Abstract
The paper presents a modification of a bottom up graph theoretic image segmentation algorithm to improve its performance. This algorithm uses Kruskal’s algorithm to build minimum spanning trees for segmentation that reflect global properties of the image: a predicate is defined for measuring the evidence of a boundary between two regions and the algorithm makes greedy decisions to produce the final segmentation. We modify the algorithm by reducing the number of edges required for sorting based on two criteria. We also show that the algorithm produces an over segmented result and suggest a statistical region merge process that will reduce the over segmentation. We have evaluated the algorithm by segmenting various video clips Our experimental results indicate the improved performance and quality of segmentation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)
Sharon, E., Brandt, A., Basri, R.: Fast multiscale image segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 70–77 (2000)
Cour, T., Benezit, F., Shi, J.: Spectral segmentation with multiscale graph decomposition. In: IEEE Conf. on Computer Vision and Pattern Recognition, vol. 2, pp. 1124–1131 (2005)
Macaire, L., Vandenbroucke, N., Postaire, J.-G.: Color image segmentation by analysis of subset connectedness and color homogeneity properties. Computer Vision and Image Understanding 102, 105–116 (2006)
Deng, Y., Manjunath, B.S., Shin, H.: Color Image Segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 446–451 (1999)
Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. IEEE Trans. on Pattern Analysis and Machine Intelligence 24, 603–619 (2002)
Sun, H., Yang, J., Ren, M.: A fast watershed algorithm based on chain code and its application in image segmentation. Pattern Recognition Letters 26, 1266–1274 (2005)
Adams, R., Bischof, L.: Seeded region growing. IEEE Transactions on Pattern Analysis and Machine Intelligence 16, 641–647 (1994)
Shih, F.Y., Cheng, S.: Automatic seeded region growing for color image segmentation. Image and Vision Computing 23, 877–886 (2005)
Felzenszwalb, P., Huttenlocher, D.: Efficient graph-based image segmentation. Int. J. of Computer Vision 59, 167–181 (2004)
Haxhimusa, Y., Kropatsch, W.: Segmentation graph hierarchies. In: Joint IAPR Int. Workshops SSPR and SPR, pp. 343–351. Springer, Heidelberg (2004)
Forsyth, D.A., Ponce, J.: Computer vision a modern approach. Prentice Hall, Englewood Cliffs (2003)
Nock, R., Nielsen, F.: Statistical region merge. IEEE Trans. on Pattern Analysis and Machine Intelligence 26, 1452–1458 (2004)
Zhang, Y.J.: A survey on evaluation methods for image segmentation. Pattern Recognition 29, 1335–1346 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fahad, A., Morris, T. (2006). A Faster Graph-Based Segmentation Algorithm with Statistical Region Merge. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2006. Lecture Notes in Computer Science, vol 4292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919629_30
Download citation
DOI: https://doi.org/10.1007/11919629_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48626-8
Online ISBN: 978-3-540-48627-5
eBook Packages: Computer ScienceComputer Science (R0)