一类含参数的正交、对称四进小波构造

本文考虑四进制的正交、对称尺度函数，构造了一组带参数的系数长度为8的对称（反对称）滤波器组．并进一步构造了与尺度函数对称点一致、系数长度不超过8的所有对称(反对称)小波滤波器组．它包含了[10]中的滤波器组，从而拓广了[10]中滤波器的选择．     

α尺度r重正交共轭滤波器的构造

对于α尺度r重紧支撑正交多小波系统,给出了由长为L的α尺度r重正交共轭滤波器构造长为L+1的α尺度r重正交共轭滤波器的一般方法,也给出了由低阶矩阵滤波器构造高阶矩阵滤波器的方法.若给定的正交共轭滤波器满足完全重构条件,则利用算法构造新的滤波器也满足完全重构条件,算法还保持正交共轭滤波器对称性,这一点在信号处理方面具有很好的应用价值.     

a尺度正交的多小波

给出一种构造 a尺度正交多小波的方法 .它是由任意 a尺度正交的单小波及一组滤波器构造出来的 .由于 a尺度单正交尺度函数选取的任意性和滤波器的选取有相当大的自由度 ,使得有可能构造出大量 a尺度正交的多小波 .     

具有线性相位的4带正交滤波器的参数化

该文得到了具有线性相位的4带正交尺度滤波器的参数化形式,同时给出了构造相应的小波滤波器的一个简单的构造方法.应用所给出的参数化形式,得到了具有紧支撑的对称正交的尺度函数,进而也获得了相应的小波.     

一种利用平衡向量构造$M$-带紧支对称尺度滤波器的方法

本文研究了M-带紧支对称尺度滤波器的表示形式,利用平衡向量,得到一种代数构造方法.利用这种方法可以通过选择半正交矩阵来构造M-带紧支对称尺度滤波器.作为应用,参数化了一类结构优美的4-带紧支对称小波框架系统.     

一类具有对称性和插值性的紧支撑尺度函数

具有对称性和插值性的多进尺度函数的滤波器也具有相应的对称性和插值 性,本文研究具有具有对称性和插值性的滤波器构造问题.     

离散积分小波变换的快速算法

本文讨论了积分小波变换的快速算法,通过尺度函数与小波间的二尺度关系,导出了一个实现积分小波变换的快速计算方法及相应滤波器的构造方法。     

三元双正交小波滤波器的刻画

研究由三元双正交插值尺度函数构造对应的双正交小波滤波器的矩阵扩充问题.当给定的一对三元双正交尺度函数中有一个为插值函数时,利用提升思想与矩阵多相分解方法,给出一类三元双正交小波滤波器的显示构造公式和一个计算实例.讨论了三元双正交小波包的的性质.     

小波分式滤波器

1．引言用小波处理实际问题时，对称性具有重要的意义．如果小波不具有对称性，则在信号重构时可能导致失真．我们知道，用多项式滤波器构造的正交小波不具有对称性，这是一个重要的缺欠．本文讨论了分式滤波器，它作为多项式滤波器的最自然的推广和进展，且包含了B样条小波滤波器，可随意构造出对称性小波函数，对实际应用提供了有意义的构造性方法．在小波计算中，为了回避hllrl＊r逆变换，人们通常喜欢用Mdl时算法山，即对尺度函数方程为造迭代格式为了得到迭代收敛（n。、v）条件，通常把滤波器其中以及时，迭代格式（2）逐点收敛于尺…     

多元(M,R)-插值型可加细函数向量的构造

本文提出了一个全新的具有r个分量函数的多元插值型可加细函数向量,即(M,R)-插值型可加细函数向量,这里M是膨胀矩阵,r=|detR|.基于(M,R)-插值型尺度滤波器,我们详细地刻画了(M,R)-插值型可加细函数向量的性质,并得到了尺度滤波器满足k+1阶和规则的充分必要条件.此外,为获得具有对称性的(M,R)-插值型可加细函数向量,我们还给出了相应尺度滤波器的结构.围绕上述理论结果,在本文的最后,我们给出了若干数值构造实例.     

Approximation properties of wavelets and relations among scaling moments II

A new orthonormality condition for scaling functions is derived. This condition shows a close connection between orthonormality and relations among discrete scaling moments. This new condition in connection with certain approximation properties of scaling functions enables to prove new relations among discrete scaling moments and consequently the same relations for continuous scaling moments.     

Balanced biorthogonal scaling vectors using fractal function macroelements on

Geronimo, Hardin et al. have previously constructed orthogonal and biorthogonal scaling vectors by extending a spline scaling vector with functions supported on [0,1]. Many of these constructions occurred before the concept of balanced scaling vectors was introduced. This paper will show that adding functions on [0,1] is insufficient for extending spline scaling vectors to scaling vectors that are both orthogonal and balanced. We are able, however, to use this technique to extend spline scaling vectors to balanced, biorthogonal scaling vectors, and we provide two large classes of this type of scaling vector, with approximation order two and three, respectively, with two specific constructions with desirable properties in each case. The constructions will use macroelements supported on [0,1], some of which will be fractal functions.     

Matrix scaling,entropy minimization,and conjugate duality (II): The dual problem

We present a matrix scaling problem calledtruncated scaling and describe applications arising in economics, urban planning, and statistics. We associate a dual pair of convex optimization problems to the scaling problem and prove that the existence of a solution for the truncated scaling problem is characterized by the attainment of the infimum in the dual optimization problem. We show that optimization problems used by Bacharach (1970), Bachem and Korte (1979), Eaves et al. (1985), Marshall and Olkin (1968) and Rothblum and Schneider (1989) to study scaling problems can be derived as special cases of the dual problem for truncated scaling. We present computational results for solving truncated scaling problems using dual coordinate descent, thereby showing that truncated scaling provides a framework for modeling and solving large-scale matrix scaling problems.Research supported in part by NSF grants ECS 8718971 and ECS 8943458.     

三进制双正交对称小波的设计

本文给出了一种三进制双正交对称小波的设计方法.在给定插值紧支撑对称尺度函数的情况下,指出了如果对偶尺度函数同为紧支撑插值的,则它们同为1-型对称.并且给出了对偶尺度函数为紧支撑插值和非插值情况下的通解计算公式.还提出了频率优化方法设计对偶尺度函数和小波函数,把双正交条件归结为线性约束的二次规划问题,最后通过线性方程组来求解.对于小波函数本文也给出了一组特解公式.     

A modified scaling parameter for the memoryless BFGS updating formula

Based on an eigenvalue analysis, condition number of the scaled memoryless BFGS (Broyden–Fletcher–Goldfarb–Shanno) updating formula is obtained. Then, a modified scaling parameter is proposed for the mentioned updating formula, minimizing the given condition number. The suggested scaling parameter can be considered as a modified version of the self–scaling parameter proposed by Oren and Spedicato. Numerical experiments are done; they demonstrate practical effectiveness of the proposed scaling parameter.     

二元正交对称不可分尺度函数的参数化

Let I be the 2 × 2 identity matrix, and M a 2 × 2 dilation matrix with M2 = 2I. First, we present the correlation of the scaling functions with dilation matrix M and 2I. Then by relating the properties of scaling functions with dilation matrix 2I to the properties of scaling functions with dilation matrix M, we give a parameterization of a class of bivariate nonseparable orthogonal symmetric compactly supported scaling functions with dilation matrix M. Finally, a construction example of nonseparable orthogonal symmetric and compactly supported scaling functions is given.     

Smooth classification of geometrically finite one-dimensional maps

The scaling function of a one-dimensional Markov map is defined and studied. We prove that the scaling function of a non-critical geometrically finite one-dimensional map is Hölder continuous, while the scaling function of a critical geometrically finite one-dimensional map is discontinuous. We prove that scaling functions determine Lipschitz conjugacy classes, and moreover, that the scaling function and the exponents and asymmetries of a geometrically finite one-dimensional map are complete -invariants within a mixing topological conjugacy class.

     

Optimization and data structure: Seven faces of dual scaling

Dual scaling can be looked at as several different optimization problems, which suggests a number of optimal properties inherent in this scaling method. This study identifies some of its old and new aspects, providing a brief, but comprehensive, characterization of dual scaling. It is important to be aware of its limitations as well as possibilities, particularly because the method is deterministic or mathematical rather than probabilistic or statistical, hence rendering it a greater risk of misapplication. Seven key characteristics of dual scaling are identified and discussed.     

Linear scaling and the DIRECT algorithm

In this paper, we discuss the performance of the DIRECT global optimization algorithm on problems with linear scaling. We show with computations that the performance of DIRECT can be affected by linear scaling of the objective function. We also provide a theoretical result which shows that DIRECT does not perform well when the absolute value of the objective function is large enough. Then we present DIRECT-a, a modification of DIRECT, to eliminate the sensitivity to linear scaling of the objective function. We prove theoretically that linear scaling of the objective function does not affect the performance of DIRECT-a. Similarly, we prove that some modifications of DIRECT are also unaffected by linear scaling of the objective function, while the original DIRECT algorithm is sensitive to linear scaling. Numerical results in this paper show that DIRECT-a is more robust than the original DIRECT algorithm, which support the theoretical results. Numerical results also show that careful choices of the parameter ε can help DIRECT perform well when the objective function is poorly linearly scaled.     

A capacity scaling algorithm for convex cost submodular flows

This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities is available.