Bayesian Non-parametric Image Segmentation with Markov Random Field Prior

  • Ehsan Amid
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7944)


In this paper, a Bayesian framework for non-parametric density estimation with spatial smoothness constraints is presented for image segmentation. Unlike common parametric methods such as mixtures of Gaussians, the proposed method does not make strict assumptions about the shape of the density functions and thus, can handle complex structures. The multiclass kernel density estimation is considered as an unsupervised learning problem. A Dirichlet compound multinomial (DCM) prior is used to model the class label prior probabilities and a Markov random field (MRF) is exploited to impose the spatial smoothness and control the confidence on the Dirichlet hyper-parameters, as well. The proposed model results in a closed form solution using an expectation-maximization (EM) algorithm for maximum a posteriori (MAP) estimation. This provides a huge advantage over other models which utilize more complex and time consuming methods such as Markov chain Monte Carlo (MCMC) or variational approximation methods. Several experiments on natural images are performed to present the performance of the proposed model compared to other parametric approaches.


Multiclass kernel density estimation Dirichlet compound multinomial distribution Markov random field prior Image segmentation 


  1. 1.
    Ding, L., Yilmaz, A., Yan, R.: Interactive Image Segmentation Using Dirichlet Process Multiple-View Learning. IEEE Transactions on Image Processing 21(4), 2119–2129 (2012)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Nikou, C., Likas, A.C., Galatsanos, N.P.: A Bayesian Framework for Image Segmentation With Spatially Varying Mixtures. IEEE Transactions on Image Processing 19(9), 2278–2289 (2010)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Andreetto, M., Zelnik-Manor, L., Perona, P.: Non-Parametric Probabilistic Image Segmentation. In: IEEE 11th International Conference on Computer Vision, ICCV 2007, October 14-21, pp. 1–8 (2007)Google Scholar
  4. 4.
    Zhang, Y., Brady, M., Smith, S.: Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm. IEEE Transactions on Medical Imaging 20(1), 45–57 (2001)CrossRefGoogle Scholar
  5. 5.
    Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)zbMATHGoogle Scholar
  6. 6.
    Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceedings of the Eighth IEEE International Conference on Computer Vision, ICCV 2001, vol. 2, pp. 416–423 (2001)Google Scholar
  7. 7.
    The Berkeley Segmentation Dataset and Benchmark,
  8. 8.
    Bowyer, K., Kranenburg, C., Dougherty, S.: Edge detector Evaluation Using Empirical ROC Curves. Computer Vision and Image Understanding 84(1), 77–103 (2001)zbMATHCrossRefGoogle Scholar
  9. 9.
    Carson, C., Belongie, S., Greenspan, H., Malik, J.: Blobworld: image segmentation using expectation-maximization and its application to image querying. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(8), 1026–1038 (2002)CrossRefGoogle Scholar
  10. 10.
    Zelnik-Manor, L., Perona, P.: Self-Tuning Spectral Clustering. In: Advances in Neural Information Processing Systems (NIPS), pp. 1601–1608 (2005)Google Scholar
  11. 11.
    Frigyik, B.A., Kapila, A., Gupta, M.R.: Introduction to the Dirichlet Distribution and Related Processes. UWEE Technical report (2010)Google Scholar
  12. 12.
    Li, S.Z.: Markov Random Field Modeling in Image Analysis. Springer, Tokyo (2001)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ehsan Amid
    • 1
  1. 1.Department of Information and Computer ScienceAalto UniversityEspooFinland

Personalised recommendations