pith. sign in

arxiv: 1906.04913 · v1 · pith:N6OCQHZMnew · submitted 2019-06-11 · 💻 cs.CV

Recurrent U-Net for Resource-Constrained Segmentation

classification 💻 cs.CV
keywords segmentationu-nethandintroducerecurrentseveralveryalways
0
0 comments X
read the original abstract

State-of-the-art segmentation methods rely on very deep networks that are not always easy to train without very large training datasets and tend to be relatively slow to run on standard GPUs. In this paper, we introduce a novel recurrent U-Net architecture that preserves the compactness of the original U-Net, while substantially increasing its performance to the point where it outperforms the state of the art on several benchmarks. We will demonstrate its effectiveness for several tasks, including hand segmentation, retina vessel segmentation, and road segmentation. We also introduce a large-scale dataset for hand segmentation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.