-
flot_optique
how to estimate the optical flow with horn and schunk method
- 2010-05-14 19:44:52下载
- 积分：1
-
chepaishibie
基于Matlab的车牌识别系统，采用灰度识别、模块匹配的模式对车牌进行处理(License plate recognition system based on Matlab, using the gray level recognition, module matching mode for processing of license plate)
- 2012-04-29 15:48:45下载
- 积分：1
-
MA-STRATEGY
自写策略，MA均线突破，20日均线和50日均线突破的策略，仅供参考(MA20 & MA50 STRATEGY)
- 2013-11-08 10:17:17下载
- 积分：1
-
1
说明： 基于遗传算法的移动传感器的部署优化，实现三维空间下对多个传感器相对探测物体位置的移动路径的规划，种群大小为49，迭代次数为1000，交叉概率为0.8，变异概率0.1，采用精英选择。(The deployment optimization of mobile sensors based on genetic algorithm realizes the planning of moving path of multiple sensors relative to the detected object position in three-dimensional space. The population size is 49, the number of iterations is 1000, the probability of cross is 0.8, the probability of variation is 0.1, and elite selection is adopted.)
- 2020-04-04 11:00:42下载
- 积分：1
-
oulafa
说明： 用欧拉法计算微积分的源代码，以及改进的欧拉法，用matlab实现(Euler method with the source code of calculus, and the modified Euler method, using matlab implementation)
- 2010-04-04 17:41:02下载
- 积分：1
-
junzhi
此代码是输入图像得到原图像的灰度直方图，得到聚类后的直方图和聚类后的图像直方图。(This code is the input image to get gray histogram of original image, get the clustering histogram and cluster after the image histogram.
)
- 2014-09-27 20:13:37下载
- 积分：1
-
An-improved-Hilbert-Huang-transform-
HHT 改进算法，文章中给出了详细的步骤和实现方法，对信号处理专业的有很大帮助(Improved algorithm of HHT, this paper presents the detailed steps and methods of signal processing, professional help)
- 2012-10-14 21:32:27下载
- 积分：1
-
ACO_jieshu
计算CN，即共同邻居的代码，用于链路预测，属于根据网络的局部特征进行预测(Calculating CN, i.e. common neighbors code for link prediction, according to the local characteristics of the network belonging to predict)
- 2014-01-24 18:34:19下载
- 积分：1
-
步进频sar二维成像
步进频合成孔径雷达(sar)二维成像，在距离维使用拼接算法，方位维压缩，形成高分辨距离向。压缩的方式是传统的RD算法。
- 2022-08-12 08:21:50下载
- 积分：1
-
jcbb-simulation.tar
analyze data association algorithms (Nearest Neighbour and JCBB) in SLAM. Data association is basically a combinatorial optimization problem whose goal is to find the “best” set of associations between the observations and predictions according to a particular criterion (e.g. individual compatibility). Form this point of view, near- est neighbour (NN, a.k.a. ML) is simply a “greedy” algorithm in which the “compatibility” of individual associations with each other is not examined. On the contrary, JCBB, by considering both the individual and joint compatibility, is able to yield much better results. JCBB uses the branch and bound technique in order to prune the search tree
- 2012-11-30 17:07:01下载
- 积分：1
|
联系客服（QQ：3324461878）
