A Fast Alternating Direction Method for TVL1-L2 Signal Reconstruction From Partial Fourier Data

被引:457
作者
Yang, Junfeng [1 ]
Zhang, Yin [2 ]
Yin, Wotao [2 ]
机构
[1] Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R China
[2] Rice Univ, Dept Computat & Appl Math, Houston, TX 77005 USA
基金
美国国家科学基金会;
关键词
Compressive sensing (CS); compressed sensing; alternating direction method; magnetic resonance imaging (MRI); MRI reconstruction; fast Fourier transform (FFT); discrete cosine transform (DCT); total variation; ALGORITHM; MINIMIZATION; RECOVERY;
D O I
10.1109/JSTSP.2010.2042333
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recent compressive sensing results show that it is possible to accurately reconstruct certain compressible signals from relatively few linear measurements via solving nonsmooth convex optimization problems. In this paper, we propose the use of the alternating direction method-a classic approach for optimization problems with separable variables (D. Gabay and B. Mercier, "A dual algorithm for the solution of nonlinear variational problems via finite-element approximations," Computer and Mathematics with Applications, vol. 2, pp. 17-40, 1976; R. Glowinski and A. Marrocco, "Sur lapproximation par elements finis dordre un, et la resolution par penalisation-dualite dune classe de problemes de Dirichlet nonlineaires," Rev. Francaise dAut. Inf. Rech. Oper., vol. R-2, pp. 41-76, 1975)-for signal reconstruction from partial Fourier (i.e., incomplete frequency) measurements. Signals are reconstructed as minimizers of the sum of three terms corresponding to total variation, l(1)-norm of a certain transform, and least squares data fitting. Our algorithm, called RecPF and published online, runs very fast (typically in a few seconds on a laptop) because it requires a small number of iterations, each involving simple shrinkages and two fast Fourier transforms (or alternatively discrete cosine transforms when measurements are in the corresponding domain). RecPF was compared with two state-of-the-art algorithms on recovering magnetic resonance images, and the results show that it is highly efficient, stable, and robust.
引用
收藏
页码:288 / 297
页数:10
相关论文
共 47 条
[1]  
AFONSO M, 2009, P WORKSH SIGN PROC A
[2]  
[Anonymous], 2002, CONTEMP MATH
[3]  
[Anonymous], 1984, Numerical Methods for Nonlinear Variational Problems
[4]  
[Anonymous], P IEEE WORKSH STAT S
[5]  
[Anonymous], 0635 UCLA CAM
[6]  
[Anonymous], 2009, APPL LAGRANGIAN BASE
[7]  
[Anonymous], [No title captured]
[8]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[9]  
Baron D., DISTRIBUTED COMPRESS
[10]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202