# Computing the Kantorovich Distance for Images

@article{Kaijser1998ComputingTK,
title={Computing the Kantorovich Distance for Images},
author={Thomas Kaijser},
journal={Journal of Mathematical Imaging and Vision},
year={1998},
volume={9},
pages={173-191}
}
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

#### Citations

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

## The Monge-Kantorovich Optimal Transport Distance for Image Comparison

ArXiv • 2018
View 4 Excerpts
Highly Influenced

## Monge's Optimal Transport Distance with Applications for Nearest Neighbour Image Classification

ArXiv • 2016
View 5 Excerpts
Highly Influenced

## Interactive Exploration of Large Event Datasets in High Energy Physics

Journal of WSCG • 2009
View 8 Excerpts
Highly Influenced

## 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

## Design of evacuation strategies with crowd density feedback

Science China Information Sciences • 2015

## Interpolation of longitudinal shape and image data via optimal mass transport

Medical Imaging: Image Processing • 2014

## A Perfect Match Condition for Point-Set Matching Problems Using the Optimal Mass Transport Approach

SIAM J. Imaging Sciences • 2013
View 2 Excerpts

## On the Computation of the Kantorovich Distance for Images

Constantinos Alexopoulos, Vassileios Drakopoulos
2012

## Fach Mathematik Variational Methods using Transport Metrics and Applications

View 1 Excerpt

#### References

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

## Using geometry to solve the transportation problem in the plane

Algorithmica • 1995
View 1 Excerpt

## Image Compression

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

## Lectures on the Coupling Method (Torgny Lindvall)

SIAM Review • 1993

## Orlin, Network Flows, Theory, Algorithms and Applications

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

## Fractal coding,

A. Jacquin
Image Compression , • 1992
View 1 Excerpt

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

## A distance metric for multidimensional histograms

Computer Vision, Graphics, and Image Processing • 1985

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

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