Skip to Main content Skip to Navigation
Conference papers

A Root-to-Leaf Algorithm Computing the Tree of Shapes of an Image

Pascal Monasse 1, 2, 3
2 imagine [Marne-la-Vallée]
LIGM - Laboratoire d'Informatique Gaspard-Monge, ENPC - École des Ponts ParisTech
Abstract : We propose an algorithm computing the tree of shapes of an image, a unified variation of the component trees, proceeding from the root to the leaf shapes in a recursive fashion. It proceeds differently from existing algorithms that start from leaves, which are regional extrema of intensity, and build the intermediate shapes up to the root, which is the whole image. The advantage of the proposed method is a simpler, clearer, and more concise implementation, together with a more favorable running time on natural images. For integer-valued images, the complexity is proportional to the total variation, which is the memory size of the output tree, which makes the algorithm optimal.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal-enpc.archives-ouvertes.fr/hal-02168487
Contributor : Pascal Monasse <>
Submitted on : Friday, June 28, 2019 - 5:32:11 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:28 AM

File

flst.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pascal Monasse. A Root-to-Leaf Algorithm Computing the Tree of Shapes of an Image. Workshop on Reproducible Research in Pattern Recognition, Aug 2018, Beijing, China. ⟨10.1007/978-3-030-23987-9_3⟩. ⟨hal-02168487⟩

Share

Metrics

Record views

142

Files downloads

268