Kernel FISTA and Application to Image Deblurring

Abstract Image deblurring is a challenging inverse problem due to its ill-posed nature, leading to various strategies for enhancing stability. The Rudin-Osher-Fatemi (ROF) model is a seminal framework recognized for its effectiveness in image denoising and deblurring, inspiring numerous variational techniques. Despite existing approaches focusing on solving analysis-based, synthesis-based, and balanced models, achieving a more accurate solution to the ROF model remains an open question. The Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) is a widely applied numerical algorithm known for its efficiency in large-scale optimization. However, FISTA’s effectiveness in solving the ROF model is constrained because it is primarily designed for synthesis models when the sparsifying transform is orthonormal. To overcome this limitation, we propose a novel Kernel FISTA (K-FISTA), integrated with a structured Pseudoinverse Image Formulation (PIF) model. In practice, our approach outperforms classical methods like ADMM and sPADMM by achieving lower final energy values, offering a more accurate numerical approximation to the common minimizer while maintaining fast convergence. Extensive experiments validate the effectiveness of the K-FISTA method in image deblurring, and we provide theoretical guarantees for its convergence.

Authors

Institutions

Publication Details

Journal
Journal of Scientific Computing
Published
2025-12-05
DOI
https://doi.org/10.1007/s10915-025-03137-z
Primary Topic
Advanced Image Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Kernel FISTA and Application to Image Deblurring

Te Qi, Tieyong Zeng, Yingying Fang, Zeyu Li et al.
Journal of Scientific Computing
Advanced Image Processing Techniques
article

Kernel FISTA and Application to Image Deblurring

Te Qi, Tieyong Zeng, Yingying Fang, Zeyu Li, Hao Zhang
article en

Abstract

Abstract Image deblurring is a challenging inverse problem due to its ill-posed nature, leading to various strategies for enhancing stability. The Rudin-Osher-Fatemi (ROF) model is a seminal framework recognized for its effectiveness in image denoising and deblurring, inspiring numerous variational techniques. Despite existing approaches focusing on solving analysis-based, synthesis-based, and balanced models, achieving a more accurate solution to the ROF model remains an open question. The Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) is a widely applied numerical algorithm known for its efficiency in large-scale optimization. However, FISTA’s effectiveness in solving the ROF model is constrained because it is primarily designed for synthesis models when the sparsifying transform is orthonormal. To overcome this limitation, we propose a novel Kernel FISTA (K-FISTA), integrated with a structured Pseudoinverse Image Formulation (PIF) model. In practice, our approach outperforms classical methods like ADMM and sPADMM by achieving lower final energy values, offering a more accurate numerical approximation to the common minimizer while maintaining fast convergence. Extensive experiments validate the effectiveness of the K-FISTA method in image deblurring, and we provide theoretical guarantees for its convergence.

Journal of Scientific ComputingVol. 106(1)
Beijing Normal-Hong Kong Baptist University (CN), Hong Kong Baptist University (HK), Chinese University of Hong Kong (HK), Nanfang Hospital (CN), Institute for Advanced Study (DE), Imperial College London (GB)
Hong Kong Baptist University
Openalex Percentile: Top 60%
Advanced Image Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.