Non-unique solutions for a convex TV – L1 problem in image segmentation

DOI10.1080/00036811.2018.1489962zbMath1434.90136OpenAlexW2884947540MaRDI QIDQ5207781

No author found.

Publication date: 13 January 2020

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036811.2018.1489962

zbMATH Keywords

convex optimizationimage segmentationmean curvature motion

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10) Variational inequalities (49J40)

Related Items (1)

Anisotropic Chan-Vese segmentation

Cites Work

• Nonlinear total variation based noise removal algorithms
• Regularity for solutions of the total variation denoising problem
• A characterization of convex calibrable sets in \(\mathbb R^N\) with respect to anisotropic norms
• On a weighted total variation minimization problem
• A geometric model for active contours in image processing
• Geodesic active contours
• An algorithm for total variation minimization and applications
• A characterization of convex calibrable sets in \(\mathbb R^N\)
• An algorithm for mean curvature motion
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• The Discontinuity Set of Solutions of the TV Denoising Problem and Some Extensions
• Active contours without edges
• Aspects of Total Variation RegularizedL¹Function Approximation
• A study in the BV space of a denoising-deblurring variational problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-unique solutions for a convex TV – L¹ problem in image segmentation