Efficient nonsmooth nonconvex optimization for image restoration and segmentation

DOI10.1007/s10915-014-9860-yzbMath1320.65035OpenAlexW1967404442MaRDI QIDQ2515532

Miyoun Jung, Myungjoo Kang

Publication date: 5 August 2015

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-014-9860-y

zbMATH Keywords

numerical exampleimage segmentationaugmented Lagrangian methodimage restorationoptimization algorithm\(L^1\) fidelity measurenonconvex regularizermultistage convex relaxation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Existence theories for optimal control problems involving partial differential equations (49J20)

Related Items

Hemivariational inequalities on graphs ⋮ Variational image colorization models using higher-order Mumford-Shah regularizers ⋮ On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration ⋮ On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints ⋮ Automatic extraction of cell nuclei using dilated convolutional network ⋮ Non-convex and non-smooth variational decomposition for image restoration ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise ⋮ Piecewise-smooth image segmentation models with \(L^1\) data-fidelity terms

Uses Software

• RecPF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Operator splittings, Bregman methods and frame shrinkage in image processing
• Variational image segmentation models involving non-smooth data-fidelity terms
• Geometric applications of the split Bregman method: segmentation and surface reconstruction
• A new fast multiphase image segmentation algorithm based on nonconvex regularizer
• A fourth order accurate discretization for the Laplace and heat equations on arbitrary domains, with applications to the Stefan problem
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• A variational approach to remove outliers and impulse noise
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• Weakly constrained minimization: application to the estimation of images and signals involving constant regions
• Optimal approximations by piecewise smooth functions and associated variational problems
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• Approximation of functional depending on jumps by elliptic functional via t-convergence
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Iteratively reweighted least squares minimization for sparse recovery
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The Concave-Convex Procedure
• Active contours without edges
• Fast, robust total variation-based reconstruction of noisy, blurred images
• Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
• On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
• Aspects of Total Variation RegularizedL¹Function Approximation
• Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
• Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Convex Analysis
• Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares