Distance Transforms of Sampled Functions

  title={Distance Transforms of Sampled Functions},
  author={Pedro F. Felzenszwalb and Daniel P. Huttenlocher},
  journal={Theory of Computing},
This paper provides linear-time algorithms for solving a class of minimization problems involving a cost function with both local and spatial terms. These problems can be viewed as a generalization of classical distance transforms of binary images, where the binary image is replaced by an arbitrary sampled function. Alternatively they can be viewed in terms of the minimum convolution of two functions, which is an important operation in grayscale morphology. A useful consequence of our… CONTINUE READING
Highly Influential
This paper has highly influenced 35 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 637 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 349 extracted citations

638 Citations

Citations per Year
Semantic Scholar estimates that this publication has 638 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 18 references

A euclidean distance transform using grayscale morphology decomposition

  • C. T. Huang, O. R. Mitchell
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1994
1 Excerpt

Quick algorithm for determining the distances from the points of the given subset of an integer lattice to the points of its complement

  • A. V. Karzanov
  • Cybernetics and System Analysis,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…