A level set representation method for N-dimensional convex shape and applications
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ObjectSemantic SegmentationSimilar Papers 제목 키워드 기반
Convex Decomposition And Efficient Shape Representation Using Deformable Convex Polytopes
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decompositi…
Aligning Instance-Semantic Sparse Representation towards Unsupervised Object Segmentation and Shape Abstraction with Repeatable Primitives
Understanding 3D object shapes necessitates shape representation by object parts abstracted from results of instance and semantic segmentation. Promising shape representations enable computers to interpret a shape with m…
Instance SegmentationObjectSemantic SegmentationUnsupervised Object SegmentationConvex Shape Representation with Binary Labels for Image Segmentation: Models and Fast Algorithms
We present a novel and effective binary representation for convex shapes. We show the equivalence between the shape convexity and some properties of the associated indicator function. The proposed method has two advantag…
Image SegmentationSemantic SegmentationTheoretical bounds on data requirements for the ray-based classification
The problem of classifying high-dimensional shapes in real-world data grows in complexity as the dimension of the space increases. For the case of identifying convex shapes of different geometries, a new classification f…
ClassificationGeneral ClassificationCvxNet: Learnable Convex Decomposition
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometr…
3D ReconstructionImage to 3DRetrieval