Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation

被引:0
作者
Goh, Kok Luong [1 ,3 ]
Chai, Soo See [2 ]
Ng, Giap Weng [3 ]
Hamzah, Muzaffar [3 ]
机构
[1] I CATS Univ Coll, Fac Sci & Technol, Kuching, Malaysia
[2] Univ Malaysia Sarawak, Fac Comp Sci & Informat Technol, Kuching, Malaysia
[3] Univ Malaysia Sabah, Fac Comp & Informat, Kota Kinabalu, Malaysia
关键词
Image segmentation; superpixel; input type; interactive segmentation; FOREGROUND EXTRACTION; IMAGE; FRAMEWORK; TOOL;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Image Segmentation is a type of semi-automated segmentation that uses user input to extract the object of interest. It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. A superpixel is a collection of pixels with similar properties such as texture and colour. Previous research was conducted to assess the impact of the number of superpixels (based on SEEDS superpixel aglorithms) required to achieve the best segmentation results. The study, however, only examined one type of input (strokes) and a small number of images. As a result, the goal of this study is to extend previous work by performing interactive segmentation with input strokes and a combination of bounding box and strokes on images from Grabcut image data sets generated by Topology preserved regular superpixel (TPRS). Based on our findings, an image with 1000 to 2500 superpixels and a combination of bounding box and strokes will help the interactive segmentation algorithm produce a good segmentation result. Finally, the size of the superpixels would influence the final segmentation results as well as the input type.
引用
收藏
页码:705 / 710
页数:6
相关论文
共 50 条
[21]   Accelerated superpixel image segmentation with a parallelized DBSCAN algorithm [J].
Loke, Seng Cheong ;
MacDonald, Bruce A. ;
Parsons, Matthew ;
Wunsche, Burkhard Claus .
JOURNAL OF REAL-TIME IMAGE PROCESSING, 2021, 18 (06) :2361-2376
[22]   Optimized method for segmentation of ancient mural images based on superpixel algorithm [J].
Liang, Jinxing ;
Liu, Anping ;
Zhou, Jing ;
Xin, Lei ;
Zuo, Zhuan ;
Liu, Zhen ;
Luo, Hang ;
Chen, Jia ;
Hu, Xinrong .
FRONTIERS IN NEUROSCIENCE, 2022, 16
[23]   Automatic Segmentation of Extraocular Muscles Using Superpixel and Normalized Cuts [J].
Xing, Qi ;
Li, Yifan ;
Wiggins, Brendan ;
Demer, Joseph L. ;
Wei, Qi .
ADVANCES IN VISUAL COMPUTING, PT I (ISVC 2015), 2015, 9474 :501-510
[24]   INTERACTIVE IMAGE SEGMENTATION BASED ON SUPERPIXEL GROUPING FOR MOBILE DEVICES WITH TOUCHSCREEN [J].
Birinci, Murat ;
Ugur, Kemal .
2014 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO (ICME), 2014,
[25]   Video segmentation algorithm based on superpixel link weight model [J].
Pan, Shu-xia ;
Sun, Wang-jie ;
Zheng, Zhigao .
MULTIMEDIA TOOLS AND APPLICATIONS, 2017, 76 (19) :19741-19760
[26]   Real-Time Superpixel Segmentation by DBSCAN Clustering Algorithm [J].
Shen, Jianbing ;
Hao, Xiaopeng ;
Liang, Zhiyuan ;
Liu, Yu ;
Wang, Wenguan ;
Shao, Ling .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (12) :5933-5942
[27]   Classification of Hyperspectral image based on superpixel segmentation and DPC algorithm [J].
Chen, Nian ;
Zhou, Hao .
2020 19TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS FOR BUSINESS ENGINEERING AND SCIENCE (DCABES 2020), 2020, :138-141
[28]   A Novel Image Segmentation Algorithm Based on Multiple Features Fusion with Hypergraph and Superpixel [J].
Wei, Wei ;
Yang, Haichuan ;
Wu, Zhuangzhi ;
Bai, Xiao ;
Sun, Xiechang ;
Liang, Yinchuan .
FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2013), 2014, 277 :709-718
[29]   Hierarchical Superpixel Segmentation for PolSAR Images Based on the Boruvka Algorithm [J].
Deng, Jie ;
Wang, Wei ;
Quan, Sinong ;
Zhan, Ronghui ;
Zhang, Jun .
REMOTE SENSING, 2022, 14 (19)
[30]   Fast Image Segmentation Algorithm Based on Superpixel Multi-feature Fusion [J].
Hou X.-G. ;
Zhao H.-Y. ;
Ma Y. .
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2019, 47 (10) :2126-2133