Name
Abstract | ||
|---|---|---|
Signature verification systems suffer from imbalanced learning, which imposes strict requirements on classifiers. The standard classification approaches, such as SVM, often degrade the performance for imbalanced data or require additional parameters for data balancing. In this study, as a new approach for signature verification, we use RankSVM as the writer-dependent classifiers, which theoretically guarantees the generalization performance for imbalanced data. To investigate the ability of RankSVM for solving imbalanced learning problems in signature verification tasks, the extensive experiments are conducted on bitmaps of GPDS-150, GPDS-300, GPDS-600, and GPDS-1000 datasets and deep features of GPDS-960 dataset. The experimental results demonstrate that the RankSVM-based approach obtains a nearly equivalent performance with the state-of-the-art method on deep features of the GPDS-960 dataset, and achieves significantly better performance than standard-SVM-based approach on bitmaps of GPDS-150, GPDS-300, GPDS-600, and GPDS-1000 datasets. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ICDAR.2019.00153 | ICDAR |
Field | DocType | Citations |
Data balancing,Pattern recognition,Computer science,Support vector machine,Artificial intelligence,Bitmap | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan Zheng | 1 | 0 | 1.01 |
| Yuchen Zheng | 2 | 0 | 0.68 |
| Wataru Ohyama | 3 | 0 | 0.68 |
| Daiki Suehiro | 4 | 18 | 4.72 |
| Seiichi Uchida | 5 | 790 | 105.59 |