登录
首页 » matlab » image_separation

image_separation

于 2007-06-15 发布 文件大小:80KB
0 256
下载积分: 1 下载次数: 11

代码说明:

  该程序可实现多个图像的线性分离,假设在无噪声情况下,运用多种方法实现分离。(the procedure can be more than a linear image separation, assuming no noise, using various methods to achieve separation.)

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

发表评论

0 个回复

  • filter
    一阶无限冲激响应低通滤波器和一阶无限冲激响应高通滤波器,用matlab计算并画出它们的增益响应(First order IIR low-pass filter and the first order IIR high-pass filter, using matlab to calculate and draw them gain response)
    2010-11-14 01:02:39下载
    积分:1
  • digitalmodulation
    matlab code for digital modulations
    2009-07-10 15:53:45下载
    积分:1
  • ply_display
    斯坦福ply格式文件读取显示程序,用matlab写的,测试可用(Stanford ply format file to read the display program, written with matlab, the test can be used)
    2013-01-04 22:35:40下载
    积分:1
  • SECANT
    solution to nonlinear equations use secant method
    2011-07-07 13:46:31下载
    积分:1
  • Butons
    some basic matlab function
    2011-12-20 00:14:45下载
    积分:1
  • mfcc
    programm of mfcc matlab parametrisation wav
    2013-05-12 23:06:00下载
    积分:1
  • SJXL
    时间序列分析中对于平稳时间序列建立模型,并实现模型的预测。(Time series analysis for stationary time series model, and the realization of the forecast model.)
    2007-12-14 21:47:17下载
    积分: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
  • LSPE
    提供了几种最小二乘法程序包括:批处理最小二乘参数估计,递推最小二乘参数估计,遗忘因子递推最小二乘参数估计,递推增广最小二乘参数估计。(Provides several least squares procedures include: Batch least squares parameter estimation, recursive least squares parameter estimation, forgetting factor recursive least squares parameter estimation, Recursive Extended Least Squares Parameter Estimation.)
    2013-08-27 19:37:54下载
    积分:1
  • kmeansM
    k-means algorithm clustering
    2014-12-27 00:06:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载