Abstract

To compute moments of a two-dimensional image, a large number of multiplications and additions are required. High speed can be achieved with a parallel algorithm that can be implemented efficiently on a parallel processor array. An efficient algorithm for calculating the low-order moments is proposed for a linear processor array. Multiplications, which are the time-consuming operations, are completely avoided. The proposed algorithm exhibits rich parallelism and is well suited to be implemented in a SIMD linear processor array. >

Full Text
Published version (Free)

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