Multi-object cosegmentation using density-based clustering

被引:0
|
作者
Wang, Tzu-Chiang [1 ]
Chang, I-Cheng [1 ]
Lin, Chun-Man [1 ]
机构
[1] Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien,974, Taiwan
关键词
Clustering algorithms;
D O I
10.3966/199115992020023101012
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cosegmentation is one of the interesting and popular topics in computer vision. The goal of cosegmentation is to extract the common foreground objects from an image set with minimum additional information. The existing cosegmentation algorithms could be classified into two categories. One is to extract one kind of foreground objects in the image set under unsupervised approaches; the other one is to find different kinds of common foreground objects in the image set under supervised approaches of which the number of kinds should be predefined. In this paper, we propose an unsupervised cosegmentation method for multiple foreground objects, which need not preset the number of object kinds. Moreover, most of the existing cosegmentation algorithms assume that the common foreground objects should appear in all images of the image set. However, if the foreground object only appears in a few images, the object is often misclassified. Our proposed algorithm can segment different kinds of common objects and have a higher segmentation rate for some foreground objects not appearing in all images. In the proposed work, an image is considered as the combination of several objects, and each object is composed of object elements. The image set could be decomposed into lots of object elements, and then object elements with similar features could be clustered into one subobject class representing one part of an object. According to the class distribution of elements, common objects are extracted by the selection criteria. The concept of independent object elements is also proposed to increase the segmentation rate. In the experimental results, we demonstrate that the proposed approach could get better segmentation results compared with other methods. © 2020 Computer Society of the Republic of China. All rights reserved.
引用
收藏
页码:148 / 165
相关论文
共 50 条
  • [41] FULLY ADAPTIVE DENSITY-BASED CLUSTERING
    Steinwart, Ingo
    ANNALS OF STATISTICS, 2015, 43 (05): : 2132 - 2167
  • [42] Anytime parallel density-based clustering
    Mai, Son T.
    Assent, Ira
    Jacobsen, Jon
    Dieu, Martin Storgaard
    DATA MINING AND KNOWLEDGE DISCOVERY, 2018, 32 (04) : 1121 - 1176
  • [43] Fast density-based clustering algorithm
    Zhou, Shuigeng
    Zhou, Aoying
    Cao, Jing
    Hu, Yunfa
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2000, 37 (11): : 1287 - 1292
  • [44] A systematic density-based clustering method using anchor points
    Wang, Yizhang
    Wang, Di
    Pang, Wei
    Miao, Chunyan
    Tan, Ah-Hwee
    Zhou, You
    NEUROCOMPUTING, 2020, 400 : 352 - 370
  • [45] The Framework of Relative Density-Based Clustering
    Cui, Zelin
    Shen, Hong
    PARALLEL ARCHITECTURE, ALGORITHM AND PROGRAMMING, PAAP 2017, 2017, 729 : 343 - 352
  • [46] Density-based clustering with differential privacy
    Wu, Fuyu
    Du, Mingjing
    Zhi, Qiang
    INFORMATION SCIENCES, 2024, 681
  • [47] A varied density-based clustering algorithm
    Fahim, Ahmed
    JOURNAL OF COMPUTATIONAL SCIENCE, 2023, 66
  • [48] Feature Selection for Density-Based Clustering
    Ling, Yun
    Ye, Chongyi
    2009 INTERNATIONAL SYMPOSIUM ON INTELLIGENT UBIQUITOUS COMPUTING AND EDUCATION, 2009, : 226 - 229
  • [49] An ensemble density-based clustering method
    Xia, Luning
    Jing, Jiwu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (ISKE 2007), 2007,
  • [50] Hierarchical density-based clustering of shapes
    Gautama, T
    Van Hulle, MM
    NEURAL NETWORKS FOR SIGNAL PROCESSING XI, 2001, : 213 - 222