The Wilson Machine for Image Modeling

Learning the distribution of natural images is one of the hardest and most important problems in machine learning. The problem remains open, because the enormous complexity of the structures in natural images spans all length scales. We break down the complexity of the problem and show that the hierarchy of structures in natural images fuels a new class of learning algorithms based on the theory of critical phenomena and stochastic processes. We approach this problem from the perspective of the theory of critical phenomena, which was developed in condensed matter physics to address problems with infinite length-scale fluctuations, and build a framework to integrate the criticality of natural images into a learning algorithm. The problem is broken down by mapping images into a hierarchy of binary images, called bitplanes. In this representation, the top bitplane is critical, having fluctuations in structures over a vast range of scales. The bitplanes below go through a gradual stochastic heating process to disorder. We turn this representation into a directed probabilistic graphical model, transforming the learning problem into the unsupervised learning of the distribution of the critical bitplane and the supervised learning of the conditional distributions for the remaining bitplanes. We learnt the conditional distributions by logistic regression in a convolutional architecture. Conditioned on the critical binary image, this simple architecture can generate large, natural-looking images, with many shades of gray, without the use of hidden units, unprecedented in the studies of natural images. The framework presented here is a major step in bringing criticality and stochastic processes to machine learning and in studying natural image statistics.

[1]  Jeffrey S. Perry,et al.  Statistics for optimal point prediction in natural images. , 2011, Journal of vision.

[2]  Saeed Saremi,et al.  Hierarchical model of natural images and the origin of scale invariance , 2013, Proceedings of the National Academy of Sciences.

[3]  Geoffrey E. Hinton,et al.  The "wake-sleep" algorithm for unsupervised neural networks. , 1995, Science.

[4]  Geoffrey E. Hinton,et al.  The Helmholtz Machine , 1995, Neural Computation.

[5]  Shang‐keng Ma Modern Theory of Critical Phenomena , 1976 .

[6]  H. Barlow Vision: A computational investigation into the human representation and processing of visual information: David Marr. San Francisco: W. H. Freeman, 1982. pp. xvi + 397 , 1983 .

[7]  W. Bialek,et al.  Statistical thermodynamics of natural images. , 2008, Physical review letters.

[8]  Jürgen Schmidhuber,et al.  Deep learning in neural networks: An overview , 2014, Neural Networks.

[9]  Terrence J. Sejnowski,et al.  On Criticality in High-Dimensional Data , 2014, Neural Computation.

[10]  P. Mahadevan,et al.  An overview , 2007, Journal of Biosciences.

[11]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[12]  Guigang Zhang,et al.  Deep Learning , 2016, Int. J. Semantic Comput..

[13]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[14]  Surya Ganguli,et al.  Deep Unsupervised Learning using Nonequilibrium Thermodynamics , 2015, ICML.

[15]  Matthias Bethge,et al.  Modeling Natural Image Statistics , 2015 .

[16]  P. Howe,et al.  Multicritical points in two dimensions, the renormalization group and the ϵ expansion , 1989 .

[17]  Eero P. Simoncelli,et al.  Natural image statistics and neural representation. , 2001, Annual review of neuroscience.

[18]  K. Wilson Problems in Physics with many Scales of Length , 1979 .

[19]  Terrence J. Sejnowski,et al.  Correlated Percolation, Fractal Structures, and Scale-Invariant Distribution of Clusters in Natural Images , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.