Tree Approximation and Optimal Encoding
نویسندگان
چکیده
منابع مشابه
Tree Approximation and Optimal Encoding
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 ...
متن کاملTree Approximation and Encoding
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 ...
متن کاملOptimal Tree Approximation with Wavelets
The more a priori knowledge we encode into a signal processing algorithm, the better performance we can expect. In this paper, we overview several approaches to capturing the structure of singularities (edges, ridges, etc.) in wavelet-based signal processing schemes. Leveraging results from approximation theory, we discuss nonlinear approximations on trees and point out that an optimal tree app...
متن کاملfragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولApproximation algorithms for the optimal p-source communication spanning tree
The computational complexity and the approximation algorithms of the optimal p-source communication spanning tree (p-OCT) problem were investigated. Let G be an undirected graph with nonnegative edge lengths. Given p vertices as sources and all vertices as destinations, and also given arbitrary requirements between sources and destinations, we investigated the problem how to construct a spannin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2001
ISSN: 1063-5203
DOI: 10.1006/acha.2001.0336