期刊文献+

基于WM-CoSaMP重构算法的压缩感知在步态识别中的应用研究 被引量:1

Compressed sensing for gait recognition with WM-CoSaMP
下载PDF
导出
摘要 针对步态识别中步态特征提取高维处理的复杂性,在研究压缩感知理论的基础上,提出将压缩感知理论应用于步态识别中的步态特征提取方面。在充分利用步态图像稀疏性的前提下,利用观测矩阵对步态图像进行投影观测,得到的观测值作为步态特征用于步态识别中,实现了特征提取的降维处理,大大降低了计算的复杂性。在步态图像的重构方面,在压缩采样匹配追踪(CoSaMP)的基础上,提出了基于小波树模型的压缩采样匹配(wavelet model-CoSaMP,WM-CoSaMP)的重构算法,进一步提高了重构精度。通过对比实验,验证了WM-CoSaMP重构算法的优越性,以及压缩感知在步态特征提取方面的优越性。 There are some problems in the gait recognition, especially for the complexity of the high dimension features. Based on the study of compressed sensing theory, this paper proposed that compressed sensing was used as a new paradigm for gait feature extraction. While the gait image had sparse representation in some orthonormal basis, projections of the images, which were taken as the gait features could be gotten by the projection matrix. In the reconstruction of the gait image, this pa- per proposed that the WM-CoSaMP based on the wavelet tree model could be used as the recovery algorithm, which could fur- ther improve the precision of the reconstruction. Experiments show that the WM-CoSaMP outperforms the OMP and the Co- SaMP. And other experiments demonstrate that the application of compressed sensing in the gait feature extraction performs better than the PCA and MPCA.
出处 《计算机应用研究》 CSCD 北大核心 2015年第1期291-294,共4页 Application Research of Computers
基金 北京市自然科学基金重点项目(KZ201410011014) 北京市学科建设资助项目(PXM2012_014213_0000_74) 北京市教委科技面上资助项目(Km201110011006)
关键词 步态识别 特征提取 压缩感知 投影观测 重构 基于小波树模型的压缩采样匹配(WM—CoSaMP) gait recognition feature extraction compressed sensing projection reconstruction WM-CoSaMP
  • 相关文献

参考文献18

  • 1NIYOGI S A, ADELSON E H. Analyzing and recognizing walking figures in XYT[ C]//Proc of IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 1994:21-23.
  • 2MURASE H, SAKAI R. Moving object recognition in eigenspace rep- resentation: gait analysis and lip reading [ J]. Pattern Recognition Letters, 1996,17 ( 2 ) : 155-162.
  • 3POLANA R, NELSON R. Detecting activities [ C ]//Proc of Interna- tional Conference of Computer Vision and Pattern Recognition. 1993.
  • 4AGARWAL M, JAIN N, KUMAR M, et al. Face recognition using eigen faces and artificial neural network[ J ]. International Journal of Computer Theory and Engineering,2010,2(4) :624-629.
  • 5LI Yi-bo, YANG Qin. Gait extraction and recognition based on lower leg and ankle [ C ]//Proc of International Conference on Intelligent Computation Technology and Automation. [ S. 1. ] :IEEE Press,2010: 379- 382.
  • 6CANDIES E. Compressive sampling [ C ]//Proc of International Con- gress of Mathematicians. 2006 : 1433-1452.
  • 7DONOHO D L, TSAIC Y. Extensions of compressed sensing [ J ]. Signal Processing,2006,86 (3) :533- 548.
  • 8BARANIUK R. Compressive sensing[ J]. IEEE Signal Processing Magazine,2007,24(4) :118-121.
  • 9BARANIUK R, DAVENPORT M, DDVORE R, et al. A simple proof of the restricted isometry property for random matrices[ J]. Con- structive Approximation,2008,28(3) :253-263.
  • 10BRUCKSTEIN A M, ELAD M, ZIBULEVSKY M. Sparse non-nega- tive solution of a linear system of equations is tmJque[ C ]//Proc of In- ternational Symposium on Communications, Control and Signal Pro- cessing. 2008:762-767.

二级参考文献7

  • 1Donoho D L. Compressed Sensing[J]. IEEE Transactions on Information Theory, 2006, 52(4): 1289-1306.
  • 2Candés E, Tao T. Near Optimal Signal Recovery from Random Projections: Universal Encoding Strategies[J]. IEEE Transactions on Information Theory, 2006, 52(12): 5406-5425.
  • 3Candés E, Tao T. Decoding by Linear Programming[J]. IEEE Transactions on Information Theory, 2005, 51(12): 4203-4215.
  • 4Cand E. Compressive Sampling[EB/OL]. (2006-03-11). http:// www.users.cms.caltech.edu/Tro07-Compressive-Sampling-Lec1Vanderbilt.pdf.
  • 5Baraniuk R. A Lecture on Compressive Sensing[J]. IEEE Signal Processing Magazine, 2007, 24(4): 118-121.
  • 6Chen Shaobin, Donoho D L, Saunders M A. Atomic Decomposition by Basis Pursuit[J]. SIAM Journal on Scientific Computing, 2001, 43(1): 129-159.
  • 7Tropp J, Gilbert A. Signal Recovery from Partial Information via Orthogonal Matching Pursuit[J]. IEEE Transactions on Information Theory, 2007, 53(12): 4655-4666.

共引文献9

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部