One-pass Moment Algorithm for Graphical Primitives
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
Keywords
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).