Paper Info
Title
An efficient algorithm for computation of shape moments from run-length codes or chain codes
Abstract
Moments are very useful for shape analysis. Zero- to third-order moments have been used for computer vision applications such as shape recognition and orientation. They can serve for composition of the well-known moment invariants used as desirable features as well as for the detection of the location and the principal axis direction of a shape. The shape is often represented by a binary image and its moments can be obtained by use of fast algorithms considering the shape as a discrete point array. In this paper a new algorithm based on the double-integral formulation is presented. The shape is considered as a continuous region and the contribution of boundary points is used for fast computation of shape moments. This method can be used to calculate moments from either the run-length codes or the chain codes of shape.
Year
DOI
Venue
1992
10.1016/0031-3203(92)90015-B
Pattern Recognition
Keywords
Field
DocType
Pattern recognition,Object orientation,Shape analysis,Moments,Central moments,Moment invariants,Fast algorithms
Active shape model,Binary image,Topological skeleton,Principal axis theorem,Algorithm,Invariant (mathematics),Velocity Moments,Mathematics,Shape analysis (digital geometry),Computation
Journal
Volume
Issue
ISSN
25
10
0031-3203
Citations 
PageRank 
References 
23
2.38
6
Authors
3
Name
Order
Citations
PageRank
Mo Dai116312.05
Pierre Baylou213921.74
Mohamed Najim314932.29