Advertisement

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.

Keywords

Hierarchies Dynamic programming Optimization Lattice 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 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. 3.
    Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. IEEE Trans. PAMI 33(5), 898–916 (2011)CrossRefGoogle Scholar
  4. 4.
    Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth (1984)Google Scholar
  5. 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. 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)CrossRefGoogle Scholar
  7. 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. 8.
    Guigues, L., Cocquerez, J.P., Men, H.L.: Scale-sets image analysis. International Journal of Computer Vision 68(3), 289–317 (2006)CrossRefGoogle Scholar
  9. 9.
    Kiran, B.R., Serra, J.: Global-local optimizations by hierarchical cuts and climbing energies. Pattern Recognition 47(1), 12–24 (2014)CrossRefGoogle Scholar
  10. 10.
    Kiran, B.R.: Energetic Lattice based optimization. Ph.D. thesis, Université Paris-Est, LIGM-A3SI, ESIEE (2014)Google Scholar
  11. 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. 12.
    Ronse, C.: Partial partitions, partial connections and connective segmentation. J. Math. Imaging Vis. 32(2), 97–125 (2008)CrossRefMathSciNetGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 14.
    Soille, P.: Constrained connectivity for hierarchical image partitioning and simplification. IEEE Transactions on Pattern Analysis and Machine Intelligence 30(7), 1132–1145 (2008)CrossRefGoogle Scholar
  15. 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)CrossRefGoogle Scholar
  16. 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)CrossRefGoogle Scholar
  17. 17.
    Valero, S.: Hyperspectral image representation and Processing with Binary Partition Trees. Ph.d., Universitat Politècnica de Catalunya, UPC (2011)Google Scholar
  18. 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)MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Centre de robotiqueMINES ParisTech, PSL-Research UniversityParisFrance
  2. 2.A3SI-ESIEE LIGMUniversité Paris-EstParisFrance

Personalised recommendations