Distance transform

Known as: Euclidean distance map, Euclidian distance map, Euclidean 
A distance transform, also known as distance map or distance field, is a derived representation of a digital image. The choice of the term depends on… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
05010019762018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
This paper provides linear-time algorithms for solving a class of minimization problems involving a cost function with both local… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example… (More)
  • figure 2
  • figure 4
  • figure 1
  • figure 5
  • figure 7
Is this relevant?
2004
2004
Within image analysis the distance transform has many applications. The distance transform measures the distance of each object… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper describes the theory and algorithms of distance transform for fuzzy subsets, called fuzzy distance transform (FDT… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We describe a multi-feature hierarchical algorithm to e ciently match N objects (templates) with an image using distance… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We describe an algorithm for generating connected skeletons of objects in a binary image. The algorithm combines essentially all… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In artificial intelligence, a number of search algorithms is available for finding shortest paths in graphs. The uniform cost… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table I
Is this relevant?