Moments of elliptic fourier descriptors

This paper develops a recursive method for computing moments of 2D objects described by elliptic Fourier descriptors (EFD). 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. Experiments are performed to quantify the accuracy of our proposed method. Comparison with Bernstein-B´ezier representations is also provided

Modeshapes recognition using Fourier descriptors: a simple SHM example

The main objective of this study is to develop an alternative criterion for modeshape classification, as the currently available one, MAC (Modal Assurance Criteria), is only a vector correlation representing modeshape similarities. This new method is developed to provide a set of features (Fourier Descriptors) for comparing modeshapes with “local” similarities of higher interest than “global” similarities using nodal lines. These lines are able to characterize modeshapes very easily. So when damage occurs, we are able to track the few descriptors changes to localise the damage. We validated our method on a CFCF plate demonstrating the quality of the damage localisation and possible use in a “mode tracking” application (space structure)

Parameterization of written signatures based on EFD

In this work we propose a method to quantify written signatures from digitalized images based on the use of Elliptical Fourier Descriptors (EFD). As usually signatures are not represented as a closed contour, and being that a necessary condition in order to apply EFD, we have developed a method that represents the signatures by means of a set of closed contours. One of the advantages of this method is that it can reconstruct the original shape from all the coefficients, or an approximated shape from a reduced set of them finding the appropriate number of EFD coefficients required for preserving the important information in each application. EFD provides accurate frequency information, thus the use of EFD opens many possibilities. The method can be extended to represent other kind of shapes

Fourier-based geometric shape prior for snakes

International audienceA novel method of snakes with shape prior is presented in this paper. We propose to add a new force which makes the curve evolve to particular shape corresponding to a template to overcome some well-known problems of snakes. The template is an instance or a sketch of the researched contour without knowing its exact geometric pose in the image. The prior information is introduced through a set of complete and locally stable invariants to Euclidean transformations (translation, rotation and scale factor) computed using Fourier Transform on contours. The method is evaluated with the segmentation of myocardial scintigraphy slices and the tracking of an object in a video sequence

Feature Extraction Methods for Character Recognition

Not Include

Automated framework for robust content-based verification of print-scan degraded text documents

Fraudulent documents frequently cause severe financial damages and impose security breaches to civil and government organizations. The rapid advances in technology and the widespread availability of personal computers has not reduced the use of printed documents. While digital documents can be verified by many robust and secure methods such as digital signatures and digital watermarks, verification of printed documents still relies on manual inspection of embedded physical security mechanisms.The objective of this thesis is to propose an efficient automated framework for robust content-based verification of printed documents. The principal issue is to achieve robustness with respect to the degradations and increased levels of noise that occur from multiple cycles of printing and scanning. It is shown that classic OCR systems fail under such conditions, moreover OCR systems typically rely heavily on the use of high level linguistic structures to improve recognition rates. However inferring knowledge about the contents of the document image from a-priori statistics is contrary to the nature of document verification. Instead a system is proposed that utilizes specific knowledge of the document to perform highly accurate content verification based on a Print-Scan degradation model and character shape recognition. Such specific knowledge of the document is a reasonable choice for the verification domain since the document contents are already known in order to verify them.The system analyses digital multi font PDF documents to generate a descriptive summary of the document, referred to as \Document Description Map" (DDM). The DDM is later used for verifying the content of printed and scanned copies of the original documents. The system utilizes 2-D Discrete Cosine Transform based features and an adaptive hierarchical classifier trained with synthetic data generated by a Print-Scan degradation model. The system is tested with varying degrees of Print-Scan Channel corruption on a variety of documents with corruption produced by repetitive printing and scanning of the test documents. Results show the approach achieves excellent accuracy and robustness despite the high level of noise

The Twist Representation of Shape

We give a contribution to the representation problem of free-form curves and surfaces. Our proposal is an operational or kinematic approach based on the Lie group SE(3). While in Euclidean space the modelling of shape as orbit of a point under the action of SE(3) is limited, we are embedding our problem into the conformal geometric algebra R_4,1 of the Euclidean space R^3. This embedding results in a number of advantages which makes the proposed method a universal and flexible one with respect to applications. Especially advantagous is the equivalence of the proposed shape model to that of the Fourier representations