optimization-toolbox-of-MATLAB

MATLAB/simulink2013b最新版新用户说明书和老用户使用说明。(MATLAB/simulink2013b latest version of the new users and old users manual instructions.)

matlab实现音乐通用特征提取并进行音乐检索，共实现40种特征提取。(MIRtoolbox proposes a large set of musical feature extractors.MIRtoolbox includes around 40 audio and music features extractors and statistical descriptors.)

implement onDraw and draw a rectangle in a random color with the name of the class.

极有用的数据处理程序，方便处理实验数据，并取得数学表达式(matlab)(very useful data processing procedures, facilitate the processing of experimental data and mathematical expression made (Matlab))

这是一个在利用密钥产生随机序列，他能实现在伪随机序列的产生(This is a key generated using random sequence, he can achieve the pseudo-random sequence generation)

The function applies the non-local means algorithm to an image.

CWP:波场中心软件，由SEISMIC UNIX代码改写为matlab版本。(matlab version for seismic unix)

在matlab环境下面编程，最好使用2012版本及其以上，完成利用matlab软件提供的图像处理函数来完成图像匹配，3D重建的工作。最后的效果图很好，由于是利用matlab自带的图片，所以压缩文件中无图片，直接打开m文件就可以运行！(Below programming in matlab environment, it is best to use 2012 version and above, using matlab software provides complete image processing function to complete the image matching, 3D reconstruction work. The final renderings good, as is the use of matlab comes with a picture, so the compressed file without pictures, you can directly open the m-file to run!)

基于matlab的模型检测，仿真，主要针对的是轮廓控制部分。带有仿真结果(Matlab based model checking, simulation, mainly for the contour control section. With simulation results)

This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both digitaltransformations return a table of digital curvelet coefficients indexed by a scale parameter, anorientation parameter, and a spatial location parameter. And both implementations are fast in the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.