Braids of Partitions

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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01134114
Contributor : Bangalore Ravi Kiran <>
Submitted on : Friday, March 22, 2019 - 12:13:32 AM
Last modification on : Saturday, March 23, 2019 - 1:34:56 AM

Identifiers

  • HAL Id : hal-01134114, version 1

Citation

Bangalore Ravi Kiran, Jean Serra. Braids of Partitions. International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing, May 2015, Rejkavik, Iceland. ⟨hal-01134114⟩

Share

Metrics

Record views

492

Files downloads

330