KIPPI: KInetic Polygonal Partitioning of Images

被引:22
作者
Bauchet, Jean-Philippe [1 ]
Lafarge, Florent [1 ]
机构
[1] Univ Cote Azur, INRIA, Nice, France
来源
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2018年
关键词
D O I
10.1109/CVPR.2018.00332
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recent works showed that floating polygons can be an interesting alternative to traditional superpixels, especially for analyzing scenes with strong geometric signatures, as man-made environments. Existing algorithms produce homogeneously-sized polygons that fail to capture thin geometric structures and over-partition large uniform areas. We propose a kinetic approach that brings more flexibility on polygon shape and size. The key idea consists in progressively extending pre-detected line-segments until they meet each other. Our experiments demonstrate that output partitions both contain less polygons and better capture geometric structures than those delivered by existing methods. We also show the applicative potential of the method when used as preprocessing in object contouring.
引用
收藏
页码:3146 / 3154
页数:9
相关论文
共 31 条
[1]  
Achanta R., 2017, CVPR, V1
[2]  
Agarwal P. K., 2010, S COMP GEOM
[3]  
[Anonymous], ECCV
[4]  
[Anonymous], ECCV
[5]  
[Anonymous], PAMI
[6]  
[Anonymous], 2011, CVPR
[7]  
[Anonymous], 2017, CVPR
[8]  
[Anonymous], 2009, CVPR
[9]  
[Anonymous], CVPR
[10]  
[Anonymous], 2001, ICCV