登录
首页 » matlab » _auto_contrast_

_auto_contrast_

于 2011-12-21 发布 文件大小:1KB
0 180
下载积分: 1 下载次数: 4

代码说明:

  Image auto contract matlab

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

发表评论

0 个回复

  • matlab-lerning
    对MATLAB初学者具有很好的作用,而且容易理解和接受,很管用哦(MATLAB for beginners on the role of good and easy to understand and accept, it is workable oh)
    2011-06-01 19:47:55下载
    积分:1
  • example
    音乐推荐系统,matlab教程,很不错的,有兴趣的可以看看(Music recommendation system, matlab tutorial, very good, interested can look at)
    2014-11-30 16:27:55下载
    积分:1
  • target-tracking-using-kalman
    说明:  本例是一个简单的运动目标跟踪程序,对一个小球进行了实时的跟踪(This example is a simple object tracking program, for a small real-time tracking of ball)
    2011-03-02 15:12:08下载
    积分:1
  • New-folder
    compressed sensing algorithm
    2013-04-12 23:07:57下载
    积分:1
  • gridconnectedmode
    renewable energy mode for beginers
    2013-11-23 19:01:36下载
    积分:1
  • han-nx30
    计算两个矩阵之间的欧氏距离,阵列信号处理的高分辨率估计,D-S证据理论数据融合。( Calculation of the Euclidean distance between the two matrices, High-resolution array signal processing estimates, D-S evidence theory data fusion.)
    2021-05-08 09:34:35下载
    积分:1
  • channelEqualizer_matlab
    利用FTF算法实现了信道均衡的原程序代码。(FTF algorithm using the channel equalization of the original code.)
    2007-06-16 09:00:30下载
    积分:1
  • SVM-KMtoolbox
    svm-km支持向量机工具箱,特点是他们能够同时最小化经验误差与最大化几何边缘区.因此支持向量机也被称为最大边缘区分类器.(svm-km SVM Toolbox, is characterized by experience that they can while minimizing errors and maximizing geometric border zone. therefore support vector machine is also known as the maximum marginal zone classification.)
    2013-09-04 19:37:13下载
    积分:1
  • 02QJLHMKZQ
    基于趋近律的滑模控制 一种典型的趋近律 一种控制器设计(Reaching Law Sliding Mode Control Based Controller Design)
    2015-02-27 17:35:34下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载