A level set representation method for N-dimensional convex shape and applications

03/21/2020
by   Lingfeng Li, et al.
16

In this work, we present a new efficient method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. Convexity prior is very useful for object completion in computer vision. It is a very challenging task to design an efficient method for high dimensional convex objects representation. In this paper, we prove that the convexity of the considered object is equivalent to the convexity of the associated signed distance function. Then, the second order condition of convex functions is used to characterize the shape convexity equivalently. We apply this new method to two applications: object segmentation with convexity prior and convex hull problem (especially with outliers). For both applications, the involved problems can be written as a general optimization problem with three constraints. Efficient algorithm based on alternating direction method of multipliers is presented for the optimization problem. Numerical experiments are conducted to verify the effectiveness and efficiency of the proposed representation method and algorithm.

READ FULL TEXT

page 13

page 14

page 15

page 16

page 19

research
02/22/2020

Convex Shape Representation with Binary Labels for Image Segmentation: Models and Fast Algorithms

We present a novel and effective binary representation for convex shapes...
research
08/09/2019

Convex hull algorithms based on some variational models

Seeking the convex hull of an object is a very fundamental problem arisi...
research
03/22/2022

Multiple Convex Objects Image Segmentation via Proximal Alternating Direction Method of Multipliers

This paper focuses on the issue of image segmentation with convex shape ...
research
08/17/2022

Correcting Convexity Bias in Function and Functional Estimate

A general framework with a series of different methods is proposed to im...
research
01/08/2021

How type of Convexity of the Core function affects the Csiszár f-divergence functional

We investigate how the type of Convexity of the Core function affects th...
research
01/05/2021

Handling Hard Affine SDP Shape Constraints in RKHSs

Shape constraints, such as non-negativity, monotonicity, convexity or su...
research
02/02/2016

A-expansion for multiple "hedgehog" shapes

Overlapping colors and cluttered or weak edges are common segmentation p...

Please sign up or login with your details

Forgot password? Click here to reset