Improved Correlation Coefficient Sparsity Adaptive Matching Pursuit in Noisy Condition

سال انتشار: 1404
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 146

فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JECEI-13-2_011

تاریخ نمایه سازی: 19 تیر 1404

چکیده مقاله:

kground and Objectives: In the realm of compressed sensing, most greedy sparse recovery algorithms necessitate former information about the signal's sparsity level, which may not be available in practical conditions. To address this, methods based on the Sparsity Adaptive Matching Pursuit (SAMP) algorithm have been developed to self-determine this parameter and recover the signal using only the sampling matrix and measurements. Determining a suitable Initial Value for the algorithm can greatly affect the performance of the algorithm.Methods: One of the latest sparsity adaptive methods is Correlation Calculation SAMP (CCSAMP), which relies on correlation calculations between the signals recovered from the support set and the candidate set. In this paper, we present a modified version of CCSAMP that incorporates a pre-estimation phase for determining the initial value of the sparsity level, as well as a modified acceptance criteria considering the variance of noise. Results: To validate the efficiency of the proposed algorithm over the previous approaches, random sparse test signals with various sparsity levels were generated, sampled at the compression ratio of ۵۰%, and recovered with the proposed and previous methos. The results indicate that the suggested method needs, on average, ۵ to ۶ fewer iterations compared to the previous methods, just due to the pre-estimation of the initial guess for the sparsity level. Furthermore, as far as the least square technique is integrated in some parts of the algorithm, in presence of noise the modified acceptance criteria significantly improve the success rate while achieving a lower mean squared error (MSE) in the recovery process.Conclusion: The pre-estimation process makes it possible to recover signal with fewer iterations while keeping the recovery quality as before. The fewer the number of iterations, the faster the algorithm. By incorporating the noise variance into the accept criteria, the method achieves a higher success rate and a lower mean squared error (MSE) in the recovery process.

کلیدواژه ها:

Compressed Sensing (CS) ، Greedy Sparse Recovery Algorithm ، Sparsity Adaptive Matching Pursuit ، Sparsity Estimation

نویسندگان

A. Vakili

Electronic Department, Faculty of Electrical Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran.

M. Shams Esfand Abadi

Electronic Department, Faculty of Electrical Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran.

M. Kalantari

Artificial Intelligence Department, Faculty of Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran.

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • J. Kang, H. Yoon, C. Yoon, S. Emelianov, "High-frequency ultrasound ...
  • D. Cohen, Y. C. Eldar, "Sub-nyquist radar systems: Temporal, spectral, ...
  • C. Wang, S. Ling, "An image encryption scheme based on ...
  • Y. C. Eldar, Compressed Sensing. in: Sampling Theory Beyond Bandlimited ...
  • D. L. Donoho, "Compressed sensing," IEEE Transa. Inf. Theory, ۵۲(۴): ...
  • E. J.Candes, J. Romberg, T. Tao, “Robust uncertainty principles: Exact ...
  • E. C. Marques, N. Maciel, L. Naviner, "A review of ...
  • S. Chen, D. L. Donoho, M. A. Saunders, "Atomic decomposition ...
  • S. Ji, Y. Xue, L. Carin, "Bayesian compressive sensing," IEEE ...
  • S. G. Mallat, Z. Zhang, "Matching pursuits with time-frequency dictionaries," ...
  • Y. Pati, R. Rezaifar, P. Krishnaprasad, "Orthogonal matching Pursuit: Recursive ...
  • D. Needell, J. A. Tropp, "CoSaMP: Iterative signal recovery from ...
  • T. Blumensath, Μ. Davies, "Gradient pursuits," IEEE Trans. Signal Process., ...
  • Q. Wang, G. Qu, "A new greedy algorithm for sparse ...
  • T. Do, L. Gan, "Sparsity adaptive matching pursuit algorithm for ...
  • R. Yan, Q. Li, H. Xiong, "Mitigating impulsive noise in ...
  • Z. B. Lahaw, H. Seddik, "A new greedy sparse recovery ...
  • S. Yao, Q. Guan, S. Wang, "Fast sparsity adaptive matching ...
  • Z. Liquan, M. Ke, J. Yanfei, "Improved generalized sparsity adaptive ...
  • Y. Zhang, Y. Liu, X. Zhang, "A variable step-size sparsity ...
  • C. Wang, Y. Zhang, L. Sun, "Improved sparsity adaptive matching ...
  • Y. Fu, S. Liu, C. Ren, “Adaptive step-size matching pursuit ...
  • Y. Li, W. Chen, "A correlation coefficient sparsity adaptive matching ...
  • X. Wang, Y. Jiang, G. Ding, "An improved variable step ...
  • E. J. Candes, T. Tao, "Decoding by Linear Programming," IEEE ...
  • J. Tropp, S. Wright, "Computational methods For sparse solution of ...
  • X. Zhang, Y. Liu, X., Wang, "A sparsity pre-estimated adaptive ...
  • M. H. Hayes, Statistical Digital Signal Processing and Modeling, John ...
  • نمایش کامل مراجع