Nothing Special   »   [go: up one dir, main page]

Skip to main content

A Faster Graph-Based Segmentation Algorithm with Statistical Region Merge

  • Conference paper
Advances in Visual Computing (ISVC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4292))

Included in the following conference series:

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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)

    Article  Google Scholar 

  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 

  4. 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)

    Article  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 

  6. 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)

    Article  Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. Adams, R., Bischof, L.: Seeded region growing. IEEE Transactions on Pattern Analysis and Machine Intelligence 16, 641–647 (1994)

    Article  Google Scholar 

  9. Shih, F.Y., Cheng, S.: Automatic seeded region growing for color image segmentation. Image and Vision Computing 23, 877–886 (2005)

    Article  Google Scholar 

  10. Felzenszwalb, P., Huttenlocher, D.: Efficient graph-based image segmentation. Int. J. of Computer Vision 59, 167–181 (2004)

    Article  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 

  13. Nock, R., Nielsen, F.: Statistical region merge. IEEE Trans. on Pattern Analysis and Machine Intelligence 26, 1452–1458 (2004)

    Article  Google Scholar 

  14. Zhang, Y.J.: A survey on evaluation methods for image segmentation. Pattern Recognition 29, 1335–1346 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics