Computing a shape's moments from its boundary

Abstract Moments have been among the most commonly used tools in the analysis of 2D shapes. Important information about a shape such as its size, center location and orientation are all moment-based attributes. There is also a number of very useful shape features such as maximum and minimum moments of inertia, moment invariants, shape spreadness and shape elongation which are also derived from moments. Traditionally, moments of a shape are computed from the occupancy array representation of the shape. That is, all the shape's pixels are involved in the computation. In this paper we propose a method which computes the same set of moments using only the corner pixels along a shape's boundary. The basic approach is to construct a set of triangles using the shape's corners and the origin of the coordinate system. The moments of these triangles are computed first. The moments of the shape are then derived from the triangles' moments. We have found the suggested method to be much more efficient than the traditional occupancy array based methods.

[1]  T. Pavlidis Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[2]  Berthold K. P. Horn Robot vision , 1986, MIT electrical engineering and computer science series.

[3]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[4]  Theodosios Pavlidis,et al.  Algorithms for Shape Analysis of Contours and Waveforms , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[6]  Anil K. Jain Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[7]  T. Morrin Chain-link compression of arbitrary black-white images , 1976 .

[8]  Jia-Guu Leu,et al.  Polygonal approximation of 2-D shapes through boundary merging , 1988, Pattern Recognit. Lett..