Finding Arbitrary Shaped Clusters for Character Recognition

Authors:
Noha A. Yousri;Mohamed. S. Kamel;Mohamed. A. Ismail
Affiliations:
PAMI lab, Electrical and Computer Engineering Dept, University of Waterloo, Canada and Computers and System Engineering Dept, University of Alexandria, Egypt;PAMI lab, Electrical and Computer Engineering Dept, University of Waterloo, Canada;Computers and System Engineering Dept, University of Alexandria, Egypt
Venue:
ICIAR '08 Proceedings of the 5th international conference on Image Analysis and Recognition
Year:
2008

Citing 11
Cited 0

CURE: an efficient clustering algorithm for large databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Clustering Algorithms

Clustering Algorithms
Cluster validity methods: part I

ACM SIGMOD Record
BIRCH: A New Data Clustering Algorithm and Its Applications

Data Mining and Knowledge Discovery
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
Efficient and Effective Clustering Methods for Spatial Data Mining

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Comparison of Techniques for Automatic Clustering of Handwritten Characters

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 3 - Volume 3
Kernel k-means: spectral clustering and normalized cuts

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Phrase-Based Document Indexing for Web Document Clustering

IEEE Transactions on Knowledge and Data Engineering
An improved handwritten Chinese character recognition system using support vector machine

Pattern Recognition Letters - Special issue: Artificial neural networks in pattern recognition
Locally Scaled Density Based Clustering

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several supervised and unsupervised methods have been applied to the field of character recognition. In this research we focus on the unsupervised methods used to group similar characters together. Instead of using the traditional clustering algorithms, which are mainly restricted to globular-shaped clusters, we use an efficient distance based clustering that identifies the natural shapes of clusters according to their densities. Thus, in the case of character recognition, where it is natural to have different writing styles for the same character, the algorithm can be used to discover the continuity between character feature vectors, which cannot be discovered by traditional algorithms. This paper |introduces the use of an algorithm that efficiently finds arbitrary-shaped clusters of characters, and compares it to related algorithms. Two character recognition data sets are used to illustrate the efficiency of the suggested algorithm.