Abstract
The approximation coefficient matrix of the 1-level Daubechies wavelet transform, combined with the Hu set of invariant moments, is proposed as the features of the off-line handwritten Tibetan consonant letters recognition. And an optimal coefficient is multiplied to the Hu set of invariant moments before concatenating it to the vector transformed from the approximation coefficient matrix. The experiments show that the proposed features improve the recognition rate of off-line handwritten Tibetan consonants evidently.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
