DocumentCode
2940284
Title
Erasure Entropy
Author
Verdu, Sergio ; Weissman, Tsachy
Author_Institution
Dept. of Electr. Eng., Princeton Univ., NJ
fYear
2006
fDate
9-14 July 2006
Firstpage
98
Lastpage
102
Abstract
We define the erasure entropy of a collection of random variables as the sum of entropies of the individual variables conditioned on all the rest. The erasure entropy rate of a source is defined as the limit of the normalized erasure entropy. The erasure entropy measures the information content carried by each symbol knowing its context. In the setup of a source observed through an erasure channel, we offer an operational characterization of erasure entropy rate as the minimal amount of bits per erasure required to recover the erased information in the limit of small erasure probability. When we allow recovery of the erased symbols within a prescribed degree of distortion, the fundamental tradeoff is described by the erasure rate-distortion function which we characterize. When no additional encoded information is available, the erased information is reconstructed solely on the basis of its context by a denoiser. Connections between erasure entropy and discrete denoising are also explored
Keywords
channel coding; entropy; error statistics; discrete denoising; erasure channel; erasure probability; erasure rate-distortion function; normalized erasure entropy; Data compression; Entropy; Image reconstruction; Markov processes; Markov random fields; Multidimensional systems; Noise reduction; Physics computing; Random variables; Rate-distortion; Data Compression; Discrete Denoising; Entropy; Erasure Channels; Markov processes; Rate-Distortion Theory; Shannon Theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261682
Filename
4035929
Link To Document