Braids of Partitions - Archive ouverte HAL Access content directly
Conference Papers Year :

Braids of Partitions

Tresses de partitions

Bangalore Ravi Kiran
  • Function : Correspondent author
  • PersonId : 965148

Connectez-vous pour contacter l'auteur
Jean Serra
  • Function : Author
  • PersonId : 965147


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.
Fichier principal
Vignette du fichier
Braids_ISMM2015.pdf (986.78 Ko) Télécharger le fichier
ISMM2015_BraidsOfPartitions.pdf (3.29 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01134114 , version 1 (22-03-2019)


  • HAL Id : hal-01134114 , version 1


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⟩
364 View
377 Download


Gmail Facebook Twitter LinkedIn More