期刊
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS
卷 11, 期 2, 页码 192-226出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1006/acha.2001.0336
关键词
compression; n-term approximation; encoding; Kolmogorov entropy
Tree approximation is a new form of nonlinear approximation which appears naturally in some applications such as image processing and adaptive numerical methods. It is somewhat more restrictive than the usual n-term approximation. We show that the restrictions of tree approximation cost little in terms of rates of approximation. We then use that result to design encoders for compression. These encoders are universal (they apply to general functions) and progressive (increasing accuracy is obtained by sending bit stream increments). We show optimality of the encoders in the sense that they provide upper estimates for the Kolmogorov entropy of Besov balls. (C) 2001 Academic Press.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据