Skip to Main content Skip to Navigation
Conference papers

Efficient Schemes for Computing α-tree Representations

Jiří Havel 1 François Merciol 2 Sébastien Lefèvre 2
2 OBELIX - Environment observation with complex imagery
UBS - Université de Bretagne Sud, IRISA-D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
Abstract : Hierarchical image representations have been addressed by various models by the past, the max-tree being probably its best representative within the scope of Mathematical Morphology. However, the max-tree model requires to impose an ordering relation between pixels, from the lowest values (root) to the highest (leaves). Recently, the α-tree model has been introduced to avoid such an ordering. Indeed, it relies on image quasi-flat zones, and as such focuses on local dissimilarities. It has led to successful attempts in remote sensing and video segmentation. In this paper, we deal with the problem of α-tree computation, and propose several efficient schemes which help to ensure real-time (or near-real time) morphological image processing.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00905177
Contributor : Sébastien Lefèvre <>
Submitted on : Wednesday, November 13, 2019 - 6:42:27 PM
Last modification on : Wednesday, October 14, 2020 - 3:46:22 AM

File

ismm2013alphatree.pdf
Files produced by the author(s)

Identifiers

Citation

Jiří Havel, François Merciol, Sébastien Lefèvre. Efficient Schemes for Computing α-tree Representations. International Symposium on Mathematical Morphology, ISMM 2013, 2013, Uppsala, Sweden. pp.111-122, ⟨10.1007/978-3-642-38294-9_10⟩. ⟨hal-00905177⟩

Share

Metrics

Record views

1173

Files downloads

151