Comparison and Simulation Study of the Sparse Representation Matching Pursuit Algorithm and the Orthogonal Matching Pursuit Algorithm

Author(s):  
Junshuo Dong ◽  
Lingda Wu
2018 ◽  
Vol 67 (9) ◽  
pp. 2058-2068 ◽  
Author(s):  
Carlos Morales-Perez ◽  
Jose Rangel-Magdaleno ◽  
Hayde Peregrina-Barreto ◽  
Juan Pablo Amezquita-Sanchez ◽  
Martin Valtierra-Rodriguez

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 231 ◽  
Author(s):  
Hanfei Zhang ◽  
Shungen Xiao ◽  
Ping Zhou

The signal reconstruction quality has become a critical factor in compressed sensing at present. This paper proposes a matching pursuit algorithm for backtracking regularization based on energy sorting. This algorithm uses energy sorting for secondary atom screening to delete individual wrong atoms through the regularized orthogonal matching pursuit (ROMP) algorithm backtracking. The support set is continuously updated and expanded during each iteration. While the signal energy distribution is not uniform, or the energy distribution is in an extreme state, the reconstructive performance of the ROMP algorithm becomes unstable if the maximum energy is still taken as the selection criterion. The proposed method for the regularized orthogonal matching pursuit algorithm can be adopted to improve those drawbacks in signal reconstruction due to its high reconstruction efficiency. The experimental results show that the algorithm has a proper reconstruction.


2018 ◽  
Vol 214 ◽  
pp. 02004
Author(s):  
Yuanyuan Li ◽  
Yaowen Fu ◽  
Wenpeng Zhang

Distributed ISAR technique has the potential to increase the cross-range resolution by exploiting multi-channel echoes from distributed virtual equivalent sensors. In the existing imaging approaches, the echoes acquired from different sensors are rearranged into an equivalent single-channel ISAR signal. Then, the missing data between the observation angles of any two adjacent sensors is restored by interpolation. However, the interpolation method can be very inaccurate when the gap is large or the signal-to-noise (SNR) of echoes is low. In this paper, we discuss sparse representation of distributed ISAR echoes since the scattering field of the target is usually composed of only a limited number of strong scattering centres, representing strong spatial sparsity. Then, by using sparse algorithm (Orthogonal Matching Pursuit algorithm, OMP), the positions and amplitudes of the scattering points in every range bin can be recovered and the final ISAR image with high cross-range resolution can be obtained. Results show the effectiveness of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document