This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Triplet Markov Fields for the Classification of Complex Structure Data
June 2008 (vol. 30 no. 6)
pp. 1055-1067
We address the issue of classifying complex data. We focus on three main sources of complexity, namely the high dimensionality of the observed data, the dependencies between these observations and the general nature of the noise model underlying their distribution. We investigate the recent {\it Triplet Markov Fields} and propose new models in this class designed for such data and in particular allowing very general noise models. In addition, our models can handle the inclusion of a learning step in a consistent way so that they can be used in a supervised framework. One advantage of our models is that whatever the initial complexity of the noise model, parameter estimation can be carried out using state-of-the-art Bayesian clustering techniques under the usual simplifying assumptions. As generative models, they can be seen as an alternative, in the supervised case, to discriminative Conditional Random Fields. Identifiability issues underlying the models in the non supervised case, are discussed while the models performance is illustrated on simulated and real data exhibiting the mentioned various sources of complexity.

[1] G. Celeux and G. Govaert, “Gaussian Parsimonious Clustering Models,” Pattern Recognition, vol. 28, pp. 781-793, 1995.
[2] C. Bouveyron, S. Girard, and C. Schmid, “High Dimensional Data Clustering,” Computational Statistics and Data Analysis, 2007.
[3] G.R. Cross and A.K. Jain, “Markov Random Fields Texture Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 1, p. 2539, 1983.
[4] W. Pieczynski and A. Tebbache, “Pairwise Markov Random Fields and Segmentation of Textured Images,” Machine Graphics and Vision, vol. 9, pp. 705-718, 2000.
[5] D. Benboudjema and W. Pieczynski, “Unsupervised Image Segmentation Using Triplet Markov Fields,” Computer Vision and Image Understanding, vol. 99, pp. 476-498, 2005.
[6] D. Benboudjema and W. Pieczynski, “Unsupervised Statistical Segmentation of Non Stationary Images Using Triplet Markov Fields,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 8, pp. 367-1378, Aug. 2007.
[7] G. Celeux, F. Forbes, and N. Peyrard, “EM Procedures Using Mean Field-Like Approximations for Markov Model-Based Image Segmentation,” Pattern Recognition, vol. 36, no. 1, pp. 131-144, 2003.
[8] S. Kumar and M. Hebert, “Discriminative Random Fields,” Int'l J. Computer Vision, vol. 68, no. 2, pp. 179-201, 2006.
[9] M. Vignes and F. Forbes, “Gene Clustering via Integrated Markov Models Combining Individual and Pairwise Features,” IEEE/ACM Trans. Computational Biology and Bioinformatics, 2007.
[10] J. Besag, “On the Statistical Analysis of Dirty Pictures,” J. Royal Statistical Soc. B, vol. 48, no. 3, pp. 259-302, 1986.
[11] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, 1984.
[12] A. Dempster, N. Laird, and D. Rubin, “Maximum Likelihood from Incomplete Data via the EM Algorithm,” J. Royal Statistical Soc. B, vol. 39, pp. 1-38, 1977.
[13] B. Chalmond, “An Iterative Gibbsian Technique for Reconstruction of m-ary Images,” Pattern Recognition, vol. 22, no. 6, pp. 747-761, 1989.
[14] W. Qian and M. Titterington, “Estimation of Parameters in Hidden Markov Models,” Philosophical Trans. Royal Soc. A, vol. 337, pp. 407-428, 1991.
[15] S. Lazebnik, C. Schmid, and J. Ponce, “Affine-Invariant Local Descriptors and Neighborhood Statistics for Texture Recognition,” Proc. IEEE Int'l Conf. Computer Vision, 2003.
[16] G. Celeux, “Bayesian Inference for Mixtures: The Label Switching Problem,” Proc. Computational Statistics, pp. 227-232, 1998.
[17] J. Li, “Clustering Based on a Multi-Layer Mixture Model,” J.Computational and Graphical Statistics, vol. 14, no. 3, 2005.
[18] M. Stephens, “Dealing with Label Switching in Mixture Models,” J. Royal Statistical Soc. B, vol. 62, pp. 795-809, 2000.
[19] G. Schwarz, “Estimating the Dimension of a Model,” Annals of Statistics, vol. 6, pp. 461-464, 1978.
[20] F. Forbes and N. Peyrard, “Hidden Markov Random Field Model Selection Criteria Based on Mean Field-Like Approximations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 8, Aug. 2003.
[21] R. Chellapa and S. Chatterjee, “Classification of Textures Using Gaussian Markov Random Fields,” IEEE Trans. Acoustics Speech and Signal Processing, pp. 959-963, 1985.
[22] T. Ojala, M. Pietikainen, and T. Manpaa, “Multiresolution Gray-Scale and Rotation-Invariant Texture Classification with Local Binary Patterns,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 971-987, 2002.
[23] T. Toyoda and O. Hasegawa, “Texture Classification Using Extended Higher Order Local Autocorrelation Features,” Proc. Fourth Int'l Workshop Texture Analysis and Synthesis, pp. 131-136, 2005.
[24] J.S. De Bonet and P. Viola, “Texture Recognition Using a Non Parametric Multi-Scale Statistical Model,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, 1998.
[25] B.S. Manjunath and W.Y. Ma, “Texture Features for Browsing and Retrieval of Image Data,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 837-842, 1996.
[26] J. Blanchet, F. Forbes, and C. Schmid, “Markov Random Fields for Textures Recognition with Local Invariant Regions and Their Geometric Relationships,” Proc. British Machine Vision Conf., Sept. 2005.
[27] D. Lowe, “Distinctive Image Features from Scale-Invariant Keypoints,” Int'l J. Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
[28] Y. Delignon, A. Marzouki, and W. Pieczynski, “Estimation of Generalized Mixtures an Its Application in Image Segmentation,” IEEE Trans. Image Processing, vol. 6, pp. 1364-1375, 1997.
[29] A. Jasra, C.C. Holmes, and D.A. Stephens, “Markov Chain Monte Carlo Methods and the Label Switching Problem in Bayesian Mixture Modeling,” Statistical Science, vol. 20, no. 1, 2005.
[30] S. Le Hegarat-Mascle, A. Kallel, and X. Descombes, “Ant Colony Optimization for Image Regularization Based on a Nonstationary Markov Modeling,” IEEE Trans. Image Processing, vol. 16, no. 3, pp.865-879, 2007.

Index Terms:
Triplet Markov model, Supervised classification, Conditional independence, Complex noise models, High dimensional data, EM-like algorithms
Citation:
Juliette Blanchet, Florence Forbes, "Triplet Markov Fields for the Classification of Complex Structure Data," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 6, pp. 1055-1067, June 2008, doi:10.1109/TPAMI.2008.27
Usage of this product signifies your acceptance of the Terms of Use.