Hutchinson metric

From testwiki
Revision as of 07:13, 28 June 2022 by imported>Neutronstar2
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
A Julia set, a fractal related to the Mandelbrot set
A fractal that models the surface of a mountain (animation)

In mathematics, the Hutchinson metric otherwise known as Kantorovich metric is a function which measures "the discrepancy between two images for use in fractal image processing" and "can also be applied to describe the similarity between DNA sequences expressed as real or complex genomic signals".[1][2]

Formal definition

Consider only nonempty, compact, and finite metric spaces. For such a space X, let P(X) denote the space of Borel probability measures on X, with

δ:XP(X)

the embedding associating to xX the point measure δx. The support |μ| of a measure in P(X) is the smallest closed subset of measure 1.

If f:X1X2 is Borel measurable then the induced map

f*:P(X1)P(X2)

associates to μ the measure f*(μ) defined by

f*(μ)(B)=μ(f1(B))

for all B Borel in X2.

Then the Hutchinson metric is given by

d(μ1,μ2)=sup{u(x)μ1(dx)u(x)μ2(dx)}

where the sup is taken over all real-valued functions u with Lipschitz constant 1.

Then δ is an isometric embedding of X into P(X), and if f:X1X2 is Lipschitz then f*:P(X1)P(X2) is Lipschitz with the same Lipschitz constant.[3]

See also

Sources and notes

Template:Reflist

  1. Template:Cite journal
  2. Hutchinson Metric in Fractal DNA Analysis -- a Neural Network Approach Template:Webarchive
  3. "Invariant Measures for Set-Valued Dynamical Systems" Walter Miller; Ethan Akin Transactions of the American Mathematical Society, Vol. 351, No. 3. (March 1999), pp. 1203–1225]