An algorithm for the computation of the Hutchinson distance

DOI10.1016/0020-0190(91)90019-EMaRDI QIDQ1183452zbMATH OpenOpenAlexFDO

Authors Jonathan Brandt, Carlos Cabrelli, Ursula Molter

Publication date 28 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90019-e

zbMATH Keywords

fractal approximationHutchinson distancesimilarity measures

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1059815
• scientific article; zbMATH DE number 270113
• The proximal distance algorithm
• Computing the Monge-Kantorovich distance
• An algorithm for realizing Euclidean distance matrices
• On the complexity of computing the Hausdorff distance
• The complexity of computing the Muirhead-Dalton distance
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• scientific article; zbMATH DE number 2209711

Cited in

(5)

• The Kantorovich metric for probability measures on the circle
• Computing the Monge-Kantorovich distance
• scientific article; zbMATH DE number 820058 (Why is no real title available?)
• Iterated function systems with place-dependent probabilities and the inverse problem of measure approximation using moments
• scientific article; zbMATH DE number 270113 (Why is no real title available?)

This page was built for publication: An algorithm for the computation of the Hutchinson distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183452)