收藏本站
收藏 | 投稿 | 手机打开
二维码
手机客户端打开本文

A Level Set Representation Method for N-Dimensional Convex Shape and Applications

Lingfeng Li  Shousheng Luo  Xue-Cheng Tai  Jiang Yang  
【摘要】:In this work, we present a new method for convex shape representation, which is regardless of the dimension of the concerned objects, using level-set approaches. To the best of our knowledge, the proposed prior is the first one which can work for high dimensional objects. Convexity prior is very useful for object completion in computer vision. It is a very challenging task to represent high dimensional convex objects. In this paper, we first 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. An algorithm based on the alternating direction method of multipliers is presented for the optimization problem. Numerical experiments are conducted to verify the effectiveness of the proposed representation method and algorithm.

知网文化
【相似文献】
中国期刊全文数据库 前19条
1 陈旭锋,管志成;Image segmentation based on Mumford-Shah functional[J];Journal of Zhejiang University Science;2004年01期
2 ;Multifeature Statistical TV Tracker[J];Chinese Journal of Systems Engineering and Electronics;1990年00期
3 ;Fuzzy entropy image segmentation based on particle swarm optimization[J];Progress in Natural Science;2008年09期
4 郭建双;张剑华;张少波;陈嘉伟;刘盛;;Furniture board segmentation based on multiple sensors and integer programming model[J];Optoelectronics Letters;2019年02期
5 袁玉波,徐成贤;IMPROVED RANDOMIZED ALGORITHM FOR THE EQUIVALENT 2-CATALOG SEGMENTATION PROBLEM[J];Numerical Mathematics A Journal of Chinese Universities(English Series);2005年02期
6 LI XiaoJuan;;Some properties of g-convex functions[J];Science China(Mathematics);2013年10期
7 熊革;肖启名;CHEUNG Wing-Sum;;Firey linear combinations of convex bodies[J];Journal of Shanghai University(English Edition);2009年02期
8 ;Construction of convex solutions for the second type of Feigenbaum's functional equations[J];Science in China(Series A:Mathematics);2009年08期
9 丁协平;GENERALIZED VECTOR QUASI-EQUILIBRIUM PROBLEMSIN LOCALLY G-CONVEX SPACES[J];Applied Mathematics and Mechanics(English Edition);2005年05期
10 陆伟刚,郭兴明,周世兴;OPTIMAL CONTROL OF HYPERBOLIC H-HEMIVARIATIONAL INEQUALITIES WITH STATE CONSTRAINTS[J];Applied Mathematics and Mechanics(English Edition);2004年07期
11 ;Global Optimization Approach to Non-convex Problems[J];The Journal of China Universities of Posts and Telecommunications;2004年03期
12 郭兴明,周世兴;OPTIMAL CONTROL OF PARABOLIC VARIATIONAL INEQUALITIES WITH STATE CONSTRAINT[J];Applied Mathematics and Mechanics(English Edition);2003年07期
13 刘太顺,任广斌;Growth theorem of convex mappings on bounded convex circular domains[J];Science in China,Ser.A;1998年02期
14 步尚全;THE ANALYTIC KREIN-MILMAN PROPERTY IN BANACH SPACES[J];Acta Mathematica Scientia;1998年01期
15 陈世国,刘家学;DUALITY FOR MULTIOBJECTIVE FRACTIONAL PROGRAMMING INVOLVING n-SET FUNCTIONS[J];Acta Mathematica Scientia;1998年S1期
16 D.Legg;D.Townsend;;CONTINUOUS AND DISCRETE N-CONVEX APPROXIMATIONS[J];Approximation Theory and Its Applications;1992年04期
17 吴卓人;ON THE CONVEX SUM OF STARLIKE FUNCTIONS[J];A Monthly Journal of Science;1983年01期
18 徐庆,于波;Homotopy Method for Non-convex Programming in Unbonded Set[J];Northeastern Mathematical Journal;2005年01期
19 张文俊 ,刘太顺;On growth and covering theorems of quasi-convex mappings in the unit ball of a complex Banach space[J];Science in China,Ser.A;2002年12期
中国重要会议论文全文数据库 前18条
1 Yanqiu Wang;Shihong Yue;;Ground Glass Nodule Segmentation Based on Regional Adaptive MRF Model[A];第三十九届中国控制会议论文集(6)[C];2020年
2 ;Concrete CT Image Segmentation Method Based on Markov Random Field[A];第二十九届中国控制会议论文集[C];2010年
3 ;On semi-E-Convex Function and semi-E-Convex Programming[A];中国企业运筹学学术交流大会论文集[C];2007年
4 X.Liu;Z.Y.Zhang;;Reliability-based design with the mixture of probability and non-probability convex models[A];中国计算力学大会2014暨第三届钱令希计算力学奖颁奖大会论文集[C];2014年
5 ;Convergence of Ishikawa Iterative Sequence with Mixed Errors for Asymptotically Quasi-nonexpansive Type mapping in convex Metric Spaces[A];第十届中国青年信息与管理学者大会论文集[C];2008年
6 尹传存;;Recent Development in Convex Bounds for Sums of Random Variables[A];第十届海峡两岸统计与概率研讨会摘要集[C];2016年
7 张树中;;Approximat ion Algorit hms for Non-Convex Optimization Problems[A];中国运筹学会第九届学术交流会论文集[C];2008年
8 王晓敏;;The Differentiability of Locally Lipschitz Functions on Locally Convex Spaces[A];第八届中国青年运筹信息管理学者大会论文集[C];2006年
9 Jingdong Diao;Jin Guo;Chang-Yin Sun;;Vision-Based Target Localization:A Distributed Convex Optimization Approach[A];第36届中国控制会议论文集(F)[C];2017年
10 Yanling Zheng;Yang Liu;Jinde Cao;;One-Layer Neural Network for Nonlinear Convex Programming with Linear Constraints[A];第37届中国控制会议论文集(B)[C];2018年
11 文开庭;;A New KKM Theorem in L-Convex Spaces and Some Applications[A];第三届贵州省自然科学优秀学术论文评选获奖论文集(2010年)[C];2010年
12 Wenwen Guan;Chaoyong Jin;Liping Xie;;Decentralized Robust Predictive Control for Convex Polyhedral Uncertain Large-Scale Systems[A];2015年中国智能自动化学术会议论文集(第二分册)[C];2015年
13 ;Duality of the conic convex constrained optimization problems in normed spaces[A];2006年中国运筹学会数学规划分会代表会议暨第六届学术会议论文集[C];2006年
14 Ying Chen;Yaogang Du;;Judging the Intersection of Convex Polygons by Bracket Method[A];2012年计算机应用与系统建模国际会议论文集[C];2012年
15 Shiqiang Du;Yuqing Shi;Weilan Wang;;L_(3/2) Sparsity Constrained Graph Non-negative Matrix Factorization for Image Representation[A];第26届中国控制与决策会议论文集[C];2014年
16 Hongye Xiong;Shihui Dong;Zhiping Wang;;Application of the new method in Supplier Selection[A];第32届中国控制与决策会议论文集(1)[C];2020年
17 ;Approximatively Second-order Cone Representable Sets And Functions[A];第六届中国不确定系统年会论文集[C];2008年
18 ;ANOTHER PROOF OF FUZZY POSYNOMIAL GEOMETRIC PROGRAMMING DUAL THEOREM[A];模糊数学和系统成果会论文集[C];1991年
中国博士学位论文全文数据库 前1条
1 Ali Abdullah Yahya;[D];合肥工业大学;2014年
中国知网广告投放
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62982499
  • 010-62783978