Yifei Lou

Yifei Lou

Auto-generated profile, based on publicly available information

Yifei Lou

University of North Carolina at Chapel Hill

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
PYPenghang Yin
Penghang Yin
YLYifei Lou
Yifei Lou
QHQi He
Qi He
JXJack Xin
Jack Xin
We study minimization of the difference of $\ell_1$ and $\ell_2$ norms as a nonconvex and Lipschitz continuous metric for solving constrained and unconstrained compressed sensing problems. We establish exact (stable) sparse recovery results under a restricted isometry property (RIP) condition for the constrained problem, and a full-rank theorem of the sensing matrix restricted to the support of the sparse solution. We present an iterative method for $\ell_{1-2}$ minimization based on the difference of convex functions algorithm and prove that it converges to a stationary point satisfying the first-order optimality condition. We propose a sparsity oriented simulated annealing procedure with non-Gaussian random perturbation and prove the almost sure convergence of the combined algorithm (DCASA) to a global minimum. Computation examples on success rates of sparse solution recovery show that if the sensing matrix is ill-conditioned (non RIP satisfying), then our method is better than existing nonconvex compressed sensing solvers in the literature. Likewise in the magnetic resonance imaging (MRI) phantom image recovery problem, $\ell_{1-2}$ succeeds with eight projections. Irrespective of the conditioning of the sensing matrix, $\ell_{1-2}$ is better than $\ell_1$ in both the sparse signal and the MRI phantom image recovery problems.

27 August 2009 in Journal of Scientific Computing
Verified
Journal Article
Open access
PDF file
YLYifei Lou
Yifei Lou
XZXiaoqun Zhang
Xiaoqun Zhang
SOStanley Osher
Stanley Osher
ABAndrea Bertozzi
Andrea Bertozzi
This paper considers two nonlocal regularizations for image recovery, which exploit the spatial interactions in images. We get superior results using preprocessed data as input for the weighted functionals. Applications discussed include image deconvolution and tomographic reconstruction. The numerical results show our method outperforms some previous ones.

1 January 2015 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
YLYifei Lou
Yifei Lou
TZTieyong ZENG
Tieyong ZENG
SOStanley Osher
Stanley Osher
JXJack Xin
Jack Xin
We propose a weighted difference of anisotropic and isotropic total variation (TV) as a regularization for image processing tasks, based on the well-known TV model and natural image statistics. Due to the form of our model, it is natural to compute via a difference of convex algorithm (DCA). We draw its connection to the Bregman iteration for convex problems and prove that the iteration generated from our algorithm converges to a stationary point with the objective function values decreasing monotonically. A stopping strategy based on the stable oscillatory pattern of the iteration error from the ground truth is introduced. In numerical experiments on image denoising, image deblurring, and magnetic resonance imaging (MRI) reconstruction, our method improves on the classical TV model consistently and is on par with representative state-of-the-art methods.

25 March 2010 in Medical Physics
Verified
Journal Article
Closed access
XJXun Jia
Xun Jia
YLYifei Lou
Yifei Lou
RLRuijiang Li
Ruijiang Li
WSWilliam Y. Song
William Y. Song
SJSteve B. Jiang
Steve B. Jiang

29 May 2017 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
YLYifei Lou
Yifei Lou
MYMing Yan
Ming Yan

16 October 2014 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
YLYifei Lou
Yifei Lou
PYPenghang Yin
Penghang Yin
QHQi He
Qi He
JXJack Xin
Jack Xin