Paper
30 October 2009 A kernel density estimation based Bayesian classifier for celestial spectrum recognition
Jin-fu Yang, Ming-ai Li, Naigong Yu
Author Affiliations +
Proceedings Volume 7496, MIPPR 2009: Pattern Recognition and Computer Vision; 749611 (2009) https://doi.org/10.1117/12.833958
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
Celestial spectrum recognition is an indispensable part of any workable automated data processing system of celestial objects. Many methods have been proposed for spectra recognition, in which most of them concerned about feature extraction. In this paper, we present a Bayesian classifier based on Kernel Density Estimation (KDE) which is composed of the following two steps: In the first step, linear Principle Component Analysis (PCA) is used to extract features to decrease computational complexity and make the distribution of spectral data more compact and useful for classification. In the second step, namely classification step, KDE and Expectation Maximum (EM) algorithm are used to estimate class conditional density and the bandwidth of kernel function respectively. The experimental results show that the proposed method can achieve satisfactory performance over the real observational data of Sloan Digital Sky Survey (SDSS).
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jin-fu Yang, Ming-ai Li, and Naigong Yu "A kernel density estimation based Bayesian classifier for celestial spectrum recognition", Proc. SPIE 7496, MIPPR 2009: Pattern Recognition and Computer Vision, 749611 (30 October 2009); https://doi.org/10.1117/12.833958
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Expectation maximization algorithms

Principal component analysis

Feature extraction

Statistical analysis

Pattern recognition

Databases

Detection and tracking algorithms

Back to Top