论文信息 - Maintenance of connected components in quadtree-based image representation

Maintenance of connected components in quadtree-based image representation

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 updating algorithms visit less nodes compared to the batch approach.

[1] Clifford A. Shaffer,et al. Optimal quadtree construction algorithms , 1987, Comput. Vis. Graph. Image Process..

[2] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[3] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .

[4] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[5] Hanan Samet,et al. Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..

[6] Hanan Samet,et al. A general approach to connected-component labeling for arbitrary image representations , 1992, JACM.

[7] Hannan Samet,et al. Region representation: Quadtrees from binary arrays , 1980 .

[8] Linda G. Shapiro,et al. A new connected components algorithm for virtual memory computers , 1983, Comput. Vis. Graph. Image Process..

[9] Shimon Even,et al. An On-Line Edge-Deletion Problem , 1981, JACM.

[10] I. Jntroductjon. Neighbor Finding Techniques for Images Represented by Quadtrees * , 1980 .

[11] G. Ramalingam. Bounded Incremental Computation , 1996, Lecture Notes in Computer Science.

[12] David Eppstein. Dynamic Connectivity in Digital Images , 1997, Inf. Process. Lett..

[13] W A Davis,et al. Connected component labeling using modified linear quadtrees , 1986 .