2014•Unpublished venueRequires access

Compressed sensing data reconstruction using a modified subspace pursuit algorithm under the condition of unknown sparsity

Xingyuan Wang, Lin Ni

Open publisher page 2 citations

Abstract

This paper introduces the fundamental knowledge of compressed sensing theory, and analyzes the important reconstruction algorithms such as orthogonal matching pursuit, subspace pursuit, but we should know the sparse degree. The sparsity adaptive matching pursuit algorithm can be terminated by setting the conditions to make adaptive sparse degree. This paper puts forward a modified sparsity adaptive algorithm based on those three algorithms. The simulation results show that new algorithm can accurately reconstruct the original signal, and has better results than SAMP.

About this research paper

What this paper is about

This paper introduces the fundamental knowledge of compressed sensing theory, and analyzes the important reconstruction algorithms such as orthogonal matching pursuit, subspace pursuit, but we should know the sparse degree. The sparsity adaptive matching pursuit algorithm can be terminated by setting the conditions to make adaptive sparse degree. This paper puts forward a modified sparsity adaptive algorithm based on those three algorithms. The simulation results show that new algorithm can accurately reconstruct the original signal, and has better results than SAMP.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper introduces the fundamental knowledge of compressed sensing theory, and analyzes the important reconstruction algorithms such as orthogonal matching pursuit, subspace pursuit, but we should know the sparse degree. The sparsity adaptive matching pursuit algorithm can be terminated by setting the conditions to make adaptive sparse degree. This paper puts forward a modified sparsity adaptive algorithm based on those three algorithms. The simulation results show that new algorithm can accurately reconstruct the original signal, and has better results than SAMP.

Key concepts: Matching pursuit, Compressed sensing, Subspace topology, Computer science, Algorithm, Matching (statistics), Signal reconstruction, Degree (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
Compressed sensing data reconstruction using a modified subspace pursuit algorithm under the condition of unknown sparsity — Research Paper | ScholarLens