Bernstein fractal approximation and fractal full Müntz theorems
نویسندگان
چکیده
منابع مشابه
On Fractal Measures and Diophantine Approximation
We study diophantine properties of a typical point with respect to measures on Rn. Namely, we identify geometric conditions on a measure μ on Rn guaranteeing that μ-almost every y ∈ Rn is not very well multiplicatively approximable by rationals. Measures satisfying our conditions are called ‘friendly’. Examples include smooth measures on nondegenerate manifolds; thus this paper generalizes the ...
متن کاملSelf-similarity, Fractal Models and Spline Approximation
Invariance is an attractive principle for specifying image processing algorithms. In this presentation, we concentrate on self-similarity—more precisely, shift, scale and rotation invariance—and identify the corresponding class of operators in d dimensions. For d = 1, there is no rotation and the scale-invariant differential operators are the fractional derivatives: ∂ γ τ ←→ (− jω) γ 2−τ( jω) γ...
متن کاملFractal image approximation and orthogonal bases
We are concerned with the fractal approximation of multidimensional functions in L2. In particular, we treat a position-dependent approximation using orthogonal bases of L2 and no search. We describe a framework that establishes a connection between the classic orthogonal approximation and the fractal approximation. The main theorem allows easy and univocal computation of the parameters of the ...
متن کاملFractal Approximation and Compression Using Projected Ifs
Approximation of natural objects (curves, surfaces, or images) with fractal models is an important center of interest for research. The general inverse problem paradigm concerns many application fields and a large variety of studies have been proposed to address it.The most known of them is the fractal image compression method introduced by Jacquin. Generally speaking, these techniques lack of ...
متن کاملTrigonometric Approximation in Fractal Image Coding
In this paper is presented a new approach in fractal image coding based on trigonometric approximation. The least square approximation method is used for approximation of blocks in standard fractal image compression algorithm. In the paper is shown that it is possible to use also trigonometric approximation for describing of blocks in fractal image coding. This approximation was implemented and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETNA - Electronic Transactions on Numerical Analysis
سال: 2019
ISSN: 1068-9613,1068-9613
DOI: 10.1553/etna_vol51s1