登录
首页 » WORD » CreateAVIframesInMatlab

CreateAVIframesInMatlab

于 2010-12-02 发布 文件大小:312KB
0 227
下载积分: 1 下载次数: 3

代码说明:

  video frames taken in matlab

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

发表评论

0 个回复

  • Micro-expression-recognision
    用于基于ORL人脸数据库和PCA降维的简易的微表情识别 (For ease of micro-expression recognition based on PCA)
    2012-12-30 02:02:17下载
    积分:1
  • chanels-simulation
    这个是对各种信道,如awgn、rayleigh、rice等的一个仿真。简单易懂,意义较大(This is a variety of channels, such as awgn, rayleigh, rice, etc. a simulation. Easy to understand, the larger significance)
    2013-09-03 15:54:17下载
    积分:1
  • fska
    2-fsk调制解调,采用相干解调,画出调制前调制后,加噪声,解调的函数图(modulated and demodulated by 2-fsk)
    2014-01-03 15:14:24下载
    积分:1
  • Integration
    信号处理中的积分运算,以位移、速度和加速度为例,适用于matlab。(Signal processing integration operation of displacement, velocity and acceleration, for example, apply to matlab.)
    2016-03-10 11:33:24下载
    积分:1
  • L-G-0000595723-0002363227.pdf
    A Practical Guide for MIMO using Matlab
    2014-11-03 11:29:06下载
    积分:1
  • bysj
    一个matlab gui小程序 可以帮助初学者 掌握matlabgui的小技巧(matlab gui help the new players)
    2009-07-01 10:43:01下载
    积分:1
  • (LFM)simulation
    线性调频(LFM)脉冲压缩雷达仿真,很好很强大(Linear FM (LFM) pulse compression radar simulation, very good very strong)
    2010-07-25 10:56:56下载
    积分:1
  • CHAPTER3
    pid自适应控制器学习和程序大家学习,很好用的(请求权)
    2010-09-17 10:53:30下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • example1
    Metropolis within Gibbs sampling
    2011-11-30 22:30:42下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载