Dept. of Electr. Eng., Columbia Univ., New York, NY.
IEEE Trans Image Process. 1993;2(2):160-75. doi: 10.1109/83.217221.
A fast rate-distortion (R-D) optimal scheme for coding adaptive trees whose individual nodes spawn descendents forming a disjoint and complete basis cover for the space spanned by their parent nodes is presented. The scheme guarantees operation on the convex hull of the operational R-D curve and uses a fast dynamic programing pruning algorithm to markedly reduce computational complexity. Applications for this coding technique include R. Coefman et al.'s (Yale Univ., 1990) generalized multiresolution wavelet packet decomposition, iterative subband coders, and quadtree structures. Applications to image processing involving wavelet packets as well as discrete cosine transform (DCT) quadtrees are presented.
提出了一种快速率失真（R-D）最优方案，用于对自适应树进行编码，这些树的各个节点生成后代，形成与其父节点所张成的空间的不相交且完备的基覆盖。该方案保证在操作 R-D 曲线的凸包上进行操作，并使用快速动态编程修剪算法显著降低计算复杂度。该编码技术的应用包括 R. Coefman 等人（耶鲁大学，1990 年）的广义多分辨率小波包分解、迭代子带编码器和四叉树结构。还介绍了将小波包以及离散余弦变换（DCT）四叉树应用于图像处理的情况。
