اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLinear Phase Perfect Reconstruction Filters and Wavelets with Even Symmetry
44
0
0.0
(
0
)
تأليف
Lucas Monzon
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Perfect reconstruction filter banks can be used to generate a variety of wavelet bases. Using IIR linear phase filters one can obtain symmetry properties for the wavelet and scaling functions. In this paper we describe all possible IIR linear phase filters generating symmetric wavelets with any prescribed number of vanishing moments. In analogy with the well known FIR case, we construct and study a new family of wavelets obtained by considering maximal number of vanishing moments for each fixed order of the IIR filter. Explicit expressions for the coefficients of numerator, denominator, zeroes, and poles are presented. This new parameterization allows one to design linear phase quadrature mirror filters with many other properties of interest such as filters that have any preassigned set of zeroes in the stopband or that satisfy an almost interpolating property. Using Beylkins approach, it is indicated how to implement these IIR filters not as recursive filters but as FIR filters.
قيم البحث
اقرأ أيضاً
Based upon the observations (i) that their in-plane lattice constants match almost perfectly and (ii) that their electronic structures overlap in reciprocal space for one spin direction only, we predict perfect spin filtering for interfaces between g
raphite and (111) fcc or (0001) hcp Ni or Co. The spin filtering is quite insensitive to roughness and disorder. The formation of a chemical bond between graphite and the open $d$-shell transition metals that might complicate or even prevent spin injection into a single graphene sheet can be simply prevented by dusting Ni or Co with one or a few monolayers of Cu while still preserving the ideal spin injection property.
In this paper we provide a complete and unifying characterization of compactly supported univariate scalar orthogonal wavelets and vector-valued or matrix-valued orthogonal multi-wavelets. This characterization is based on classical results from syst
em theory and basic linear algebra. In particular, we show that the corresponding wavelet and multi-wavelet masks are identified with a transfer function $$ F(z)=A+B z (I-Dz)^{-1} , C, quad z in mathbb{D}={z in mathbb{C} : |z| < 1}, $$ of a conservative linear system. The complex matrices $A, B, C, D$ define a block circulant unitary matrix. Our results show that there are no intrinsic differences between the elegant wavelet construction by Daubechies or any other construction of vector-valued or matrix-valued multi-wavelets. The structure of the unitary matrix defined by $A, B, C, D$ allows us to parametrize in a systematic way all classes of possible wavelet and multi-wavelet masks together with the masks of the corresponding refinable functions.
A new formalism is derived for the analysis and exact reconstruction of band-limited signals on the sphere with directional wavelets. It represents an evolution of the wavelet formalism developed by Antoine & Vandergheynst (1999) and Wiaux et al. (20
05). The translations of the wavelets at any point on the sphere and their proper rotations are still defined through the continuous three-dimensional rotations. The dilations of the wavelets are directly defined in harmonic space through a new kernel dilation, which is a modification of an existing harmonic dilation. A family of factorized steerable functions with compact harmonic support which are suitable for this kernel dilation is firstly identified. A scale discretized wavelet formalism is then derived, relying on this dilation. The discrete nature of the analysis scales allows the exact reconstruction of band-limited signals. A corresponding exact multi-resolution algorithm is finally described and an implementation is tested. The formalism is of interest notably for the denoising or the deconvolution of signals on the sphere with a sparse expansion in wavelets. In astrophysics, it finds a particular application for the identification of localized directional features in the cosmic microwave background (CMB) data, such as the imprint of topological defects, in particular cosmic strings, and for their reconstruction after separation from the other signal components.
In recent years, contour-based eigensolvers have emerged as a standard approach for the solution of large and sparse eigenvalue problems. Building upon recent performance improvements through non-linear least square optimization of so-called rational
filters, we introduce a systematic method to design these filters by minimizing the worst-case convergence ratio and eliminate the parametric dependence on weight functions. Further, we provide an efficient way to deal with the box-constraints which play a central role for the use of iterative linear solvers in contour-based eigensolvers. Indeed, these parameter-free filters consistently minimize the number of iterations and the number of FLOPs to reach convergence in the eigensolver. As a byproduct, our rational filters allow for a simple solution to load balancing when the solution of an interior eigenproblem is approached by the slicing of the sought after spectral interval.
In this paper, we address the problem of sampling from a set and reconstructing a set stored as a Bloom filter. To the best of our knowledge our work is the first to address this question. We introduce a novel hierarchical data structure called Bloom
SampleTree that helps us design efficient algorithms to extract an almost uniform sample from the set stored in a Bloom filter and also allows us to reconstruct the set efficiently. In the case where the hash functions used in the Bloom filter implementation are partially invertible, in the sense that it is easy to calculate the set of elements that map to a particular hash value, we propose a second, more space-efficient method called HashInvert for the reconstruction. We study the properties of these two methods both analytically as well as experimentally. We provide bounds on run times for both methods and sample quality for the BloomSampleTree based algorithm, and show through an extensive experimental evaluation that our methods are efficient and effective.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
