Abstract

In this paper we present a parallel algorithm for solving the ranking problem in the connected components of images. This algorithm is assigned to be implemented on an n/spl times/n reconfigurable mesh computer, where the image is stored one pixel per processing element. This algorithm is achieved in three essential stages, such as contour extraction of the component, straight line segment identification in the contour and ranking the boundary pixels. This algorithm is of O(log p) times complexity, where p is the number of the straight line segments in the contour. The reconfigurability of the mesh allows us to perform all the mentioned procedures fast and independently of the image size. >

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 call

Disclaimer: 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.