fiuning

A new approach to vanishing point detection in architectural environments一种寻找消失点的新算法(A new approach to vanishing point detection in architectural environments)

说明：  《数字图像处理与机器视觉:Visual C++与Matlab实现》2 频率域图像增强,彩色图像处理(&quot Digital image processing and machine vision: Visual C++ and Matlab to achieve&quot two frequency domain, image enhancement, color image processing)

1 录入一段语音，对其进行时域频域处理，通过变频、变速达到变声目的，且使处理后的语音信号不影响正常收听与理解。 2 用图形用户界面（GUI）对上述变声前变声后进行时域频域图形输出，不同的频率、速度有不同的输出，且对前后波形进行比较 (1 entry a voice, the frequency domain and time domain by frequency conversion variable speed, processing to make the treatment and voice purpose, after the speech signal shall not affect the normal to listen to and understand. 2 with the graphical user interface (GUI) voice of the above voice before after the frequency domain in the time domain graphics output, different frequency, speed have different output, and compared before and after waveform )

电池全寿命加速老化试验的采集数据。在不同温度下的充电和放电下完成。数据格式为matlab的mat，文件里面有详细的实验数据说明，希望对研究电池寿命预测和诊断的同志有帮助。(Battery life-accelerated aging test data collection. At different temperatures to complete the charging and discharging. The data format is the matlab mat, which has detailed documentation of the experimental data shows that the hope of battery life prediction and diagnosis to help comrades.)

matlab从入门到精通，很经典很好的教材(matlab entry to the master, it is a classic good teaching)

语音信号的分离。可以将两个同时说话的人的声音分离开来。也可以将人声和音乐的分离开来。(Separating the speech signal. Two simultaneous speaker' s voice can be separated. Also the human voice and music can be separated.)

说明：  编程分别用jocabi迭代法求解方程。在一般情况下，Guass-Seide迭代法比Jacobi迭代法收敛要快一些，但这也不是绝对的，在木些情况下，Jacobi迭代法收敛，Guass-Seide迭代却可能不收敛(use matlab to deal with the equation )

this program simulated multipath channel in environment using matlab program

雷达数据处理中文经典教材，系统地介绍了国内外多年来雷达数据自理技术的研究进展情况及作者们的研究成果，对雷达系统设计学习者有较大帮助。(Chinese classic radar data processing materials, a systematic introduction to radar data at home and abroad for many years the progress of self-care technology research and the authors of the research results, the radar system design learners have more help.)

说明：  利用蚁群算法解决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.)