搜索资源列表
同时计算关联维和Kolmogorov熵
- 关于非线性时间序列中同时计算关联维和Kolmogorov熵的程序,-on nonlinear time series simultaneously calculate the correlation dimension and Kolmogorov entropy procedures,
kongming
- 神经网络训练根据Kolmogorov定理,输入层有14个节点,所以中间层有29个节点 %中间层神经元的传递函数为 tansig %输出层有8个节点,其神经元传递函数为logsig %训练函数采用traingdx-neural network training under the Kolmogorov theorem, input layer has 14 nodes, Therefore, the intermediate layer has 29% of nodes middle
match-v3.3.src
- This software implements stereo algorithms described in the following papers: Vladimir Kolmogorov and Ramin Zabih \"Multi-Camera scene Reconstruction via Graph Cuts\" In: European Conference on Computer Vision, May 2002. Vladimir
Kolmogorov
- 同时计算关联维和Kolmogorov熵的C++源代码
K_entropy
- 关于混沌Kolmogorov熵的计算程序,在前人基础上自己编写的。已经用过很多混沌时间序列K熵的计算。
TRW_S-v1.1
- The two algorithms are max-product belief propagation (BP, Pearl 88) and sequential tree-reweighted max-product message passing (TRW-S, Kolmogorov 05)
KolmogorovEntropy_GP
- Kolmogorov 熵的计算 - GP算法
KolmogorovEntropy_STB
- Kolmogorov 熵的计算 - STB算法
kolmogorov
- 网络流量的kolmogorov参数,简要说明了kolmogorov参数的作用及国外的研究
STAT_KOLMOGOROV_TEST.rar
- This function performs the one sample, two tailed Kolmogorov-Smirnov hypothesis test on a set of data samples for a given cumulative distribution function.,This function performs the one sample, two tailed Kolmogorov-Smirnov hypothesis test on a se
GraphCut
- 对Vladimir Kolmogorov,Yuri Boykov大牛的算法杰作——Graph Cut进行使用演示,代码力求精简,可供Graph Cut初学者参考学习。已通过VS2005编译。-Of Vladimir Kolmogorov, Yuri Boykov big cow masterpiece algorithm- Graph Cut for the use of demonstration, the code to be simple, for beginners Reference
KolmogorovEntropy_STB
- 求K熵(Kolmogorov Entropy) GP算法 - \KolmogorovEntropy_GP\Main_KolmogorovEntropy_GP.m STB算法 - \KolmogorovEntropy_STB\Main_KolmogorovEntropy_STB.m-For K-entropy (Kolmogorov Entropy) GP algorithm- \ KolmogorovEntropy_GP \ Main_KolmogorovEntropy_GP.m STB
chaos
- ApEn(近似熵)方法是测度熵的一种替代算 法,简单可靠,值得深入研究. -.The correlation dimension obtained from this method is optimal and the stable estimation of the Kolmogorov entropy is also obtained.
athetic_computation
- 1928年, George D. Birkhoff提出了著名的美学度量公式measure = order/complexity.但是order和complexity具体如何计算并没有给出。本文在Shannon信息论的基础上,提出了基于Shannon entropy和kolmogorov complexity的美学度量。作者认为他们“on a promising track with a sound theoretical basis, which not only extends but wil
GraphMatching-v1.0.src.tar
- 一种对于图匹配优化问题对偶分解的算法实现-An implementation of a dual decomposition technique for the graph matching optimization problem described in Feature Correspondence via Graph Matching: Models and Global Optimization. Lorenzo Torresani, Vladimi
maxflow
- Yuri Boykov s and Vladimir Kolmogorov s work on graph cuts and MRF optimization has been extensively cited in the academia, and their maximum flow implementation is widely used in computer vision and image processing research.
Kolmogorov
- 计算信号的Kolmogorov熵, 计算信号的Kolmogorov熵,计算信号的Kolmogorov熵-computing Kolmogorov entropy of signal
kolmogorov
- Kolmogorov is a evolutionary method
Kolmogorov-entropy
- 用于计算混沌分析中的柯尔莫哥洛夫熵的STB算法-for compute the Kolmogorov entropy
KolmogorovEntropy_GP
- 柯尔莫哥洛夫熵(Kolmogorov熵,以下简称K熵)是刻划混沌系统的一个重要的量。在不同类型的动力学系统中,K熵的数值是不同的。本程序可以计算kolmogorov熵(Kolmogorov entropy (hereinafter referred to as K entropy) is an important quantity for describing chaotic systems. In different types of dynamical systems, the K entr