Convexity rule for shape decomposition based on discrete contour evolution

被引:273
作者
Latecki, LJ [1 ]
Lakämper, R [1 ]
机构
[1] Univ Hamburg, Dept Appl Math, D-20146 Hamburg, Germany
关键词
visual parts; discrete curve evolution; digital curves; digital straight line segments; total curvature; shape hierarchy; digital geometry;
D O I
10.1006/cviu.1998.0738
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We concentrate here on decomposition of 2D objects into meaningful parts of visual form, or visual parts. It is a simple observation that convex parts of objects determine visual parts, However, the problem is that many significant visual parts are not convex, since a visual part may have concavities. We solve this problem by identifying convex parts at different stages of a proposed contour evolution method in which significant visual parts will become convex object parts at higher stages of the evolution, We obtain a novel rule for decomposition of 2D objects into visual parts, called the hierarchical convexity rule, which states that visual parts are enclosed by maximal convex (with respect to the object) boundary arcs at different stages of the contour evolution. This rule determines not only parts of boundary curves but directly the visual parts of objects. Moreover, the stages of the evolution hierarchy induce a hierarchical structure of the visual parts. The more advanced the stage of contour evolution, the more significant is the shape contribution of the obtained visual parts. (C) 1999 Academic Press.
引用
收藏
页码:441 / 454
页数:14
相关论文
共 32 条