nips nips2009 nips2009-149 nips2009-149-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Kevin Briggman, Winfried Denk, Sebastian Seung, Moritz N. Helmstaedter, Srinivas C. Turaga
Abstract: Images can be segmented by first using a classifier to predict an affinity graph that reflects the degree to which image pixels must be grouped together and then partitioning the graph to yield a segmentation. Machine learning has been applied to the affinity classifier to produce affinity graphs that are good in the sense of minimizing edge misclassification rates. However, this error measure is only indirectly related to the quality of segmentations produced by ultimately partitioning the affinity graph. We present the first machine learning algorithm for training a classifier to produce affinity graphs that are good in the sense of producing segmentations that directly minimize the Rand index, a well known segmentation performance measure. The Rand index measures segmentation performance by quantifying the classification of the connectivity of image pixel pairs after segmentation. By using the simple graph partitioning algorithm of finding the connected components of the thresholded affinity graph, we are able to train an affinity classifier to directly minimize the Rand index of segmentations resulting from the graph partitioning. Our learning algorithm corresponds to the learning of maximin affinities between image pixel pairs, which are predictive of the pixel-pair connectivity. 1
[1] P. Arbelaez. Boundary extraction in natural images using ultrametric contour maps. Proc. POCV, 2006.
[2] F. Bach and M. Jordan. Learning spectral clustering, with application to speech separation. The Journal of Machine Learning Research, 7:1963–2001, 2006.
[3] Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 23(11):1222–1239, 2001.
[4] K. L. Briggman and W. Denk. Towards neural circuit reconstruction with volume electron microscopy techniques. Curr Opin Neurobiol, 16(5):562–70, 2006.
[5] W. Denk and H. Horstmann. Serial block-face scanning electron microscopy to reconstruct three-dimensional tissue nanostructure. PLoS Biol, 2(11):e329, 2004.
[6] P. Dollár, Z. Tu, and S. Belongie. Supervised learning of edges and object boundaries. In CVPR, June 2006.
[7] P. Felzenszwalb and D. Huttenlocher. Efficient Graph-Based Image Segmentation. International Journal of Computer Vision, 59(2):167–181, 2004.
[8] B. Fischer, V. Roth, and J. Buhmann. Clustering with the connectivity kernel. In Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference. Bradford Book, 2004.
[9] C. Fowlkes, D. Martin, and J. Malik. Learning affinity functions for image segmentation: combining patch-based and gradient-based approaches. Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on, 2, 2003. 8
[10] X. He, R. Zemel, and M. Carreira-Perpinan. Multiscale conditional random fields for image labeling. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition, volume 2. IEEE Computer Society; 1999, 2004.
[11] V. Jain, J. Murray, F. Roth, S. Turaga, V. Zhigulin, K. Briggman, M. Helmstaedter, W. Denk, and H. Seung. Supervised learning of image restoration with convolutional networks. ICCV 2007, 2007.
[12] S. Kumar and M. Hebert. Discriminative random fields: a discriminative framework for contextual interaction in classification. Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on, pages 1150–1157, 2003.
[13] Y. LeCun, L. Bottou, G. Orr, and K. Müller. Efficient backprop. Lecture notes in computer science, pages 9–50, 1998.
[14] M. Maire, P. Arbelaez, C. Fowlkes, and J. Malik. Using contours to detect and localize junctions in natural images. In IEEE Conference on Computer Vision and Pattern Recognition, 2008. CVPR 2008, pages 1–8, 2008.
[15] D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In Proc. Eighth Int’l Conf. Computer Vision, volume 2, pages 416–423, 2001.
[16] D. R. Martin, C. C. Fowlkes, and J. Malik. Learning to detect natural image boundaries using local brightness, color, and texture cues. IEEE Trans Pattern Anal Mach Intell, 26(5):530–549, May 2004.
[17] M. Meila and J. Shi. Learning segmentation by random walks. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS, pages 873–879, 2001.
[18] W. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical association, pages 846–850, 1971.
[19] H. Seung. Reading the Book of Memory: Sparse Sampling versus Dense Mapping of Connectomes. Neuron, 62(1):17–29, 2009.
[20] J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888–905, 2000.
[21] S. J. Smith. Circuit reconstruction tools today. Curr Opin Neurobiol, 17(5):601–608, Oct 2007.
[22] Z. Tu, X. Chen, A. Yuille, and S. Zhu. Image parsing: Unifying segmentation, detection, and recognition. International Journal of Computer Vision, 63(2):113–140, 2005.
[23] R. Unnikrishnan, C. Pantofaru, and M. Hebert. Toward objective evaluation of image segmentation algorithms. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, pages 929–944, 2007. 9