2012
DOI: 10.1016/j.patcog.2012.02.010
|View full text |Cite
|
Sign up to set email alerts
|

Distance maps from unthresholded magnitudes

Abstract: A straightforward algorithm that computes distance maps from unthresholded magnitude values is presented, suitable for still images and video sequences. While results on binary images are similar to classic Euclidean Distance Transforms, the proposed approach does not require a binarization step. Thus, no thresholds are needed and no information is lost in intermediate classification stages. Experiments include the evaluation of segmented images using the watershed algorithm and the measurement of pixel value … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Their placement is based on the classical definition of the Distance Transform (DT) where each point receives a value representing a point distance from the nearest object [20]. However, Antón-Canalís et al have redefined the term object [21] in their Distance from Unthresholded Magnitudes Maps (DMUM) algorithm, where the expression on the "distance to the nearest object" was replaced by the "distance to the nearest most relevant magnitude area" in a mapping function directly based on unthresholded magnitudes. Thus, DMUM provides a map of the local minima located along the processed image and defines the trixel vertices (see Figure 2-b).…”
Section: Triangular Superpixelsmentioning
confidence: 99%
“…Their placement is based on the classical definition of the Distance Transform (DT) where each point receives a value representing a point distance from the nearest object [20]. However, Antón-Canalís et al have redefined the term object [21] in their Distance from Unthresholded Magnitudes Maps (DMUM) algorithm, where the expression on the "distance to the nearest object" was replaced by the "distance to the nearest most relevant magnitude area" in a mapping function directly based on unthresholded magnitudes. Thus, DMUM provides a map of the local minima located along the processed image and defines the trixel vertices (see Figure 2-b).…”
Section: Triangular Superpixelsmentioning
confidence: 99%
“…The first part of the TriToM creation is related to the image analysis through the DMUM (Distance Maps from Unthresholded Magnitudes) as a preprocessing step [12]. The local minimum points are placed by computing the DMUM algorithm all over the image.…”
Section: Tritom Creationmentioning
confidence: 99%