OPTIMAL PARALLEL ALGORITHMS FOR REGION LABELING AND MEDIAL AXIS TRANSFORM OF BINARY IMAGES

초록

Given a square-root n x square-root n binary image, region labeling labels each 1 of the image so that two 1's have the same label if and only if they are in the same region (i.e., connected) and medial axis transform finds for each 1 of the image the largest square subimage having it as top-left corner and consisting only of 1's. Both can be solved in theta-(n) sequential time. O(log n) time, n/log n processor parallel algorithms for both problems in the EREW PRAM are presented.

키워드