Brezinski Inverse and Geometric Product-Based Steffensen's Methods for Image Reverse Filtering
This work develops extensions of Steffensen's method to provide new tools for solving the semi-blind image reverse filtering problem. Two extensions are presented: a parametric Steffensen's method for accelerating the Mann iteration, and a family of 12 Steffensen's methods for vector variables. The development is based on Brezinski inverse and geometric product vector inverse. Variants of these methods are presented with adaptive parameter setting and first-order method acceleration. Implementation details, complexity, and convergence are discussed, and the proposed methods are shown to generalize existing algorithms. A comprehensive study of 108 variants of the vector Steffensen's methods is presented in the Supplementary Material. Representative results and comparison with current state-of-the-art methods demonstrate that the vector Steffensen's methods are efficient and effective tools in reversing the effects of commonly used filters in image processing.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stochastic Steffensen method
Is it possible for a first-order method, i.e., only first derivatives allowed, to be quadratically convergent? For univariate loss functions, the answer is yes -- the Steffensen method avoids second derivatives and is st…
Stochastic OptimizationGeneralized Inverses of Matrix Products: From Fundamental Subspaces to Randomized Decompositions
We investigate the Moore-Penrose pseudoinverse and generalized inverse of a matrix product $A=CR$ to establish a unifying framework for generalized and randomized matrix inverses. This analysis is rooted in first princip…
An Element-wise RSAV Algorithm for Unconstrained Optimization Problems
We present a novel optimization algorithm, element-wise relaxed scalar auxiliary variable (E-RSAV), that satisfies an unconditional energy dissipation law and exhibits improved alignment between the modified and the orig…
On Technical Bases and Surplus in Life Insurance
We revisit surplus on general life insurance contracts, represented by Markov models. We classify technical bases in terms of boundary conditions in Thiele's equation(s), allowing more general regulations than Scandinavi…
No More DeLuLu: Physics-Inspired Kernel Networks for Geometrically-Grounded Neural Computation
We introduce the yat-product, a kernel operator combining quadratic alignment with inverse-square proximity. We prove it is a Mercer kernel, analytic, Lipschitz on bounded domains, and self-regularizing, admitting a uniq…