Compressed quadtree representations for storing similar images

摘要

Based on linear quadtree structures and overlapping concepts, a new approach is proposed for storing a sequence of similar binary images. The space reduction of the method from linear quadtrees to overlapped linear quadtrees is equal to the overlapping percentage of images. We make a modification to the representation to provide bidirectional image retrieval. A simple, systematic and efficient method is devised for forward and backward retrieval to obtain the desired images quickly. The new representations are efficient and effective for a practical sstem in the fields of animation and geographic information systems.