In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
Krishnan Padmanabhan, Sundeep Venkatraman, Oliver ...
We present a hybrid approach to image watermarking that exploits results from both information theory and perceptual studies. Towards this purpose we use a waterfilling-type algor...
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
We present an information theoretic approach for learning a linear dimension reduction transform for object classification. The theoretic guidance of the approach is that the trans...