Kernel principal component analysis for multimedia retrieval
Main Article Content
Abstract
Principal component analysis (PCA) is an important tool in many areas including data reduction and interpretation, information retrieval, image processing, and so on. Kernel PCA has recently been proposed as a nonlinear extension of the popular PCA. The basic idea is to first map the input space into a feature space via a nonlinear map and then compute the principal components in that feature space. This paper illustrates the potential of kernel PCA for dimensionality reduction and feature extraction in multimedia retrieval. By the use of Gaussian kernels, the principal components were computed in the feature space of an image data set and they are used as new dimensions to approximate image features. Extensive experimental results show that kernel PCA performs better than linear PCA with respect to the retrieval quality as well as the retrieval precision in content-based image retrievals.
Keywords: Principal component analysis, kernel principal component analysis, multimedia retrieval, dimensionality reduction, image retrieval
Downloads
Article Details
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
References
[2] Cha, G.-H., & Chung, C.-W. Chung (1998). A New Indexing Scheme for Content-Based Image Retrieval, Multimedia Tools and Applications, 6, 263-288.
[3] Cha, G.-H., Zhu, X., Petkovic, D., &Chung, C.-W. (2002). An Efficient Indexing Method for Nearest Neighbor Searches in High-Dimensional Image Databases. IEEE Transactions on Multimedia. 4, 76-87.
[4] Chakrabarti, K., & Mehrotra, S. (2000). Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces, Proc. of the Int’l Conf. on VLDB., 89-100.
[5] Diamantaras, K.I., & Kung, S.Y. (1996). Principal Component Neural Networks, Wiley, New York.
[6] Faloutsos, C. et al. (1994). Efficient and Effective Querying by Image Content. Journal of Intelligent Information Systems, 3, 231-262.
[7] Kanth, K.V.R., Agrawal, D., & Singh, A. (1998). Dimensionality Reduction for Similarity Searching in Dynamic Databases, Proc. of the ACM SIGMOD Conf., 166-176. 8.
[8] Payne, J., Hepplewhite, L., & Stonham, T. J. (2000). Texture, Human Perception and Information Retrieval Measures, Proc. of ACM SIGIR 2000 Workshop.
[9] Peng, J., & Heisterkamp, D. R. (2003). Kernel indexing for Relevance Feedback Image Retrieval, Proc. of IEEE Int’l Conf. on Image Processing, 733-736. 10.
[10] Rijsbergen, C.J.V. (1979). Information Retrieval. Butterworths, London.
[11] Saitoh, S. (1988), Theory of Reproducing Kernels and its Applications. Longman Scientific & Technical, Harlow, England.
[12] Salton, G., & McGill, M. J. (1983). Introduction to Modern Information Retrieval, McGraw-Hill, New York.
[13] Schölkopf, B., Smola, A., & Müller, K. (1998). Nonlinear Component Analysis as a Kernel Eigenvalue Problem, Neural Computation, 10, 1299-1319.
[14] Schölkopf, B. et al. (1997). Comparing Support Vector Machines with Gaussian Kernels to Radial Basis Function Classifiers, IEEE Transactions on Signal Processing, 45, 2758-2765.