Abstract
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 re- compute the connected components information is very expensive. Our algorithms update the quadtree as well as the connected components labeling when a homogeneous region in the quadtree is changing. The updation algorithms visit less number of nodes as compared to the batch approach.