• DocumentCode
    2827277
  • Title

    Object co-segmentation based on directed graph clustering

  • Author

    Fanman Meng ; Bing Luo ; Chao Huang

  • Author_Institution
    Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
  • fYear
    2013
  • fDate
    17-20 Nov. 2013
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    In this paper, we develop a new algorithm to segment multiple common objects from a group of images. Our method consists of two aspects: directed graph clustering and prior propagation. The clustering is used to cluster the local regions of the original images and generate the foreground priors from these clusterings. The second step propagates the prior of each class and locates the common objects from the images in terms of foreground map. Finally, we use the foreground map as the unary term of Markov random field segmentation and segment the common objects by graph-cuts algorithm. We test our method on FlickrMFC and ICoseg datasets. The experimental results show that the proposed method can achieve larger accuracy compared with several state-of-arts co-segmentation methods.
  • Keywords
    Markov processes; graph theory; image segmentation; pattern clustering; FlickrMFC; ICoseg datasets; Markov random field segmentation; directed graph clustering; graph-cuts algorithm; object cosegmentation; prior propagation; state-of-arts cosegmentation methods; Accuracy; Clustering algorithms; Clustering methods; Conferences; Image segmentation; Proposals; Cosegmentation; directed graph clustering; graph-cuts; propagation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Visual Communications and Image Processing (VCIP), 2013
  • Conference_Location
    Kuching
  • Print_ISBN
    978-1-4799-0288-0
  • Type

    conf

  • DOI
    10.1109/VCIP.2013.6706376
  • Filename
    6706376