登录
首页 » Others » yi

yi

于 2012-04-15 发布 文件大小:1KB
0 240
下载积分: 1 下载次数: 0

代码说明:

说明:  图像的贝叶斯分类MATLAB程序,最优阈值迭代法(Image of the Bayesian classifier MATLAB program,Iterative method of optimal threshold)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • my_danzai_
    sar雷达,弹载的,自己编的,大家可以参考~(so easy!)
    2010-07-31 15:56:40下载
    积分:1
  • Beginning_Algorithms_code
    BOOK:Beginning Algorithms Code Examples(BOOK : Beginning Algorithms Code Examples)
    2006-12-28 11:18:17下载
    积分:1
  • 2DFDTDUPPMLTFSF.m.tar
    Two dimensional FDTD with UPML + TFSF
    2011-08-26 09:06:37下载
    积分:1
  • Hiding_info_in_IMage
    hiding technique by segmentation of image methods in matlab
    2014-11-26 20:30:01下载
    积分:1
  • kuigei
    可实现对二维数据的聚类,多机电力系统仿真及其潮流计算,关于非线性离散系统辨识。( Can realize the two-dimensional data clustering, Multi-machine power system simulation and flow calculation, Nonlinear discrete system identification.)
    2016-05-20 15:50:40下载
    积分:1
  • 91433
    Simulation of Autonomous Navigation Mobile Robot System
    2015-01-06 04:43:12下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • ldpc_Robert_org
    经典lDPC编码程序 Robert的论文里的部分仿真程序 (Robert LDPC coding procedures classic papers in the part of simulation program)
    2007-07-31 21:50:17下载
    积分:1
  • Pinhole-array
    用于生成3D显示所需的针孔阵列,每个针孔为正方形。(for 3D displays.)
    2014-11-17 21:02:51下载
    积分:1
  • MATLAB2-wavelet
    MATLAB2维小波变换经典程序 让你知道而为小波变换是什么一回事(MATLAB2-dimensional wavelet transform classical procedures let you know for what it is about wavelet transform)
    2008-06-04 08:41:35下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载