-
siftDemoLowe
Simple demo of sift from mr Lowe
- 2010-07-27 03:40:32下载
- 积分:1
-
model
基于自动细胞法的平面交叉口仿真
对平面交叉口不取消左转的仿真程序:model1.m
对平面交叉口以绕行方式取消左转的仿真程序:model2.m
对平面交叉口以迂回方式取消左转的仿真程序:model3.m
(Does not abolish the intersection turn left emulator: model1.m intersection to bypass cancel turn left emulator: emulator model2.m circuitous way to cancel the intersection turn left: model3.m)
- 2012-06-14 18:42:52下载
- 积分:1
-
fuzzy
模糊聚类分析源程序,包括标准化处理,聚类图,等等(Fuzzy clustering analysis of source code, including the standardization processing, clustering diagram, etc.)
- 2012-09-08 09:53:11下载
- 积分:1
-
cd
code for image subtraction
- 2014-01-27 14:07:44下载
- 积分:1
-
XIAOBO_OMP_19856475252
压缩感知OMP算法,稀疏基为2-d小波基,包含两种算法:1、先稀疏再采样;2、先采样再稀疏;该压缩包对刚接触压缩感知的初学者有非常重要的意义。(compressived sensing OMP)
- 2014-04-15 11:43:28下载
- 积分:1
-
zoom
DCT compressed mpeg using matlab code
- 2010-12-02 20:42:45下载
- 积分:1
-
Language
在matlab环境,实现language算法,根据所给的点确定原函数(language method)
- 2009-12-23 00:33:42下载
- 积分:1
-
ACA_TSP
旅行商问题(Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm
to work out the TSP.)
- 2013-09-19 22:37:38下载
- 积分:1
-
degree
此程序用于求有向网路和无向网路的节点的度(This procedure is used to beg for the degree of the nodes of the network to the Internet and no)
- 2012-10-13 08:45:50下载
- 积分:1
-
transformation
transformation of coordiantes using finite diff method
- 2013-11-08 00:47:46下载
- 积分:1