Skip to main content

Fast Simple Linear Iterative Clustering by Early Candidate Cluster Elimination

  • Conference paper
  • First Online:
Pattern Recognition and Image Analysis (IbPRIA 2015)

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

Included in the following conference series:

Abstract

For superpixel segmentation, simple linear iterative clustering (SLIC) has attracted much attention due to its outstanding performance in terms of speed and accuracy. However, computational-efficiency challenge still remains for applying it to real-time applications. In this paper, by applying the Cauchy-Schwarz inequality, we derive a simple condition to get rid of unnecessary operations from the cluster inspection procedure. Candidate clusters can be early eliminated without cluster inspection requiring high computation. In the experimental results, it is confirmed that the proposed superpixel segmentation algorithm improves efficiency of SLIC by 21 % on average without any degradation in segmentation performance.

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 EPUB and 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

References

  1. Ren X., Malik, J.: Learning a classification model for segmentation. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 10–17 (2003)

    Google Scholar 

  2. Liu, Z., Zou, W., Meur, O.L.: Saliency tree: a novel saliency detection framework. IEEE Trans. Image Process. 23, 1937–1952 (2014)

    Article  MathSciNet  Google Scholar 

  3. Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., Süsstrunk, S.: SLIC superpixels compared to state-of-the-art superpixel methods. IEEE Trans. Pattern Anal. Mach. Intell. 34, 2274–2282 (2012)

    Article  Google Scholar 

  4. Ayvaci, A., Soatto, S.: Motion segmentation with occlusions on the superpixel graph. In: Proceedings of the IEEE International Conference on Computer Vision Workshops, pp. 727–734 (2009)

    Google Scholar 

  5. Mori, G., Ren, X., Efros, A.A., Malik, J.: Recovering human body configurations: Combining segmentation and recognition. In: Proceedings of the IEEE International Conference on Computer Vision, Pattern Recognition, pp. 326–333 (2004)

    Google Scholar 

  6. Kim, K.-S., Zhang, D., Kang, M.-C., Ko, S.-J.: Improved simple linear iterative clustering superpixels. In: Proceedings of the IEEE International Symposium Consumer Electron, pp. 259–260 (2013)

    Google Scholar 

  7. Ren, C.Y., Reid, I.: gSLIC: a real-time implementation of slic superpixel segmentation. Technical report, University of Oxford (2011)

    Google Scholar 

  8. Robovec, J., Kybic, J.: jSLIC: superpixels in ImageJ. Computer Vision Winter Workshop (2014)

    Google Scholar 

  9. Wu, K.-S., Lin, J.-C.: Fast VQ encoding by an efficient kick-out condition. IEEE Trans. Circuits Syst. Video Technol. 10, 59–62 (2000)

    Article  Google Scholar 

  10. Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithm and measuring ecological statistics. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 416–423 (2001)

    Google Scholar 

  11. VLFeat.org, VLFeat: http://www.vlfeat.org. Accessed November 2014

  12. Veksler, O., Boykov, Y., Mehrani, P.: Superpixels and supervoxels in an energy optimization framework. In: Proceedings of the European Conference on Computer Vision, pp. 211–224 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kang-Sun Choi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Choi, KS., Oh, KW. (2015). Fast Simple Linear Iterative Clustering by Early Candidate Cluster Elimination. In: Paredes, R., Cardoso, J., Pardo, X. (eds) Pattern Recognition and Image Analysis. IbPRIA 2015. Lecture Notes in Computer Science(), vol 9117. Springer, Cham. https://doi.org/10.1007/978-3-319-19390-8_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19390-8_65

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19389-2

  • Online ISBN: 978-3-319-19390-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics