Abstract
A new approach is proposed for finding the "best cut" in a hierarchy of partitions by energy minimization. Said energy must be "climbing" i.e. it must be hierarchically and scale increasing. It encompasses separable energies [5], [9] and those which composed under supremum [14], [12]. It opens the door to multivariate data processing by providing laws of combination by extrema and by products of composition. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Serra, J., Kiran, B. R., & Cousty, J. (2012). Hierarchies and climbing energies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7441 LNCS, pp. 821–828). https://doi.org/10.1007/978-3-642-33275-3_101
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
