The Community for Technology Leaders
Pervasive Computing and Communications Workshops, IEEE International Conference on (2012)
Lugano, Switzerland
Mar. 19, 2012 to Mar. 23, 2012
ISBN: 978-1-4673-0905-9
pp: 58-63
Prithwish Basu , Raytheon BBN Technologies, Cambridge MA
Jie Bao , Samsung US R&D Center, San Jose, CA
Mike Dean , Raytheon BBN Technologies, Cambridge MA
James Hendler , RPI, Troy NY
We show how semantic relationships that exist within an information-rich source can be exploited for achieving parsimonious communication between a pair of semantically-aware nodes that preserves quality of information. We extend the source coding theorem of classical information theory to encompass semantics in the source and show that by utilizing semantic relations between source symbols, higher rate of lossless compression may be achieved compared to traditional syntactic compression methods. We define the capacity of a semantic source as the mutual information between its models and syntactic messages, and show that it equals the average semantic entropy of its messages. We further show the duality of semantic redundancy and semantic ambiguity in compressing semantic data, and establish the semantic capacity of a source as the lower bound on semantic compression. Finally, we give a practical semantic compression algorithm that exploits the graph structure of a shared knowledge base to facilitate semantic communication between a pair of nodes.

J. Hendler, J. Bao, P. Basu and M. Dean, "Preserving quality of information by using semantic relationships," 2012 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)(PERCOM WORKSHOPS), Lugano, 2012, pp. 58-63.
84 ms
(Ver 3.3 (11022016))