arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.09600math.NAcs.CVcs.NAeess.IV

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

Henan University(河南大学);Hong Kong Baptist University(香港浸会大学);Hong Kong University of Science and Technology(香港科技大学)

Shousheng Luo, Xue-Cheng Tai, Yang Wang

英文摘要:

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 advantages. Firstly, the representation is based on a simple inequality constraint on the binary function rather than the definition of convex shapes, which allows us to obtain efficient algorithms for various applications with convexity prior. Secondly, this method is independent of the dimension of the concerned shape. In order to show the effectiveness of the proposed representation approach, we incorporate it with a probability based model for object segmentation with convexity prior. Efficient algorithms are given to solve the proposed models using Lagrange multiplier methods and linear approximations. Various experiments are given to show the superiority of the proposed methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑