An overview of low-rank matrix recovery from incomplete observations

MA Davenport, J Romberg - IEEE Journal of Selected Topics in …, 2016 - ieeexplore.ieee.org
Low-rank matrices play a fundamental role in modeling and computational methods for
signal processing and machine learning. In many applications where low-rank matrices …

Compressed sensing MRI: a review from signal processing perspective

JC Ye - BMC Biomedical Engineering, 2019 - Springer
Magnetic resonance imaging (MRI) is an inherently slow imaging modality, since it acquires
multi-dimensional k-space data through 1-D free induction decay or echo signals. This often …

Low-rank matrix completion: A contemporary survey

LT Nguyen, J Kim, B Shim - IEEE Access, 2019 - ieeexplore.ieee.org
As a paradigm to recover unknown entries of a matrix from partial observations, low-rank
matrix completion (LRMC) has generated a great deal of interest. Over the years, there have …

Low-Rank Modeling of Local -Space Neighborhoods (LORAKS) for Constrained MRI

JP Haldar - IEEE transactions on medical imaging, 2013 - ieeexplore.ieee.org
Recent theoretical results on low-rank matrix reconstruction have inspired significant interest
in low-rank modeling of MRI images. Existing approaches have focused on higher …

Image reconstruction from highly undersampled (k, t)-space data with joint partial separability and sparsity constraints

B Zhao, JP Haldar, AG Christodoulou… - IEEE transactions on …, 2012 - ieeexplore.ieee.org
Partial separability (PS) and sparsity have been previously used to enable reconstruction of
dynamic images from undersampled (k, t)-space data. This paper presents a new method to …

Improved magnetic resonance fingerprinting reconstruction with low‐rank and subspace modeling

B Zhao, K Setsompop, E Adalsteinsson… - Magnetic resonance …, 2018 - Wiley Online Library
Purpose This article introduces a constrained imaging method based on low‐rank and
subspace modeling to improve the accuracy and speed of MR fingerprinting (MRF). Theory …

Understanding alternating minimization for matrix completion

M Hardt - 2014 IEEE 55th Annual Symposium on Foundations …, 2014 - ieeexplore.ieee.org
Alternating minimization is a widely used and empirically successful heuristic for matrix
completion and related low-rank optimization problems. Theoretical guarantees for …

Bilinear generalized approximate message passing—Part I: Derivation

JT Parker, P Schniter, V Cevher - IEEE Transactions on Signal …, 2014 - ieeexplore.ieee.org
In this paper, we extend the generalized approximate message passing (G-AMP) approach,
originally proposed for high-dimensional generalized-linear regression in the context of …

Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization

Y Shen, Z Wen, Y Zhang - Optimization Methods and Software, 2014 - Taylor & Francis
The matrix separation problem aims to separate a low-rank matrix and a sparse matrix from
their sum. This problem has recently attracted considerable research attention due to its …

Sparse Bayesian methods for low-rank matrix estimation

SD Babacan, M Luessi, R Molina… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
Recovery of low-rank matrices has recently seen significant activity in many areas of science
and engineering, motivated by recent theoretical results for exact reconstruction guarantees …