Analyzing the distribution of a large-scale character pattern set using relative neighborhood graph

Masanori Goto, Ryosuke Ishida, Yaokai Feng, Seiichi Uchida

Research output: Contribution to journalConference article

11 Citations (Scopus)

Abstract

The goal of this research is to understand the true distribution of character patterns. Advances in computer technology for mass storage and digital processing have paved way to process a massive dataset for various pattern recognition problems. If we can represent and analyze the distribution of a large-scale character pattern set directly and understand its relationships deeply, it should be helpful for improving character recognizer. For this purpose, we propose a network analysis method to represent the distribution of patterns using a relative neighborhood graph and its clustered version. In this paper, the properties and validity of the proposed method are confirmed on 410,564 machine-printed digit patterns and 622,660 handwritten digit patterns which were manually ground-truthed and resized to 16 times 16 pixels. Our network analysis method represents the distribution of the patterns without any assumption, approximation or loss.

Original languageEnglish
Article number6628575
Pages (from-to)3-7
Number of pages5
JournalProceedings of the International Conference on Document Analysis and Recognition, ICDAR
DOIs
Publication statusPublished - Dec 11 2013
Event12th International Conference on Document Analysis and Recognition, ICDAR 2013 - Washington, DC, United States
Duration: Aug 25 2013Aug 28 2013

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Analyzing the distribution of a large-scale character pattern set using relative neighborhood graph'. Together they form a unique fingerprint.

  • Cite this