arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.10664cs.CVcs.LGq-bio.NC
收藏

Do Neural Networks for Segmentation Understand Insideness?

Center for Brains, Minds and Machines, Massachusetts Institute of Technology(麻省理工学院大脑、心智与机器中心);Max Planck Institute of Neurobiology(马克斯·普朗克神经生物学研究所);Fujitsu Laboratories Ltd.(富士通实验室有限公司)

Kimberly Villalobos, Vilim Štih, Amineh Ahmadinejad, Shobhita Sundaram, Jamell Dozier, Andrew Francl, Frederico Azevedo, Tomotake Sasaki, Xavier Boix

英文摘要:

The insideness problem is an aspect of image segmentation that consists of determining which pixels are inside and outside a region. Deep Neural Networks (DNNs) excel in segmentation benchmarks, but it is unclear if they have the ability to solve the insideness problem as it requires evaluating long-range spatial dependencies. In this paper, the insideness problem is analysed in isolation, without texture or semantic cues, such that other aspects of segmentation do not interfere in the analysis. We demonstrate that DNNs for segmentation with few units have sufficient complexity to solve insideness for any curve. Yet, such DNNs have severe problems with learning general solutions. Only recurrent networks trained with small images learn solutions that generalize well to almost any curve. Recurrent networks can decompose the evaluation of long-range dependencies into a sequence of local operations, and learning with small images alleviates the common difficulties of training recurrent networks with a large number of unrolling steps.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑