Deterministic Sensing Matrices in Compressive Sensing: A Survey

Citations

WEB OF SCIENCE

44
Citations

SCOPUS

70

초록

Compressive sensing is a sampling method which provides a new approach to efficient signal compression and recovery by exploiting the fact that a sparse signal can be suitably reconstructed from very few measurements. One of the most concerns in compressive sensing is the construction of the sensing matrices. While random sensing matrices have been widely studied, only a few deterministic sensing matrices have been considered. These matrices are highly desirable on structure which allows fast implementation with reduced storage requirements. In this paper, a survey of deterministic sensing matrices for compressive sensing is presented. We introduce a basic problem in compressive sensing and some disadvantage of the random sensing matrices. Some recent results on construction of the deterministic sensing matrices are discussed.

키워드

ORTHOGONAL MATCHING PURSUIT; ALGEBRAIC-GEOMETRY CODES; SIGNAL RECOVERY; CONSTRUCTIONS; RECONSTRUCTION; BOUNDS
제목
Deterministic Sensing Matrices in Compressive Sensing: A Survey
저자
Nguyen, Thu L. N.; Shin, Yoan
DOI
10.1155/2013/192795
발행일
2013
유형
Article
저널명
The Scientific World Journal