Hierarchies and optima

  • Authors:
  • Jean Serra

  • Affiliations:
  • Université Paris-Est, Noisy-le-Grand, France

  • Venue:
  • DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is devoted to hierarchies of partitions, on which all criteria are proved to be connective. Optimisations are addressed by minimizing energies that satisfy the condition of hierarchical increasingness. The optimal cuts through the hierarchies are found. It is shown that many of the classical techniques are variants of what is proposed.