Name
Abstract | ||
|---|---|---|
The max-tree is a mathematical morphology data structure that represents an image through the hierarchical relationship of connected components resulting from different thresholds. It was proposed in 1998 by Salembier et al., since then,many efficient algorithms to build and process it were proposed.There are also efficient algorithms to extract size, shape and contrast attributes of the max-tree nodes. These algorithms al-lowed efficient implementation of connected filters like attribute-openings and development of automatic and semi-automatic applications that compete with the state-of-the-art. This paper reviews the max-tree principles, algorithms, applications and its current trends. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/SIBGRAPI-T.2016.011 | 2016 29th SIBGRAPI Conference on Graphics, Patterns and Images Tutorials (SIBGRAPI-T) |
Keywords | Field | DocType |
max-tree,component tree,filtering,algorithms | Data structure,Algorithm design,Mathematical morphology,Computer science,Algorithm,Theoretical computer science,Image segmentation,Probabilistic analysis of algorithms,Connected component | Conference |
ISBN | Citations | PageRank |
978-1-5090-4435-1 | 0 | 0.34 |
References | Authors | |
25 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Souza | 1 | 72 | 9.78 |
| Luis A. Tavares | 2 | 0 | 0.34 |
| Leticia Rittner | 3 | 82 | 12.95 |
| Roberto de Alencar Lotufo | 4 | 572 | 53.61 |