Connected components labelling using murray polygons

Abstract An algorithm is presented to label the connected components of a binary image using murray polygons. Murray polygons are a generalization of space filling curves and of Peano polygons in particular. The algorithm used an array of run-lengths as input which has been obtained by using a murray polygon. The algorithm focuses on a particular block which is disjoint from other blocks. The starting point for the algorithm can either be indicated by positioning a cursor on the display or in an automated system by choosing a long run-length of the appropriate block comprising the object, only if the object required is large. With slight modification the same algorithm can be used for 3-D and higher dimensional images.