Paper Titles
Fast Algorithms for Temporal Association Rules in a Large Database
p.287
Houses for an Information Society by Interpretation of Traditional Korean Houses
p.293
An Implication of System Thinking Paradigm in Current Science Education
p.299
Sketch Analysis-Based Engineering Solution for Online Story Authoring and Animation
p.305
Use of Region-Oriented Segmentation in Coin Recognition
p.312
Virtual Reality Interface Using PDA for Street View Color Design
p.318
A Protein Structure Retrieval System Using 3D Edge Histogram
p.324
A Study on the Knowledge Community for Creating and Sharing Implicit Knowledge
p.331
SRT Division Based on Redundant Signed Number
p.337

Use of Region-Oriented Segmentation in Coin Recognition

Article Preview

Abstract:

Region-oriented segmentation is a simple relatively robust method for coin recognition. In this paper we present the use of Region-oriented segmentation for Coin Recognition. We use an improved K-Means Clustering Algorithm, which has the advantage to speed up the automatic determining of the optimal number of classes, to group all the gray-levels into several clusters. With the help of this cluster algorithm a label image of original coin image is obtained. In turn, the features such as area, perimeter, compactness and polar distance are extracted from the label image. The coins presented in the image could be recognized by matching the classifiers stored in the database. Several common segmentation approaches are also presented here in comparing to the region-oriented segmentation.

You might also be interested in these eBooks
On the Convergence of Bio-, Information-, Enrivonmental-, Energy-, Space- and Nano-Technolgies View Preview

Info:

Periodical:

Key Engineering Materials (Volumes 277-279)

Pages:

312-317

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.277-279.312

Citation:

Cite this paper

Online since:

January 2005

Authors:

Ming Ma, Kulwinder Singh, Dong Won Park, Juno Chang

Keywords:

Coin Recognition, Edge-Oriented Segmentation, Image Segmentation, K-Means Clustering, Object Recognition, Region-Oriented Segmentation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2005 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

References

[1] Canny, J. F. IEEE Pattern Anal. Mach. Intell. 8, 679-698 (1986).

Google Scholar

[2] Rosenfeld, A. & Kak, A. C. Digital Image Processing (Academic, New York), 2nd Ed. (1982).

Google Scholar

[3] Haddon, J. F. & Boyce, J. F. IEEE Pattern Anal. Mach. Intell. 12, 929-948. (1990).

Google Scholar

[4] Ballard, D. H. & Brown, C. M. Computer Vision (Prentice-Hall, Englewood Cliffs, NJ) (1982).

Google Scholar

[5] Hurlbert, A. &Poggio, T. in Neural Information Processing Systems, ed. Touretzky, D. S. (Kaufman, San Mateo, CA) (1989), pp.297-303.

Google Scholar

[6] Zhu, S. C. Lee, T. S. Yuille, A. L. Harvard Robotics Lab TR 94-10 (Harvard Univ., Cambridge, MA) (1995).

Google Scholar

[7] Moller P, Hurlbert AC: Psychophysical evidence for fast region-based segmentation processes in motion and color. Proc Natl Acad Sci USA (1996), 93: 7421-7426.

DOI: 10.1073/pnas.93.14.7421

Google Scholar

[8] Wertheimer, M. Psych. Forsch. 4, 301-350 (1923).

Google Scholar

[9] M. Ma, K. Singh, D. -W. Park, Image Retrieval By Contents / Using Color & Edge, Proc. of. The 3rd International Workshop on Content-Based Multimedia Indexing September 22-24, (2003) IRISA, Rennes, France.

Google Scholar

[10] HARTIGAN, J. Clustering Algorithms,. John Wiley & Sons, New York, NY. (1975).

Google Scholar

[11] HARTIGAN, J. and WONG, M. Algorithm AS136: A k-means clustering algorithm. Applied Statistics, 28, 100-108 (1979).

DOI: 10.2307/2346830

Google Scholar

[12] E. Di Sciascio, A. Celentano, Similarity Evaluation in Image Retrieval Using the Hough Transform, Journal of Computing and Information Technology, 4, 3, 199-204, (1996).

Google Scholar

[13] K. Singh, M. Ma, D. -W. Park, A Content-Based Image Retrieval Using FFT & Cosine Similarity Coefficient, Proc. of. The 5th IASTED International Conference Signal and Image processing, (SIP 2003), Honolulu, Hawaii, U.S.A. (13-15 August, 2003).

Google Scholar

[14] K. Alsabti, S. Ranka, and V. Singh, An Efficient k-means Clustering Algorithm, Proc. First Workshop High Performance Data Mining, Mar. (1998).

Google Scholar