A binary characterization method for shape convexity and applications

DOI10.1016/J.APM.2023.06.008MaRDI QIDQ6072884zbMATH OpenFDO

Authors Shousheng Luo, Jinfeng Chen, Yunhai Xiao, Xue-Cheng Tai

Publication date 13 October 2023

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.11395

zbMATH Keywords

binary methodconvex hull computationconvexity priorobject(s) segmentationproximal alternating direction method of multipliers

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: Convexity prior is one of the main cue for human vision and shape completion with important applications in image processing, computer vision. This paper focuses on characterization methods for convex objects and applications in image processing. We present a new method for convex objects representations using binary functions, that is, the convexity of a region is equivalent to a simple quadratic inequality constraint on its indicator function. Models are proposed firstly by incorporating this result for image segmentation with convexity prior and convex hull computation of a given set with and without noises. Then, these models are summarized to a general optimization problem on binary function(s) with the quadratic inequality. Numerical algorithm is proposed based on linearization technique, where the linearized problem is solved by a proximal alternating direction method of multipliers with guaranteed convergent. Numerical experiments demonstrate the efficiency and effectiveness of the proposed methods for image segmentation and convex hull computation in accuracy and computing time.

Cites work

• A level set representation method for N-dimensional convex shape and applications
• A new binary representation method for shape convexity and application to image segmentation
• A new variational approach based on level-set function for convex hull problem with outliers
• Active contours without edges
• An Edge-Weighted Centroidal Voronoi Tessellation Model for Image Segmentation
• Augmented Lagrangian method for an Euler's elastica based segmentation model that promotes convex contours
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex object(s) characterization and segmentation using level set function
• Convexity Shape Prior for Level Set-Based Image Segmentation Method
• Curvature formulas for implicit curves and surfaces
• Deformable models for image segmentation: a critical review of achievements and future challenges
• Hankel matrix rank minimization with applications to system identification and realization
• Image segmentation using a local GMM in a variational framework
• Mean Curvature and Asymptotic Volume of Small Balls
• Optimal approximations by piecewise smooth functions and associated variational problems
• The quickhull algorithm for convex hulls

Cited in

(4)

• Convexity properties in binary detection problems
• Connected-component preserving image segmentation using the iterative convolution-thresholding method
• Image vectorization with depth: convexified shape layers with depth ordering
• Fuzzy circularity: a new fuzzy shape-based descriptor of the object

This page was built for publication: A binary characterization method for shape convexity and applications

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