-
controller_development_and_impl_for_path_planning
Robot path planning including clothoid to help conceptor to make his own trajectory implementation
- 2010-10-20 13:37:31下载
- 积分:1
-
MeanShiftCluster
mean shift clustering file
- 2009-05-10 03:16:23下载
- 积分:1
-
chaojishihzong
超级时钟的程序,值得收藏,很经典的,用C语言编写,运行可靠!(Super-clock program, worthy of collection, very classic, with the C language, and reliable operation!)
- 2010-12-01 21:01:30下载
- 积分:1
-
mf
说明: test1: a simple example for optical flow:
1 take the camera man picture for example
2 move it with subpixels (interpolate to get the result)
3 optical flow to estimate the motion
test2-7 simple examples for picture rotation and translations
- 2012-06-09 02:11:30下载
- 积分:1
-
RPLS
递推偏最小二乘法(RPLS)采用自适应更新策略,更好的实现建模和实时监测,并提供实例说明。(Recursive partial least squares (RPLS) using adaptive update strategy, better realize the modeling and real-time monitoring, and provide examples.
)
- 2021-04-24 14:58:48下载
- 积分:1
-
jiaoyanzaosheng
用巴特沃斯滤波器去除图像中的椒盐噪声程序 图像增强程序(With bart wo filter to remove salt &pepper noise in the images of the program image enhancement program)
- 2011-08-31 10:13:42下载
- 积分:1
-
kmeans
matlab自带的很好用的kmeans算法程序,已经验证通过,(matlab kmeans algorithm, matlab kmeans algorithm matlab kmeans algorithm procedures)
- 2013-04-09 16:16:12下载
- 积分:1
-
huffmancoding
格式:[huffcodes,氢,領 ,电子] = huffmancoding(磷,氮)
%输入:p是每个字母符号的概率
(如:对= [0.3 0.2 0.2 0.2 .06 .04])
n是一个整数,决定在每个帧的符号数量
(默认:n = 1时)
%输出:huffcodes:huffmancodes
答:源熵
甲肝:平均熵编码
电子邮件:科丁效率(format : [huffcodes,H,Hav,e]=huffmancoding(p,n)
inputs: p is the probability of each alphabet symbol
( eg:p=[.3 .2 .2 .2 .06 .04] )
n is an integer that determines number of symbols at each frame
(default:n=1)
outputs: huffcodes: huffmancodes
H: source entropy
Hav: average entropy for coding
e: codding efficiency
)
- 2010-07-05 12:07:29下载
- 积分:1
-
threeM
建立了一个空间固定曲率和挠率的三维血管模型,并绘制出三维的图像(Created a space for fixed three-dimensional curvature and torsion vessel model, and draws three-dimensional images)
- 2021-02-04 20:59:57下载
- 积分:1
-
P4-1
传算法(Genetic Algorithm)是一类借鉴生物界的进化规律(适者生存,优胜劣汰遗传机制)演化而来的随机化搜索方法。它是由美国的J.Holland教授1975年首先提出,其主要特点是直接对结构对象进行操作,不存在求导和函数连续性的限定;具有内在的隐并行性和更好的全局寻优能力;采用概率化的寻优方法,能自动获取和指导优化的搜索空间,自适应地调整搜索方向,不需要确定的规则。遗传算法的这些性质,已被人们广泛地应用于组合优化、机器学习、信号处理、自适应控制和人工生命等领域。它是现代有关智能计算中的关键技术(Propagation algorithm (Genetic Algorithm) is a law of evolution in biology class reference (survival of the fittest, survival of the fittest genetic mechanisms) randomized search method evolved. It was first proposed by the United States J.Holland professor in 1975, and its main feature is to operate directly on the structure of the object, the continuity of the derivative and the function limitation does not exist with global implicit parallelism inherent and better optimization capability the use of probabilistic optimization method that can automatically obtain and guidance to optimize the search space adaptively adjust the search direction, the rule does not require determined. The nature of the genetic algorithm, has been widely used in combinatorial optimization, machine learning, signal processing fields, such as adaptive control and artificial life. It is about smart modern computing key technologies)
- 2014-02-08 09:18:38下载
- 积分:1