This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Statistical Region Merging
November 2004 (vol. 26 no. 11)
pp. 1452-1458
This paper explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions. We exhibit a particular blend of algorithmics and statistics whose segmentation error is, as we show, limited from both the qualitative and quantitative standpoints. This approach can be efficiently approximated in linear time/space, leading to a fast segmentation algorithm tailored to processing images described using most common numerical pixel attribute spaces. The conceptual simplicity of the approach makes it simple to modify and cope with hard noise corruption, handle occlusion, authorize the control of the segmentation scale, and process unconventional data such as spherical images. Experiments on gray-level and color images, obtained with a short readily available C-code, display the quality of the segmentations obtained.

[1] D. Forsyth and J. Ponce, Computer Vision A Modern Approach. Prentice Hall, 2003.
[2] Z. Wu and R. Leahy, “An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1,101-1,113, Nov. 1993.
[3] E. Sharon, A. Brandt, and R. Basri, Fast Multiscale Image Segmentation Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2000.
[4] E. Sharon, A. Brandt, and R. Basri, Segmentation and Boundary Detection Using Multiscale Intensity Measurements Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2001.
[5] J. Shi and J. Malik, Normalized Cuts and Image Segmentation IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[6] A. Barbu and S.C. Zhu, Graph Partition by Swendsen-Wang Cuts Proc. Int'l Conf. Computer Vision, 2003.
[7] M. Galun, E. Sharon, R. Basri, and A. Brandt, Texture Segmentation by Multiscale Aggregation of Filter Responses and Shape Elements Proc. Ninth IEEE Int'l Conf. Computer Vision, pp. 716-725, 2003.
[8] P.F. Felzenszwalb and D.P. Huttenlocher, Image Segmentation Using Local Variations Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp. 98-104, 1998.
[9] S.C. Zhu and A. Yuille, “Region Competition: Unifying Snakes, Region Growing and Bayes/MDL for Multiband Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 884-900, 1996.
[10] D. Comaniciu and P. Meer, Robust Analysis of Feature Spaces: Color Image Segmentation Proc. 1997 IEEE Conf. Computer Vision and Pattern Recognition, pp. 750-755, 1997.
[11] C. McDiarmid, Concentration Probabilistic Methods for Algorithmic Discrete Math., M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, eds., pp. 1-54, Springer Verlag, 1998.
[12] M.J. Kearns and Y. Mansour, A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization Proc. 15th Int'l Conf. Machine Learning, pp. 269-277, 1998.
[13] C. Fiorio and J. Gustedt, Two Linear Time Union-Find Strategies for Image Processing Theoretical Computer Science, vol. 154, pp. 165-181, 1996.

Index Terms:
Grouping, image segmentation.
Citation:
Richard Nock, Frank Nielsen, "Statistical Region Merging," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 11, pp. 1452-1458, Nov. 2004, doi:10.1109/TPAMI.2004.110
Usage of this product signifies your acceptance of the Terms of Use.