Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Laurent Najman <>
Submitted on : Thursday, November 13, 2014 - 11:48:40 AM
Last modification on : Wednesday, June 9, 2021 - 5:28:03 PM
Long-term archiving on: : Monday, February 16, 2015 - 3:10:44 PM


Files produced by the author(s)


  • HAL Id : hal-01082342, version 1


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⟩



Record views


Files downloads