Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition

Masanori Goto, Ryosuke Ishida, Seiichi Uchida

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We propose a pre-selection method for training support vector machines (SVM) with a large-scale dataset. Specifically, the proposed method selects patterns around the class boundary and the selected data is fed to train an SVM. For the selection, that is, searching for boundary patterns, we utilize a relative neighborhood graph (RNG). An RNG has an edge for each pair of neighboring patterns and thus, we can find boundary patterns by looking for edges connecting patterns from different classes. Through large-scale handwritten digit pattern recognition experiments, we show that the proposed pre-selection method accelerates SVM training process 5-15 times faster without degrading recognition accuracy.

Original languageEnglish
Title of host publication13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings
PublisherIEEE Computer Society
Pages306-310
Number of pages5
ISBN (Electronic)9781479918058
DOIs
Publication statusPublished - Nov 20 2015
Event13th International Conference on Document Analysis and Recognition, ICDAR 2015 - Nancy, France
Duration: Aug 23 2015Aug 26 2015

Publication series

NameProceedings of the International Conference on Document Analysis and Recognition, ICDAR
Volume2015-November
ISSN (Print)1520-5363

Other

Other13th International Conference on Document Analysis and Recognition, ICDAR 2015
CountryFrance
CityNancy
Period8/23/158/26/15

Fingerprint

Character recognition
Support vector machines
Pattern recognition
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this

Goto, M., Ishida, R., & Uchida, S. (2015). Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition. In 13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings (pp. 306-310). [7333773] (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR; Vol. 2015-November). IEEE Computer Society. https://doi.org/10.1109/ICDAR.2015.7333773

Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition. / Goto, Masanori; Ishida, Ryosuke; Uchida, Seiichi.

13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings. IEEE Computer Society, 2015. p. 306-310 7333773 (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR; Vol. 2015-November).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Goto, M, Ishida, R & Uchida, S 2015, Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition. in 13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings., 7333773, Proceedings of the International Conference on Document Analysis and Recognition, ICDAR, vol. 2015-November, IEEE Computer Society, pp. 306-310, 13th International Conference on Document Analysis and Recognition, ICDAR 2015, Nancy, France, 8/23/15. https://doi.org/10.1109/ICDAR.2015.7333773
Goto M, Ishida R, Uchida S. Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition. In 13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings. IEEE Computer Society. 2015. p. 306-310. 7333773. (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR). https://doi.org/10.1109/ICDAR.2015.7333773
Goto, Masanori ; Ishida, Ryosuke ; Uchida, Seiichi. / Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition. 13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings. IEEE Computer Society, 2015. pp. 306-310 (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR).
@inproceedings{5cbb26b124da484bb3fdbd55ece3522e,
title = "Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition",
abstract = "We propose a pre-selection method for training support vector machines (SVM) with a large-scale dataset. Specifically, the proposed method selects patterns around the class boundary and the selected data is fed to train an SVM. For the selection, that is, searching for boundary patterns, we utilize a relative neighborhood graph (RNG). An RNG has an edge for each pair of neighboring patterns and thus, we can find boundary patterns by looking for edges connecting patterns from different classes. Through large-scale handwritten digit pattern recognition experiments, we show that the proposed pre-selection method accelerates SVM training process 5-15 times faster without degrading recognition accuracy.",
author = "Masanori Goto and Ryosuke Ishida and Seiichi Uchida",
year = "2015",
month = "11",
day = "20",
doi = "10.1109/ICDAR.2015.7333773",
language = "English",
series = "Proceedings of the International Conference on Document Analysis and Recognition, ICDAR",
publisher = "IEEE Computer Society",
pages = "306--310",
booktitle = "13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings",
address = "United States",

}

TY - GEN

T1 - Preselection of support vector candidates by relative neighborhood graph for large-scale character recognition

AU - Goto, Masanori

AU - Ishida, Ryosuke

AU - Uchida, Seiichi

PY - 2015/11/20

Y1 - 2015/11/20

N2 - We propose a pre-selection method for training support vector machines (SVM) with a large-scale dataset. Specifically, the proposed method selects patterns around the class boundary and the selected data is fed to train an SVM. For the selection, that is, searching for boundary patterns, we utilize a relative neighborhood graph (RNG). An RNG has an edge for each pair of neighboring patterns and thus, we can find boundary patterns by looking for edges connecting patterns from different classes. Through large-scale handwritten digit pattern recognition experiments, we show that the proposed pre-selection method accelerates SVM training process 5-15 times faster without degrading recognition accuracy.

AB - We propose a pre-selection method for training support vector machines (SVM) with a large-scale dataset. Specifically, the proposed method selects patterns around the class boundary and the selected data is fed to train an SVM. For the selection, that is, searching for boundary patterns, we utilize a relative neighborhood graph (RNG). An RNG has an edge for each pair of neighboring patterns and thus, we can find boundary patterns by looking for edges connecting patterns from different classes. Through large-scale handwritten digit pattern recognition experiments, we show that the proposed pre-selection method accelerates SVM training process 5-15 times faster without degrading recognition accuracy.

UR - http://www.scopus.com/inward/record.url?scp=84962589854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962589854&partnerID=8YFLogxK

U2 - 10.1109/ICDAR.2015.7333773

DO - 10.1109/ICDAR.2015.7333773

M3 - Conference contribution

AN - SCOPUS:84962589854

T3 - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

SP - 306

EP - 310

BT - 13th IAPR International Conference on Document Analysis and Recognition, ICDAR 2015 - Conference Proceedings

PB - IEEE Computer Society

ER -