whatmakesagoodmodelofnaturalimages-Hebrew.PDFVIP

What makes a good model of natural images? Yair Weiss1,2 1 Hebrew University of Jerusalem yweiss@cs.huji.ac.il William T. Freeman2 2 MIT CSAIL billf@mit.edu Abstract Many low-level vision algorithms assume a prior proba- bility over images, and there has been great interest in try- ing to learn this prior from examples. Since images are very non Gaussian, high dimensional, continuous signals, learning their distribution presents a tremendous computa- tional challenge. Perhaps the most successful recent algo- rithm is the Fields of Experts (FOE) [20] model which has shown impressive performance by modeling image statis- tics with a product of potentials defined on filter outputs. However, as in previous models of images based on filter outputs [30], calculating the probability of an image given the model requires evaluating an intractable partition func- tion. This makes learning very slow (requires Monte-Carlo sampling at every step) and makes it virtually impossible to compare the likelihood of two different models. Given this computational difficulty, it is hard to say whether nonintu- itive features learned by such models represent a true prop- erty of natural images or an artifact of the approximations used during learning. In this paper we present (1) tractable lower and upper bounds on the partition function of models based on filter outputs and (2) efficient learning algorithms that do not re- quire any sampling. Our results are based on recent results in machine learning that deal with Gaussian potentials. We extend these results to non-Gaussian potentials and derive a novel, basis rotation algorithm for approximating the maxi- mum likelihood filters. Our results allow us to (1) rigorously compare the likelihood of different models and (2) calcu- late high likelihood models of natural image statistics in a matter of minutes. Applying our results to previous models shows that the nonintuitive features are not an artifact of the learning process but rather are