<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1606.06650/</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/1606.06650/feed.xml" rel="self" type="application/rss+xml" /><item><title>3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation — mentioned by kevinalexbrown</title><link>https://news.ycombinator.com/item?id=13485663</link><guid isPermaLink="false">urn:hackerpapers:mention:1606.06650:13485663</guid><pubDate>Wed, 25 Jan 2017 20:26:00 GMT</pubDate><description>&lt;p&gt;It was an image segmentation task, and the features were similar across data sets. The other thing that made it work well was heavy use of data augmentation that captured ways in which different data points could reasonably differ. There was a really cool medical imaging paper recently that literally just labeled several 2D slices in a 3D dataset consisting of 3 images and performed a reasonable segmentation: https://arxiv.org/abs/1606.06650&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1606.06650/"&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>
