登录
首页 » matlab » MatlabStudy

MatlabStudy

于 2010-03-14 发布 文件大小:131KB
0 174
下载积分: 1 下载次数: 7

代码说明:

  这里面是100个简单的matlab学习程序,特别适合于matlab的初学者,期待和大家共同进步。(Matlab study)

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

发表评论

0 个回复

  • MATLAB6.0HandbookMathematics
    MATLAB6.0数学手册pdf版本,可方便查找matlab的常用数学函数,并针对各函数都有详细的例子(MATLAB6.0 Mathematical Manual pdf version of the matlab can easily find a common mathematical functions, and for each function are detailed examples of)
    2009-12-15 18:51:38下载
    积分:1
  • filter
    各种滤波器的设计,包括高斯低通滤波器。hilberrt带通滤波器,插值滤波器等等。(Various filter design, including Gaussian low-pass filter. hilberrt band-pass filter, the interpolation filter and so on.)
    2013-07-10 11:51:06下载
    积分:1
  • face_detection
    说明:  一个非常优秀的人脸检测matlab程序,可用于人脸跟踪、识别的基础,附有测试图片!(A very excellent face detection matlab program can be used to face tracking, recognition based on testing with pictures!)
    2011-04-01 14:50:04下载
    积分:1
  • cv
    说明:  vectoriel control of synchronious machines
    2010-05-22 00:15:46下载
    积分:1
  • UTVExpPack
    UTV分解工具包,常用的相关matlab程序(tools of UTV)
    2013-05-04 23:18:20下载
    积分: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
  • dwt_wm
    watermarking algorithm using DWT technique
    2011-05-18 16:24:41下载
    积分:1
  • teshuhanshu
    在matlab软件平台上对一些需要调用的特殊函数的计算。(Special function calculation)
    2013-08-15 18:12:36下载
    积分:1
  • mls_mb
    A code to fit a curve on sampled data using moving least squares method. MLSM is generalized form of weighted least squares and firstly introduced to use in meshless Finite Element Method (FEM). The main feature of this method is that the weight function is updated from point to point which enables the user to control “closeness of fit”.This code is performed for 1D fitting and is tested on a sinusoid function.
    2012-08-02 16:28:47下载
    积分:1
  • psomatlab
    包括粒子群算法的MATLAB工具箱和PDF文档的使用说明(PSO TOOLBOX IN MATLAB)
    2009-06-05 09:07:01下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载