Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm for the computation of the Hutchinson distance

From MaRDI portal
Publication:1183452
Jump to:navigation, search

DOI10.1016/0020-0190(91)90019-EzbMath0748.68020OpenAlexW2083979484MaRDI QIDQ1183452

Jonathan Brandt, Carlos A. Cabrelli, Ursula M. 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

similarity measuresfractal approximationHutchinson distance


Mathematics Subject Classification ID

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


Related Items (3)

The Kantorovich metric for probability measures on the circle ⋮ Computing the Monge-Kantorovich distance ⋮ ITERATED FUNCTION SYSTEMS WITH PLACE-DEPENDENT PROBABILITIES AND THE INVERSE PROBLEM OF MEASURE APPROXIMATION USING MOMENTS



Cites Work

  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1183452&oldid=12049071"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki