Similarity Hashing: A Computer Vision Solution to the Inverse Problem of Linear Fractals

Fractals 5, 1997, pp. 39-50.

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.

AttachmentSize
simhash.pdf5.78 MB

Theme by Danetsoft and Danang Probo Sayekti inspired by Maksimer