8 February 2005 A new tree-like fuzzy binary support vector machine for optical character recognition
Author Affiliations +
Abstract
This paper proposes a new tree-like fuzzy binary support vector machines multi-class classifier (FBSVM) for the optical character recognition task. We construct this tree-like classifier by fusing of fuzzy clustering technique and support vector machine (SVM). In k-class task, the new classifier contains k-1 SVM sub-classifiers, but the "one-against-one" method which is usually used contains k(k-1)/2 sub-classifiers. This method also overcomes the drawback such as unclassifiable region that the "one-against-one" method has, and has a good classification performance. Furthermore, it needs less memory. By applying the new classifier to the real mail zipcode digits recognition task, the experimental results indicate that the FBSVM has a better recognition performance.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Guo-yun Zhang, Guo-yun Zhang, Jing Zhang, Jing Zhang, } "A new tree-like fuzzy binary support vector machine for optical character recognition", Proc. SPIE 5637, Electronic Imaging and Multimedia Technology IV, (8 February 2005); doi: 10.1117/12.572086; https://doi.org/10.1117/12.572086
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

Color indexing with weak spatial constraints
Proceedings of SPIE (March 12 1996)
Fuzzy support vector machines based on linear clustering
Proceedings of SPIE (November 03 2005)
Auto music score recognizing system
Proceedings of SPIE (April 13 1993)

Back to Top