Meaningful Disjoint Level Lines Selection

Abstract : Many methods based on the morphological notion of shapes (i.e., connected components of level sets) have been proved to be very efficient in shape recognition and shape analysis. The inclusion relationship of the level lines (bound-aries of level sets) forms the tree of shapes, a tree-based image representation with a high potential. Numerous applications using this tree representation have been proposed. In this article, we propose an efficient algorithm that extracts a set of disjoint level lines in the image. These selected level lines yield a simplified image with clean contours, which provides an intuitive idea about the main structure of the tree of shapes. Besides, we obtain a saliency map without transition prob-lems around the contours by weighting level lines with their significance. Experimental results demonstrate the efficiency and usefulness of our method.
Type de document :
Communication dans un congrès
International Conference on Image Processing (ICIP), Oct 2014, Paris, France
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01082342
Contributeur : Laurent Najman <>
Soumis le : jeudi 13 novembre 2014 - 11:48:40
Dernière modification le : mercredi 27 janvier 2016 - 17:39:22
Document(s) archivé(s) le : lundi 16 février 2015 - 15:10:44

Fichier

geraud.2014.icip.xu.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01082342, version 1

Collections

Citation

Yongchao Xu, Edwin Carlinet, Thierry Géraud, Laurent Najman. Meaningful Disjoint Level Lines Selection. International Conference on Image Processing (ICIP), Oct 2014, Paris, France. <hal-01082342>

Partager

Métriques

Consultations de
la notice

173

Téléchargements du document

91