Computation and analysis of the N-layer scalable rate-distortion function

IEEE Transactions on Information Theory

Volumn 49, Issue 5, 2003, Pages 1218-1230

  Tuncel, Ertem ^a   Rose, Kenneth ^a  

^a University of California   (United States)

Author keywords

Alternating minimization; Kuhn Tucker optimality conditions; Rate distortion (RD); Scalable source coding; Successive refinement

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; OPTIMIZATION; PERTURBATION TECHNIQUES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SIGNAL ENCODING;

BLAHUT-ARIMOTO ALGORITHM; KUHN-TUCKER OPTIMALITY CONDITIONS; RATE DISTORTION; SCALABLE SOURCE CODING;

SIGNAL DISTORTION;

EID: 0038530848     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.810627     Document Type: Article

References (16)

1. S. Arimoto, "An algorithm for computing capacity of arbitrary discrete memoryless channels," IEEE Trans. Inform. Theory, vol. IT-18, pp. 14-20, Jan. 1972.
2. T. Berger, Rate Distortion Theory. A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
3. R. E. Blahut, "Computation of channel capacity and rate-distortion functions," IEEE Trans. Inform. Theory, vol. IT-18, pp. 460-473, July 1972.
4. ____, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
5. I. Csiszár, "On the computation of rate-distortion functions," IEEE Trans. Inform. Theory, vol. IT-20, pp. 122-124, Jan. 1974.
6. I. Csiszár and G. Tusnády, "Information geometry and alternating minimization procedures," Statist. Decisions, pp. 205-237, 1984, Supplement Issue 1.
7. M. Effros, "Distortion-rate bounds for fixed- and variable-rate multiresolution source coding," IEEE Trans. Inform. Theory, vol. 45, pp. 1887-1910, Sept. 1999.
8. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, Mar. 1991.
9. A. M. Gerrish, "Estimation of information rates," Ph.D. dissertation, Yale Univ., New Haven, CT, 1963.
10. V. Koshelev, "Hierarchical coding of discrete sources," Probl. Pered. Inform., vol. 16, no. 3, pp. 31-49, 1980.
11. ____, "An evaluation of the average distortion for discrete schemes of sequential approximation," Probl. Pered. Inform., vol. 17, no. 3, pp. 20-33, 1981.
12. L. Lastras and T. Berger, "All sources are nearly successively refinable," IEEE Trans. Inform. Theory, vol. 47, pp. 918-926, Mar. 2001.
13. D.G. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
14. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol. 40, pp. 253-259, Jan. 1994.
15. K. Rose, "A mapping approach to rate-distortion computation and analysis," IEEE Trans. Inform. Theory, vol. 40, pp. 1939-1952, Nov. 1994.
16. ____, "Deterministic annealing for clustering, compression, classification, regression, and related optimization problems," Proc. IEEE, vol. 86, pp. 2210-2239, Nov. 1998.