No abstract

The main objective of this paper is to carry out a detailed analysis of the most popular Connected Component Labeling (CCL) algorithms for remote sensing image classification. This algorithm searches line-by-line, top to bottom to assign a splotch label to each current pixel that is connected to a splotch. This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. It assigns a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy deeds the dependencies among the neighbors to reduce the number of neighbors examined. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based deep rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. The connected component labeling assigns labels to a pixel such that adjacent pixels of the same features are assigned the same label. The paper presents a modification of this algorithm that allows the resolution of merged labels and experimental results demonstrate that proposed method is much more efficient than conventional methods for various kinds of color images. This method is improving the labeling algorithms and also benefits for other applications in computer vision and pattern recognition

No abstract