A VSLMS Style Tap-length Learning Algorithm for Structure Adaptation

Compared with the ordinary adaptive filter, the variable-length adaptive filter is more efficient (including smaller., lower power consumption and higher computational complexity output SNR) because of its tap-length learning algorithm, which is able to dynamically adapt its tap-length to the optimal tap-length that best balances the complexity and the performance of the adaptive filter. Among existing tap-length algorithms, the LMS-style Variable Tap-Length Algorithm (also called Fractional Tap-Length Algorithm or FT Algorithm) proposed by Y.Gong has the best performance because it has the fastest convergence rates and best stability. However, in some cases its performance deteriorates dramatically. To solve this problem, we first analyze the FT algorithm and point out some of its defects. Second, we propose a new FT algorithm called 'VSLMS' (Variable Step-size LMS) Style Tap-Length Learning Algorithm, which not only uses the concept of FT but also introduces a new concept of adaptive convergence slope. With this improvement the new FT algorithm has even faster convergence rates and better stability. Finally, we offer computer simulations to verify this improvement.

A Novel Geometric Algorithm for Blind Image Restoration Based on High-Dimensional Space

A novel geometric algorithm for blind image restoration is proposed in this paper, based on High-Dimensional Space Geometrical Informatics (HDSGI) theory. In this algorithm every image is considered as a point, and the location relationship of the points in high-dimensional space, i.e. the intrinsic relationship of images is analyzed. Then geometric technique of "blurring-blurring-deblurring" is adopted to get the deblurring images. Comparing with other existing algorithms like Wiener filter, super resolution image restoration etc., the experimental results show that the proposed algorithm could not only obtain better details of images but also reduces the computational complexity with less computing time. The novel algorithm probably shows a new direction for blind image restoration with promising perspective of applications.

maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams

IEEE

algorithms for computing weak bisimulation equivalence

IEEE Comp Soc, IFIP, Tianjin Normal Univ

An integrated aurora image retrieval system: AuroraEye

With the digital all-sky imager (ASI) emergence in aurora research, millions of images are captured annually. However, only a fraction of which can be actually used. To address the problem incurred by low efficient manual processing, an integrated image analysis and retrieval system is developed. For precisely representing aurora image, macroscopic and microscopic features are combined to describe aurora texture. To reduce the feature dimensionality of the huge dataset, a modified local binary pattern (LBP) called ALBP is proposed to depict the microscopic texture, and scale-invariant Gabor and orientation-invariant Gabor are employed to extract the macroscopic texture. A physical property of aurora is inducted as region features to bridge the gap between the low-level visual features and high-level semantic description. The experiments results demonstrate that the ALBP method achieves high classification rate and low computational complexity. The retrieval simulation results show that the developed retrieval system is efficient for huge dataset. (c) 2010 Elsevier Inc. All rights reserved.

基于几何特征的快速高精度角点检测算法

角点检测应用十分广泛,是许多计算机视觉任务的基础。本文提出了一种快速、高精度的角点检测算法,算法简单新颖,角点条件和角点响应函数设计独特。和以往不同的是:算法在设计上考虑的是角点的局部几何特征,使得处理的数据量大为减少,同时能够很好地保证检测精度等其他性能指标。通过和广泛使用的SUSAN算法、Harris算法在正确率、漏检、精度、抗噪声、计算复杂度等方面进行综合比较,结果表明该算法无论对人工合成图像还是对自然图像均具有良好的性能。

基于非线性修正的多线阵像机的空间定位

介绍了一种基于多线阵像机构成的视觉空间定位系统.该系统利用线阵像机的快速性与高分辨率的特点,采用了非平行空间投影面相交定位的基本原理,利用几何投影关系定位求解的方法,实现了多线阵像机视觉系统的空间定位.并提出了多线阵像机的神经网络非线性修正方法,使修正后的PSD能在较宽的位置范围内输出高线性度的信号.实验结果表明,基于非线性修正的多线阵像机位姿测量系统简化了立体视觉空间定位计算的复杂性,在定位精度、定位范围和采样速度上均达到了良好效果.

UUV推进系统容错控制分配算法研究

针对水下机器人(UUV)推进系统容错控制分配问题,本文提出了基于SVD分解(奇异值分解)与定点分配的混合算法。与传统的方法相比,它回避了求伪逆矩阵的问题,降低了计算量;能够满足推进器饱和约束限制。利用水下实验平台推进系统模型进行了仿真实验,验证了算法的正确性和有效性。

滑转率对月球车车轮驱动力学特性的影响分析

应用车辆地面力学理论研究滑转率对月球车车轮挂钩牵引力、驱动效率以及功率消耗的影响。建立刚性车轮与松软月壤交互作用的动力学模型。通过实例对月球车车轮驱动动力学特性进行仿真分析。研究结果表明,车轮的挂钩牵引力、驱动效率以及驱动能耗均受到车轮滑转率的制约。存在一个最优的滑转率区间,在此区间内车轮可获得较大的挂钩牵引力、较高的驱动效率以及较低的驱动能耗。求取轮、地相对速度,对月球车车轮的地面摩擦力功率进行了估算。

a computational proof of complexity of some restricted counting problems

South Central University

Linearization Method and Linear Complexity

We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.

Outline and computational approaches of protein misfolding.

Protein misfolding is a general causation of classical conformational diseases and many pathogenic changes that are the result of structural conversion. Here I review recent progress in clinical and computational approaches for each stage of the misfolding process, aiming to present readers an outline for swift comprehension of this field.