Abstract
In this paper, we experimentally evaluate the validity of dimension-reduction methods for the computation of the similarity in pattern recognition. Image pattern recognition uses pattern recognition techniques for the classification of image data. For the numerical achievement of image pattern recognition techniques, images are sampled using an array of pixels. This sampling procedure derives vectors in a higher-dimensional metric space from image patterns. For the accurate achievement of pattern recognition techniques, the dimension reduction of data vectors is an essential methodology, since the time and space complexities of data processing depend on the dimension of data. However, dimension reduction causes information loss of geometrical and topological features of image patterns. The desired dimension-reduction method selects an appropriate low-dimensional subspace that preserves the information used for classification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Xu, Y., Zhang, D., Yang, J., Yang, J.Y.: An approach for directly extracting features from matrix data and its application in face recognition. Neurocomputing 71, 1857–1865 (2008)
Su, T.H., Zhang, T.W., Guan, D.J., Huang, H.J.: Off-line recognition of realistic chinese handwriting using segmentation-free strategy. Pattern Recognition 42, 167–182 (2009)
Leonardis, A., Bischof, H., Maver, J.: Multiple eigenspaces. Pattern Recognition 35, 2613–2627 (2002)
Park, C.H., Park, H.: Fingerprint classification using fast Fourier transform and nonlinear discriminant analysis. Pattern Recognition 38, 495–503 (2005)
Park, H., Park, K.: Iris recognition based on score level fusion by using SVM. Pattern Recognition Letters 28, 2019–2028 (2007)
Borgwardt, K.M.: Graph Kernels. PhD thesis, Ludwig-Maximilians-Universität München (2007), http://edoc.ub.uni-muenchen.de/7169/1/Borgwardt_KarstenMichael.pdf
Gärtnera, T., Le, Q.V., Smola, A.J.: A short tour of kernel methods for graphs. Technical report (2006), http://cs.stanford.edu/~quocle/srl-book.pdf
Xu, Y., Zhong, A., Yang, J., Zhang, D.: LPP solution schemes for use with face recognition. Pattern Recognition 43, 4165–4176 (2010)
Iijima, T.: Theory of pattern recognition. Electronics and Communications in Japan, 123–134 (1963)
Murase, H., Nayar, S.K.: Illumination planning for object recognition using parametric eigenspace. IEEE Trans. Pattern Analysis and Machine Intelligence 16, 1219–1227 (1994)
Maeda, K.: From the subspace methods to the mutual subspace method. In: Cipolla, R., Battiato, S., Farinella, G.M. (eds.) Computer Vision. SCI, vol. 285, pp. 135–156. Springer, Heidelberg (2010)
Fukui, K., Yamaguchi, O.: Face recognition using multi-viewpoint patterns for robot vision. Robotics Research 15, 192–201 (2005)
Yang, J., Zhang, D., Frangi, A., Yang, J.Y.: Two-dimensional PCA: a new approach to appearance-based face representation and recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 26, 131–137 (2004)
Benito, M., Peña, D.: A fast approach for dimensionality reduction with image data. Pattern Recognition 38, 2400–2408 (2005)
Otsu, N.: Mathematical Studies on Feature Extraction in Pattern Recognition. PhD thesis, Electrotechnical Laboratory (1981)
Shen, L., Bai, L.: Mutual boost learning for selecting gabor features for face recognition. Pattern Recognition Letters 27, 1758–1767 (2006)
Burt, P.J., Andelson, E.H.: The Laplacian pyramid as a compact image code. IEEE Trans. Communications 31, 532–540 (1983)
Vempala, S.S.: The Random Projection Method. DIMACS, 65 (2004)
Johnson, W., Lindenstrauss, J.: Extensions of Lipschitz maps into a Hilbert space. Contemporary Mathematics 26, 189–206 (1984)
Sakai, T., Imiya, A.: Practical algorithms of spectral clustering: Toward large-scale vision-based motion analysis. In: Wang, L., Zhao, G., Cheng, L., Pietikäinen, M. (eds.) Machine Learning for Vision-Based Motion Analysis, pp. 3–26. Springer (2011)
Björck, A., Golub, G.H.: Numerical methods for computing angles between linear subspaces. Mathematics of Computation 27, 579–594 (1975)
Georghiades, A., Belhumeur, P., Kriegman, D.: From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Analysis and Machine Intelligence 23, 643–660 (2001)
Leibe, B., Schiele, B.: Analyzing appearance and contour based methods for object categorization. Proc. of Computer Vison and Pattern Recognition 2, 409–415 (2003)
LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. of the IEEE 86, 2278–2324 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itoh, H., Sakai, T., Kawamoto, K., Imiya, A. (2013). Dimension Reduction Methods for Image Pattern Recognition. In: Hancock, E., Pelillo, M. (eds) Similarity-Based Pattern Recognition. SIMBAD 2013. Lecture Notes in Computer Science, vol 7953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39140-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-39140-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39139-2
Online ISBN: 978-3-642-39140-8
eBook Packages: Computer ScienceComputer Science (R0)