COMPONENT LABELING IN PYRAMID ARCHITECTURE

A new pyramid algorithm for labeling connected components of an image is presented. The algorithm uses explicit node to node connections in a pyramid architecture for data transfer operations and does not assum e any complex pyramid machine with random access read (RAR) or random access write (RAW) capabilities. The algorithm is more practical from a programming point of view as it is easily implementable on some of t he existing pyramid machines (Schaeffer, Proc. 18th Annual Hawaii Conf . on Systems Science, Vol. 1, pp. 178-184 (1985), Tanomoto et al., Par allel Computer Vision, pp. 43-83. Academic Press, Orlando, Florida (19 87)). The time complexity of the algorithm is O(s log n) for n x n ima ge size and s components in the image. Moreover, the algorithm is appl icable on both binary and multilevel images and hence is useful for se gmentation of multilevel images. Experimental results on binary and ra nge images are cited in this paper to highlight distinctive features o f the algorithm.