Efficient Algorithms for Overlapping a Sequence of Images

Abstract

In this paper, we present two novel and efficient algorithms for overlapping a sequence of quadtrees, one for binary images and the other for gray images. They relax the constraint that the common subtrees to be merged have to be at the same position and of the same size. This relaxation causes the proposed algorithm to have higher compression capability. Experiments are carried out to demonstrate the memory-saving and computational advantages of the proposed algorithm. Experimental results reveal that the proposed overlapping representation has 24.89%–54.55% (6.83%–11.71%) compression improvement and 34.92%–49.18% (24.75%–34.50%) execution-time improvement when compared to the previous result. Finally, the application of our result to overlap a sequence of gray images is presented.