Abstract
In this paper we propose a novel parameterless approach for discriminative analysis. By following the large margin concept, the graph Laplacian is split in two components: within-class graph and between-class graph to better characterize the discriminant property of the data. Our approach has two important characteristics: (i) while all spectral-graph based manifold learning techniques (supervised and unsupervised) are depending on several parameters that require manual tuning, ours is parameter-free, and (ii) it adaptively estimates the local neighborhood surrounding each sample based on the data similarity. Our approach has been applied to the problem of modeless coarse 3D head pose estimation. It was tested on two databases FacePix and Pointing’04. It was conveniently compared with other linear techniques. The experimental results confirm that our method outperforms, in general, the existing ones. Although we have concentrated in this paper on coarse 3D head pose problem, the proposed approach could also be applied to other classification tasks for objects characterized by large variance in their appearance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Turk, M., Pentland, A.: Eigenfaces for recognition. Journal of Cognitive Neuroscience 33(1), 71–86 (1991)
Borg, I., Groenen, P.: Modern Multidimensional Scaling: theory and applications. Springer, Heidelberg (2005)
Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, London (1990)
Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)
Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, 1373–1396 (2003)
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)
Saul, L.K., Roweis, S.T., Singer, Y.: Think globally, fit locally: Unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research 4, 119–155 (2003)
Yan, S., Xu, D., Zhang, B., Zhang, H., Yang, Q., Lin, S.: Graph embedding and extension: a general framework for dimensionality reduction. IEEE Trans. on Pattern Analysis and Machine Intelligence 29, 40–51 (2007)
Yan, S., Xu, D., Zhang, B., Zhang, H.J.: Graph embedding: A general framework for dimensionality reduction. In: Int. Conference on Computer Vision and Pattern Recognition (2005)
Wang, F., Wang, X., Zhang, D., Zhang, C., Li, T.: Marginface: A novel face recognition method by average neighborhood margin maximization. Pattern Recognition 42, 2863–2875 (2009)
Alipanahi, B., Biggs, M., Ghodsi, A.: Distance metric learning vs. Fisher discriminant analysis. In: AAAI Conference on Artificial Intelligence (2008)
Cai, D., He, X., Zhou, K., Han, J., Bao, H.: Locality sensitive discriminant analysis. In: International Joint Conference on Artificial Intelligence (2007)
Dornaika, F., Ahlberg, J.: Face and facial feature tracking using deformable models. International Journal of Image and Graphics 4, 499–532 (2004)
Dornaika, F., Davoine, F.: On appearance based face and facial action tracking. IEEE Transactions on Circuits and Systems for Video Technology 16, 1107–1124 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bosaghzadeh, A., Dornaika, F. (2011). A Parameter-Free Locality Sensitive Discriminant Analysis and Its Application to Coarse 3D Head Pose Estimation. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2011. Lecture Notes in Computer Science, vol 6939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24031-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-24031-7_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24030-0
Online ISBN: 978-3-642-24031-7
eBook Packages: Computer ScienceComputer Science (R0)