Publication Details
Efficient schemes for computing alpha-tree representations
Efficient schemes; Hierarchical image representations; Hierarchies; Image partition; Morphological image processing; Near-real time; Tree representation; Video segmentation
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 alpha-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 alpha-tree computation, and propose several efficient schemes which help to ensure real-time (or near-real time) morphological image processing
@inproceedings{BUT106897,
author="Jiří {Havel} and Francois {Merciol} and Sebastien {Lefevre}",
title="Efficient schemes for computing alpha-tree representations",
booktitle="Mathematical Morphology and Its Applications to Signal and Image Processing",
year="2013",
series="Lecture Notes in Computer Science Volume 7883",
journal="Lecture Notes in Computer Science",
volume="2013",
number="7883",
pages="111--122",
publisher="Springer Verlag",
address="Berlin",
doi="10.1007/978-3-642-38294-9\{_}10",
isbn="978-3-642-38293-2",
issn="0302-9743"
}