Efficient algorithms for compressed sensing and matrix completion
<p>Compressed sensing and matrix completion are two new data acquisition techniques whose efficiency is achieved by exploring low dimensional structures in high dimensional data. Despite the combinatorial nature of compressed sensing and matrix completion, there has been significant develo...
Main Author: | Wei, K |
---|---|
Other Authors: | Tanner, J |
Format: | Thesis |
Language: | English |
Published: |
2014
|
Subjects: |
Similar Items
-
On low-rank plus sparse matrix sensing
by: Vary, S
Published: (2021) -
Control perspectives on numerical algorithms and matrix problems /
by: 444990 Bhaya, Amit, et al.
Published: (2006) -
An Efficient Algorithm for Solving the Matrix Optimization Problem in the Unsupervised Feature Selection
by: Chunmei Li, et al.
Published: (2022-02-01) -
CGIHT: Conjugate Gradient Iterative Hard Thresholding for Compressed Sensing and Matrix Completion
by: Tanner, J, et al.
Published: (2015) -
Practical numerical methods algorithms and programs /
by: 227220 Kohn, Michael C.
Published: (1987)