Logo image
A Fast Algorithm for Convolutional Structured Low-Rank Matrix Recovery
Journal article

A Fast Algorithm for Convolutional Structured Low-Rank Matrix Recovery

Gregory Ongie and Mathews Jacob
IEEE transactions on computational imaging, Vol.3(4), pp.535-550
12/2017
DOI: 10.1109/TCI.2017.2721819
PMCID: PMC5999344
PMID: 29911129
url
https://www.ncbi.nlm.nih.gov/pmc/articles/5999344View
Open Access

Abstract

Fourier-domain structured low-rank matrix priors are emerging as powerful alternatives to traditional image recovery methods such as total variation and wavelet regularization. These priors specify that a convolutional structured matrix, i.e., Toeplitz, Hankel, or their multilevel generalizations, built from Fourier data of the image should be low-rank. The main challenge in applying these schemes to large-scale problems is the computational complexity and memory demand resulting from lifting the image data to a large-scale matrix. We introduce a fast and memory-efficient approach called the generic iterative reweighted annihilation filter algorithm that exploits the convolutional structure of the lifted matrix to work in the original unlifted domain, thus considerably reducing the complexity. Our experiments on the recovery of images from undersampled Fourier measurements show that the resulting algorithm is considerably faster than previously proposed algorithms and can accommodate much larger problem sizes than previously studied.
Jacobian matrices Transmission line matrix methods Convolution compressed sensing Magnetic resonance imaging finite rate of innovation multi-level Toeplitz matrices structured low-rank matrix recovery Approximation algorithms Annihilating filter MRI reconstruction Image reconstruction

Details

Metrics

Logo image