Skip to main content

A Segmentation Quality Measure Based on Rich Descriptors and Classification Methods

  • Conference paper
Scale Space and Variational Methods in Computer Vision (SSVM 2011)

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

  • 2554 Accesses

Abstract

Most segmentation methods are based on a relatively simple score, designed to lend itself to relatively efficient optimization. We take the opposite approach and suggest more complex segmentation scores that are based on a mixture of on-line and off-line learning processes and rely on rich descriptors. The score is evaluated by a segmentation process which uses exploration-exploitation to search for good segments in various scales and shapes. We test our algorithm in a foreground-background segmentation task, given a minimal prior which is just a single seed point inside the object of interest. Results on two image databases are presented and compared with earlier approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

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

    Article  Google Scholar 

  2. Martin, D.R., Fowlkes, C.C., Malik, J.: Learning to detect natural image boundaries using local brightness, color, and texture cues. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 530–549 (2004)

    Article  Google Scholar 

  3. Dollar, P., Tu, Z., Belongie, S.: Supervised learning of edges and object boundaries. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 1964–1971 (2006)

    Google Scholar 

  4. Ren, X., Malik, J.: Learning a classification model for segmentation. In: Proc. 9th Int’l. Conf. Computer Vision, vol. 1, pp. 10–17 (2003)

    Google Scholar 

  5. Chan, T., Vese, L.: Active contours without edges. IEEE Transactions on Image Processing 10, 266–277 (2001)

    Article  MATH  Google Scholar 

  6. Rother, C., Kolmogorov, V., Blake, A.: Grabcut: Interactive foreground extraction using iterated graph cuts. In: ACM SIGGRAPH 2004, pp. 309–314 (2004)

    Google Scholar 

  7. Bagon, S., Boiman, O., Irani, M.: What is a good image segment? a unified approach to segment extraction. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part IV. LNCS, vol. 5305, pp. 30–44. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Boykov, Y.Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: ICCV, vol. 1, pp. 105–112 (2001)

    Google Scholar 

  9. Li, Y., Adelson, E., Agarwala, A.: Scribbleboost: Adding classification to edge-aware interpolation of local image and video adjustments. Computer Graphics Forum 27(4), 1255–1264 (2008)

    Article  Google Scholar 

  10. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: STOC 2005, New York, NY, pp. 684–693 (2005)

    Google Scholar 

  11. Boykov, Y., Veksler, O., Zabih, R.: Efficient approximate energy minimization via graph cuts. IEEE Transactions on PAMI 20, 1222–1239 (2001)

    Article  Google Scholar 

  12. Alpert, S., Galun, M., Basri, R., Brandt, A.: Image segmentation by probabilistic bottom-up aggregation and cue integration. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2007)

    Google Scholar 

  13. Meyer, F.: Topographic distance and watershed lines. Signal Processing 38, 113–125 (1994); Mathematical Morphology and Its Applications to Signal Processing

    Article  MATH  Google Scholar 

  14. Vezhnevets, A.: GML-Adaboost, MSU Graphics and Media Lab, Computer Vision Group, http://graphics.cs.msu.ru

  15. Friedman, J., Hastie, T., Tibshirani, R.: Additive logistic regression: a statistical view of boosting. Annals of Statistics 28, 2000 (1998)

    MATH  MathSciNet  Google Scholar 

  16. Lienhart, R., Kuranov, A., Pisarevsky, V.: Empirical analysis of detection cascades of boosted classifiers for rapid object detection. Annals of Statistics 28, 2000 (1998)

    Google Scholar 

  17. Sandler, R., Lindenbaum, M.: Optimizing gabor filter design for texture edge detection and classification. Int. J. Comput. Vision 84, 308–324 (2009)

    Article  Google Scholar 

  18. Damski, I., Sharfshtein, A.: GrabCut implementation, www1.idc.ac.il/toky/CompPhoto-09/Projects/Stud_projects/IrenaAviad/Web

  19. Lempitsky, V., Kohli, P., Rother, C., Sharp, T.: Segmentation with a bounding box prior. In: ICCV 2009 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peles, D., Lindenbaum, M. (2012). A Segmentation Quality Measure Based on Rich Descriptors and Classification Methods. In: Bruckstein, A.M., ter Haar Romeny, B.M., Bronstein, A.M., Bronstein, M.M. (eds) Scale Space and Variational Methods in Computer Vision. SSVM 2011. Lecture Notes in Computer Science, vol 6667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24785-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24785-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24784-2

  • Online ISBN: 978-3-642-24785-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics