期刊名称：IAENG International Journal of Computer Science
印刷版ISSN：1819-656X
电子版ISSN：1819-9224
出版年度：2021
卷号：48
期号：3
语种：English
出版社：IAENG - International Association of Engineers
摘要：The sparsity adaptive matching pursuit (SAMP) algorithm reconstructs the signal through multiple iterations with a fixed stepsize, which consumes too much time. To solve this problem, a variable stepsize sparsity adaptive matching pursuit (VSSAMP) algorithm is proposed. The sparsity is preestimated, and then the variable stepsize SAMP is used to reconstruct the signal. Different from the SAMP algorithm, VSSAMP algorithm determines the stepsize according to the energy difference of two consecutive residues. The experiment results show that the reconstruction probability of VSSAMP algorithm is slightly slower than SAMP algorithm in onedimensional signal, and the reconstruction quality of VSSAMP is basically equal to SAMP algorithm in tow-dimensional image. Most notably, the reconstruction time of VSSAMP algorithm is significantly lower than SAMP in reconstruction of onedimensional signal and two-dimensional image.
