Paper
1 April 1998 Pattern recognition with fast feature extraction
Mykola G. Nakhodkin, Yurij S. Musatenko, Vitalij N. Kurashov
Author Affiliations +
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.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mykola G. Nakhodkin, Yurij S. Musatenko, and Vitalij N. Kurashov "Pattern recognition with fast feature extraction", Proc. SPIE 3402, Optical Information Science and Technology (OIST97): Optical Memory and Neural Networks, (1 April 1998); https://doi.org/10.1117/12.304963
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Wavelets

Pattern recognition

Feature extraction

Chemical elements

Signal to noise ratio

Signal processing

Back to Top