1998
DOI: 10.1109/83.718487
|View full text |Cite
|
Sign up to set email alerts
|

Optimum design of chamfer distance transforms

Abstract: Abstract-The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desired Euclidean distance transform at a lower computational cost. They can also give integer-valued distances that are more suitable for several digital image processing tasks. The local distances used to compute a chamfer distance transform are selected to minimize an approximation error. In this paper, a new geometric approach i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
17
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 132 publications
(18 citation statements)
references
References 13 publications
1
17
0
Order By: Relevance
“…At this point, the recognition of correspondences among point clouds is essential to compute plant movements of the plant as displacements between multi-temporal datasets. Therefore, first cloud-to-cloud differences between sequential TLiDAR datasets are computed using a chamfer distance approach that exploits an octree organization (Akmal Butt and Maragos, 1998 ). Second, the distance statistics resulting from this first step are used to refine the displacements.…”
Section: Methodsmentioning
confidence: 99%
“…At this point, the recognition of correspondences among point clouds is essential to compute plant movements of the plant as displacements between multi-temporal datasets. Therefore, first cloud-to-cloud differences between sequential TLiDAR datasets are computed using a chamfer distance approach that exploits an octree organization (Akmal Butt and Maragos, 1998 ). Second, the distance statistics resulting from this first step are used to refine the displacements.…”
Section: Methodsmentioning
confidence: 99%
“…The algorithm begins at the basin outlet and performs the segmentation in the upstream direction (Figure 1b), so that the vector of intermediate outlets is sorted descending in terms of drainage area. After setting an accumulated length value of zero to the basin outlet (green square in Figure 1b), the algorithm starts tracing in the upstream direction and the accumulated length is updated at each pixel using the Distance Transforms method (Butt & Maragos, 1998) to improve distance calculations (Paz & Collischonn, 2007). Whenever the length threshold is exceeded, as indicated by the break lines in Figure 1b, the accumulated length is reset to zero and a unique number (ID) is assigned to all pixels belonging to the same river reach.…”
Section: A Length-delimited Vector-based River Discretization For Hydrologic-hydrodynamic Modelingmentioning
confidence: 99%
“…The approximated global distance is a superposition of the local distances multiplied by corresponding global coordinate. Based on the above-mentioned principles, we select chamfer distance transform algorithm, 11 which operates quickly and simply. This algorithm also obtains calculated distance close enough to the real Euclidean distance.…”
Section: Second Stage Of Detectionmentioning
confidence: 99%