Optical character recognition by the method of moments
Computer Vision, Graphics, and Image Processing
New forms of shape invariants from elliptic Fourier descriptors
Pattern Recognition
Computing a shape's moments from its boundary
Pattern Recognition
Boundary Finding with Parametrically Deformable Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
A survey of moment-based techniques for unoccluded object representation and recognition
CVGIP: Graphical Models and Image Processing
Computing moments of objects enclosed by piecewise polynomial surfaces
ACM Transactions on Graphics (TOG)
Zernike moment-based image analysis and its application
Pattern Recognition Letters
Application of Elliptic Fourier Descriptors to Symmetry Detection Under Parallel Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Implicitization of Parametric Curves by Matrix Annihilation
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Simulation of Articulated Rigid Bodies with Contact and Collision
IEEE Transactions on Visualization and Computer Graphics
Analysis of Two-Dimensional Non-Rigid Shapes
International Journal of Computer Vision
Numerical Geometry of Non-Rigid Shapes
Numerical Geometry of Non-Rigid Shapes
Minimum description length shape model based on elliptic fourier descriptors
ISNN'06 Proceedings of the Third international conference on Advnaces in Neural Networks - Volume Part II
Moment computation for objects with spline curve boundary
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modeling and Estimation of the Dynamics of Planar Algebraic Curves via Riccati Equations
Journal of Mathematical Imaging and Vision
Hi-index | 0.10 |
This paper develops a recursive method for computing moments of 2D objects described by elliptic Fourier descriptors (EFD). To this end, Green's theorem is utilized to transform 2D surface integrals into 1D line integrals and EFD description is employed to derive recursions for moments computations. A complexity analysis is provided to demonstrate space and time efficiency of our proposed technique. Accuracy and speed of the recursive computations are analyzed experimentally and comparisons with some existing techniques are also provided.