Features as sufficient statistics

Advances in Neural Information Processing Systems

Volumn , Issue , 1998, Pages 794-800

  Geiger, D ^a   Rudra, A ^a   Maloney, L ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RECONSTRUCTION PROBLEMS; SPARSE DATA; SUFFICIENT STATISTICS;

EID: 84890477319     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. A. Berger and S. Delia Pietra and V. Delia Pietra "A Maximum Entropy Approach to Natural Language Processing" Computational Linguistics, Vol.22 (1), pp 39-71, 1996.
2. T. Cover and J. Thomas. Elements of Information Theory. Wiley Interscience, New York, 1991.
3. D. Geiger and J. E. Kogler. Scaling Images and Image Feature via the Renormaliza- Tion Group. In Proc. IEEE Conf. on Computer Vision & Pattern Recognition, New York, NY, 1993.
4. G. Hinton and Z. Gkahramani. Generative Models for Discovering Sparse Distributed Representations To Appear Phil. Trans, of the Royal Society B, 1997.
5. R. Linsker. Self-Organization in a Perceptual Network. Computer, March 1988, 105-117.
6. J. Principe, U. of Florida at Gainesville Personal Communication.
7. T. Sejnowski. Computational Models and the Development of Topographic Projections Trends Neurosci, 10, 304-305.
8. S.C. Zhu, Y.N. Wu, D. Mumford. Minimax entropy principle and its application to texture modeling Neural Computation 1996 B.
9. P. Viola and W.M. Wells III. "Alignment by Maximization of Mutual Information". In Proceedings of the International Conference on Computer Vision. Boston. 1995.