2013
DOI: 10.1016/s1874-1029(13)60063-4
|View full text |Cite
|
Sign up to set email alerts
|

From Compressed Sensing to Low-rank Matrix Recovery: Theory and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 39 publications
0
1
0
Order By: Relevance
“…Recently, low‐rank‐based methods has been developed to further exploit temporal sparsity. Peng et al [15] review the fundamental theories about CS, matrix rank minimisation, and low‐rank matrix recovery, and then introduce the typical applications of these theories in image processing, computer vision, and computational photography. They also propose a robust alignment algorithm by sparse and low‐rank decomposition for linearly correlated images [16].…”
Section: Related Workmentioning
confidence: 99%
“…Recently, low‐rank‐based methods has been developed to further exploit temporal sparsity. Peng et al [15] review the fundamental theories about CS, matrix rank minimisation, and low‐rank matrix recovery, and then introduce the typical applications of these theories in image processing, computer vision, and computational photography. They also propose a robust alignment algorithm by sparse and low‐rank decomposition for linearly correlated images [16].…”
Section: Related Workmentioning
confidence: 99%