Texture modelling with nested high-order Markov-Gibbs random fields

Texture models with heterogeneous sets of features are learnt sequentially.Parameter learning can be omitted.Local binary patterns with learnt offsets are introduced as MGRF features.Methods of gradually or immediately selecting the offsets are compared.The models are promising for texture synthesis and inpainting. Currently, Markov-Gibbs random field (MGRF) image models which include high-order interactions are almost always built by modelling responses of a stack of local linear filters. Actual interaction structure is specified implicitly by the filter coefficients. In contrast, we learn an explicit high-order MGRF structure by considering the learning process in terms of general exponential family distributions nested over base models, so that potentials added later can build on previous ones. We relatively rapidly add new features by skipping over the costly optimisation of parameters.We introduce the use of local binary patterns as features in MGRF texture models, and generalise them by learning offsets to the surrounding pixels. These prove effective as high-order features, and are fast to compute. Several schemes for selecting high-order features by composition or search of a small subclass are compared. Additionally we present a simple modification of the maximum likelihood as a texture modelling-specific objective function which aims to improve generalisation by local windowing of statistics.The proposed method was experimentally evaluated by learning high-order MGRF models for a broad selection of complex textures and then performing texture synthesis, and succeeded on much of the continuum from stochastic through irregularly structured to near-regular textures. Learning interaction structure is very beneficial for textures with large-scale structure, although those with complex irregular structure still provide difficulties. The texture models were also quantitatively evaluated on two tasks and found to be competitive with other works: grading of synthesised textures by a panel of observers; and comparison against several recent MGRF models by evaluation on a constrained inpainting task.

[1]  Raymond J. Mooney,et al.  Bottom-up learning of Markov logic network structure , 2007, ICML '07.

[2]  Josiane Zerubia,et al.  Estimation of Markov random field prior parameters using Markov chain Monte Carlo maximum likelihood , 1999, IEEE Trans. Image Process..

[3]  Erkki Oja,et al.  Independent component analysis: algorithms and applications , 2000, Neural Networks.

[4]  Kazuhiro Fukui,et al.  Rotation Invariant Co-occurrence among Adjacent LBPs , 2012, ACCV Workshops.

[5]  Sung Yong Shin,et al.  On pixel-based texture synthesis by non-parametric sampling , 2006, Comput. Graph..

[6]  Stochastic Relaxation , 2014, Computer Vision, A Reference Guide.

[7]  Jana Reinhard,et al.  Textures A Photographic Album For Artists And Designers , 2016 .

[8]  Christopher K. I. Williams,et al.  Multiple Texture Boltzmann Machines , 2012, AISTATS.

[9]  James Theiler,et al.  Grafting: Fast, Incremental Feature Selection by Gradient Descent in Function Space , 2003, J. Mach. Learn. Res..

[10]  Georgy L. Gimel'farb,et al.  Texture Analysis by Accurate Identification of a Generic Markov-Gibbs Model , 2008, Applied Pattern Recognition.

[11]  Geoffrey E. Hinton,et al.  Generating more realistic images using gated MRF's , 2010, NIPS.

[12]  Krishnamoorthy Sivakumar,et al.  Morphologically Constrained GRFs: Applications to Texture Synthesis and Analysis , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Daphne Koller,et al.  Efficient Structure Learning of Markov Networks using L1-Regularization , 2006, NIPS.

[14]  Irfan A. Essa,et al.  Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..

[15]  Miroslav Dudík,et al.  Maximum Entropy Density Estimation with Generalized Regularization and an Application to Species Distribution Modeling , 2007, J. Mach. Learn. Res..

[16]  Songde Ma,et al.  Sequential synthesis of natural textures , 1985, Comput. Vis. Graph. Image Process..

[17]  David Saad,et al.  On-Line Learning in Neural Networks , 1999 .

[18]  Song-Chun Zhu Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling , 1998 .

[19]  Kris Popat,et al.  Novel cluster-based probability model for texture synthesis, classification, and compression , 1993, Other Conferences.

[20]  Andrew McCallum,et al.  Efficiently Inducing Features of Conditional Random Fields , 2002, UAI.

[21]  John D. Lafferty,et al.  Inducing Features of Random Fields , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Wen-Hung Liao,et al.  Texture Classification Using Uniform Extended Local Ternary Patterns , 2010, 2010 IEEE International Symposium on Multimedia.

[23]  Song-Chun Zhu,et al.  Minimax Entropy Principle and Its Application to Texture Modeling , 1997, Neural Computation.

[24]  Alexei A. Efros,et al.  Image quilting for texture synthesis and transfer , 2001, SIGGRAPH.

[25]  K. Murphy Bayesian Structure Learning for Markov Random Fields with a Spike and Slab Prior , 2012 .

[26]  Erkki Oja,et al.  Reduced Multidimensional Co-Occurrence Histograms in Texture Classification , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Anil K. Jain,et al.  Markov Random Field Texture Models , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[28]  Qi Gao,et al.  Texture Synthesis: From Convolutional RBMs to Efficient Deterministic Algorithms , 2014, S+SSPR.

[29]  Nikos Komodakis,et al.  Markov Random Field modeling, inference & learning in computer vision & image understanding: A survey , 2013, Comput. Vis. Image Underst..

[30]  Georgy L. Gimel'farb,et al.  Texture modelling with generic translation- and contrast/offset-invariant 2nd–4th-order MGRFs , 2013, 2013 28th International Conference on Image and Vision Computing New Zealand (IVCNZ 2013).

[31]  Jianhua Lin,et al.  Divergence measures based on the Shannon entropy , 1991, IEEE Trans. Inf. Theory.

[32]  A. Zalesny Analysis and Synthesis of Textures With Pairwise Signal Interactions , 2002 .

[33]  Karel J. Zuiderveld,et al.  Contrast Limited Adaptive Histogram Equalization , 1994, Graphics Gems.

[34]  Yee Whye Teh,et al.  Energy-Based Models for Sparse Overcomplete Representations , 2003, J. Mach. Learn. Res..

[35]  O. E. Barndorff‐Nielsen General Exponential Families , 2006 .

[36]  Geoffrey E. Hinton,et al.  Learning Generative Texture Models with extended Fields-of-Experts , 2009, BMVC.

[37]  Marc Levoy,et al.  Fast texture synthesis using tree-structured vector quantization , 2000, SIGGRAPH.

[38]  David L. Neuhoff,et al.  Local radius index - a new texture similarity feature , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[39]  Gaurav Sharma,et al.  Local Higher-Order Statistics (LHS) for Texture Categorization and Facial Analysis , 2012, ECCV.

[40]  Matti Pietikäinen,et al.  Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[41]  Jana Zujovic,et al.  Perceptual Texture Similarity Metrics , 2011 .

[42]  Michael J. Black,et al.  Fields of Experts , 2009, International Journal of Computer Vision.

[43]  Rupert Paget,et al.  Texture synthesis via a noncausal nonparametric multiscale Markov random field , 1998, IEEE Trans. Image Process..

[44]  Georgy L. Gimel'farb,et al.  Learning High-order Generative Texture Models , 2014, IVCNZ '14.

[45]  E. Jaynes Information Theory and Statistical Mechanics , 1957 .

[46]  Michael Unser,et al.  Sum and Difference Histograms for Texture Classification , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[47]  Matti Pietikäinen,et al.  A comparative study of texture measures with classification based on featured distributions , 1996, Pattern Recognit..

[48]  Xiaoyang Tan,et al.  Enhanced Local Texture Feature Sets for Face Recognition Under Difficult Lighting Conditions , 2007, AMFG.

[49]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[50]  Eero P. Simoncelli,et al.  A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients , 2000, International Journal of Computer Vision.

[51]  Yoshua Bengio,et al.  Texture Modeling with Convolutional Spike-and-Slab RBMs and Deep Extensions , 2012, AISTATS.

[52]  Béla Julesz,et al.  Visual Pattern Discrimination , 1962, IRE Trans. Inf. Theory.

[53]  Tijmen Tieleman,et al.  Training restricted Boltzmann machines using approximations to the likelihood gradient , 2008, ICML '08.

[54]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[55]  Georgy L. Gimel'farb,et al.  High-Order MGRF Models for Contrast/Offset Invariant Texture Retrieval , 2014, IVCNZ '14.

[56]  Georgy L. Gimel'farb,et al.  Image Textures and Gibbs Random Fields , 1999, Computational Imaging and Vision.

[57]  J. Preston Ξ-filters , 1983 .

[58]  Song-Chun Zhu,et al.  Exploring Texture Ensembles by Efficient Markov Chain Monte Carlo-Toward a 'Trichromacy' Theory of Texture , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[59]  Mark W. Schmidt,et al.  Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials , 2010, AISTATS.

[60]  Nikos Komodakis,et al.  Beyond pairwise energies: Efficient optimization for higher-order MRFs , 2009, CVPR.

[61]  Gabriel Peyré,et al.  Sparse Modeling of Textures , 2009, Journal of Mathematical Imaging and Vision.

[62]  Thibault Langlois,et al.  Parameter adaptation in stochastic optimization , 1999 .

[63]  Erkki Oja,et al.  Texture discrimination with multidimensional distributions of signed gray-level differences , 2001, Pattern Recognit..

[64]  Xiaoyang Tan,et al.  Enhanced Local Texture Feature Sets for Face Recognition Under Difficult Lighting Conditions , 2007, IEEE Transactions on Image Processing.

[65]  Heike Freud,et al.  On Line Learning In Neural Networks , 2016 .

[66]  Eric P. Xing,et al.  Grafting-light: fast, incremental feature selection and structure learning of Markov random fields , 2010, KDD '10.

[67]  Aly A. Farag,et al.  Optimizing Binary MRFs with Higher Order Cliques , 2008, ECCV.