• DocumentCode
    249342
  • Title

    Unsupervised co-segmentation based on a new global GMM constraint in MRF

  • Author

    Hongkai Yu ; Min Xian ; Xiaojun Qi

  • Author_Institution
    Dept. of Comput. Sci., Utah State Univ., Logan, UT, USA
  • fYear
    2014
  • fDate
    27-30 Oct. 2014
  • Firstpage
    4412
  • Lastpage
    4416
  • Abstract
    This paper proposes a new Markov Random Fields (MRF) optimization model for co-segmentation. The co-saliency model is incorporated into our model to make it fully unsupervised and work well for images with similar backgrounds. The Gaussian Mixture Model (GMM) based dissimilarity between foregrounds in each image and the common objects in the set is involved as a new global constraint (i.e., energy term) in our model. Finally, we introduce an alternative approximation to represent the energy function, which could be minimized by Graph Cuts iteratively. The experimental results on two datasets show that our algorithm achieves better or comparable accuracy when comparing with state-of-the-art algorithms.
  • Keywords
    Gaussian processes; Markov processes; approximation theory; image segmentation; iterative methods; mixture models; optimisation; Gaussian mixture model; MRF; Markov random fields; alternative approximation; co-saliency model; energy function; global GMM constraint; global constraint; image foreground; iterative graph cut; optimization model; unsupervised co-segmentation; Computational modeling; Computer vision; Conferences; Histograms; Image segmentation; Optimization; Pattern recognition; Co-segmentation; Global GMM Constraint; Graph Cuts; Markov Random Fields;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing (ICIP), 2014 IEEE International Conference on
  • Conference_Location
    Paris
  • Type

    conf

  • DOI
    10.1109/ICIP.2014.7025895
  • Filename
    7025895