20212021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)Requires access

Sparse Matrix Reconstruction Based on Sequential Sparse Recovery for Multiple Measurement Vectors

Xingyu He, Tao Liu

Open publisher page 2 citations

Abstract

This paper considers recovery of two-dimensional (2D) sparse signals from incomplete measurements. The 2D sparse signals can be reconstructed by solving a sparse representation problem for Multiple Measurement Vectors (MMV). However, the extension of the sparse recovery algorithms to the MMV case may be inefficient if the vectors do not have the same sparsity profile. In this paper, a sequential sparse recovery (SSR) algorithm is proposed to reconstruct the two-dimensional (2D) sparse matrix. The sparsity of the matrix is much reduced after down-sampling observation and the sparse matrix can be reconstructed after sequential observations and reconstructions. Simulation results verify the effectiveness of the proposed method in 2D sparse signal reconstruction.

About this research paper

What this paper is about

This paper considers recovery of two-dimensional (2D) sparse signals from incomplete measurements. The 2D sparse signals can be reconstructed by solving a sparse representation problem for Multiple Measurement Vectors (MMV). However, the extension of the sparse recovery algorithms to the MMV case may be inefficient if the vectors do not have the same sparsity profile. In this paper, a sequential sparse recovery (SSR) algorithm is proposed to reconstruct the two-dimensional (2D) sparse matrix. The sparsity of the matrix is much reduced after down-sampling observation and the sparse matrix can be reconstructed after sequential observations and reconstructions. Simulation results verify the effectiveness of the proposed method in 2D sparse signal reconstruction.

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 considers recovery of two-dimensional (2D) sparse signals from incomplete measurements. The 2D sparse signals can be reconstructed by solving a sparse representation problem for Multiple Measurement Vectors (MMV). However, the extension of the sparse recovery algorithms to the MMV case may be inefficient if the vectors do not have the same sparsity profile. In this paper, a sequential sparse recovery (SSR) algorithm is proposed to reconstruct the two-dimensional (2D) sparse matrix. The sparsity of the matrix is much reduced after down-sampling observation and the sparse matrix can be reconstructed after sequential observations and reconstructions. Simulation results verify the effectiveness of the proposed method in 2D sparse signal reconstruction.

Key concepts: Sparse approximation, Sparse matrix, Computer science, Matrix (chemical analysis), Compressed sensing, Algorithm, Signal reconstruction, Signal recovery

Related papers

Back to paper searchBrowse research topicsOriginal source
Sparse Matrix Reconstruction Based on Sequential Sparse Recovery for Multiple Measurement Vectors — Research Paper | ScholarLens