Convex non-convex image segmentation
DOI10.1007/s00211-017-0916-4zbMath1453.65141OpenAlexW2752392650MaRDI QIDQ2413469
Alessandro Lanza, Fiorella Sgallari, Serena Morigi, Raymond Honfu Chan
Publication date: 10 April 2018
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-017-0916-4
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical methods for variational inequalities and related problems (65K15)
Related Items (15)
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Convex image denoising via non-convex regularization with parameter selection
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Augmented Lagrangian method for total variation restoration with non-quadratic fidelity
- Multiphase soft segmentation with total variation and \(H^{1}\) regularization
- Completely convex formulation of the Chan-Vese image segmentation model
- Square smoothing regularization matrices with accurate boundary conditions
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- Threshold dynamics for the piecewise constant Mumford-Shah functional
- Constrained TV\(_p\)-\(\ell_2\) model for image restoration
- A Two-Stage Image Segmentation Method Using a Convex Variant of the Mumford--Shah Model and Thresholding
- A New Multiscale Representation for Shapes and Its Application to Blood Vessel Recovery
- Optimal approximations by piecewise smooth functions and associated variational problems
- A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
- Convex Image Denoising via Non-Convex Regularization
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- A binary level set model and some applications to Mumford-Shah image segmentation
- A Multiphase Image Segmentation Method Based on Fuzzy Region Competition
- Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
- Deblurring Methods Using Antireflective Boundary Conditions
- Optimization and nonsmooth analysis
- Variational Analysis
- Active contours without edges
- Edge-preserving and scale-dependent properties of total variation regularization
- Sparse Signal Estimation by Maximally Sparse Convex Optimization
- Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- Unsupervised Multiphase Segmentation: A Phase Balancing Model
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Convex Analysis
This page was built for publication: Convex non-convex image segmentation