ive of

Abstract—In this paper, we have considered the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change. The batch approach to recalculate the connected components information is very expensive. Our algorithms update the quadtree and the connected components labeling when a homogeneous region in the quadtree is changed. Our algorithms visit less number of nodes as compared to the batch approach. For small changes in the image, the proposed algorithms save time to update the quadtree and take less time to update the labels of the components on the average. Index Terms—Connected components, data structures image processing, quadtree representation, I