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

Fingerprint

Electric network analysis
Digital signal processing
Pattern recognition
Pixels

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition

Cite this

@article{a0dda540d5654d65a49f0681e349d803,
title = "Analyzing the distribution of a large-scale character pattern set using relative neighborhood graph",
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.",
author = "Masanori Goto and Ryosuke Ishida and Yaokai Feng and Seiichi Uchida",
year = "2013",
month = "12",
day = "11",
doi = "10.1109/ICDAR.2013.10",
language = "English",
pages = "3--7",
journal = "Proceedings of the International Conference on Document Analysis and Recognition, ICDAR",
issn = "1520-5363",

}

TY - JOUR

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

AU - Goto, Masanori

AU - Ishida, Ryosuke

AU - Feng, Yaokai

AU - Uchida, Seiichi

PY - 2013/12/11

Y1 - 2013/12/11

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/ICDAR.2013.10

DO - 10.1109/ICDAR.2013.10

M3 - Conference article

AN - SCOPUS:84889573926

SP - 3

EP - 7

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

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

SN - 1520-5363

M1 - 6628575

ER -