The construction of wavelets from generalized conjugate mirror filters in

The classical constructions of wavelets and scaling functions from conjugate mirror filters are extended to settings that lack multiresolution analyses. Using analogues of the classical filter conditions, generalized mirror filters are defined in the context of a generalized notion of multiresolution analysis. Scaling functions are constructed from these filters using an infinite matrix product. From these scaling functions, non-MRA wavelets are built, including one whose Fourier transform is infinitely differentiable on an arbitrarily large interval.     

Smoothing Minimally Supported Frequency Wavelets: Part II

The main purpose of this paper is to give a procedure to "mollify" the low-pass filters of a large number of Minimally Supported Frequency (MSF) wavelets so that the smoother functions obtained in this way are also low-pass filters for an MRA. Hence, we are able to approximate (in the L²-norm) MSF wavelets by wavelets with any desired degree of smoothness on the Fourier transform side. Although the MSF wavelets we consider are bandlimited, this may not be true for their smooth approximations. This phenomena is related to the invariant cycles under the transformation $x\mapsto 2x (\mbox{mod}2\pi).The main purpose of this paper is to give a procedure to “mollify” the low-pass filters of a large number ofMinimally Supported Frequency (MSF) wavelets so that the smoother functions obtained in this way are also low-pass filters for an MRA. Hence, we are able to approximate (in the L ² -norm) MSF wavelets by wavelets with any desired degree of smoothness on the Fourier transform side. Although the MSF wavelets we consider are bandlimited, this may not be true for their smooth approximations. This phenomena is related to the invariant cycles under the transformation x ?2x (mod2π). We also give a characterization of all low-pass filters for MSF wavelets. Throughout the paper new and interesting examples of wavelets are described.     

Design of Interpolating Biorthogonal Multiwavelet Systems with Compact Support

In this paper we characterize all totally interpolating biorthogonal finite impulse response (FIR) multifilter banks of multiplicity two, and provide a design framework for corresponding compactly supported multiwavelet systems with high approximation order. In these systems, each component of the analysis and synthesis portions possesses the interpolating property. The design framework is based on scalar filter banks, and examples with approximation order two and three are provided. We show that our multiwavelet systems preserve almost all of the desirable properties of the generalized interpolating scalar wavelet systems, including the dyadic-rational nature of the filter coefficients, equality of the flatness degree of the low-pass filters and the approximation order of the corresponding functions, and equality between the uniform samples of a signal and its projection coefficients for a given scale. This last property allows us to avoid the cumbersome prefiltering associated with standard multiwavelet systems. We also show that there are no symmetric totally interpolating biorthogonal multifilter banks of multiplicity two. Finally, we point out that our design framework incorporates a simple relationship between the multiscaling functions and multiwavelets that substantially simplifies the implementation of the system.     

On the error behaviour of the filtered back projection

The filtered back projection (FBP) formula allows us to reconstruct bivariate functions from given Radon samples. However, the FBP formula is numerically unstable and low-pass filters with finite bandwidth and a compactly supported window function are employed to make the reconstruction by FBP less sensitive to noise. In this paper we analyse the inherent reconstruction error which is incurred by the application of a low-pass filter with finite bandwidth. We present L²-error estimates on Sobolev spaces of fractional order along with asymptotic convergence rates, where the filter's bandwidth goes to infinity. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hexagonal tight frame filter banks with idealized high-pass filters

This paper studies the construction of hexagonal tight wavelet frame filter banks which contain three “idealized” high-pass filters. These three high-pass filters are suitable spatial shifts and frequency modulations of the associated low-pass filter, and they are used by Simoncelli and Adelson in (Proc IEEE 78:652–664, 1990) for the design of hexagonal filter banks and by Riemenschneider and Shen in (Approximation Theory and Functional Analysis, pp. 133–149, Academic Press, Boston 1991; J. Approx Theory 71:18–38 1992) for the construction of 2-dimensional orthogonal filter banks. For an idealized low-pass filter, these three associated high-pass filters separate high frequency components of a hexagonal image in 3 different directions in the frequency domain. In this paper we show that an idealized tight frame, a frame generated by a tight frame filter bank containing the “idealized” high-pass filters, has at least 7 frame generators. We provide an approach to construct such tight frames based on the method by Lai and Stöckler in (Appl Comput Harmon Anal 21:324–348, 2006) to decompose non-negative trigonometric polynomials as the summations of the absolute squares of other trigonometric polynomials. In particular, we show that if the non-negative trigonometric polynomial associated with the low-pass filter p can be written as the summation of the absolute squares of other 3 or less than 3 trigonometric polynomials, then the idealized tight frame associated with p requires exact 7 frame generators. We also discuss the symmetry of frame filters. In addition, we present in this paper several examples, including that with the scaling functions to be the Courant element B ₁₁₁ and the box-spline B ₂₂₂. The tight frames constructed in this paper will have potential applications to hexagonal image processing.     

Smoothing minimally supported frequency wavelets: Part II

The main purpose of this paper is to give a procedure to “mollify” the low-pass filters of a large number ofMinimally Supported Frequency (MSF) wavelets so that the smoother functions obtained in this way are also low-pass filters for an MRA. Hence, we are able to approximate (in the L ² -norm) MSF wavelets by wavelets with any desired degree of smoothness on the Fourier transform side. Although the MSF wavelets we consider are bandlimited, this may not be true for their smooth approximations. This phenomena is related to the invariant cycles under the transformation x ↦2x (mod2π). We also give a characterization of all low-pass filters for MSF wavelets. Throughout the paper new and interesting examples of wavelets are described.     

利用提升格式构造稳定的对偶小波

近年来 ,产生了一种称为“提升格式”的新的小波构造方法 [7,8,9] ,它从一个较简单的多尺度分析 (MRA)出发 ,利用尺度函数相同的多尺度分析之间的相互关系 ,逐步地得到所需性质的多尺度分析 .本文仅考虑双正交滤波的提升格式 .当选定一初始双正交滤波后 ,利用提升格式构造的双正交滤波仍是双正交的 ,而这双正交滤波能否生成双正交小波 Riesz基即稳定的对偶小波 ?更进一步 ,如何从一些较为简单的不能生成双正交小波 Riesz基的双正交滤波出发 ,利用提升格式构造出具有 Riesz基性质的双正交滤波 ?这在目前有关提升格式的文章中没作回答 .本…     

广义变系数模型的Bayesian B样条估计

提出了广义变系数模型函数系数的一种新的估计方法．我们用B样条函数逼近函数系数,不具体选择节点的个数,而是节点个数取均匀的无信息先验,样条函数系数取正态先验,用Bayesian模型平均的方法估计各个函数系数．这种估计方法一个主要特点是允许各个函数系数所需节点个数的后验分布不同,因此允许不同函数系数使用不同的光滑参数．另外,本文还给出了Bayesian B样条估计的计算方法,并通过模拟例子,说明广义变系数模型的函数系数可以由Bayesian B样条估计方法得到很好的估计．     

Wavelet Filter Functions,the Matrix Completion Problem,and Projective Modules Over <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Bold">T</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

We discuss how one can use certain filters from signal processing to describe isomorphisms between certain projective C(T ⁿ )-modules. Conversely, we show how cancellation properties for finitely generated projective modules over C(T ⁿ ) can often be used to prove the existence of continuous high pass filters, of the kind needed for multivariate wavelets, corresponding to a given continuous low-pass filter. However, we also give an example of a continuous low-pass filter for which it is impossible to find corresponding continuous high-pass filters. In this way we give another approach to the solution of the matrix completion problem for filters of the kind arising in wavelet theory.     

On Rough Intuitionistic Fuzzy Ideals（Filters） in Lattices

In this paper, we introduce a new algebraic structure, called a rough intuitionistic fuzzy ideal（filter） which is a generalized intuitionistic fuzzy ideal（filter） of a lattice and study some related properties of such ideals（filters）.     

关于小波正则性的几个问题

本文给出了确定尺度函数正则指数的一个公式,证明了正交的四系数滤波中Daubechies小波正则性最优,并结合B-样条对应的双正交滤波,应用提升格式,增加对偶小波的正则性.     

Generalized filters, the low-pass condition, and connections to multiresolution analyses

We study generalized filters that are associated to multiplicity functions and homomorphisms of the dual of an abelian group. These notions are based on the structure of generalized multiresolution analyses. We investigate when the Ruelle operator corresponding to such a filter is a pure isometry, and then use that characterization to study the problem of when a collection of closed subspaces, which satisfies all the conditions of a GMRA except the trivial intersection condition, must in fact have a trivial intersection. In this context, we obtain a generalization of a theorem of Bownik and Rzeszotnik.     

二进小波的构造方法研究

提出两种二进小波的构造方法.首先,将Mallat构造的B-样条二进小波推广得到一种构造B-样条二进小波的新方法;其次,基于二进提升方案提出构造二进小波的另一种新方法—–构造定理,并通过调整定理中提升参数的形式、以新的B-样条二进小波作为初始二进小波,具体构造了具有有限长单位脉冲响应、高阶消失矩、线性相位的提升二进小波,这些提升二进小波不能由Sweldens提升方案得到.     

Parseval frame wavelets with -dilations

We study Parseval frame wavelets in with matrix dilations of the form , where A is an arbitrary expanding n×n matrix with integer coefficients, such that |detA|=2. We show that each A-MRA admits either Parseval frame wavelets, or Parseval frame bi-wavelets. The minimal number of generators for a Parseval frame associated with an A-MRA (i.e. 1 or 2) is determined in terms of a scaling function. All Parseval frame (bi)wavelets associated with A-MRA's are described. We then introduce new classes of filter induced wavelets and bi-wavelets. It is proved that these new classes strictly contain the classes of all A-MRA Parseval frame wavelets and bi-wavelets, respectively. Finally, we demonstrate a method of constructing all filter induced Parseval frame (bi)wavelets from generalized low-pass filters.     

On fuzzy fantastic filters of lattice implication algebras

Fuzzification of a fantastic filter in a lattice implication algebra is considered. Relations among a fuzzy filter, a fuzzy fantastic filter, and fuzzy positive implicative filter are stated. Conditions for a fuzzy filter to be a fuzzy fantastic filter are given. Using the notion of level set, a characterization of a fuzzy fantastic filter is considered. Extension property for fuzzy fantastic filters is established. The notion of normal/maximal fuzzy fantastic filters and complete fuzzy fantastic filters is introduced, and some related properties are investigated.     

On (∈, ∈ ∨ q)‐fuzzy filters of R0‐algebras

In this paper, we introduce the notions of (∈, ∈ ∨ q)‐fuzzy filters and (∈, ∈ ∨ q)‐fuzzy Boolean (implicative) filters in R₀‐algebras and investigate some of their related properties. Some characterization theorems of these generalized fuzzy filters are derived. In particular, we prove that a fuzzy set in R₀‐algebras is an (∈, ∈ ∨ q)‐fuzzy Boolean filter if and only if it is an (∈, ∈ ∨ q)‐fuzzy implicative filter. Finally, we consider the concepts of implication‐based fuzzy Boolean (implicative) filters of R₀‐algebras (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A simple smoothing spline,III

Summary  Computational methods for spline smoothing are studied in the context of the linear smoothing spline. Comparisons are made between two efficient methods for computing the estimator using band-limited basis functions and the Kalman filter. In particular, the Kalman filter approach is shown to be an efficient method for computing under the Kimeldorf-Wahba representation for the estimator. Run time comparisons are made between band-limited B-spline and Kalman filter based algorithms.     

通带可调相位 FIR 数字滤波器及其设计

常见的 FIR 数字滤波器大致可分为两类:一类是线性相位滤波器;另一类是极小相位滤波器,这两种类型的滤波器,其相位响应均不可调.第一种滤波器,其群延迟为((N-1)T)/2,其中 N 为滤波器长度,T 为采样周期.以 N=60,T=0.2秒的线性相位滤波器为例,它的相位响应为     

Filtering for a class of nonlinear discrete-time stochastic systems with state delays

In this paper, the filtering problem is investigated for a class of nonlinear discrete-time stochastic systems with state delays. We aim at designing a full-order filter such that the dynamics of the estimation error is guaranteed to be stochastically, exponentially, ultimately bounded in the mean square, for all admissible nonlinearities and time delays. First, an algebraic matrix inequality approach is developed to deal with the filter analysis problem, and sufficient conditions are derived for the existence of the desired filters. Then, based on the generalized inverse theory, the filter design problem is tackled and a set of the desired filters is explicitly characterized. A simulation example is provided to demonstrate the usefulness of the proposed design method.     

On a class of SGS filters for LES with shape preserving concatenation properties

We develop a class of filter functions for large-eddy simulation which have the key property that multiple successive application even with different filter widths is equal to a single filtering employing filters from the same class but at an extended or equal filter width. In the context of the filter class development we obtain a functional delay equation which for special cases may be solved completely general. The presently developed class of filters may be used in conjunction with certain sub-grid scale models such as the approximate deconvolution model [3] where explicit multiple filtering is needed. Hence utilizing filters from the present class computational cost of filter evaluation may be considerably reduced.