grid-supression-in-frequency-domain

说明：  最小费用最大流问题 MATLAB编程代码(Maximum flow problem minimum cost MATLAB programming code)

punya tya tentang membuat file gui matlab

生成了符合泊松分布的随机变量，包涵了matlab源代码和C++源代码 利用C++生成，利用matlab画图(generate the poisson varibles )

信道估计程序，ieee发表的文章对应的原码，本人已经验证，可以使用。(Channel estimation procedures, ieee post corresponding to the original code, I have verified that you can use.)

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

合成孔径雷达的模糊与 PRF ；连续形式的回波模型 ； 抽样信号的频谱 ； 抽样形式的回波模型 ；方位模糊的仿真与抑制 (Fuzzy synthetic aperture radar and PRF continuous form of echo model sampling frequency spectrum sample form of echo model azimuth ambiguity suppression and Simulation)

轴承故障诊断.rar轴承故障诊断.rar(damage detection)

四旋翼飞控系统，包含定点，定高，自动按航迹点飞行，自动起飞，降落功能(Four-rotor flight control system)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

Mean Shift 这个概念最早是由Fukunaga等人[1]于1975年在一篇关于概率密度梯度函数的估计中提出来的,其最初含义正如其名,就是偏移的均值向量,在这里Mean Shift是一个名词,它指代的是一个向量,但随着Mean Shift理论的发展,Mean Shift的含义也发生了变化,如果我们说Mean Shift算法,一般是指一个迭代的步骤,即先算出当前点的偏移均值,移动该点到其偏移均值,然后以此为新的起始点,继续移动,直到满足一定的条件结束. 用matlab实现mean shift算法仿真(Mean Shift the concept was first used by Fukunaga et al [1] in 1975 in an article on the probability density function estimation of gradient raised its original meaning, as its name implies, is the offset of the mean vector, where is the Mean Shift a noun, it refers to a vector, but with the Mean Shift the development of the theory, Mean Shift the meaning has changed, if we say that Mean Shift algorithm, generally refers to an iterative steps, namely, first calculate the current point Mean offset, move the shift points to its average, and then as a new starting point and continue to move until the end to meet certain conditions. realize using mean shift algorithm matlab simulation)