Experiments on Picture Representation Using Regular Decomposition.

摘要

The problem of building a computer-searchable data representation for a complex image and the effect of representation on algorithms for scene segmentation into regions is considered. A regular decomposition of picture area into successively small quadrants is defined which involves logarithmic search. This hierarchial search and resulting picture representation is shown to enable rapid access of image data without regard to position, efficient storage, and approximate structural descriptions of constituent patterns. Examples involving solid geometrical objects, alphabetic characters and abstract patterns are given.