A new image representation algorithm inspired by image submodality models, redundancy reduction, and learning in biological vision

We develop a new biologically motivated algorithm for representing natural images using successive projections into complementary subspaces. An image is first projected into an edge subspace spanned using an ICA basis adapted to natural images which captures the sharp features of an image like edges and curves. The residual image obtained after extraction of the sharp image features is approximated using a mixture of probabilistic principal component analyzers (MPPCA) model. The model is consistent with cellular, functional, information theoretic, and learning paradigms in visual pathway modeling. We demonstrate the efficiency of our model for representing different attributes of natural images like color and luminance. We compare the performance of our model in terms of quality of representation against commonly used basis, like the discrete cosine transform (DCT), independent component analysts (ICA), and principal components analysis (PCA), based on their entropies. Chrominance and luminance components of images are represented using codes having lower entropy than DCT, ICA, or PCA for similar visual quality. The model attains considerable simplification for learning from images by using a sparse independent code for representing edges and explicitly evaluating probabilities in the residual subspace.

[1]  Norbert Krüger,et al.  Collinearity and Parallelism are Statistically Significant Second-Order Relations of Complex Cell Responses , 1998, Neural Processing Letters.

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Aapo Hyvärinen,et al.  Topographic Independent Component Analysis , 2001, Neural Computation.

[4]  Terrence J. Sejnowski,et al.  Unsupervised Learning , 2018, Encyclopedia of GIS.

[5]  Christopher M. Bishop,et al.  Mixtures of Probabilistic Principal Component Analyzers , 1999, Neural Computation.

[6]  C. Collin,et al.  An Introduction to Natural Computation , 1998, Trends in Cognitive Sciences.

[7]  H Barlow,et al.  Redundancy reduction revisited , 2001, Network.

[8]  Michael I. Jordan,et al.  Mixtures of Probabilistic Principal Component Analyzers , 2001 .

[9]  Terrence J. Sejnowski,et al.  Neural codes and distributed representations: foundations of neural computation , 1999 .

[10]  Ken Nakayama,et al.  Brightness perception and filling-in , 1991, Vision Research.

[11]  S. Grossberg,et al.  Neural dynamics of 1-D and 2-D brightness perception: A unified model of classical and recent phenomena , 1988, Perception & psychophysics.

[12]  E. Land,et al.  Lightness and retinex theory. , 1971, Journal of the Optical Society of America.

[13]  A Hurlbert,et al.  Formal connections between lightness algorithms. , 1986, Journal of the Optical Society of America. A, Optics and image science.

[14]  A. D. Hoyes Clinical Neuroanatomy for Medical Students , 1981 .

[15]  Jules Davidoff,et al.  Color perception , 1998 .

[16]  David J. Field,et al.  Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.

[17]  Bernard Moulden,et al.  A two-dimensional model of brightness perception based on spatial filtering consistent with retinal processing , 1999, Vision Research.

[18]  T. Cover,et al.  Entropy, Relative Entropy and Mutual Information , 2001 .

[19]  Aapo Hyvärinen,et al.  Emergence of Phase- and Shift-Invariant Features by Decomposition of Natural Images into Independent Feature Subspaces , 2000, Neural Computation.

[20]  Jeffrey S. Perry,et al.  Edge co-occurrence in natural images predicts contour grouping performance , 2001, Vision Research.