Abstract
Finding connected components of a digital image is a fundamental problem in image processing and image understanding. Although many applications must deal with gray-scale or color images, most parallel algorithms presented to date consider the problem only for binary images. This paper considers the problem related to the k-valid connected component of gray-scale images, which is a generalized concept of the connected component in binary images. This paper presents algorithms for the problem of n x n gray-scale images. An Exclusive Read Exclusive Write (EREW) PRAM algorithm that finds a maximal k-valid connected component in O(log k log n) time using n 2 /log n processors is shown here. We also show an Arbitrary Concurrent Read Concurrent Write (CRCW) PRAM algorithm and an EREW PRAM algorithm that find a maximal k-valid segmentation in a time of order O((log k + log * n)log n) and respectively, O(log 2 n) using n 2 processors in both cases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
