Probabilistic Tangent Subspace: A unified view

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 528-535

  Lee, Jianguo ^a   Wang, Jingdong ^a   Zhang, Changshui ^a   Bian, Zhaoqi ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SOFTWARE PROTOTYPING; VECTORS;

INHERENT VARIABILITY; INVARIANT ALGORITHMS; PROBABILISTIC TANGENT SUBSPACE (PTS); TANGENT DISTANCE (TD);

PATTERN RECOGNITION;

EID: 14344265533     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Burges, C. (1999). Geometry and invariance in kernel based methods. Advances in kernel methods - support vector learning. Cambridge, MA: MIT Press.
2. Chapelle, O., & Schölkopf, B. (2002). Incorporating invariances in nonlinear svms. Advances in Neural Information Processing Systems 14 (pp. 609-616).
3. DeCoste, D., & Schölkopf, B. (2002). Training invariant support vector machines. Machine Learning, 46, 161-190.
4. Haasdonk, B., & Keysers, D. (2002). Tangent distance kernels for support vector machines. Proc. of the 16th International Conference on Pattern Recognition (pp. 864-868).
5. Hastie, T., Simard, P., & Saeckinger, E. (1995). Learning prototype models for tangent distance. Advances in Neural Information Processing Systems 7.
6. Kambhatla, N., & Leen, T. (1997). Dimension reduction by local principal component analysis. Neural Computation, 1493-1516.
7. Keysers, D., Macherey, W., Dahmen, J., & Ney, H. (2001). Learning of variability for invariant statisti cal pattern recognition. Proc. of the 12th European Conference on Machine Learning (pp. 263-275).
8. Kurgan, L., & Cios, K. (2002). Ensemble of classifiers to improve accuracy of the CLIP4 machine learning algorithm. Proc. of the SPIE International Conference on Sensor Fusion: Architectures, Algorithms, and Applications VI (pp. 22-31).
9. Kurgan, L., Cios, K., Tadeusiewicz, R., Ogiela, M., & Goodenday, L. (2001). Knowledge discovery approach to automated cardiac SPECT diagnosis. Artificial Intelligence in Medicine, 23, 149-169.
10. Moghaddam, B. (2002). Principal manifolds and probabilistic subspace for visual recognition. IEEE Trans. PAMI, 24, 780-788.
11. Moghaddam, B., & Pentland, A. (1997). Probabilistic visual learning for object representation. IEEE Trans. PAMI, 19, 696-710.
12. Phillips, P., Moon, H., & et al. (2000). The FERET evaluation methodology for face recognition algorithms. IEEE Trans. PAMI, 22, 1090-1104.
13. Schölkopf, B., Burges, C., & Vapnik, V. (1996). Incorporating invariances in support vector learning machines. ICANN96 (LNCS, Vol. 1112). Springer.
14. Schölkopf, B., Simard, P., Smola, A. J., & Vapnik, V. (1998a). Prior knowledge in support vector kernels. Advances in Neural Information Processing Systems 10 (pp. 640-646).
15. Schölkopf, B., Smola, A., & Müller, K. R. (1998b). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10, 1299-1319.
16. Schölkopf, B., & Smola, A. J. (2002). Learning with kernels. Cambridge, MA: MIT Press.
17. Simard, P., LeCun, Y., & Denker, J. (1993). Efficient pattern recognition using a new transformation distance. Advances in Neural Information Processing Systems 5 (pp. 50-58).
18. Simard, P., LeCun, Y., Denker, J., & Victorri, B. (2001). Transformation invariance in pattern recognition - tangent distance and tangent propagation. International Journal of Imaging System and Technology, 11, 181-194.
19. Wang, X., & Tang, X. (2003). Unified subspace analysis for face recognition. Proc. of IEEE International Conference on Computer Vision.