Fast inversion of matrices arising in image processing

In recent years, new nonlinear partial differential equation (PDE) based approaches have become popular for solving image processing problems. Although the outcome of these methods is often very promising, their actual realization is in general computationally intensive. Therefore, accurate and efficient schemes are needed. The aim of this paper is twofold. First, we will show that the three dimensional alignment problem of a histological data set of the human brain may be phrased in terms of a nonlinear PDE. Second, we will devise a fast direct solution technique for the associated structured large systems of linear equations. In addition, the potential of the derived method is demonstrated on real-life data. This revised version was published online in June 2006 with corrections to the Cover Date.     

微机控制扫描迈克尔逊干涉仪

本介绍用微机控制迈克尔逊干涉仪动镜的扫描,匀速改变光程差,并获取中央干涉条纹光强变化,经FFT得到入射光光谱图。     

An automatic integration procedure for infinite range integrals involving oscillatory kernels

Let the real functionsK(x) andL(x) be such thatM(x)=K(x)+iL(x)=e^ix g(x), whereg(x) is infinitely differentiable for all largex and is non-oscillatory at infinity. We develop an efficient automatic quadrature procedure for numerically computing the integrals _a K(t)f(t) and _a L(t)f(t)dt, where the functionf(t) is smooth and nonoscillatory at infinity. One such example for which we also provide numerical results is that for whichK(x)=J (x) andL(x)=Y (x), whereJ (x) andY (x) are the Bessel functions of order . The procedure involves the use of an automatic scheme for Fourier integrals and the modified W-transformation which is used for computing oscillatory infinite integrals.     

压电晶体位移特性曲线干涉自动测量方法

本文提出了压电晶体(PZT)位移物曲线自动干涉测量方法,该方法利用干涉仪把PZT的微位移量转化成干涉条纹相位变化量,通过快速傅里叶变换(FFT)方法自动复原干涉条纹中包含的相位的变化量,从而高精度地检测出PZT的位移特性曲线.根据该方法,利用CCD摄象机、图象板和干涉仪组合成一套光、机、电一体化的微位移自动测试系统,实际测量了我们研制的PZT随电压变化的位移特性曲线.实验表明,该方法原理实现简单,且能实现高精度、自动、实时和动态测量.     

A fast algorithm for numerical solutions to Fortet's equation

A fast algorithm for computation of default times of multiple firms in a structural model is presented. The algorithm uses a multivariate extension of the Fortet's equation and the structure of Toeplitz matrices to significantly improve the computation time. In a financial market consisting of M1 firms and N discretization points in every dimension the algorithm uses O(nlogn·M·M!·N^M(M-1)/2) operations, where n is the number of discretization points in the time domain. The algorithm is applied to firm survival probability computation and zero coupon bond pricing.     

Four Easy Ways to a Faster FFT

The Fast Fourier Transform (FFT) was named one of the Top Ten algorithms of the 20th century , and continues to be a focus of current research. A problem with currently used FFT packages is that they require large, finely tuned, machine specific libraries, produced by highly skilled software developers. Therefore, these packages fail to perform well across a variety of architectures. Furthermore, many need to run repeated experiments in order to re-program their code to its optimal performance based on a given machine's underlying hardware. Finally, it is difficult to know which radix to use given a particular vector size and machine configuration. We propose the use of monolithic array analysis as a way to remove the constraints imposed on performance by a machine's underlying hardware, by pre-optimizing array access patterns. In doing this we arrive at a single optimized program. We have achieved up to a 99.6% increase in performance, and the ability to run vectors up to 8388608 elements larger, on our experimental platforms. Preliminary experiments indicate different radices perform better relative to a machine's underlying architecture.     

Harmonic analysis for graph refinements and the continuous graph FFT

The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.