A bound on the rate-distortion function and application to images
暂无分享,去创建一个
An upper bound on the rate-distortion function for discrete ergodic sources with memory is developed by partitioning the source sample space into a finite number of disjoint subsets and bounding the rates for each subset. The bound depends only on the mean vectors and covariance matrices for the subsets and is easy to compute. It is tighter than the Gaussian bound for sources that exhibit clustering of either the values or covariances of successive source outputs. The bound is evaluated for a certain class of pictorial data using both one-dimensional and two-dimensional blocks of picture elements. Two-dimensional blocks yield a tighter bound than one-dimensional blocks; both result in a significantly tighter bound than the Gaussian bound.
[1] V. Ralph Algazi,et al. Comparison of line-by-line and two-dimensional encoding of random images , 1971, IEEE Trans. Inf. Theory.
[2] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .
[3] Barin Geoffrey Haskell,et al. The computation and bounding of rate-distortion functions , 1969, IEEE Trans. Inf. Theory.