A Kronecker approximation with a convex constrained optimization method for blind image restoration
From MaRDI portal
Publication:694158
DOI10.1007/S11590-011-0370-7zbMATH Open1259.90091OpenAlexW2083582143MaRDI QIDQ694158FDOQ694158
Authors: A. Bouhamidi, Khalide Jbilou 
Publication date: 11 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0370-7
Recommendations
- Kronecker product approximations for image restoration with new mean boundary conditions
- Kronecker product approximation for the total variation regularization in image restoration
- Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
- Constrained iterations for blind deconvolution and convexity issues
- Kronecker product approximations for image restoration with whole-sample symmetric boundary conditions
- Blind Deconvolution Using Convex Programming
- A robust algorithm for blind total variation restoration
- Kronecker product approximations for image restoration with anti-reflective boundary conditions
- Constrained numerical optimization methods for blind deconvolution
- A Kullback–Leibler Divergence Approach to Blind Image Restoration
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Algorithm 813
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique for Newton’s Method
- Title not available (Why is that?)
- Convex programming in Hilbert space
- Title not available (Why is that?)
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
- On the Goldstein-Levitin-Polyak gradient projection method
- A gradient-based continuous method for large-scale optimization problems
- On the Barzilai and Borwein choice of steplength for the gradient method
- A bilinear algorithm for sparse representations
- Inexact spectral projected gradient methods on convex sets
- Kronecker product and SVD approximations in image restoration
- Bayesian Methods in Nonlinear Digital Image Restoration
- Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Regularization methods for the stable solution of inverse problems
- The gradient projection method with exact line search
- Algorithms with high order convergence speed for blind source extraction
Cited In (9)
- Kronecker product approximation for the total variation regularization in image restoration
- Polynomial computations for blind image deconvolution
- Title not available (Why is that?)
- A numerical method on the mixed solution of matrix equation \(\sum_{i = 1}^t A_i X_i B_i = E\) with sub-matrix constraints and its application
- Best Kronecker product approximation of the blurring operator in three dimensional image restoration problems
- Structured FISTA for image restoration.
- Kronecker product approximations for image restoration with anti-reflective boundary conditions
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
- An iteration method to solve multiple constrained least squares problems
Uses Software
This page was built for publication: A Kronecker approximation with a convex constrained optimization method for blind image restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694158)
