登录
首页 » matlab » Code

Code

于 2011-10-13 发布 文件大小:23KB
0 264
下载积分: 1 下载次数: 11

代码说明:

  由图像序列恢复结构:输入至少3帧图像,既可以根据马义的算法求取图像所表针的环境的三维结构(Restore the structure by the image sequence)

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

发表评论

0 个回复

  • OPC-0710-00000004
    Matlab环境下基于OPC技术实现动态矩阵控制 Matlab环境下基于OPC技术实现动态矩阵控制(Matlab environment based on OPC technology to achieve dynamic matrix control Matlab environment OPC technology based on Dynamic Matrix Control)
    2007-10-08 05:44:51下载
    积分:1
  • DOA_11
    这个是空间谱估计中阵元互耦校正算法,自己写的。(This is the spatial spectrum estimation Mutual Coupling correction algorithm, wrote it myself.)
    2016-03-18 19:00:08下载
    积分:1
  • PSNR
    This is a code for calculating PSNR of two images.
    2014-01-04 15:30:53下载
    积分:1
  • mean
    mean-shift algorithm matlab code
    2010-10-04 16:23:49下载
    积分:1
  • aerodynamics-of-wind-turbines
    Denmark Technical University的大牛Hansen,第二版风力机空气动力学。(Denmark Technical University' s Daniel Hansen, the second edition of wind turbine aerodynamics.)
    2013-07-19 09:00:35下载
    积分:1
  • ship-tracking-control
    matlab编写的航迹控制程序,对于初学者能够起到重要启发作用(The matlab track written control procedures, can play an important inspiration for beginners)
    2012-06-25 20:38:03下载
    积分:1
  • CAPP
    computer architecture and parallel processing
    2013-02-08 11:59:34下载
    积分:1
  • K-meanCluster
    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
    2007-11-15 01:49:03下载
    积分:1
  • matlab_inverse-kinematics
    已知串联机构各个构件的运动,求取其运动所需的力,和其运动学逆解计算(Serial mechanism known to all members of the movement, the force required to strike the motion, and the calculation of inverse kinematics)
    2011-06-03 19:46:43下载
    积分:1
  • audiolocalization_2mic
    This is the function programmes of fan in an system noise removal
    2011-08-06 20:23:14下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载