Compressed sensing data reconstruction using adaptive generalized orthogonal matching pursuit algorithm
Hui Sun, Lin Ni
Abstract
Hui Sun, Lin Ni
Abstract
Compressed sensing (CS), which breaks the limitations of the traditional Nyquist sampling theorem, takes full advantage of the sparse signal characteristics to achieve the accurate reconstruction of the compressed signal. An effective algorithm called GOAMP (Generalized Orthogonal Adaptive Matching Pursuit) algorithm was proposed by studying and summarizing the existing Matching Pursuit algorithm. The GOAMP algorithm can reconstruct the compressed signal exactly when the sparsity of the signal is unknown. Compare to the OMP (Orthogonal Matching Pursuit), the number of columns of the measurement matrix selected at each step is decided by the descent speed of the residual. Then like the OMP and the GOMP (Generalized Orthogonal Matching Pursuit), use the columns (atoms) selected before to reconstruct the original signal. The experiments show that the algorithm can choose the near-optimal iteration step quickly, signal reconstruction quality and efficiency of the algorithm are both ideal.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Compressed sensing (CS), which breaks the limitations of the traditional Nyquist sampling theorem, takes full advantage of the sparse signal characteristics to achieve the accurate reconstruction of the compressed signal. An effective algorithm called GOAMP (Generalized Orthogonal Adaptive Matching Pursuit) algorithm was proposed by studying and summarizing the existing Matching Pursuit algorithm. The GOAMP algorithm can reconstruct the compressed signal exactly when the sparsity of the signal is unknown. Compare to the OMP (Orthogonal Matching Pursuit), the number of columns of the measurement matrix selected at each step is decided by the descent speed of the residual. Then like the OMP and the GOMP (Generalized Orthogonal Matching Pursuit), use the columns (atoms) selected before to reconstruct the original signal. The experiments show that the algorithm can choose the near-optimal iteration step quickly, signal reconstruction quality and efficiency of the algorithm are both ideal.
Key concepts: Matching pursuit, Compressed sensing, Signal reconstruction, Algorithm, Computer science, SIGNAL (programming language), Residual, Matching (statistics)