Journal of Digital Contents Society (디지털콘텐츠학회 논문지)

Digital Contents Society (한국디지털콘텐츠학회)
권호 표지
DOI QR코드

DOI QR Code

An Improved RSR Method to Obtain the Sparse Projection Matrix

희소 투영행렬 획득을 위한 RSR 개선 방법론

  • Ahn, Jung-Ho (Division of Computer Media Information Engineering, Kangnam University)
  • Received : 2015.06.22
  • Accepted : 2015.08.31
  • Published : 2015.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper addresses the problem to make sparse the projection matrix in pattern recognition method. Recently, the size of computer program is often restricted in embedded systems. It is very often that developed programs include some constant data. For example, many pattern recognition programs use the projection matrix for dimension reduction. To improve the recognition performance, very high dimensional feature vectors are often extracted. In this case, the projection matrix can be very big. Recently, RSR(roated sparse regression) method[1] was proposed. This method has been proved one of the best algorithm that obtains the sparse matrix. We propose three methods to improve the RSR; outlier removal, sampling and elastic net RSR(E-RSR) in which the penalty term in RSR optimization function is replaced by that of the elastic net regression. The experimental results show that the proposed methods are very effective and improve the sparsity rate dramatically without sacrificing the recognition rate compared to the original RSR method.

본 논문은 패턴인식에서 자주 사용되는 투영행렬을 희소화하는 문제를 다룬다. 최근 임베디드 시스템이 널리 사용됨에 따라 탑재되는 프로그램의 용량이 제한받는 경우가 빈번히 발생한다. 개발된 프로그램은 상수 데이터를 포함하는 경우가 많다. 예를 들어, 얼굴인식과 같은 패턴인식 프로그램의 경우 고차원 벡터를 저차원 벡터로 차원을 축소하는 투영행렬을 사용하는 경우가 많다. 인식성능 향상을 위해 영상으로부터 매우 높은 차원의 고차원 특징벡터를 추출하는 경우 투영행렬의 사이즈는 매우 크다. 최근 라소 회귀분석 방법을 이용한 RSR(rotated sparse regression) 방법론[1]이 제안되었다. 이 방법론은 여러 실험을 통해 희소행렬을 구하는 가장 우수한 알고리즘 중 하나로 평가받고 있다. 우리는 본 논문에서 RSR을 개선할 수 있는 세 가지 방법론을 제안한다. 즉, 학습데이터에서 이상치를 제거하여 일반화 성능을 높이는 방법, 학습데이터를 랜덤 샘플링하여 희소율을 높이는 방법, RSR의 목적함수에 엘라스틱 넷 회귀분석의 패널티 항을 사용한 E-RSR(elastic net-RSR) 방법을 제안한다. 우리는 실험을 통해 제안한 방법론이 인식률을 희생하지 않으며 희소율을 크게 증가시킴으로써 기존 RSR 방법론을 개선할 수 있음을 보였다.

Keywords

References

  1. D. Chen, X. Cao, F. Wen, and J. Sun, "Blessing of Dimensionality: High-dimensional Feature and Its Efficient Compression for Face Verification", Proc. CVPR, pp.3025-3032, June. 2013.
  2. D. Chen, X. Cao, L. Wang, F. Wen, and J. Sun, "Bayesian Face Revisited: A Joint Formulation," Proc. ECCV, pp.566-579, 2012.
  3. S. Han and J.-H. Ahn, "An Improved Joint Bayesian Method using Mirror Image's Features", Journal of Digital Contents Society, in press, 2015.
  4. Y. Sun, D. Liang, X. Wang and X. Tang, "DeepID3: Face Recognition with Very Deep Neural Networks", arXiv:1502.00873v1, 2015.
  5. B. Scholkopf, A. Smola, and K.-R. Muller, "Nonlinear Component Analysis as Kernel Eigenvalue Problem ", Neural Computation, Vol.10, No.5, pp. 1299-1319, 1998. https://doi.org/10.1162/089976698300017467
  6. S. Mika, G. Ratsch, J. Weston, B. Scholkopf, and K.- R. Muller, "Fisher Discriminant Analysis with Kernels", Proceedings of the IEEE Signal Processing Society Workshop, pp. 41-48, 1999.
  7. G. E. Hinton and R. R. Salakhutdinov, "Reducing the Dimensionality of Data with Neural Network", Science, Vol. 313, pp. 504-507, 2006. https://doi.org/10.1126/science.1127647
  8. C. M. Bishop, Pattern Recognition and Machine Learning, 1st ed., Springer, 2006.
  9. J. Bi, K. Bennett, M. Embrechts, C. Breneman, and M. Song, "Dimensionality Reduction via Sparse Support Vector Machine", Journal of Machine Learning Research, Vol.3, pp. 1229-1243, 2003.
  10. J. Friedman, T. Hastie and R. Tibshirani, "Regularization Paths for Generalized Linear Model via Coordinate Descent", Journal of Statiscal Software, Vol.33, No.1, pp.1-22, 2010.
  11. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust Face Recognition via Sparse Representation", IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 31, No. 2, pp. 210-227, 2009. https://doi.org/10.1109/TPAMI.2008.79
  12. T. Hastie, R. Tibshirani, and J. Friedman, "The Elements of Statistical Learning: Prediction, Inference and Data Mining", 2nd Edition, Springer-Verlag, New York, 2009.
  13. T. Zhang, "Adaptive forward-backward greedy algorithm for learning space representations", Information Theory. Vol. 57, No.7, pp. 4689-4708, 2011. https://doi.org/10.1109/TIT.2011.2146690
  14. J. Liu, S. Ji, and J. Ye, "Multi-task feature learning via efficient L2, 1-norm minimization", In Conference on Uncertainty in Artificial Intelligence, pp. 339-34 8, 2009.
  15. R. Mason, R. Gunst, and J. Hess, "Statistical design and analysis of experiments: with applications to engineering and science", 1st Edition, Wiley, 1989.
  16. G. Huang, M. Ramesh, T. Berg, and E. Learned-Miller, "Labeled Faces in the Wild: A Database for Studying Face Recognition in Unconstrained Environments", University of Massachusetts, Amherst, Technical Report 07-49, Oct. 2007.
  17. L. Wolf, T. Hassner, and Y. Taigman, "Effective Face Recognition by Combining Multiple Descriptors and Learned Background Statistics", IEEE T. PAMI, Vol.33, No.10, 2011.
  18. Y. Saad, "Iterative Methods for Sparse Linear Systems", 2nd Edition, SIAM, 2003.

Cited by

  1. An Improved Joint Bayesian Method using Mirror Image's Features vol.16, pp.5, 2015, https://doi.org/10.9728/dcs.2015.16.5.671