Chaoyan Huang
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
Chaoyan Huang has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Tieyong Zeng
Beijing Normal University-Hong Kong Baptist University, Zhuhai, China
7 shared publications - Tingting Wu
School of Science, Nanjing University of Posts and Telecommunications, Nanjing, People’s Republic of China
5 shared publications Tieyong Zeng
Department of Mathematics, the Chinese University of Hong Kong, Hong Kong
4 shared publications- Juncheng Li
School of Computer Science and Technology, East China Normal University, Shanghai, China
2 shared publications Tingting Wu
2 shared publicationsZhongming Wu
2 shared publications
Latest Publications
- 19 August 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (8) , 085010
Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
Imaging tasks are typically tackled using a structured optimization framework. This paper delves into a class of algorithms for difference-of-convex (DC) structured optimization, focusing on minimizing a DC function along with a possibly nonconvex function. Existing DC algorithms (DCAs) often fail to effectively handle nonconvex functions or exhibit slow convergence rates, hindering us from incorporating deep priors with theoretical guarantees in image processing tasks. We propose a novel inertial proximal DCA in Bregman geometry, named iBPDCA, designed to address nonconvex terms and enhance convergence speed through inertial techniques. We provide a detailed theoretical analysis, establishing both subsequential and global convergence of iBPDCA via the Kurdyka–Łojasiewicz property. Additionally, we introduce a plug-and-play (PnP) variant, PnP-iBPDCA, which employs a deep neural network-based prior for greater flexibility and robustness while ensuring theoretical convergence. We also establish that the Gaussian gradient step denoiser used in our method is equivalent to evaluating the Bregman proximal operator for an implicitly weakly convex functional. We extensively validate our method on Rician noise and phase retrieval. We demonstrate that iBPDCA surpasses existing state-of-the-art methods.
- 19 August 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (8) , 085010
Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
Imaging tasks are typically tackled using a structured optimization framework. This paper delves into a class of algorithms for difference-of-convex (DC) structured optimization, focusing on minimizing a DC function along with a possibly nonconvex function. Existing DC algorithms (DCAs) often fail to effectively handle nonconvex functions or exhibit slow convergence rates, hindering us from incorporating deep priors with theoretical guarantees in image processing tasks. We propose a novel inertial proximal DCA in Bregman geometry, named iBPDCA, designed to address nonconvex terms and enhance convergence speed through inertial techniques. We provide a detailed theoretical analysis, establishing both subsequential and global convergence of iBPDCA via the Kurdyka–Łojasiewicz property. Additionally, we introduce a plug-and-play (PnP) variant, PnP-iBPDCA, which employs a deep neural network-based prior for greater flexibility and robustness while ensuring theoretical convergence. We also establish that the Gaussian gradient step denoiser used in our method is equivalent to evaluating the Bregman proximal operator for an implicitly weakly convex functional. We extensively validate our method on Rician noise and phase retrieval. We demonstrate that iBPDCA surpasses existing state-of-the-art methods.
- 22 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematics of Data Science
- Vol. 7 (4) , 1729-1754
Deep Block Proximal Linearized Minimization Algorithm for Nonconvex Inverse Problems
Image restoration is typically addressed through nonconvex inverse problems, which are often solved using first-order blockwise splitting methods. In this paper, we consider a general type of nonconvex optimization model that captures many inverse image problems and present an inertial block proximal linearized minimization (iBPLM) algorithm. Our new method unifies the Jacobi-type parallel and the Gauss–Seidel-type alternating update rules and extends beyond these approaches. The inertial technique is also incorporated into each blockwise subproblem update, which can accelerate numerical convergence. Furthermore, we extend this framework with a plug-and-play variant (PnP-iBPLM) that integrates deep gradient denoisers, offering a flexible and robust solution for complex imaging tasks. We provide comprehensive theoretical analysis, demonstrating both subsequential and global convergence of the proposed algorithms. To validate our methods, we apply them to multiblock dictionary learning problems in image denoising and deblurring. Experimental results show that both iBPLM and PnP-iBPLM significantly enhance numerical performance and robustness in these applications.
- 22 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematics of Data Science
- Vol. 7 (4) , 1729-1754
Deep Block Proximal Linearized Minimization Algorithm for Nonconvex Inverse Problems
Image restoration is typically addressed through nonconvex inverse problems, which are often solved using first-order blockwise splitting methods. In this paper, we consider a general type of nonconvex optimization model that captures many inverse image problems and present an inertial block proximal linearized minimization (iBPLM) algorithm. Our new method unifies the Jacobi-type parallel and the Gauss–Seidel-type alternating update rules and extends beyond these approaches. The inertial technique is also incorporated into each blockwise subproblem update, which can accelerate numerical convergence. Furthermore, we extend this framework with a plug-and-play variant (PnP-iBPLM) that integrates deep gradient denoisers, offering a flexible and robust solution for complex imaging tasks. We provide comprehensive theoretical analysis, demonstrating both subsequential and global convergence of the proposed algorithms. To validate our methods, we apply them to multiblock dictionary learning problems in image denoising and deblurring. Experimental results show that both iBPLM and PnP-iBPLM significantly enhance numerical performance and robustness in these applications.
- 25 April 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 283
Fast MRI reconstruction: A thorough survey from single-modal to multi-modal
- 25 April 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 283
Fast MRI reconstruction: A thorough survey from single-modal to multi-modal
- 13 June 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 17 (2) , 1145-1181
Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
This paper investigates the convergence properties and applications of the three-operator splitting method, also known as the Davis–Yin splitting (DYS) method, integrated with extrapolation and plug-and-play (PnP) denoiser within a nonconvex framework. We first propose an extrapolated DYS method to effectively solve a class of structural nonconvex optimization problems that involve minimizing the sum of three possibly nonconvex functions. Our approach provides an algorithmic framework that encompasses both extrapolated forward–backward splitting and extrapolated Douglas–Rachford splitting methods. To establish the convergence of the proposed method, we rigorously analyze its behavior based on the Kurdyka–Łojasiewicz property, subject to some tight parameter conditions. Moreover, we introduce two extrapolated PnP-DYS methods with convergence guarantee, where the traditional regularization step is replaced by a gradient step–based denoiser. This denoiser is designed using a differentiable neural network and can be reformulated as the proximal operator of a specific nonconvex functional. We conduct extensive experiments on image deblurring and image superresolution problems, where our numerical results showcase the advantage of the extrapolation strategy and the superior performance of the learning-based model that incorporates the PnP denoiser in terms of achieving high-quality recovery images.
- 13 June 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 17 (2) , 1145-1181
Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
This paper investigates the convergence properties and applications of the three-operator splitting method, also known as the Davis–Yin splitting (DYS) method, integrated with extrapolation and plug-and-play (PnP) denoiser within a nonconvex framework. We first propose an extrapolated DYS method to effectively solve a class of structural nonconvex optimization problems that involve minimizing the sum of three possibly nonconvex functions. Our approach provides an algorithmic framework that encompasses both extrapolated forward–backward splitting and extrapolated Douglas–Rachford splitting methods. To establish the convergence of the proposed method, we rigorously analyze its behavior based on the Kurdyka–Łojasiewicz property, subject to some tight parameter conditions. Moreover, we introduce two extrapolated PnP-DYS methods with convergence guarantee, where the traditional regularization step is replaced by a gradient step–based denoiser. This denoiser is designed using a differentiable neural network and can be reformulated as the proximal operator of a specific nonconvex functional. We conduct extensive experiments on image deblurring and image superresolution problems, where our numerical results showcase the advantage of the extrapolation strategy and the superior performance of the learning-based model that incorporates the PnP denoiser in terms of achieving high-quality recovery images.
- 13 May 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 477
Medical image reconstruction with multi-level deep learning denoiser and tight frame regularization
- 13 May 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 477
Medical image reconstruction with multi-level deep learning denoiser and tight frame regularization
- Open Access
- 16 April 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 99 (2) , 1-28
An Efficient Inexact Gauss–Seidel-Based Algorithm for Image Restoration with Mixed Noise
A challenge in image restoration is to recover a clear image from the blurry observation in the presence of different types of noise. There are few works addressing image deblurring under mixed noise. To handle this issue, we propose a general model based on classical wavelet tight frame regularization. We utilize a convexity-preserving term to obtain a component-wise convex model under a mild condition. Indeed, to reduce the cost of solving subproblems, the inexact Gauss–Seidel-based majorized semi-proximal alternating direction method of multipliers (sGS-imsPADMM) with relative error control is developed. Besides, the global convergence of sGS-imsPADMM is demonstrated. Numerical results for the image restoration problems show that the proposed model and solving approach are superior to some state-of-the-art methods both in numerical analysis and visual quality.
- 16 April 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 99 (2) , 1-28
Open AccessAn Efficient Inexact Gauss–Seidel-Based Algorithm for Image Restoration with Mixed Noise
A challenge in image restoration is to recover a clear image from the blurry observation in the presence of different types of noise. There are few works addressing image deblurring under mixed noise. To handle this issue, we propose a general model based on classical wavelet tight frame regularization. We utilize a convexity-preserving term to obtain a component-wise convex model under a mild condition. Indeed, to reduce the cost of solving subproblems, the inexact Gauss–Seidel-based majorized semi-proximal alternating direction method of multipliers (sGS-imsPADMM) with relative error control is developed. Besides, the global convergence of sGS-imsPADMM is demonstrated. Numerical results for the image restoration problems show that the proposed model and solving approach are superior to some state-of-the-art methods both in numerical analysis and visual quality.
- Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 18 (1) , 286-310
Finding robust minimizer for non-convex phase retrieval
The phase retrieval task has received considerable attention in recent years. Here, phase retrieval refers to the problem of recovering the clear image from magnitude-only data of its Fourier transform, or other linear transforms. As the observed magnitude signal is usually corrupted by heavy noise, retrieving the original object is rather difficult. In this paper, we investigate a regularization-based framelet method to recover the phase information and alleviate the influence of noise. Indeed, since phase retrieval is usually modeled by a non-convex model, how to find the solution efficiently is an intricate challenge. For this reason, we first reformulate the objective function as the difference between two convex functions. By introducing the boosted difference of convex algorithm (BDCA), the proposed scheme has good performance in handling the phase retrieval problem. Theoretically, we also present the convergence analysis of the numerical algorithm. To exhibit the effectiveness of our approach, we consider two classical regularizers with the proposed framework. Besides, two different measurement models are carefully studied to illustrate the robustness of our scheme. Numerical experiments demonstrate clearly that the proposed framelet method is effective and robust in tackling the non-convex phase retrieval task.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 18 (1) , 286-310
Open AccessFinding robust minimizer for non-convex phase retrieval
The phase retrieval task has received considerable attention in recent years. Here, phase retrieval refers to the problem of recovering the clear image from magnitude-only data of its Fourier transform, or other linear transforms. As the observed magnitude signal is usually corrupted by heavy noise, retrieving the original object is rather difficult. In this paper, we investigate a regularization-based framelet method to recover the phase information and alleviate the influence of noise. Indeed, since phase retrieval is usually modeled by a non-convex model, how to find the solution efficiently is an intricate challenge. For this reason, we first reformulate the objective function as the difference between two convex functions. By introducing the boosted difference of convex algorithm (BDCA), the proposed scheme has good performance in handling the phase retrieval problem. Theoretically, we also present the convergence analysis of the numerical algorithm. To exhibit the effectiveness of our approach, we consider two classical regularizers with the proposed framework. Besides, two different measurement models are carefully studied to illustrate the robustness of our scheme. Numerical experiments demonstrate clearly that the proposed framelet method is effective and robust in tackling the non-convex phase retrieval task.
- 24 July 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 16 (3) , 1177-1194
Spherical Image Inpainting with Frame Transformation and Data-Driven Prior Deep Networks
Spherical image processing has been widely applied in many important fields, such as omnidirectional vision for autonomous cars, global climate modeling, and medical imaging. It is nontrivial to extend an algorithm developed for flat images to the spherical ones. In this work, we focus on the challenging task of spherical image inpainting with a deep learning-based regularizer. Instead of a naive application of existing models for planar images, we employ a fast directional spherical Haar framelet transform and develop a novel optimization framework based on a sparsity assumption of the framelet transform. Furthermore, by employing progressive encoder-decoder architecture, a new and better-performed deep CNN denoiser is carefully designed and works as an implicit regularizer. Finally, we use a plug-and-play method to handle the proposed optimization model, which can be implemented efficiently by training the CNN denoiser prior. Numerical experiments are conducted and show that the proposed algorithms can greatly recover damaged spherical images and achieve the best performance over purely using a deep learning denoiser and a plug-and-play model.
- 24 July 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 16 (3) , 1177-1194
Spherical Image Inpainting with Frame Transformation and Data-Driven Prior Deep Networks
Spherical image processing has been widely applied in many important fields, such as omnidirectional vision for autonomous cars, global climate modeling, and medical imaging. It is nontrivial to extend an algorithm developed for flat images to the spherical ones. In this work, we focus on the challenging task of spherical image inpainting with a deep learning-based regularizer. Instead of a naive application of existing models for planar images, we employ a fast directional spherical Haar framelet transform and develop a novel optimization framework based on a sparsity assumption of the framelet transform. Furthermore, by employing progressive encoder-decoder architecture, a new and better-performed deep CNN denoiser is carefully designed and works as an implicit regularizer. Finally, we use a plug-and-play method to handle the proposed optimization model, which can be implemented efficiently by training the CNN denoiser prior. Numerical experiments are conducted and show that the proposed algorithms can greatly recover damaged spherical images and achieve the best performance over purely using a deep learning denoiser and a plug-and-play model.
- 5 June 2023
- Published by Elsevier in Pattern Recognition
- Vol. 143
Single-particle reconstruction in cryo-EM based on three-dimensional weighted nuclear norm minimization
- 5 June 2023
- Published by Elsevier in Pattern Recognition
- Vol. 143
Single-particle reconstruction in cryo-EM based on three-dimensional weighted nuclear norm minimization
- Open Access
- 26 April 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (9) , 2056
Review of Quaternion-Based Color Image Processing Methods
Images are a convenient way for humans to obtain information and knowledge, but they are often destroyed throughout the collection or distribution process. Therefore, image processing evolves as the need arises, and color image processing is a broad and active field. A color image includes three distinct but closely related channels (red, green, and blue (RGB)). Compared to directly expressing color images as vectors or matrices, the quaternion representation offers an effective alternative. There are several papers and works on this subject, as well as numerous definitions, hypotheses, and methodologies. Our observations indicate that the quaternion representation method is effective, and models and methods based on it have rapidly developed. Hence, the purpose of this paper is to review and categorize past methods, as well as study their efficacy and computational examples. We hope that this research will be helpful to academics interested in quaternion representation.
- 26 April 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (9) , 2056
Open AccessReview of Quaternion-Based Color Image Processing Methods
Images are a convenient way for humans to obtain information and knowledge, but they are often destroyed throughout the collection or distribution process. Therefore, image processing evolves as the need arises, and color image processing is a broad and active field. A color image includes three distinct but closely related channels (red, green, and blue (RGB)). Compared to directly expressing color images as vectors or matrices, the quaternion representation offers an effective alternative. There are several papers and works on this subject, as well as numerous definitions, hypotheses, and methodologies. Our observations indicate that the quaternion representation method is effective, and models and methods based on it have rapidly developed. Hence, the purpose of this paper is to review and categorize past methods, as well as study their efficacy and computational examples. We hope that this research will be helpful to academics interested in quaternion representation.