Convex object(s) characterization and segmentation using level set function

DOI10.1007/S10851-021-01056-WOpenAlexW3215861390MaRDI QIDQ2127274FDOQ2127274

Authors: Shousheng Luo, Xue-Cheng Tai, Roland Glowinski 

Publication date: 20 April 2022

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-021-01056-w

Recommendations

• A new binary representation method for shape convexity and application to image segmentation
• A level set representation method for \(N\)-dimensional convex shape and applications
• Image segmentation with partial convexity shape prior using discrete conformality structures
• Topology- and convexity-preserving image segmentation based on image registration
• Convex non-convex segmentation over surfaces

zbMATH Keywords

ADMMimage segmentationlevel set methodconvex shape prior

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Geodesic active contours
• An algorithm for total variation minimization and applications
• Curvature formulas for implicit curves and surfaces
• Optimal approximations by piecewise smooth functions and associated variational problems
• Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• A fast sweeping method for Eikonal equations
• A fast marching level set method for monotonically advancing fronts.
• Active contours without edges
• The Discrete Cosine Transform
• On an inequality of C. Sundberg: a computational investigation via nonlinear programming
• Title not available (Why is that?)
• Segmentation under Occlusions Using Selective Shape Prior
• A fast algorithm for Euler's elastica model using augmented Lagrangian method
• Image segmentation using Euler's elastica as the regularization
• The Convexity of a Domain and the Superharmonicity of the Signed Distance Function
• Title not available (Why is that?)
• Segmentation of Overlapping Elliptical Objects in Silhouette Images
• Augmented Lagrangian method for an Euler's elastica based segmentation model that promotes convex contours
• Convexity Shape Prior for Level Set-Based Image Segmentation Method
• An effective region force for some variational models for learning and clustering
• New region force for variational models in image segmentation and high dimensional data clustering
• A simple fast algorithm for minimization of the elastica energy combining binary and level set representations

Cited In (3)

• Superiorized iteration algorithm for CT image simultaneous reconstruction and segmentation
• A binary characterization method for shape convexity and applications
• The largest convex patches: A boundary-based method for obtaining object parts

Uses Software

• GrabCut

This page was built for publication: Convex object(s) characterization and segmentation using level set function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127274)