数据流小波变换编码的近似算法
Approximation algorithms for wavelet transform coding of data streams
摘要:
本文讨论的问题,找到一个B项小波表示的离散函数$f \in \real^n$,其距离f是最小的。当我们寻求最小化f和它的表示之间的欧几里得距离时,这个问题很容易理解。本文给出了在各种紧支集小波基下寻找最小化广义$\ell_p$距离(包括$\ell_\infty$)的可证明近似表示的第一个已知算法。对于Haar基,给出了一个多项式时间近似方案.这些算法适用于一次通过的子线性空间数据流计算模型。它们自然地推广到多维和加权范数。一个普遍的表示,提供了一个可证明的近似保证下,所有的p-范数同时和第一个近似算法的比特预算版本的问题,称为自适应量化,也提出。此外,它表明,这里提出的算法可以用来选择一个基础从树结构的字典的基地,并找到一个B-项表示的给定函数,可证明近似其最佳字典的基础表示。
英文摘要:
This paper addresses the problem of finding a B-term wavelet representation of a given discrete function $f \in \real^n$ whose distance from f is minimized. The problem is well understood when we seek to minimize the Euclidean distance between f and its representation. The first known algorithms for finding provably approximate representations minimizing general $\ell_p$ distances (including $\ell_\infty$) under a wide variety of compactly supported wavelet bases are presented in this paper. For the Haar basis, a polynomial time approximation scheme is demonstrated. These algorithms are applicable in the one-pass sublinear-space data stream model of computation. They generalize naturally to multiple dimensions and weighted norms. A universal representation that provides a provable approximation guarantee under all p-norms simultaneously; and the first approximation algorithms for bit-budget versions of the problem, known as adaptive quantization, are also presented. Further, it is shown that the algorithms presented here can be used to select a basis from a tree-structured dictionary of bases and find a B-term representation of the given function that provably approximates its best dictionary-basis representation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。