High accuracy character recognition algorithm using Fourier and topological descriptors
From MaRDI portal
Recommendations
- ARABIC CHARACTER RECOGNITION USING MODIFIED FOURIER SPECTRUM (MFS) VS. FOURIER DESCRIPTORS
- Arabic character recognition using 1-D slices of the character spectrum
- scientific article; zbMATH DE number 1759552
- A Programmed Algorithm for Designing Multifont Character Recognition Logics
- scientific article; zbMATH DE number 5257523
Cites work
- scientific article; zbMATH DE number 3451488 (Why is no real title available?)
- Computer Recognition of Handwritten Numerals by Polygonal Approximations
- Fourier Descriptors for Plane Closed Curves
- Fourier Preprocessing for Hand Print Character Recognition
- Interactive Pattern Analysis and Classification
- Recognition of Handwritten Characters by Topological Feature Extraction and Multilevel Categorization
Cited in
(8)- Recognizing typeset documents using Walsh transformation
- Signal recognition: Fourier transform vs. Hartley transform.
- Character recognition using morphological transformations
- scientific article; zbMATH DE number 5257523 (Why is no real title available?)
- ARABIC CHARACTER RECOGNITION USING MODIFIED FOURIER SPECTRUM (MFS) VS. FOURIER DESCRIPTORS
- Optical character recognition of the orthodox Hellenic Byzantine Music notation
- A Programmed Algorithm for Designing Multifont Character Recognition Logics
- A quantitative representation of molecular surface shape. I: Theory and development of the method
This page was built for publication: High accuracy character recognition algorithm using Fourier and topological descriptors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794454)
