登录
首页 » matlab » youcheng

youcheng

于 2013-07-09 发布 文件大小:41KB
0 114
下载积分: 1 下载次数: 4

代码说明:

  游程编码 可运行自己亲测 有函数图像以及编码前和编码后的图像对比(RLE can run their own pro-test as well as a function of the image before encoding and the encoded image contrast)

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

发表评论

0 个回复

  • bermaxrand
    bermax command using and generating
    2010-10-25 23:48:58下载
    积分:1
  • gradient
    Gradient code. Use this to do gradient of image.
    2009-05-13 21:21:57下载
    积分:1
  • MATLABandC
    综合了matlab和c语言的特点,将其两者综合起来,说明了matlab如何调用C语言。(Combines the features of matlab and c language, which both together, explains matlab how to call the C language.)
    2014-11-10 12:53:25下载
    积分:1
  • Normal_2
    在转速为48K/min时,正常工况下的时域波形(In speed for 48 k/min, the normal working conditions of the time domain waveform )
    2012-11-19 21:23:47下载
    积分:1
  • proj11-02
    数字图像处理程序:付里叶描绘子方法的实现(Digital image processing: Fourier descriptors method implementation)
    2010-10-19 17:26:19下载
    积分:1
  • LMS
    用MATLAB编写的LMS算法源程序,是一个M函数(LMS algorithm source code written in MATLAB)
    2010-11-01 11:06:49下载
    积分:1
  • Matlab_Image_Processing_Function
    介绍Matlab图像处理的常用函数,希望对大家有帮助(Matlab on the common image processing functions, we hope to help)
    2007-03-01 21:30:36下载
    积分:1
  • first2345
    CONTROL OF DC MOTOR USING BUCK BOOST CONVERTER
    2013-11-22 05:09:58下载
    积分:1
  • PIDCONTROLMATLAB
    一种用MATLAB实现的控制,能达到很优的效果,大家不防试试。(A MATLAB implementation of the control, can achieve the very excellent results, we do not try prevention.)
    2009-03-14 09:40:05下载
    积分:1
  • Matlab_zuixiaoerchengfa
      最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:54:17下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载