05978173

直方图图像均衡化和规定划、以及加性噪声，如拖尾脉冲噪声，高斯脉冲噪声（自适应方法）、和椒盐噪声等等各种噪声的添加噪声和去除噪声的MATLAB代码(Histogram equalization and provisions of the planning image, and additive noise, such as trailing impulse noise, Gaussian pulse noise (adaptive approach), and salt and pepper noise, etc., add all the noise noise noise and remove the MATLAB code)

说明：  matlab经典讲座及例子及源程序，里面有好多命令，可供大家参考(program)

说明：  经典常规波束形成 包含几种方法的对比(Classic conventional beamforming with comparison of several methods)

FOR HELP AND DOCUMENT FOR POWER DCV S

The Cross Bilateral filter can enhance the PSNR of multi focus images that is in image fuison. Bilateral filtering is a local, nonlinear and non- iterative technique which combines a classical low-pass filter with an edge stopping function that attenuates the filter kernel when the intensity difference between pixels is large. As both gray level similarities and geometric closeness of the neighboring pixels are considered, the weights of the filter depend not only on Mahalanobis distance but also on the distance in gray/color space. The advantage of the filter is that it smoothes the image while preserving edges using neighboring pixels. CBF considers both gray-level similarities and geometric closeness of neighboring pixels in image one to shape the filter kernel and filters the image two.

读取声音信号，并实现对其的插值，matlab仿真(Reading the sound signal, the realization of interpolation)

信号处理书籍，很详细的讲解了数据处理与分析的原理和过程，可利用MATLAB实现信号处理过程。(Signal processing books, very detailed explanation of the principle and process of data processing and analysis, signal processing using MATLAB.)

MFSK调制，用MATLAB实现MFSK调制。(MFSK modulation, MFSK modulation using MATLAB to achieve.)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

可以运行的卡尔曼滤波算法，对一个飞行目标进行速度和位置的跟踪，达到了预期的效果(Kalman filter algorithm can run on a flying target speed and location tracking, and to achieve the desired effect )