Multi-radius centralized projection for binary pattern histogram face recognition

The existing local binary pattern （LBP） operators have several disadvantages such as rather long histograms, lower discrimination, and sensitivity to noise. Aiming at these problems, we propose the central- ized binary pattern （CBP） operator. CBP operator can significantly reduce the histograms＇ dimensionality, offer stronger discrimination, and decrease the white noise＇s influence on face images. Moreover, for in- creasing the recognition accuracy and speed, we use multi-radius CBP histogram as face representation and project it onto locality preserving projection （LPP） space to obtain lower dimensional features. Experiments on FERET and CAS-PEAL databases demonstrate that the proposed method is superior to other modern approaches not only in recognition accuracy but also in recognition speed.     

二元三方向剖分中B样条的B网结构与递推算法

§1.引言众所周知,de Boor-Con递推公式及微分-差分公式对于一元B样条的理论和应用极为重要。在多元样条中是否存在类似的结果,已成为近年来的研究课题。本文从B网结构出发,讨论三向剖分下不同次数样条空间的B样条之间的递推关系,指出不能简单地把函数形式的de Boor-Con公式搬到这里,然而可以在B网意义下实现递推。与一     

两个二元函数之商的极限的探讨

在数学理论的研究和应用中，常常遇到这样的问题，设两个二元函数它们都在点（x0，y0）的某个邻域内连续（甚至于有更好的性质，例如可微），且（x0，y0）是它们的公共零点。当（x，y）→（x0，y0）时’此两个二元函数之商的极限是否存在？这是二元函数I型未定式的极限问题。与一元函数相比，二元函数未定式的极限问题要复杂得多和困难得多。引理1设函数g（x，y）在点（0，0）处可徽，且g（0，0）一0，匕radg（0，0）一1人IZ，。。。＿，2，。。、＿。。。＿＿。J。（0，0）。，＿＿＿。＿。nn。V。。。＿Vg‘Z（0，0）＋g’2（0，0）学0…     

保形2k＋1次C~k的样条插值方法

本文给出了对任何一组型值点构造２ｋ＋１次Ｃ~ｋ连续的保形插值样条函数的方法     

Strong convergence theorems for nonexpansive semi-groups in Banach spaces

Some strong convergence theorems of explicit composite iteration scheme for nonexpansive semi-groups in the framework of Banach spaces are established.Results presented in the paper not only extend and improve the corresponding results of Shioji- Takahashi,Suzuki,Xu and Aleyner-Reich,but also give a partially affirmative answer to the open questions raised by Suzuki and Xu.     

新二元三角插值多项式的构造

设Ω=[-πxπ,-πyπ],C(Ω)表示关于x,y均以2π为周期的连续函数空间.若f(x,y)∈C(Ω),取结点组为(xk,yl)=(2k+2n 1)π,(2l 2+m 1)πk=0,1,2,…,2n,l=0,1,2,…,2m,则我们获得一个二元三角插值多项式Cn,m(f;x,y)=M1N∑k=2n0∑l=2m0f(xk,yl).1+2∑nα=1cosα(x-xk)+2∑mβ=1cosβ(y-yl)+4∑nα=1∑mβ=1cosα(x-xk)cosβ(y-yl)其中M=2m+1,N=2n+1.为改进其收敛性,本文构造一个新的因子ρα,β,使得带有该因子ρα,β的二元三角插值多项式Ln,m(f;x,y)可以在全平面上一致地收敛到每个连续的f(x,y),且具有最佳逼近阶.     

Bivariate Blending Thiele-Werner＇s Osculatory Rational Interpolation

Both the expansive Newton＇s interpolating polynomial and the Thiele-Werner＇s interpolation are used to construct a kind of bivariate blending Thiele-Werner＇s osculatory rational interpolation. A recursive algorithm and its characteristic properties are given. An error estimation is obtained and a numerical example is illustrated.