Second-order Cone Programming Methods for Total Variation-Based Image Restoration
From MaRDI portal
Publication:5470334
DOI10.1137/040608982zbMath1094.68108OpenAlexW2061979078WikidataQ113079390 ScholiaQ113079390MaRDI QIDQ5470334
Publication date: 30 May 2006
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040608982
total variationdomain decompositioninterior-point methodsimage denoisingnested dissectionsecond-order cone programming
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Interior-point methods (90C51)
Related Items (40)
The parameter-Newton iteration for the second-order cone linear complementarity problem ⋮ Wavelet-based minimal-energy approach to image restoration ⋮ Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems ⋮ Algorithms and software for total variation image reconstruction via first-order methods ⋮ Iterative total variation regularization with non-quadratic fidelity ⋮ Multiresolution Parameter Choice Method for Total Variation Regularized Tomography ⋮ A new fast algorithm for constrained four-directional total variation image denoising problem ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Duality-based algorithms for total-variation-regularized image restoration ⋮ A fast fixed point algorithm for total variation deblurring and segmentation ⋮ On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration ⋮ Image recovery via nonlocal operators ⋮ Image restoration based on the hybrid total-variation-type model ⋮ Shrinking gradient descent algorithms for total variation regularized image denoising ⋮ New time dependent pretreat models based on total variational image restoration ⋮ Geometry of total variation regularized \(L^p\)-model ⋮ Proximity algorithms for the L1/TV image denoising model ⋮ Ambiguous Joint Chance Constraints Under Mean and Dispersion Information ⋮ Hardness Results for Structured Linear Systems ⋮ Implementation of an optimal first-order method for strongly convex total variation regularization ⋮ Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework ⋮ Hybrid variational model based on alternating direction method for image restoration ⋮ Restoration of matrix fields by second-order cone programming ⋮ Surrogate functionals and thresholding for inverse interface problems ⋮ On a nonlinear multigrid algorithm with primal relaxation for the image total variation minimisation ⋮ Numerical Methods and Applications in Total Variation Image Restoration ⋮ Simplified Energy Landscape for Modularity Using Total Variation ⋮ Some first-order algorithms for total variation based image restoration ⋮ Mathematical modeling of textures: application to color image decomposition with a projected gradient algorithm ⋮ A projection method based on the splitting Bregman iteration for the image denoising ⋮ Enhancing sparsity by reweighted \(\ell _{1}\) minimization ⋮ An adaptive fixed-point proximity algorithm for solving total variation denoising models ⋮ An accelerated version of alternating direction method of multipliers for TV minimization in EIT ⋮ Convex Hodge decomposition and regularization of image flows ⋮ Variational Methods for Denoising Matrix Fields ⋮ Bounded Variation Regularization Using Line Sections ⋮ Efficient Threshold Selection for Multivariate Total Variation Denoising ⋮ Alternating method based on framelet l0-norm and TV regularization for image restoration ⋮ A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone. ⋮ An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications
This page was built for publication: Second-order Cone Programming Methods for Total Variation-Based Image Restoration
