Skip to main content

Abstract

In obtaining a tractable solution to the problem of extracting a minimal partition from hierarchy or tree by dynamic programming, we introduce the braids of partition and h-increasing energies, the former extending the solution space from a hierarchy to a larger set, the latter describing the family of energies, for which one can obtain the solution by a dynamic programming. We also provide the singularity condition for the existence of unique solution, leading to the definition of the energetic lattice. The paper also identifies various possible braids in literature and how this structure relaxes the segmentation problem.

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. Akcay, H.G., Aksoy, S.: Automatic detection of geospatial objects using multiple hierarchical segmentations. IEEE T. Geoscience & Remote Sensing 46(7), 2097–2111 (2008)

    Article  Google Scholar 

  2. Angulo, J., Jeulin, D.: Stochastic watershed segmentation. In: Banon, G.J.F., Barrera, J., de Mendonça Braga-Neto, U., Hirata, N.S.T. (eds.) Proceedings (ISMM), Rio de Janeiro, vol. 1, pp. 265–276. INPE (October 2007)

    Google Scholar 

  3. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. IEEE Trans. PAMI 33(5), 898–916 (2011)

    Article  Google Scholar 

  4. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth (1984)

    Google Scholar 

  5. Brendel, W., Todorovic, S.: Segmentation as maximum-weight independent set. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.) NIPS, pp. 307–315. Curran Associates, Inc. (2010)

    Google Scholar 

  6. Cousty, J., Najman, L.: Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 272–283. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Diday, E.: Spatial pyramidal clustering based on a tessellation. In: Banks, D., McMorris, F., Arabie, P., Gaul, W. (eds.) Classification, Clustering, and Data Mining Applications, pp. 105–120. Studies in Classification, Data Analysis, and Knowledge Organisation, Springer, Heidelberg (2004)

    Google Scholar 

  8. Guigues, L., Cocquerez, J.P., Men, H.L.: Scale-sets image analysis. International Journal of Computer Vision 68(3), 289–317 (2006)

    Article  Google Scholar 

  9. Kiran, B.R., Serra, J.: Global-local optimizations by hierarchical cuts and climbing energies. Pattern Recognition 47(1), 12–24 (2014)

    Article  Google Scholar 

  10. Kiran, B.R.: Energetic Lattice based optimization. Ph.D. thesis, Université Paris-Est, LIGM-A3SI, ESIEE (2014)

    Google Scholar 

  11. Malisiewicz, T., Efros, A.A.: Improving spatial support for objects via multiple segmentations. In: British Machine Vision Conference (BMVC) (September 2007)

    Google Scholar 

  12. Ronse, C.: Partial partitions, partial connections and connective segmentation. J. Math. Imaging Vis. 32(2), 97–125 (2008)

    Article  MathSciNet  Google Scholar 

  13. Salembier, P., Garrido, L.: Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval. IEEE Trans. on Image Processing 9(4), 561–576 (2000)

    Article  Google Scholar 

  14. Soille, P.: Constrained connectivity for hierarchical image partitioning and simplification. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(7), 1132–1145 (2008)

    Article  Google Scholar 

  15. Straehle, C., Peter, S., Köthe, U., Hamprecht, F.: K-smallest spanning tree segmentations. In: Weickert, J., Hein, M., Schiele, B. (eds.) GCPR 2013. LNCS, vol. 8142, pp. 375–384. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Unnikrishnan, R., Pantofaru, C., Hebert, M.: Toward objective evaluation of image segmentation algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(6), 929–944 (2007)

    Article  Google Scholar 

  17. Valero, S.: Hyperspectral image representation and Processing with Binary Partition Trees. Ph.d., Universitat Politècnica de Catalunya, UPC (2011)

    Google Scholar 

  18. Veganzones, M., Tochon, G., Dalla-Mura, M., Plaza, A., Chanussot, J.: Hyperspectral image segmentation using a new spectral unmixing-based binary partition tree representation. ITIP 23(8), 3574–3589 (2014)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bangalore Ravi Kiran .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kiran, B.R., Serra, J. (2015). Braids of Partitions. In: Benediktsson, J., Chanussot, J., Najman, L., Talbot, H. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2015. Lecture Notes in Computer Science(), vol 9082. Springer, Cham. https://doi.org/10.1007/978-3-319-18720-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18720-4_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18719-8

  • Online ISBN: 978-3-319-18720-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics