The Theory of Braids and Energetic Lattices II - Constrained Optimization by Disseminated Energy

Abstract : Give a hierarchy of segmentations, the optimal cut problem consists in extracting the partition with the least energy, solved greedily by a dynamic program. The energy is composed of two terms : fidelity term (how well the local model fits the image) and regularization/constraint term(how simple the partition is). The energetic lattice was introduced as a basis for the dynamic programming substructure. At no moment the energy of a complete partition is ever calculated. In view of the local nature of the dynamic program substructure, in this study we introduce three constraint models : Multiplier constrained, Cut constrained, Class constrained , each of which has a equivalent representation as an energetic lattice and captures the constraint on the solution space of partitions in different ways.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01538632
Contributor : Bangalore Ravi Kiran <>
Submitted on : Tuesday, June 13, 2017 - 7:24:33 PM
Last modification on : Monday, November 12, 2018 - 10:56:36 AM
Document(s) archivé(s) le : Tuesday, December 12, 2017 - 2:00:08 PM

File

Braid_theory_II_Constrained_op...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01538632, version 1

Citation

B Ravi Kiran, Jean Serra. The Theory of Braids and Energetic Lattices II - Constrained Optimization by Disseminated Energy. 2016. 〈hal-01538632〉

Share

Metrics

Record views

294

Files downloads

76