A Faster Graph-Based Segmentation Algorithm with Statistical Region Merge
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.
KeywordsImage Segmentation Segmentation Algorithm Minimum Span Tree Edge Weight Colour Channel
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 3.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)Google Scholar
- 5.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)Google Scholar
- 11.Haxhimusa, Y., Kropatsch, W.: Segmentation graph hierarchies. In: Joint IAPR Int. Workshops SSPR and SPR, pp. 343–351. Springer, Heidelberg (2004)Google Scholar
- 12.Forsyth, D.A., Ponce, J.: Computer vision a modern approach. Prentice Hall, Englewood Cliffs (2003)Google Scholar