Convolutional Networks Can Learn to Generate Affinity Graphs for Image Segmentation

被引:272
作者
Turaga, Srinivas C. [1 ]
Murray, Joseph F. [1 ]
Jain, Viren
Roth, Fabian [1 ]
Helmstaedter, Moritz [2 ]
Briggman, Kevin [2 ]
Denk, Winfried [2 ]
Seung, H. Sebastian [1 ,3 ]
机构
[1] MIT, Dept Brain & Cognit Sci, Howard Hughes Med Inst, Cambridge, MA 02139 USA
[2] Max Planck Inst Med Res, D-69120 Heidelberg, Germany
[3] MIT, Dept Phys, Howard Hughes Med Inst, Cambridge, MA 02139 USA
关键词
CIRCUIT RECONSTRUCTION; 3D RECONSTRUCTION; NEURAL TISSUE; VOLUME;
D O I
10.1162/neco.2009.10-08-881
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many image segmentation algorithms first generate an affinity graph and then partition it. We present a machine learning approach to computing an affinity graph using a convolutional network (CN) trained using ground truth provided by human experts. The CN affinity graph can be paired with any standard partitioning algorithm and improves segmentation accuracy significantly compared to standard hand-designed affinity functions. We apply our algorithm to the challenging 3D segmentation problem of reconstructing neuronal processes from volumetric electron microscopy (EM) and show that we are able to learn a good affinity graph directly from the raw EM images. Further, we show that our affinity graph improves the segmentation accuracy of both simple and sophisticated graph partitioning algorithms. In contrast to previous work, we do not rely on prior knowledge in the form of hand-designed image features or image preprocessing. Thus, we expect our algorithm to generalize effectively to arbitrary image types.
引用
收藏
页码:511 / 538
页数:28
相关论文
共 32 条
[1]   Rapid automated three-dimensional tracing of neurons from confocal image stacks [J].
Al-Kofahi, KA ;
Lasek, S ;
Szarowski, DH ;
Pace, CJ ;
Nagy, G ;
Turner, JN ;
Roysam, B .
IEEE TRANSACTIONS ON INFORMATION TECHNOLOGY IN BIOMEDICINE, 2002, 6 (02) :171-187
[2]  
Andres B, 2008, LECT NOTES COMPUT SC, V5096, P142, DOI 10.1007/978-3-540-69321-5_15
[3]  
[Anonymous], 2005, P 11 ACM SIGKDD INT, DOI DOI 10.1145/1081870.1081948
[4]  
[Anonymous], 1998, NEURAL NETWORKS TRIC
[5]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[6]   Towards neural circuit reconstruction with volume electron microscopy techniques [J].
Briggman, Kevin L. ;
Denk, Winfried .
CURRENT OPINION IN NEUROBIOLOGY, 2006, 16 (05) :562-570
[7]   COMPUTER-ASSISTED REGISTRATION, SEGMENTATION, AND 3D RECONSTRUCTION FROM IMAGES OF NEURONAL TISSUE-SECTIONS [J].
CARLBOM, I ;
TERZOPOULOS, D ;
HARRIS, KM .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1994, 13 (02) :351-362
[8]  
Cormen T.H., 2000, INTRO ALGORITHMS
[9]  
Cour T, 2005, PROC CVPR IEEE, P1124
[10]   Serial block-face scanning electron microscopy to reconstruct three-dimensional tissue nanostructure [J].
Denk, W ;
Horstmann, H .
PLOS BIOLOGY, 2004, 2 (11) :1900-1909