Abstract
Abstract: An efficient algorithm is presented to label the Connected Components in array representation of 2-d images. A new data structure is suggested to maintain the equivalence table that makes use of a modified version of Union-Find algorithms. The operations supported by the equivalence table enable aggressive reuse of labels and bound the size of the table by \lfloor N/2 \rfloor + 1, for a N X N image. It is also shown that the maintenance of the table has an overall linear amortized cost.