Towards a Simple and Efficient Object-based Superpixel Delineation Framework

被引:4
作者
Belem, Felipe C. [1 ]
Perret, Benjamin [2 ]
Cousty, Jean [2 ]
Guimaraes, Silvio J. F. [3 ]
Falcao, Alexandre X. [1 ]
机构
[1] Univ Estadual Campinas, Inst Comp, LIDS, Sao Paulo, Brazil
[2] Univ Gustave Eiffel, LIGM, CNRS, ESIEE Paris, Marne La Vallee, France
[3] Pontificia Univ Catolica Minas Gerais, IMSci, Belo Horizonte, MG, Brazil
来源
2021 34TH SIBGRAPI CONFERENCE ON GRAPHICS, PATTERNS AND IMAGES (SIBGRAPI 2021) | 2021年
基金
巴西圣保罗研究基金会;
关键词
SEGMENTATION;
D O I
10.1109/SIBGRAPI54419.2021.00054
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Superpixel segmentation methods are widely used in computer vision applications due to their properties in border delineation. These methods do not usually take into account any prior object information. Although there are a few exceptions, such methods significantly rely on the quality of the object information provided and present high computational cost in most practical cases. Inspired by such approaches, we propose Object-based Dynamic and Iterative Spanning Forest (ODISF), a novel object-based superpixel segmentation framework to effectively exploit prior object information while being robust to the quality of that information. ODISF consists of three independent steps: (i) seed oversampling; (ii) dynamic path-based superpixel generation; and (iii) object-based seed removal. After (i), steps (ii) and (iii) are repeated until the desired number of superpixels is finally reached. Experimental results show that ODISF can surpass state-of-the-art methods according to several metrics, while being significantly faster than its object-based counterparts.
引用
收藏
页码:346 / 353
页数:8
相关论文
共 34 条
[1]   SLIC Superpixels Compared to State-of-the-Art Superpixel Methods [J].
Achanta, Radhakrishna ;
Shaji, Appu ;
Smith, Kevin ;
Lucchi, Aurelien ;
Fua, Pascal ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2274-2281
[2]   Contour Detection and Hierarchical Image Segmentation [J].
Arbelaez, Pablo ;
Maire, Michael ;
Fowlkes, Charless ;
Malik, Jitendra .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) :898-916
[3]   Fast Superpixel Segmentation with Deep Features [J].
Awaisu, Mubinun ;
Li, Liang ;
Peng, Junjie ;
Zhang, Jiawan .
ADVANCES IN COMPUTER GRAPHICS, CGI 2019, 2019, 11542 :410-416
[4]   Towards Interactive Image Segmentation by Dynamic and Iterative Spanning Forest [J].
Barcelos, Isabela Borlido ;
Belem, Felipe ;
Miranda, Paulo ;
Falcao, Alexandre Xavier ;
do Patrocinio, Zenilton K. G., Jr. ;
Guimaraes, Silvio Jamil F. .
DISCRETE GEOMETRY AND MATHEMATICAL MORPHOLOGY, DGMM 2021, 2021, 12708 :351-364
[5]  
Belem F., 2020, 33 C GRAPH PATT IM S, P22
[6]   The Importance of Object-based Seed Sampling for Superpixel Segmentation [J].
Belem, Felipe ;
Melo, Leonardo ;
Guimaraes, Silvio ;
Falcao, Alexandre .
2019 32ND SIBGRAPI CONFERENCE ON GRAPHICS, PATTERNS AND IMAGES (SIBGRAPI), 2019, :108-115
[7]   Superpixel Segmentation Using Dynamic and Iterative Spanning Forest [J].
Belem, Felipe C. ;
Guimaraes, Silvio Jamil F. ;
Falcao, Alexandre X. .
IEEE SIGNAL PROCESSING LETTERS, 2020, 27 :1440-1444
[8]  
Castelo-Fernandez C., 2018, 23 IB C PATT REC, P470
[9]   Path-Value Functions for Which Dijkstra's Algorithm Returns Optimal Mapping [J].
Ciesielski, Krzysztof Chris ;
Falcao, Alexandre Xavier ;
Miranda, Paulo A. V. .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2018, 60 (07) :1025-1036
[10]  
de Castro Belem F., 2018, IB C PATT REC, P334