Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm

08/05/2019
by   Mihir Sahasrabudhe, et al.
0

The distance transform algorithm is popular in computer vision and machine learning domains. It is used to minimize quadratic functions over a grid of points. Felzenszwalb and Huttenlocher (2004) describe an O(N) algorithm for computing the minimum distance transform for quadratic functions. Their algorithm works by computing the lower envelope of a set of parabolas defined on the domain of the function. In this work, we describe an average time O(N) algorithm for maximizing this function by computing the upper envelope of a set of parabolas. We study the duality of the minimum and maximum distance transforms, give a correctness proof of the algorithm and its runtime, and discuss potential applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2019

Conditional Hardness of Earth Mover Distance

The Earth Mover Distance (EMD) between two sets of points A, B ⊆R^d with...
research
08/27/2021

A Bisection Method Like Algorithm for Approximating Extrema of a Continuous Function

For a continuous function f defined on a closed and bounded domain, ther...
research
12/02/2021

On the computational complexity of the Steiner k-eccentricity

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...
research
07/06/2023

A Near-Linear Time Algorithm for the Chamfer Distance

For any two point sets A,B ⊂ℝ^d of size up to n, the Chamfer distance fr...
research
11/18/2016

A Novel Architecture for Computing Approximate Radon Transform

Radon transform is a type of transform which is used in image processing...
research
08/21/2020

Optimal algorithm for computing Steiner 3-eccentricities of trees

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...
research
11/12/2020

Focal points and their implications for Möbius Transforms and Dempster-Shafer Theory

Dempster-Shafer Theory (DST) generalizes Bayesian probability theory, of...

Please sign up or login with your details

Forgot password? Click here to reset