Discriminative random fields: a discriminative framework for contextual interaction in classification

In this work we present discriminative random fields (DRFs), a discriminative framework for the classification of image regions by incorporating neighborhood interactions in the labels as well as the observed data. The discriminative random fields offer several advantages over the conventional Markov random field (MRF) framework. First, the DRFs allow to relax the strong assumption of conditional independence of the observed data generally used in the MRF framework for tractability. This assumption is too restrictive for a large number of applications in vision. Second, the DRFs derive their classification power by exploiting the probabilistic discriminative models instead of the generative models used in the MRF framework. Finally, all the parameters in the DRF model are estimated simultaneously from the training data unlike the MRF framework where likelihood parameters are usually learned separately from the field parameters. We illustrate the advantages of the DRFs over the MRF framework in an application of man-made structure detection in natural images taken from the Corel database.

[1]  Philip E. Gill,et al.  Practical optimization , 1981 .

[2]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Josef Kittler,et al.  Contextual Pattern Recognition Applied to Cloud Detection and Identification , 1985, IEEE Transactions on Geoscience and Remote Sensing.

[4]  J. Besag On the Statistical Analysis of Dirty Pictures , 1986 .

[5]  Stuart German,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1988 .

[6]  Josef Kittler,et al.  Combining Evidence in Probabilistic Relaxation , 1989, Int. J. Pattern Recognit. Artif. Intell..

[7]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[8]  Chee Sun Won,et al.  Unsupervised segmentation of noisy and textured images using Markov random fields , 1992, CVGIP Graph. Model. Image Process..

[9]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Trevor J. Hastie,et al.  Discriminative vs Informative Learning , 1997, KDD.

[11]  Wojciech Pieczynski,et al.  Pairwise Markov random fields and its application in textured images segmentation , 2000, 4th IEEE Southwest Symposium on Image Analysis and Interpretation.

[12]  Hui Cheng,et al.  Multiscale Bayesian segmentation using a trainable context model , 2001, IEEE Trans. Image Process..

[13]  Anil K. Jain,et al.  Bayesian learning of sparse classifiers , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[14]  Stan Z. Li,et al.  Markov Random Field Modeling in Image Analysis , 2001, Computer Science Workbench.

[15]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[16]  C. Fox,et al.  Exact MAP states and expectations from perfect sampling: Greig, porteous and seheult revisited , 2001 .

[17]  Christopher K. I. Williams,et al.  Combining Belief Networks and Neural Networks for Scene Segmentation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Michael Brady,et al.  Segmentation of ultrasound B-mode images with intensity inhomogeneity correction , 2002, IEEE Transactions on Medical Imaging.

[19]  Martial Hebert,et al.  Man-made structure detection in natural images using a causal multiscale random field , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[20]  Chang-Tsun Li,et al.  A Class of Discrete Multiresolution Random Fields and Its Application to Image Segmentation , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Thomas P. Minka,et al.  Algorithms for maximum-likelihood logistic regression , 2003 .

[22]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.