Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Image Segmentation

  • Chapter
  • First Online:
Generalized Principal Component Analysis

Part of the book series: Interdisciplinary Applied Mathematics ((IAM,volume 40))

  • 9850 Accesses

Abstract

Image segmentation is the task of partitioning a natural image into multiple contiguous regions, also known as segments, whereby adjacent regions are separated by salient edges or contours, and each region consists of pixels with homogeneous color or texture. In computer vision, this is widely accepted as a crucial step for any high-level vision tasks such as object recognition and understanding image semantics.

The whole is more than the sum of its parts.

—Aristotle

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

Notes

  1. 1.

    Note that there is even ambiguity in segmentation done by different humans. In later sections, we will see how we could make such human-based evaluation somewhat meaningful.

  2. 2.

    We will see how to incorporate pairwise information such as edges into such a simplified framework later. In particular, as we will see, such information can be incorporated through a special initialization to the segmentation algorithm.

  3. 3.

    Another popular approach for constructing texture vectors is to use multivariate responses of a fixed 2D texture filter bank. A previous study by (Varma and Zisserman 2003) has argued that the difference in segmentation results between the two approaches is small, and yet it is more expensive to compute 2D filter bank responses.

  4. 4.

    The image segmentation example shown in Section 6.4.2 in Chapter 6 was done using such a coding length function.

  5. 5.

    For a large region with a sufficiently smooth boundary, the number of boundary-crossing windows is significantly smaller than the number of those in the interior. For boundary-crossing windows, their average coding length is roughly proportional to the number of pixels inside the region if the Gaussian distribution is sufficiently isotropic.

  6. 6.

    We use the publicly available code for this method available at http://www.cs.sfu.ca/~mori/research/superpixels/ with parameter N_sp = 200.

  7. 7.

    We will discuss several discrepancy measures in Section 10.4.2, such as the probabilistic Rand index (PRI) and variation of information (VOI).

  8. 8.

    The quantitative performance of several existing algorithms was also evaluated in a recent work ((Arbelaez et al. 2009)), which was published roughly at the same time as this work. The reported results therein generally agree with our findings.

References

  • Arbelaez, P. (2006). Boundary extraction in natural images using ultrametric contour maps. In Workshop on Perceptual Organization in Computer Vision.

    Google Scholar 

  • Arbelaez, P., Maire, M., Fowlkes, C., & Malik, J. (2009). From contours to regions: An empirical evaluation. In IEEE Conference on Computer Vision and Pattern Recognition.

    Google Scholar 

  • Comanicu, D., & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 24, 603–619.

    Article  Google Scholar 

  • Cour, T., Benezit, F., & Shi, J. (2005). Spectral segmentation with multiscale graph decomposition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

    Google Scholar 

  • Deng, Y., & Manjunath, B. (2001). Unsupervised segmentation of color-texture regions in images and video. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(8), 800–810.

    Article  Google Scholar 

  • Donoser, M., Urschler, M., Hirzer, M., & Bischof, H. (2009). Saliency driven total variation segmentation. In Proceedings of the International Conference on Computer Vision (ICCV).

    Google Scholar 

  • Duda, R., Hart, P., & Stork, D. (2000). Pattern Classification (2nd ed.). Wiley, New York.

    MATH  Google Scholar 

  • Efros, A. A., & Leung, T. K. (1999). Texture synthesis by non-parametric sampling. In IEEE International Conference on Computer Vision (pp. 1033–1038). Corfu, Greece.

    Book  Google Scholar 

  • Elder, J., & Zucker, S. (1996). Computing contour closures. In Proceedings of the European Conference on Computer Vision (ECCV).

    Google Scholar 

  • Felzenszwalb, P. F., & Huttenlocher, D. P. (2004). Efficient graph-based image segmentation. International Journal of Computer Vision (IJCV), 59(2), 167–181.

    Article  Google Scholar 

  • Freixenet, J., Munoz, X., Raba, D., Marti, J., & Cuff, X. (2002). Yet another survey on image segmentation. In Proceedings of the European Conference on Computer Vision (ECCV).

    Google Scholar 

  • Gevers, T., & Smeulders, A. (1997). Combining region splitting and edge detection through guided Delaunay image subdivision. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

    Google Scholar 

  • Haralick, R., & Shapiro, L. (1985). Image segmentation techniques. Computer Vision, Graphics, and Image Processing, 29(1), 100–132.

    Article  Google Scholar 

  • Jain, A. (1989). Fundamentals of Digital Image Processing. Upper Saddle River: Prentice Hall.

    MATH  Google Scholar 

  • Kim, J., Fisher, J., Yezzi, A., Cetin, M., & Willsky, A. (2005). A nonparametric statistical method for image segmentation using information theory and curve evolution. PAMI, 14(10), 1486–1502.

    MathSciNet  Google Scholar 

  • Kim, T., Lee, K., & Lee, S. (2010). Learning full pairwise affinities for spectral segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

    Google Scholar 

  • Kurita, T. (1995). An efficient clustering algorithm for region merging. IEICE Transactions of Information and Systems, E78-D(12), 1546–1551.

    Google Scholar 

  • Levina, E., & Bickel, P. J. (2006). Texture synthesis and non-parametric resampling of random fields. Annals of Statistics, 34(4), 1751–1773.

    Article  MathSciNet  MATH  Google Scholar 

  • Liu, Y. K., & Zalik, B. (2005). Efficient chain code with Huffman coding. Pattern Recognition, 38(4), 553–557.

    Article  Google Scholar 

  • Ma, Y., Derksen, H., Hong, W., & Wright, J. (2007). Segmentation of multivariate mixed data via lossy coding and compression. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(9), 1546–1562.

    Article  Google Scholar 

  • Malik, J., Belongie, S., Leung, T., & Shi, J. (2001). Contour and texture analysis for image segmentation. International Journal of Computer Vision, 43(1), 7–27.

    Article  MATH  Google Scholar 

  • Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2001). A Database of Human Segmented Natural Images and its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statistics. In IEEE International Conference on Computer Vision.

    Google Scholar 

  • Meila, M. (2005). Comparing clusterings: An axiomatic view. In Proceedings of the International Conference on Machine Learning.

    Google Scholar 

  • Mobahi, H., Rao, S., Yang, A., & Sastry, S. (2011). Segmentation of natural images by texture and boundary compression. International Journal of Computer Vision, 95(1), 86–98.

    Article  Google Scholar 

  • Mori, G., Ren, X., Efros, A., & Malik, J. (2004). Recovering human body configurations: Combining segmentation and recognition. In IEEE Conference on Computer Vision and Pattern Recognition.

    Google Scholar 

  • Rand, W. M. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336), 846–850.

    Article  Google Scholar 

  • Rao, S., Mobahi, H., Yang, A., & Sastry, S. (2009). Natural image segmentation with adaptive texture and boundary encoding. In Asian Conference on Computer Vision, 1 (pp. 135–146).

    Google Scholar 

  • Ren, X., Fowlkes, C., & Malik, J. (2005). Scale-invariant contour completion using condition random fields. In IEEE International Conference on Computer Vision.

    Google Scholar 

  • Ren, X., Fowlkes, C., & Malik, J. (2008). Learning probabilistic models for contour completion in natural images. International Journal of Computer Vision, 77, 47–63.

    Article  Google Scholar 

  • Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888–905.

    Article  Google Scholar 

  • Tremeau, A., & Borel, N. (1997). A region growing and merging algorithm to color segmentation. Pattern Recognition, 30(7), 1191–1204.

    Article  Google Scholar 

  • Tu, Z., & Zhu, S. (2002). Image segmentation by data-driven Markov Chain Monte Carlo. PAMI, 24(5), 657–673.

    Article  Google Scholar 

  • Varma, M., & Zisserman, A. (2003). Texture classification: Are filter banks necessary? In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.

    Google Scholar 

  • Wang, J., Jia, Y., Hua, X., Zhang, C., & Quan, L. (2008a). Normalized tree partitioning for image segmentation. In IEEE Conference on Computer Vision and Pattern Recognition.

    Google Scholar 

  • Yang, A., Wright, J., Ma, Y., & Sastry, S. (2008). Unsupervised segmentation of natural images via lossy data compression. Computer Vision and Image Understanding, 110(2), 212–225.

    Article  Google Scholar 

  • Yu, S. (2005). Segmentation induced by scale invariance. In IEEE Conference on Computer Vision and Pattern Recognition.

    Google Scholar 

  • Zhu, Q., Song, G., & Shi, J. (2007). Untangling cycles for contour grouping. In Proceedings of the International Conference on Computer Vision (ICCV).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag New York

About this chapter

Cite this chapter

Vidal, R., Ma, Y., Sastry, S.S. (2016). Image Segmentation. In: Generalized Principal Component Analysis. Interdisciplinary Applied Mathematics, vol 40. Springer, New York, NY. https://doi.org/10.1007/978-0-387-87811-9_10

Download citation

Publish with us

Policies and ethics