Puneet Varma (Editor)

Hutchinson metric

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Hutchinson metric

In mathematics, the Hutchinson 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".

Formal definition

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

δ : X → P ( X )

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

If

f : X 1 → X 2

is Borel measurable then the induced map

f ∗ : P ( X 1 ) → P ( X 2 )

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

f ∗ ( μ ) ( B ) = μ ( f − 1 ( B ) )

for all B Borel in X 2 .

Then the Hutchinson metric is given by

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

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 : X 1 → X 2

is Lipschitz then

f ∗ : P ( X 1 ) → P ( X 2 )

is Lipschitz with the same Lipschitz constant.

References

Hutchinson metric Wikipedia
(Text) CC BY-SA