Parallel Region Property Computation by Active Quadtree Networks

Given a binary image stored in a cellular array, a local reconfiguration process can be used to reconnect some of the cells into a quadtree network representing the image. This quadtree can also be ``roped,´´ i.e., nodes representing adjacent image blocks of the same size can be joined. Using the roped quadtree network as a parallel (cellular) computer, image properties such as perimeter and genus, as well as the quadtree distance transform, can be computed in O(tree height) = O(log image diameter) time. The area and centroid of the image can be computed in O(height) time without the need for roping.