Abstract
Zero- to third-order moments are very useful tools for analysing 2-D (two-dimensional) shapes. Given an N × N digital image, this paper presents a novel constant-time parallel algorithm for computing a horizontal/vertical convex shape's moments, each row/column in the shape without holes, on an N × N reconfigurable mesh. In the sense of the product of time and the number of processors used, our algorithm is time- and cost-optimal.
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.
