Paper Info

Title | ||
---|---|---|

Stealing bits from a quantized source |

Abstract | ||
---|---|---|

We consider "bit stealing" scenarios where the rate of a source code must be reduced without prior planning. We first investigate the efficiency of source requantization to reduce rate, which we term successive degradation. We focus on finite-alphabet sources with arbitrary distortion measures as well as the Gaussian-quadratic and high-resolution scenarios. We show an achievable rate-distortion tradeoff and prove that this is the best guaranteeable tradeoff for any good source code. This tradeoff is in general different from the rate-distortion tradeoff with successive refinement, where there is prior planning. But, we show that with quadratic distortion measures, for all sources with finite differential entropy and at least one finite moment, the gap is at most 1/2 bit or 3 dB in the high-resolution limit. In the Gaussian-quadratic case, the gap is at most 1/2 bit for all resolutions. We further consider bit stealing in the form of information embedding, whereby an embedder acts on a quantized source and produces an output at the same rate and in the original source codebook. We develop achievable distortion-rate tradeoffs. Two cases are considered, corresponding to whether or not the source decoder is informed of the embedding rate. In the Gaussian-quadratic case, we show the informed decoder need only augment the regular decoder with simple post-reconstruction distortion compensation in the form of linear scaling for the resulting system to be as efficient as bit stealing via successive degradation. Finally, we show that the penalty for uninformed versus informed decoders is at most 3 dB or 0.21-bit in the Gaussian-quadratic case and that their performance also lies within the 1/2-bit gap to that of successive refinement. |

Year | DOI | Venue |
---|---|---|

2006 | 10.1109/TIT.2006.876237 | IEEE Transactions on Information Theory |

Keywords | Field | DocType |

rate distortion theory,finite-alphabet source,gaussian-quadratic case,information embedding,good source code,quantized source,original source codebook,successive degradation,quantization,informed decoder,index terms — transcoding,digital watermarking,prior planning,source code,coding with side information,successive refinement,degradation,decoding,source coding | Discrete mathematics,Source code,Computer science,Information protection policy,Differential entropy,Decoding methods,Quantization (signal processing),Rate–distortion theory,Distortion,Codebook | Journal |

Volume | Issue | ISSN |

52 | 7 | 0018-9448 |

ISBN | Citations | PageRank |

0-7803-7501-7 | 3 | 0.58 |

References | Authors | |

22 | 4 |

Authors (4 rows)

Cited by (3 rows)

References (22 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

A. S. Cohen | 1 | 3 | 0.58 |

Draper, Stark C. | 2 | 132 | 9.78 |

E. Martinian | 3 | 174 | 11.99 |

Gregory W. Wornell | 4 | 9849 | 1189.42 |