AN ALGORITHM FOR CONNECTED COMPONENT LABELING BASED ON LINEAR QUADTREES

Quadtree representation of an image provides a method of saving stcrages effectively and performing image processing quickly,while connected component labelingis one of the most basic operations in image processing,image analysis and computergraphics.Reference〔1〕and〔2〕had proposed an algorithm for connected component labeling of an image based on pointer quadtree and linear quadtrce (LQT,for short)respectively.In this paper,we propose a new algorithm for connected component labeling(CCL,for short) based on linear quadtree.This algorithm has thesame average time complexity (O(N·log N)) as that of〔1〕and〔2〕,but its efficiency and generality are better than that of〔1〕and〔2〕.