• DocumentCode
    2835711
  • Title

    Map-MRF based LIP segmentation without true segment number

  • Author

    Cheung, Yiu-Ming ; Li, Meng

  • Author_Institution
    Dept. of Comput. Sci., Hong Kong Baptist Univ., Hong Kong, China
  • fYear
    2011
  • fDate
    11-14 Sept. 2011
  • Firstpage
    769
  • Lastpage
    772
  • Abstract
    This paper presents an MAP-MRF (i.e. maximum a posteriori-Markov random field) based image segmentation method to achieve stable performance without knowing the true segment number in advance. Specifically, we firstly assign the segment number a value greater than or equal to the ground truth. Subsequently, cluster centroid of each segment in observation space is initialized randomly so that each pixel can be assigned the Euclidean distance-based membership. Then, a 2-D MRF is constructed on the regular pixel lattice of the interesting image. Under MAP-MRF framework, the image segmentation can be regarded as a labeling problem with the label configuration determined by the segment label of membership winner on each site. We therefore propose an iterative algorithm by optimizing the objective function to fade out the over-segmentation, through which an optimal segmentation is achieved. Finally, an unsupervised lip segmentation scheme based on the proposed method is presented. Experiment shows its outstanding performance.
  • Keywords
    Markov processes; image segmentation; iterative methods; maximum likelihood estimation; random processes; Euclidean distance-based membership; cluster centroid; image segmentation method; iterative algorithm; labeling problem; maximum a posteriori-Markov random field; unsupervised lip segmentation scheme; Accuracy; Conferences; Entropy; Face; Image color analysis; Image segmentation; Image segmentation; MAP-MRF framework; segment number;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing (ICIP), 2011 18th IEEE International Conference on
  • Conference_Location
    Brussels
  • ISSN
    1522-4880
  • Print_ISBN
    978-1-4577-1304-0
  • Electronic_ISBN
    1522-4880
  • Type

    conf

  • DOI
    10.1109/ICIP.2011.6116668
  • Filename
    6116668