Computing Data-Aware Diagonal Frame Decompositions

DOI10.48550/ARXIV.2610.35691MaRDI QIDQ7409154arXivFDO

Authors Andrea Ebner, Mathias Staudigl, Dirk Lorenz

Publication date 26 October 2026

Published in arXiv

Tldr We present a method for computing diagonal frame decompositions that capture signal characteristics, enabling efficient and stable representation and enhancement of signals or images. An optimization-based algorithm computes the decomposition with established convergence properties.

Full work available at URL https://doi.org/10.48550/ARXIV.2610.35691

arXiv classification

math.NAmath.OC

Cites work

• A convergence result for nonautonomous subgradient evolution equations and its application to the steepest descent exponential penalty trajectory in linear programming
• An introduction to frames and Riesz bases
• Asymptotic behavior of nonautonomous monotone and subgradient evolution equations
• Asymptotic behavior of penalty dynamics for constrained variational inequalities
• Compactly supported shearlets are optimally sparse
• Convergence of non-linear diagonal frame filtering for regularizing inverse problems
• Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
• Designing structured tight frames via an alternating projection method
• Efficient regularization with wavelet sparsity constraints in photoacoustic tomography
• Frame paths and error bounds for sigma-delta quantization
• Grassmannian frames with applications to coding and communication
• Imbedding Conditions for Hermitian and Normal Matrices
• Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition
• Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
• On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
• Optimality conditions for the nonlinear programming problems on Riemannian manifolds
• Proximal gradient method for nonsmooth optimization over the Stiefel manifold
• Recovering edges in ill-posed inverse problems: Optimality of curvelet frames.
• Regularization of Inverse Problems
• Regularization of Inverse Problems by Filtered Diagonal Frame Decomposition
• Robust low-rank matrix completion by Riemannian optimization
• Sampling with arbitrary sampling and reconstruction spaces and oblique dual frame vectors
• Scalable frames
• Simple bilevel programming and extensions
• Sobolev duals in frame theory and Sigma-Delta quantization
• Sparse regularization of inverse problems by operator-adapted frame thresholding
• Stochastic model-based minimization of weakly convex functions
• Ten Lectures on Wavelets
• The dual-tree complex wavelet transform
• The mathematics of computerized tomography
• The Radon transform and medical imaging
• Tikhonov regularized exterior penalty dynamics for constrained variational inequalities
• Viscosity Solutions of Minimization Problems
• Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods

This page was built for publication: Computing Data-Aware Diagonal Frame Decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409154)