Skip to main content

Segmentation with Selectively Propagated Constraints

  • Conference paper
  • First Online:
Neural Information Processing (ICONIP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9948))

Included in the following conference series:

Abstract

This paper presents a novel selective constraint propagation method for constrained image segmentation. In the literature, many pairwise constraint propagation methods have been developed to exploit pairwise constraints for cluster analysis. However, since these methods mostly have a polynomial time complexity, they are not much suitable for segmentation of images even with a moderate size, which is equal to cluster analysis with a large data size. In this paper, we thus choose to perform pairwise constraint propagation only over a selected subset of pixels, but not over the whole image. Such a selective constraint propagation problem is then solved by an efficient graph-based learning algorithm. Finally, the selectively propagated constraints are exploited based on \(L_1\)-minimization for normalized cuts over the whole image. The experimental results show the promising performance of the proposed method.

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. Carson, C., Belongie, S., Greenspan, H., Malik, J.: Blobworld: image segmentation using expectation-maximization and its application to image querying. TPAMI 24(8), 1026–1038 (2002)

    Article  Google Scholar 

  2. Eriksson, A., Olsson, C., Kahl, F.: Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints. In: ICCV (2007)

    Google Scholar 

  3. Ghanem, B., Ahuja, N.: Dinkelbach NCUT: an efficient framework for solving normalized cuts problems with priors and convex constraints. IJCV 89(1), 40–55 (2010)

    Article  Google Scholar 

  4. Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193–218 (1985)

    Article  MATH  Google Scholar 

  5. Kamvar, S., Klein, D., Manning, C.: Spectral learning. In: IJCAI, pp. 561–566 (2003)

    Google Scholar 

  6. Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering: a kernel approach. In: ICML, pp. 457–464 (2005)

    Google Scholar 

  7. Li, Z., Liu, J., Tang, X.: Pairwise constraint propagation by semidefinite programming for semi-supervised classification. In: ICML, pp. 576–583 (2008)

    Google Scholar 

  8. Lu, Z., Carreira-Perpinan, M.: Constrained spectral clustering through affinity propagation. In: CVPR (2008)

    Google Scholar 

  9. Lu, Z., Ip, H.H.S.: Constrained spectral clustering via exhaustive and efficient constraint propagation. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part VI. LNCS, vol. 6316, pp. 1–14. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: ICCV, vol. 2, pp. 416–423 (2001)

    Google Scholar 

  11. Shi, J., Malik, J.: Normalized cuts and image segmentation. TPAMI 22(8), 888–905 (2000)

    Article  Google Scholar 

  12. Xu, L., Li, W., Schuurmans, D.: Fast normalized cut with linear constraints. In: CVPR. pp. 2866–2873 (2009)

    Google Scholar 

  13. Yu, S., Shi, J.: Segmentation given partial grouping constraints. TPAMI 26(2), 173–183 (2004)

    Article  Google Scholar 

  14. Zhou, D., Bousquet, O., Lal, T., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: NIPS, vol. 16, pp. 321–328 (2004)

    Google Scholar 

  15. Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using Gaussian fields and harmonic functions. In: ICML, pp. 912–919 (2003)

    Google Scholar 

Download references

Acknowledgments

This work was partially supported by National Natural Science Foundation of China (61573363 and 61573026), 973 Program of China (2014CB340403 and 2015CB352502), the Fundamental Research Funds for the Central Universities and the Research Funds of Renmin University of China (15XNLQ01), and IBM Global SUR Award Program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhiwu Lu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Han, P., Liu, G., Huang, S., Yuan, W., Lu, Z. (2016). Segmentation with Selectively Propagated Constraints. In: Hirose, A., Ozawa, S., Doya, K., Ikeda, K., Lee, M., Liu, D. (eds) Neural Information Processing. ICONIP 2016. Lecture Notes in Computer Science(), vol 9948. Springer, Cham. https://doi.org/10.1007/978-3-319-46672-9_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46672-9_65

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-46672-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics