Climbing on Pyramids
It provides a theoretical framework for energy minimization in hierarchical partitions, relevant for image segmentation and clustering.
The paper proposes a new method for finding the best cut in a hierarchy of partitions using climbing energies, which are hierarchically and scale increasing. The approach generalizes separable energies and those composed under supremum.
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 and those composed under supremum.