AllFsk

Sort back sorted data to initial state

说明：  图像去雾的matlab源程序，对于学习图像去雾很有帮助(Matlab source code image defogging the demister helpful for learning image)

水声通信面临的最困难的问题是多途干扰,其中自多途引起接收信号的幅度衰落,互多途引起接收信号的码间干扰,再加上海洋环境的高噪声背景、低的载波频率、极为有限的带宽以及传输条件的时间—空间—频率变化特性,使得通信过程十分困难。此外，水声通信试验的成本高，难度大，也为水声通信研究带来挑战。 本软件对水声信道的仿真研究很有帮助，可以产生声线图，冲激响应，声速图等仿真文件，结合Matlab画图工具绘制图像，对水声信道的模拟仿真很有帮助。(The most difficult problem faced by underwater acoustic communication is multi-path interference, which since multipath fading caused by the magnitude of the received signal, and mutual inter-symbol interference caused by multipath signal reception, plus the marine environment of high background noise, low carrier frequency , very limited bandwidth and transmission conditions of time- space- frequency characteristic such that the communication process is very difficult. In addition, the high cost of underwater acoustic communication experiment, difficult, and challenges for the study of underwater acoustic communication. This software is useful for simulation study of underwater acoustic channel can produce sound chart, impulse response, sound velocity diagrams simulation files, combined with Matlab drawing tools to draw the image of underwater acoustic channel simulation helpful.)

小波包分析提取振动信号中的特征频率，ML法能够很好的估计信号的信噪比,利用自然梯度算法。( Wavelet packet analysis to extract vibration signal characteristic frequency, ML estimation method can be a good signal to noise ratio, Use of natural gradient algorithm.)

说明：  了解matlab编程的机制，里面包含了80多个matlab程序，是初学者的必备资料。(Matlab program to understand the mechanism, which includes more than 80 matlab program, is essential information for beginners.)

Kernel methods for feature extraction

说明：  可实现自动分析，偏最小而成分析，结果可得相关性和RMSEC值(Automatic analysis can be realized, and analysis based on minimum)

matlab初级应用介绍,帮助大家学习MATLAB的基本应用和知识，希望大家喜欢，呵呵(the simple use of matlab)

说明：  利用蚁群算法解决TSP问题，本例涉及了31个城市并将其坐标化，每个城市只能拜访一次，而且最后要回到初始城市，所选路径为所有路径之中的最小值。(Using ant colony algorithm to solve TSP problem, this example involves 31 cities and coordinates them, each city can only visit once, and finally return to the initial City, the selected path is the minimum of all paths.)

kalman递归理论的详细讲解,通谷易懂,想弄明白kalman理论的同志一看便知!(a easy understanding for Kalman theory.it is very useful for new leaner! )