Abstract
Moment is a useful tool in character and drawing recognition. As the moment computation is time-consuming, the main aim in this area is to develop a fast algorithm. The commonly-used method is the discrete Green’s theorem, which transforms the double summation into a summation on region contour. An improved discrete Green’s theorem proposed in this paper, which removes the constraint on parity pairing, thus extends its validity in applying the algorithm to complex regions. The contour tracing is fulfilled by a boundary-tracing-automation, and the central moments for graphical primitives are computed by one-pass scanning algorithm, the calculation of the moment is greatly simplified DOI : http://dx.doi.org/10.11591/telkomnika.v12i5.5099
Sign-in/Register to access full text options 
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
