License-plate-number-recognition

Norden E. Huang写的关于HHT变换的介绍及其相关问题(Norden E. Huang Transform to write an introduction on the HHT and related issues)

一个在MATLAB中实现的UKF算法用于目标追踪(tracking the target by UKF algorithm)

传统滑模观测器simulink模型，控制函数参数需要自己整定。( Traditional sliding mode observer Simulink model, control function parameters need to set their own. )

说明：  此算法为增广最小二乘法。uy2为含噪声数据，n=2,噪声模型n=2(The algorithm for least squares augmented. uy2 for data containing noise, n = 2, the noise model n = 2)

画图瑞利背景下CA CFAR检测性能比较的Matlab程序 (plot a figure speed platform where both the target and the clutter have range walk. In this method, for efficient clutter suppression the clutter’s range walk)

关于语音信号的小波阈值降噪，希望对大家有用。(About the speech signal wavelet threshold de-noising, hope useful for everyone)

运用Matlab，对一些对比度较差的图片进行目标物提取时使用的阈值方法，其中，其运用的是动态阈值的方法（非全局阈值）(Using Matlab, for some poor contrast image target extraction using threshold method, among them, the use of a dynamic threshold method (not a global threshold value))

In a multiple transmit antenna, single antenna per receiver downlink channel with limited channel state feedback, we consider the following question: given a constraint on the total system-wide feedback load, is it referable to get low-rate/coarse channel feedback from a large number of receivers or high-rate/high-quality feedback from a smaller number of receivers? Acquiring feedback from many receivers allows multi-user diversity to be exploited, while high-rate feedback allows for very precise selection of beamforming directions. We show that there is a strong preference for obtaining high-quality feedback, and that obtaining near-perfect channel information from as many receivers as possible provides a significantly larger sum rate than collecting a few feedback bits from a large number of users.

迭代自适应Simpson，Lobatto积分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)

条带式合成孔径雷达的回波仿真程序，目标模型为点模型。(Strip of synthetic aperture radar echo simulation program, the target model for the point model.)