Lixin Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Lixin Shen has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Ashley Prater-Bennette
Air Force Research Laboratory, Rome, USA
11 shared publications - Yuesheng Xu
Department of Mathematics and Statistics, Old Dominion University, Norfolk, USA
11 shared publications Bruce W. Suter
Air Force Research Laboratory, Rome, NY, USA
4 shared publications- Andrzej Krol
SUNY Upstate Medical Univ. (United States)
3 shared publications - Bruce W. Suter
Air Force Research Laboratory, Rome, USA
3 shared publications - Chen Xu
Shenzhen Key Laboratory for Advanced Machine Learning and Applications, College of Mathematics and Statistics, Shenzhen University, Shenzhen, China
3 shared publications
Latest Publications
- Open Access
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 26, 1-31
Robust penalized dantzig selector: Error analysis, oracle inequalities, and algorithmic efficiency
This article addresses the recovery of sparse signals and low-rank matrices from limited, noisy observations. We introduce unconstrained models, termed the Robust Penalized Dantzig Vector Selector (RPDvS) for sparse signal recovery and the Robust Penalized Dantzig Matrix Selector (RPDmS) for low-rank matrix recovery. Under restricted isometry assumptions on the measurement operators, we establish stable recovery error bounds and oracle inequalities for both models in the presence of Gaussian noise. For the RPDmS model, we derive a tight oracle inequality that guarantees identification of a "nearly perfect'' column space and motivates a simple post-processing procedure that yields an improved estimator, thereby bridging a gap in the earlier analysis of the Dantzig matrix selector by Candès and Plan (2011). Parallel oracle-type results are obtained for the RPDvS model. Building on these theoretical guarantees, we develop efficient algorithms for solving the RPDvS and RPDmS problems and implement the proposed post-processing steps. Extensive simulations and empirical studies demonstrate that the new methods are computationally competitive while achieving superior reconstruction accuracy in both sparse signal and low-rank matrix recovery, thereby confirming the sharpness of our error bounds and the effectiveness of the algorithms.
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 26, 1-31
Open AccessRobust penalized dantzig selector: Error analysis, oracle inequalities, and algorithmic efficiency
This article addresses the recovery of sparse signals and low-rank matrices from limited, noisy observations. We introduce unconstrained models, termed the Robust Penalized Dantzig Vector Selector (RPDvS) for sparse signal recovery and the Robust Penalized Dantzig Matrix Selector (RPDmS) for low-rank matrix recovery. Under restricted isometry assumptions on the measurement operators, we establish stable recovery error bounds and oracle inequalities for both models in the presence of Gaussian noise. For the RPDmS model, we derive a tight oracle inequality that guarantees identification of a "nearly perfect'' column space and motivates a simple post-processing procedure that yields an improved estimator, thereby bridging a gap in the earlier analysis of the Dantzig matrix selector by Candès and Plan (2011). Parallel oracle-type results are obtained for the RPDvS model. Building on these theoretical guarantees, we develop efficient algorithms for solving the RPDvS and RPDmS problems and implement the proposed post-processing steps. Extensive simulations and empirical studies demonstrate that the new methods are computationally competitive while achieving superior reconstruction accuracy in both sparse signal and low-rank matrix recovery, thereby confirming the sharpness of our error bounds and the effectiveness of the algorithms.
- 9 November 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 211 (2) , 44
Proximity Operator of the $\ell _1$ over $\ell _2$ Function- 9 November 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 211 (2) , 44
Proximity Operator of the $\ell _1$ over $\ell _2$ Function- 22 September 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (3) , 2123-2156
Framelet Regularized SENSE Calibration in \({k}\)-Space with Conditional Sensitivity-Map Updates for Parallel MRI ReconstructionParallel Magnetic Resonance Imaging (pMRI) shortens scan time by reducing the amount of k-space data acquired from multiple receiver coils. Conventional model-based reconstruction algorithms typically exploit either coil sensitivity information in the image domain or intercoil correlations in the frequency domain. However, both approaches rely on assumptions that may fail in certain scenarios, and each has its own strengths and limitations. In this work, we propose a Calibration Observation Model (COM) that integrates the advantages of both image-domain and frequency-domain methods to achieve efficient reconstruction. Furthermore, we introduce a three-dimensional multi-coil regularization term based on the Two-Level Nonstationary Tight Framelet (TNTF) system, resulting in the TNTF-COM model, which effectively suppresses artifacts and noise. Moreover, we develop a sensitivity update (US) method to further enhance reconstruction quality, leading to the TNTF-COMEUS model. To ensure stable and reproducible calibration, our method performs conditional sensitivity-map updates: the sensitivity-map is refreshed when the reconstructed slice image becomes stable (i.e., the mean absolute error between consecutive reconstructions falls below [Formula: see text]), with at most [Formula: see text] updates per run. Experimental results demonstrate that the proposed model-based reconstruction approach achieves, and in some cases surpasses, the performance of state-of-the-art deep learning-based methods, delivering high reconstruction accuracy and robustness. The implementation code and datasets used in this work are publicly available at https://github.com/Chenvp/COMEUS/ .
- 22 September 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (3) , 2123-2156
Framelet Regularized SENSE Calibration in \({k}\)-Space with Conditional Sensitivity-Map Updates for Parallel MRI ReconstructionParallel Magnetic Resonance Imaging (pMRI) shortens scan time by reducing the amount of k-space data acquired from multiple receiver coils. Conventional model-based reconstruction algorithms typically exploit either coil sensitivity information in the image domain or intercoil correlations in the frequency domain. However, both approaches rely on assumptions that may fail in certain scenarios, and each has its own strengths and limitations. In this work, we propose a Calibration Observation Model (COM) that integrates the advantages of both image-domain and frequency-domain methods to achieve efficient reconstruction. Furthermore, we introduce a three-dimensional multi-coil regularization term based on the Two-Level Nonstationary Tight Framelet (TNTF) system, resulting in the TNTF-COM model, which effectively suppresses artifacts and noise. Moreover, we develop a sensitivity update (US) method to further enhance reconstruction quality, leading to the TNTF-COMEUS model. To ensure stable and reproducible calibration, our method performs conditional sensitivity-map updates: the sensitivity-map is refreshed when the reconstructed slice image becomes stable (i.e., the mean absolute error between consecutive reconstructions falls below [Formula: see text]), with at most [Formula: see text] updates per run. Experimental results demonstrate that the proposed model-based reconstruction approach achieves, and in some cases surpasses, the performance of state-of-the-art deep learning-based methods, delivering high reconstruction accuracy and robustness. The implementation code and datasets used in this work are publicly available at https://github.com/Chenvp/COMEUS/ .
- Open Access
- 30 July 2026
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 68 (4) , 48
MG-SpaIR: Multi-Grade Sparse-Guided Implicit Representation for Training-Data-Free Image Restoration
MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade residual hierarchy that progressively refines the reconstruction from low to high spatial frequencies across grades, improving representational fidelity and mitigating spectral limitations. To stabilize reconstruction optimization and suppress INR-induced artifacts, we further propose an explicit sparse proximal regularization (e.g., $$\ell _0$$ type) applied directly in the high-resolution image domain, which discourages spurious high-frequency patterns while preserving sharp structures. The resulting optimization is solved efficiently via a multi-grade proximal alternating scheme, and we establish convergence guarantees for the associated updates under standard regularity conditions. Experiments on mixed-degradation benchmarks demonstrate that MG-SpaIR consistently outperforms strong training-data-free baselines such as Deep Image Prior, providing a stable, interpretable, and data-efficient alternative to conventional learning-based restoration methods.- 30 July 2026
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 68 (4) , 48
Open AccessMG-SpaIR: Multi-Grade Sparse-Guided Implicit Representation for Training-Data-Free Image Restoration
MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade residual hierarchy that progressively refines the reconstruction from low to high spatial frequencies across grades, improving representational fidelity and mitigating spectral limitations. To stabilize reconstruction optimization and suppress INR-induced artifacts, we further propose an explicit sparse proximal regularization (e.g., $$\ell _0$$ type) applied directly in the high-resolution image domain, which discourages spurious high-frequency patterns while preserving sharp structures. The resulting optimization is solved efficiently via a multi-grade proximal alternating scheme, and we establish convergence guarantees for the associated updates under standard regularity conditions. Experiments on mixed-degradation benchmarks demonstrate that MG-SpaIR consistently outperforms strong training-data-free baselines such as Deep Image Prior, providing a stable, interpretable, and data-efficient alternative to conventional learning-based restoration methods. - 24 July 2026
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 68 (4) , 47
A Bilevel Sensitivity-Corrected Reconstruction Framework with Deep Priors for Parallel MRI
- 24 July 2026
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 68 (4) , 47
A Bilevel Sensitivity-Corrected Reconstruction Framework with Deep Priors for Parallel MRI
- Open AccessProximity Operator of the $\ell_1$ over $\ell_2$ FunctionWe study the proximity operator of the nonconvex, scale-invariant ratio $h(\vx)=\|\vx\|_{1}/\|\vx\|_{2}$ and show it can be computed exactly in any dimension. By expressing $\vx=r\vu$ and exploiting sign and permutation invariance, we reduce the proximal step to a smooth optimization of a rank-one quadratic over the nonnegative orthant of the unit sphere. We prove that every proximal point arises from a finite candidate set indexed by $k\in\{1,\dots,n\}$: the active subvector is a local, but nonglobal, minimizer on $\mathbb{S}^{k-1}$ characterized by the roots of an explicit quartic. This yields closed-form candidates, an exact selection rule, and a necessary and sufficient existence test. Building on these characterizations, we develop practical algorithms, including an $O(n)$ implementation via prefix sums and a pruning criterion that avoids unnecessary quartic solves. The method returns all proximal points when the prox is non-unique, and in experiments it attains strictly lower objective values than approaches that guess sparsity or rely on sphere projections with limited scalability.Open AccessProximity Operator of the $\ell_1$ over $\ell_2$ FunctionWe study the proximity operator of the nonconvex, scale-invariant ratio $h(\vx)=\|\vx\|_{1}/\|\vx\|_{2}$ and show it can be computed exactly in any dimension. By expressing $\vx=r\vu$ and exploiting sign and permutation invariance, we reduce the proximal step to a smooth optimization of a rank-one quadratic over the nonnegative orthant of the unit sphere. We prove that every proximal point arises from a finite candidate set indexed by $k\in\{1,\dots,n\}$: the active subvector is a local, but nonglobal, minimizer on $\mathbb{S}^{k-1}$ characterized by the roots of an explicit quartic. This yields closed-form candidates, an exact selection rule, and a necessary and sufficient existence test. Building on these characterizations, we develop practical algorithms, including an $O(n)$ implementation via prefix sums and a pruning criterion that avoids unnecessary quartic solves. The method returns all proximal points when the prox is non-unique, and in experiments it attains strictly lower objective values than approaches that guess sparsity or rely on sphere projections with limited scalability.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 20, 156-180
Efficient algorithms for mixed noise removal via nonlocal low-rank regularization
This paper addresses an image denoising problem where observed images are contaminated by a mix of Gaussian and impulse noise. The proposed approach involves solving an optimization problem with an objective function that combines a convex content-dependent fidelity term and a nonlocal low-rank regularization term. Both terms are constructed using patch matrices formed from similar patches of the image. Based on the unique properties of these terms, we propose two different strategies to efficiently solve the problem. We also provide convergence analysis for both methods. Our numerical experiments demonstrate that the proposed two-phase approach performs well in terms of three quantitative metrics: peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and feature similarity (FSIM), as well as in the visual quality of the restored images.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 20, 156-180
Efficient algorithms for mixed noise removal via nonlocal low-rank regularization
This paper addresses an image denoising problem where observed images are contaminated by a mix of Gaussian and impulse noise. The proposed approach involves solving an optimization problem with an objective function that combines a convex content-dependent fidelity term and a nonlocal low-rank regularization term. Both terms are constructed using patch matrices formed from similar patches of the image. Based on the unique properties of these terms, we propose two different strategies to efficiently solve the problem. We also provide convergence analysis for both methods. Our numerical experiments demonstrate that the proposed two-phase approach performs well in terms of three quantitative metrics: peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and feature similarity (FSIM), as well as in the visual quality of the restored images.
- Open Access
- 5 December 2025
- Published by Global Science Press in Journal of Computational Mathematics
Stochastic Variance Reduced Gradient for Tensor Recovery
Low-rank tensor recovery is pivotal in numerous applications, including image and video processing, machine learning, and data analysis. A common approach to this problem involves convex relaxation, where the tensor rank function is minimized by using the tensor nuclear norm. However, this method can be significantly suboptimal. In addition, the stochastic variance reduced gradient (SVRG) method, a variant of stochastic gradient descent, has been applied to matrix recovery problems. In this paper, we extend the SVRG method to the tensor framework, introducing the tensor stochastic variance reduced gradient (TSVRG) algorithm for tensor recovery with CP or Tucker rank constraints. TSVRG is designed to achieve higher precision solutions by escaping local minima and identifying superior global optima. Moreover, TSVRG offers reduced computational complexity compared to traditional gradient descent methods. We establish a convergence theorem for TSVRG under the tensor restricted isometry condition when the measurements are linear. Finally, we present numerical results using both synthetic and real data, demonstrating the competitive performance of TSVRG compared to other advanced algorithms.
- 5 December 2025
- Published by Global Science Press in Journal of Computational Mathematics
Open AccessStochastic Variance Reduced Gradient for Tensor Recovery
Low-rank tensor recovery is pivotal in numerous applications, including image and video processing, machine learning, and data analysis. A common approach to this problem involves convex relaxation, where the tensor rank function is minimized by using the tensor nuclear norm. However, this method can be significantly suboptimal. In addition, the stochastic variance reduced gradient (SVRG) method, a variant of stochastic gradient descent, has been applied to matrix recovery problems. In this paper, we extend the SVRG method to the tensor framework, introducing the tensor stochastic variance reduced gradient (TSVRG) algorithm for tensor recovery with CP or Tucker rank constraints. TSVRG is designed to achieve higher precision solutions by escaping local minima and identifying superior global optima. Moreover, TSVRG offers reduced computational complexity compared to traditional gradient descent methods. We establish a convergence theorem for TSVRG under the tensor restricted isometry condition when the measurements are linear. Finally, we present numerical results using both synthetic and real data, demonstrating the competitive performance of TSVRG compared to other advanced algorithms.
- Open Access
Signal and Image Recovery with Scale and Signed Permutation Invariant Sparsity-Promoting Functions
Sparse signal recovery has been a cornerstone of advancements in data processing and imaging. Recently, the squared ratio of $\ell_1$ to $\ell_2$ norms, $(\ell_1/\ell_2)^2$, has been introduced as a sparsity-prompting function, showing superior performance compared to traditional $\ell_1$ minimization, particularly in challenging scenarios with high coherence and dynamic range. This paper explores the integration of the proximity operator of $(\ell_1/\ell_2)^2$ and $\ell_1/\ell_2$ into efficient optimization frameworks, including the Accelerated Proximal Gradient (APG) and Alternating Direction Method of Multipliers (ADMM). We rigorously analyze the convergence properties of these algorithms and demonstrate their effectiveness in compressed sensing and image restoration applications. Numerical experiments highlight the advantages of our proposed methods in terms of recovery accuracy and computational efficiency, particularly under noise and high-coherence conditions.Open AccessSignal and Image Recovery with Scale and Signed Permutation Invariant Sparsity-Promoting Functions
Sparse signal recovery has been a cornerstone of advancements in data processing and imaging. Recently, the squared ratio of $\ell_1$ to $\ell_2$ norms, $(\ell_1/\ell_2)^2$, has been introduced as a sparsity-prompting function, showing superior performance compared to traditional $\ell_1$ minimization, particularly in challenging scenarios with high coherence and dynamic range. This paper explores the integration of the proximity operator of $(\ell_1/\ell_2)^2$ and $\ell_1/\ell_2$ into efficient optimization frameworks, including the Accelerated Proximal Gradient (APG) and Alternating Direction Method of Multipliers (ADMM). We rigorously analyze the convergence properties of these algorithms and demonstrate their effectiveness in compressed sensing and image restoration applications. Numerical experiments highlight the advantages of our proposed methods in terms of recovery accuracy and computational efficiency, particularly under noise and high-coherence conditions. - Open Access
- 4 November 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (1) , 1-28
Computing Proximity Operators of Scale and Signed Permutation Invariant Functions
This paper investigates the computation of proximity operators for scale and signed permutation invariant functions. A scale invariant function remains unchanged under uniform scaling, while a signed permutation invariant function retains its structure despite permutations and sign changes applied to its input variables. Noteworthy examples include the $$\ell _0$$ function, the ratio of $$\ell _1/\ell _2$$ , and its square, with their proximity operators being particularly crucial in sparse signal recovery. We delve into the properties of scale and signed permutation invariant functions, delineating the computation of their proximity operators into three sequential steps: the $${\varvec{w}}$$ -step, r -step, and d -step. These steps collectively form a procedure termed as WRD, with the $${\varvec{w}}$$ -step being of utmost importance and requiring careful treatment. Leveraging this procedure, we present a method for explicitly and efficiently computing the proximity operator of $$(\ell _1/\ell _2)^2$$ and introduce an algorithm for the proximity operator of $$\ell _1/\ell _2$$ . Numerical experiments on sparse signal recovery corroborate the analysis and show that first-order methods equipped with these proximity operators outperform $$\ell _1$$ -based baselines in reconstruction accuracy.- 4 November 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (1) , 1-28
Open AccessComputing Proximity Operators of Scale and Signed Permutation Invariant Functions
This paper investigates the computation of proximity operators for scale and signed permutation invariant functions. A scale invariant function remains unchanged under uniform scaling, while a signed permutation invariant function retains its structure despite permutations and sign changes applied to its input variables. Noteworthy examples include the $$\ell _0$$ function, the ratio of $$\ell _1/\ell _2$$ , and its square, with their proximity operators being particularly crucial in sparse signal recovery. We delve into the properties of scale and signed permutation invariant functions, delineating the computation of their proximity operators into three sequential steps: the $${\varvec{w}}$$ -step, r -step, and d -step. These steps collectively form a procedure termed as WRD, with the $${\varvec{w}}$$ -step being of utmost importance and requiring careful treatment. Leveraging this procedure, we present a method for explicitly and efficiently computing the proximity operator of $$(\ell _1/\ell _2)^2$$ and introduce an algorithm for the proximity operator of $$\ell _1/\ell _2$$ . Numerical experiments on sparse signal recovery corroborate the analysis and show that first-order methods equipped with these proximity operators outperform $$\ell _1$$ -based baselines in reconstruction accuracy.