COMPUTING HORIZONTAL/VERTICAL CONVEX SHAPES MOMENTS ON RECONFIGURABLE MESHES

摘要

Zero- to third-order moments are very useful tools for analysing 2-D (two-dimensional) shapes. Given an N x 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 x N reconfigurable mesh. In the sense of the product of time and the number of processors used, our algorithm is time- and cost-optimal. Copyright (C) 1996 Pattern Recognition Society. [References: 30]