matlabdrawaFFT

有关机动目标跟踪，卡尔曼滤波相关的资料，对从事卡尔曼滤波研究，机动目标跟踪的朋友有参考价值 (The maneuvering target tracking, Kalman filtering relevant information, engaged in Kalman filtering, target tracking friends have reference value)

这是关于用MATLAB编写M文件求复合材料层合板性能指标的一个作业，第一个M文件是对层合板性能的分析，第二个M文件是对层合板破坏的分析。(This is written in MATLAB M-file on demand using composite laminates performance of a job, the first M-file is a performance analysis of laminated plates, the second M-file is damaged laminate analysis.)

说明：  matlab编的时频分析的小程序，可用于各种信号的时频分析(matlab series of time-frequency analysis procedures can be used for a variety of signal time-frequency analysis)

DCT and DST funnctions in MATLAB for arbitrary dimensions

Amplitude modulation and demodulation

基带信号采用不归零矩形脉冲， 生成 2PSK 信号的时域波形和功 率谱密度(The baseband signal uses a non-return rectangular pulse to generate the time domain waveform and power spectral density of the 2PSK signal)

mlr codes in matla is very good anduseful to usein mTLAB

说明：  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)

Histogram of Oriented Gradient toolbox, can be used for object detection and object recognition. This code is not for commercial purpose.

说明：  该课题为基于kmeans的聚类分割，输入一张彩色图像，可以选择需要分割成多少类，就会以不同颜色区分不同的块，带有GUI界面，操作丰富。(This topic is based on Clustering Segmentation of kmeans. Input a color image, you can choose how many categories you need to segment, and then different blocks will be distinguished with different colors, with GUI interface and rich operation.)