<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Robustness Analysis of Face Obscuration · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.05243/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1905.05243/feed.xml" rel="self" type="application/rss+xml" /><item><title>Robustness Analysis of Face Obscuration — mentioned by dgco</title><link>https://news.ycombinator.com/item?id=23423886</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.05243:23423886</guid><pubDate>Fri, 05 Jun 2020 00:54:52 GMT</pubDate><description>&lt;p&gt;In https://arxiv.org/abs/1905.05243, we presented a measure of the effectiveness of eight face obscuration techniques. We did so by attacking the redacted faces in three scenarios: obscured face identification, verification, and reconstruction. Based on our evaluation, we show that the k-same based methods are the most effective.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.05243/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
