Share Email Print

Proceedings Paper

Pattern recognition with fast feature extraction
Author(s): Mykola G. Nakhodkin; Yurij S. Musatenko; Vitalij N. Kurashov
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The comparison of recently suggested algorithms of fast approximate Karhunen-Loeve (KL) transform when applied to pattern recognition problem is presented. It is known that adequate signs selection is still the problem. In the paper we consider several algorithms that can perform fast and qualitative signs selection. Among them are wavelet based algorithm of approximate KL transform, 2D algorithm of KL transform, algorithm with projection into proper orthogonalized basis, and real time algorithm of KL transform. To compare quality of the algorithms they are applied to human faces recognition problem. The efficiency of the all abovementioned algorithms is demonstrated.

Paper Details

Date Published: 1 April 1998
PDF: 11 pages
Proc. SPIE 3402, Optical Information Science and Technology (OIST97): Optical Memory and Neural Networks, (1 April 1998); doi: 10.1117/12.304963
Show Author Affiliations
Mykola G. Nakhodkin, Kiev Univ. (Ukraine)
Yurij S. Musatenko, Kiev Univ. (Ukraine)
Vitalij N. Kurashov, Kiev Univ. (Ukraine)

Published in SPIE Proceedings Vol. 3402:
Optical Information Science and Technology (OIST97): Optical Memory and Neural Networks
Andrei L. Mikaelian, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?