Similarity hashing: A computer vision solution to the inverse problem of linear fractals

John C. Hart, Wayne O. Cochran, Patrick J. Flynn

Research output: Contribution to journalArticle

Abstract

The difficult task of finding a fractal representation of an input shape is called the inverse problem of fractal geometry. Previous attempts at solving this problem have applied techniques from numerical minimization, heuristic search and image compression. The most appropriate domain from which to attack this problem is not numerical analysis nor signal processing, but model-based computer vision. Self-similar objects cause an existing computer vision algorithm called geometric hashing to malfunction. Similarity hashing capitalizes on this observation to not only detect a shape's morphological self-similarity but also find the parameters of its self-transformations.

Original languageEnglish (US)
Pages (from-to)39-50
Number of pages12
JournalFractals
Volume5
Issue numberSUPPL. 1
StatePublished - Apr 1 1997

ASJC Scopus subject areas

  • Modeling and Simulation
  • Geometry and Topology
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Similarity hashing: A computer vision solution to the inverse problem of linear fractals'. Together they form a unique fingerprint.

  • Cite this