DocumentCode
398354
Title
Training sequence size in clustering algorithms and averaging single-particle images
Author
Kim, Dong Sik ; Lee, Kiryung
Author_Institution
Sch. of Electron. & Inf. Eng., Hankuk Univ. of Foreign Studies, Kyonggi-do, South Korea
Volume
2
fYear
2003
fDate
14-17 Sept. 2003
Abstract
In clustering the training vectors, we may consider an algorithm, which tries to find empirically optimal representative vectors that achieve the empirical minimum to inductively design optimal representative vectors yielding the true optimum. In order to evaluate the performance of the representative vectors, we may observe the empirical minimum with respect to the training ratio, the ratio of the training sequence size to the number of representative vectors. In this paper, the convergence rates of the expectations of the empirical minimum and the validating errors are observed with respect to the training ratio. When enhancing the noisy particle images, which are obtained from the transmission electron microscopy, the theoretical analysis is employed to discuss the performance in conjunction with the overfitting property.
Keywords
image classification; learning (artificial intelligence); pattern clustering; quantisation (signal); self-organising feature maps; transmission electron microscopy; averaging single-particle images clustering; clustering algorithms; convergence rates; noisy particle image; self-organising maps; training sequence size; training vectors; transmission electron microscopy; Algorithm design and analysis; Clustering algorithms; Convergence; Cost function; Design engineering; Image analysis; Performance analysis; Quantization; Spectral analysis; Transmission electron microscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on
ISSN
1522-4880
Print_ISBN
0-7803-7750-8
Type
conf
DOI
10.1109/ICIP.2003.1246710
Filename
1246710
Link To Document