A data-dependent regularization method based on the graph Laplacian
From MaRDI portal
Cites work
- A framelet-based image inpainting algorithm
- A generalized Krylov subspace method for _p-_q minimization
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Convex analysis and monotone operator theory in Hilbert spaces
- Deblurring Images
- Deep Convolutional Neural Network for Inverse Problems in Imaging
- Deep Learning
- Deep null space learning for inverse problems: convergence analysis and rates
- DRIP: deep regularizers for inverse problems
- Flexible Krylov methods for \(\ell_p\) regularization
- Fractional graph Laplacian for image reconstruction
- Fractional Tikhonov regularization for linear discrete ill-posed problems
- Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images
- Graph Laplacian for image deblurring
- Graphs and Discrete Dirichlet Spaces
- scientific article; zbMATH DE number 3876486 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Image recovery via nonlocal operators
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- Iterated fractional Tikhonov regularization
- Limited memory restarted ^p-^q minimization methods using generalized Krylov subspaces
- NETT: solving inverse problems with deep neural networks
- Nonlinear total variation based noise removal algorithms
- Nonlocal Linear Image Regularization and Supervised Segmentation
- Nonlocal Operators with Applications to Image Processing
- Nonstationary iterated thresholding algorithms for image deblurring
- On generalized iterated Tikhonov regularization with operator-dependent seminorms
- Principles of computerized tomography imaging
- Provably Convergent Plug-and-Play Quasi-Newton Methods
- Regularization by fractional filter methods and data smoothing
- Regularization preconditioners for frame-based image deblurring with reduced boundary artifacts
- Simple bounds for recovering low-complexity models
- Solving inverse problems using data-driven models
- Square smoothing regularization matrices with accurate boundary conditions
- The difficulty of computing stable and accurate neural networks: on the barriers of deep learning and Smale's 18th problem
- The generalized Lasso problem and uniqueness
- Uniformly convex neural networks and non-stationary iterated network Tikhonov (iNETT) method
- Variational methods in imaging
Cited in
(6)- A fractional graph \(\mathrm{La}+\varPsi\) approach to image reconstruction
- Convergence analysis and parameter estimation for the iterated Arnoldi-Tikhonov method
- On the convergence of the iterative regularization method assisted by the graph Laplacian with early stopping
- Iterated graph Laplacian for image restoration problems
- Randomized Krylov-Projected Iterated Tikhonov Regularization for Large-Scale Ill-posed Problems Under A Posteriori Stopping Rule
- Uniform Chebyshev approximations of functions satisfying a variation-type condition: reconstruction of time-varying signals on graphs
This page was built for publication: A data-dependent regularization method based on the graph Laplacian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000285)
