Computing the Kantorovich Distance for Images

  title={Computing the Kantorovich Distance for Images},
  author={Thomas Kaijser},
  journal={Journal of Mathematical Imaging and Vision},
Computing the Kantorovich distance for images is equivalent to solving a very large transportation problem. The cost-function of this transportation problem depends on which distance-function one uses to measure distances between pixels. In this paper we present an algorithm, with a computational complexity of roughly order $$\mathcal{O}$$ (N2), where N is equal to the number of pixels in the two images, in case the underlying distance-function is the L1-metric, an approximation of the L2… CONTINUE READING


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

Optimal Mass Transport for Registration and Warping

International Journal of Computer Vision • 2004
View 3 Excerpts
Highly Influenced

Surface parameterization based on polar factorization

J. Computational Applied Mathematics • 2018
View 1 Excerpt


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

Image Compression

M. Barnsley, L. Hurd, Fractal
AK Peters: Wellesley, • 1993

Orlin, Network Flows, Theory, Algorithms and Applications

R. K. Ahuja, T. L. Magnanti, J.B
View 3 Excerpts

Fractal coding,

A. Jacquin
Image Compression , • 1992
View 1 Excerpt

Fractal compression,

A. Jacquin
Ph.D. thesis, Georgia Inst. of Technology: Atalanta, • 1989
View 2 Excerpts

A distance measure for comparison of pictures and shapes,

M. Werman
Ph.D. thesis, • 1986
View 2 Excerpts

The Monge-Kantorovich mass transference problem and its stochastic applications,

S. T. Rachev
Theory of Prob. Appl. , • 1985
View 3 Excerpts

Similar Papers

Loading similar papers…