Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1910.14325

On the Proof of Fixed-Point Convergence for Plug-and-Play ADMM

Ruturaj G. Gavaskar·Kunal N. Chaudhury
View original source ↗Read source document ↗Export metadata ↓

Abstract

In most state-of-the-art image restoration methods, the sum of a data-fidelity and a regularization term is optimized using an iterative algorithm such as ADMM (alternating direction method of multipliers). In recent years, the possibility of using denoisers for regularization has been explored in several works. A popular approach is to formally replace the proximal operator within the ADMM framework with some powerful denoiser. However, since most state-of-the-art denoisers cannot be posed as a proximal operator, one cannot guarantee the convergence of these so-called plug-and-play (PnP) algorithms. In fact, the theoretical convergence of PnP algorithms is an active research topic. In this letter, we consider the result of Chan et al. (IEEE TCI, 2017), where fixed-point convergence of an ADMM-based PnP algorithm was established for a class of denoisers. We argue that the original proof is incomplete, since convergence is not analyzed for one of the three possible cases outlined in the paper. Moreover, we explain why the argument for the other cases does not apply in this case. We give a different analysis to fill this gap, which firmly establishes the original convergence theorem.

Explore related subjects

eess.IVcs.CV

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruturaj G. Gavaskar, Kunal N. Chaudhury. 2019-10-31. On the Proof of Fixed-Point Convergence for Plug-and-Play ADMM. https://doi.org/10.1109/lsp.2019.2950611

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

KELP: K-space-conditioned Estimation of Learned Sampling Patterns for Scan-Adaptive Multi-Coil MRI

Deep learning techniques have gained considerable attention for accelerating MRI acquisition while maintaining image quality. In this work, we present a convolutional neural network (CNN)-based framework for predicting scan-adaptive undersampling patterns directly from low-frequency multi-coil $k$-space data. Unlike approaches that optimize sampling patterns during training or rely on nearest-neighbor search at inference, our method is trained using precomputed scan-adaptive optimized masks as supervised labels and predicts a scan-specific sampling pattern in a single forward pass. The training procedure alternates between optimizing the sampling network and a reconstruction network, allowing the learned masks to adapt to reconstruction performance. Experiments on the fastMRI multi-coil knee dataset demonstrate competitive reconstruction quality compared with existing population- and scan-adaptive sampling approaches at $4\times$ and $8\times$ acceleration factors. In addition, the proposed method enables efficient scan-specific mask prediction with inference cost independent of the training dictionary size.

eess.IV↗
arXiv2026

LaminoDiff: Generative Computed Laminography via Near-Isotropic Spectral Supervision and Anisotropic Geometry

Computed Laminography (CL) is widely used for nondestructive inspection of extended planar objects, but its restricted angular coverage produces an anisotropic point spread function, missing-cone spectral incompleteness, and severe aliasing with interlayer leakage. This paper presents LaminoDiff, a physics-constrained diffusion framework for CL reconstruction. During training, a CT-derived near-isotropic supervision target is reconstructed from full-angle Computed Tomography (CT) projections physically degraded to match CL detector noise and focal-spot blur while retaining full angular coverage; it is withheld from inference. At inference, the reverse process uses only the CL observation. An Anisotropic Representation (AR) constructs depth-aware channels from three adjacent slices: a neighbor average, a center-neighbor residual, and the retained current slice, followed by directional in-plane feature extraction. Experiments on simulated and real multilayer printed circuit board data, including ball grid array and high-frequency stub samples, show that LaminoDiff improves artifact suppression, edge preservation, and depth stratification over analytic Feldkamp--Davis--Kress and representative learning-based baselines.

eess.IV↗
arXiv2026

IViT: A Novel Interpretable Visual Transformer for Skin Disease Detection

The clinical diagnosis of skin diseases is susceptible to interference from inter-class similarity of skin lesions, and over-reliance on clinicians'experience easily leads to subjective bias. Although existing deep learning aided diagnosis methods achieve competitive accuracy, they suffer from the black-box opacity of Vision Transformer (ViT) and poor adaptability to medical few-shot scenarios. Moreover, mainstream explainable algorithms generally face the bottleneck of significant accuracy degradation when improving interpretability. This paper proposes an interpretable ViT (IViT) constrained by Quadratic Programming (QP). The introduced pre-trained transfer learning adapts to few-shot feature extraction. A discrete QP feature selection framework is constructed to screen generic and discriminative features consistent with clinical diagnostic logic. A multi-objective loss function is designed to reduce feature redundancy and optimize activation distribution while preserving classification performance. Experimental results on six standard skin disease datasets show that IViT achieves an accuracy of 93.80%, only 0.21% lower than the baseline, with feature redundancy reduced by 29.5%. Its core activation regions are consistent with clinically concerned lesion areas. The proposed model balances accuracy and interpretability, providing a reliable solution for the clinical deployment of few-shot intelligent skin disease diagnosis.

eess.IV↗