2014 IEEE International Conference on Image Processing (ICIP) 2014
DOI: 10.1109/icip.2014.7025593
|View full text |Cite
|
Sign up to set email alerts
|

A first parallel algorithm to compute the morphological tree of shapes of nD images

Abstract: The tree of shapes is a self-dual tree-based image representation belonging to the field of mathematical morphology. This representation is highly interesting since it is invariant to contrast changes and inversion, and allows for numerous and powerful applications. A new algorithm to compute the tree of shapes has been recently presented: it has a quasilinear complexity; it is the only known algorithm that is also effective for nD images with n > 2; yet it is sequential. With the increasing size of data to pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 27 publications
0
14
0
Order By: Relevance
“…The algorithm computes the tree of shapes with quasi-linear time complexity when data quantization is low (typically 12 bits or less) and it works for nD images. Moreover, Crozet et al [38] presented the first parallel algorithm to compute the morphological tree of shapes based on the previous algorithm [37]. The tree of shapes is a more general representation of the image with respect to the min-tree and max-tree and it has many advantages.…”
Section: A Tree Of Shapesmentioning
confidence: 99%
“…The algorithm computes the tree of shapes with quasi-linear time complexity when data quantization is low (typically 12 bits or less) and it works for nD images. Moreover, Crozet et al [38] presented the first parallel algorithm to compute the morphological tree of shapes based on the previous algorithm [37]. The tree of shapes is a more general representation of the image with respect to the min-tree and max-tree and it has many advantages.…”
Section: A Tree Of Shapesmentioning
confidence: 99%
“…The algorithm computes the ToS with quasi-linear time complexity when data quantization is low (typically 12 bits or less) and it works for nD images. Moreover, Crozet et al [20] presented the first parallel algorithm to compute the morphological ToS based on the previous algorithm [19].…”
Section: Tree Of Shapesmentioning
confidence: 99%
“…Last let us recall that a quasi-linear algorithm exists to compute the tree of shapes, that has the property of also working in the nD case [10]. A parallel version of this algorithm is available [9].…”
Section: The Morphological Tree Of Shapesmentioning
confidence: 99%