<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast Edge Detection Using Structured Forests · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1406.5549/</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/1406.5549/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast Edge Detection Using Structured Forests — mentioned by fxtentacle</title><link>https://news.ycombinator.com/item?id=23536878</link><guid isPermaLink="false">urn:hackerpapers:mention:1406.5549:23536878</guid><pubDate>Tue, 16 Jun 2020 07:54:21 GMT</pubDate><description>&lt;p&gt;Wow, that G-GLN paper is really new. Thanks for sharing it :) My first impression is that this will be very challenging to use for many of the people currently using AI in practice, because of the requirement to have a convex and gaussian-distributed result. For example, I currently work on optical flow and the loss functions are usually very jumpy and usually only convex within a few pixels around the correct result. I have seen plenty of modeling errors in optical flow SOTA papers, for example casting a boolean occlusion term so that it can be added to the loss (Won&amp;#x27;t work, no gradient). I…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1406.5549/"&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>
