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

The difficult task of finding a recurrent 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 and affinity hashing capitalize on this observation to not only detect a shape's morphological selfsimilarity but also find the parameters of its self-transformations. The similarity hashing procedure illustrated here will form the basis of a system which will automatically obtain recurrent models from digitized input shapes. 1 Introduction Fractal geometry provides a representation powerful enough to model the high level of detail found in natural structures[16]. Linear ..