A convergent least-squares regularized blind deconvolution approach
type: Item
instance of: scholarly article
title: A convergent least-squares regularized blind deconvolution approach
zbMATH Open document ID: 1391.94064
author: A. Cornelio
author: F. Porta
author: M. Prato
published in: Applied Mathematics and Computation
publication date: 2018-06-07T00:00:00Z
full work available at URL: http://hdl.handle.net/11380/1063871
Mathematics Subject Classification ID: 94A08
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 6881712
zbMATH Keywords: blind deconvolution
zbMATH Keywords: regularization
zbMATH Keywords: least squares problems
zbMATH Keywords: optimization methods
describes a project that uses: UNLocBoX
MaRDI profile type: Publication
OpenAlex ID: W1976851246
cites work: Q3843144
cites work: Parameter Estimation for Blind and Non-Blind Deblurring Using Residual Whiteness Measures
cites work: Parametric Blur Estimation for Blind Restoration of Natural Images: Linear Motion and Out-of-Focus
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: Proximal Splitting Methods in Signal Processing
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: On semi- and subanalytic geometry
cites work: On gradients of functions definable in o-minimal structures
cites work: Deblurring Images
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Implementation of an optimal first-order method for strongly convex total variation regularization
cites work: Q4209222
cites work: A unified convergence analysis of block successive minimization methods for nonsmooth optimization
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
cites work: Inexact block coordinate descent methods with application to non-negative matrix factorization
cites work: A scaled gradient projection method for constrained image deblurring
cites work: Nonnegative image reconstruction from sparse Fourier data: a new deconvolution algorithm
cites work: Two-Point Step Size Gradient Methods
cites work: New adaptive stepsize selections in gradient methods
cites work: A new semiblind deconvolution approach for Fourier-based image restoration: an application in astronomy
cites work: A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3320132
cites work: Blind and Semi-Blind Deblurring of Natural Images
cites work: Preconditioned iterative regularization in Banach spaces
cites work: Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle
cites work: Q3331506
cites work: Nonnegative least-squares image deblurring: improved gradient projection approaches
cites work: Efficient gradient projection methods for edge-preserving removal of Poisson noise
cites work: Projected Gradient Methods for Nonnegative Matrix Factorization
cites work: Newton's Method for Large Bound-Constrained Optimization Problems
cites work: Regularization methods for the solution of inverse problems in solar X-ray and imaging spectroscopy
DOI: 10.1016/J.AMC.2015.02.048
description: scientific article; zbMATH DE number 6881712