搜索资源列表
treewave
- Included are the files wav1.m, wav2.m, wavecoef.mat and readme. wav2 function implements the tree structured wavelet transform of the input matrix, up to the given level of decomposition. Wav2 uses another function called wav1, which takes the w
IterativeClosestPointMethod
- ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points,
svm_new
- MATLAB的SVM算法实现，Matlab Support Vector Machine Toolbox，This toolbox was designed as a teaching aid, which matlab is particularly good for since source code is relatively legible and simple to modify. However, it is still reasonably fast if used w
TVL1_HCS_v1
- % May 2010 % This matlab code implements TVL1 based Hybrid Compressive Sensing using LSQR. % Only suitable the small scale data due to the costly storage and computation. % % A - M x N measurement matrix: random sampling alone or hybrid sampling (ran
TwIST_v2
- % demo_l2_l1 - This demo illustrates the TwIST % algorithm in the l2-l1 optimization problem % % xe = arg min 0.5*||A x-y||^2 + tau ||x||_1 % x % % where A is a generic matrix and ||.||_1 is the l1 norm. % After obtaining the solution we implement a
Matlab_Support_Vector_Machine_Toolbox
- This toolbox was designed as a teaching aid, which matlab is particularly good for since source code is relatively legible and simple to modify. However, it is still reasonably fast if used with the supplied optimiser. However, if you really wa
DIJKSTRAs
- 这是从点S到T找寻最短路径的Dijkstra算法-Find shortest path from point S to piont T for positive weight matrix W by Dijkstra method. This is the fastest routine.
ode45
- 解常微分方程的Matlab程序 字符串ypfun是用以表示f(t, y)的M文件名, tspan=[t0, tfinal]表示自变量初值t0和终值tf y0表示初值向量y0，可选参数options为用odeset设置精度等参数。 输出列向量tout表示节点，输出矩阵yout 表示数值解，每一列对应y的一个分量。若无输出参数，则作出图形。-Solution of ordinary differential equations of the Matlab program is
pca_analysis
- 程序说明：y = pca(mixedsig)，程序中mixedsig为 n*T 阶混合数据矩阵，n为信号个数，T为采样点数。y为 m*T 阶主分量矩阵。n是维数，T是样本数。-Procedure Note: y = pca (mixedsig), the program mixedsig for the n* T-order mixed data matrix, n is the signal number, T the sampling points. y for m* T-order pri
anp
- NP是美国匹兹堡大学的T.L.Saaty 教授于1996年提出了一种适应非独立的递阶层次结构的决策方法，它是在网络分析法（AHP）基础上发展而形成的一种新的实用决策方法。其关键步骤有以下几个： 1 确定因素，并建立网络层和控制层模型。 2 创建比较矩阵。 3 按照指标类型针对每列进行规范化。 4 求出每个比较矩阵的最大特征值和对应的特征向量。 5 一致性检验。如果不满足，则调整相应的比较矩阵中的元素。 6 将各个特征向量单位化(归一化)
SVM
- In this paper, we show how support vector machine (SVM) can be employed as a powerful tool for $k$-nearest neighbor (kNN) classifier. A novel multi-class dimensionality reduction approach, Discriminant Analysis via Support Vectors (SVDA), is in
PrimAlgorithm
- 最小生成树prim算法，Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and
multifile
- 用于循环载入多个文件，比如文本文件。不用手动输入t1.txt, t2.txt ,t3.txt... , 然后得到的文件可以用一个矩阵存储下来。或者用一个向量以流的方式存储。-This program is used to cycle load files, like text files. For example,you don t have to manually type t1.txt, t2.txt, t3.txt in your program. Moreover, the result
fecgm
- 独立成份分析（ＩＣＡ）以及ｗｉｎｎｅｒ滤波 Source separation of complex signals with JADE. Jade performs `Source Separation in the following sense: X is an n x T data matrix assumed modelled as X = A S + N where o A is an unknown n x m matrix with full rank.
MinimumspanningtreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn file name given input parameters and format that is called prim before Input adjacency matrix D and node numbers n input prim are two lines of the matrix T, the numbe
ott11
- Optical tweezers computational toolbox,用T Matrix方法计算粒子的散射及捕获，基于Matlab的程序包及说明文件-Optical tweezers computational toolbox to calculate the scattering of the nanoparticles. The code was in Matlab！
Matrix-Checking-Functions
- Matlab Functions for determining if certaion matrix is: 1) Symmetric 2) Lower/Upper triangular (Unit/Strictly/Non-Strictly) 3) n-Banded 4) (Strictly) Diagonally Dominant 5) Isn t it positive definite
R-and-T-for-two-arrays
- 程序r_t用来计算两组空间坐标点之间的旋转平移关系。调用方式如下： p1=[x11,x12,...,x1n y11,y12,...,y1n z11,z12,...,z1n] n个控制点在第一个坐标系下的坐标 p2=[x21,x22,...,x2n y21,y22,...,y2n z21,z22,...,z2n] n个控制点在第二个坐标系下的坐标 RT=r_t(p1,p2) 两个坐标系直接的旋转平移关系,表示方式为RT=[R T] 注：p1和p2也可提供齐次坐标-for RT
LW_utux0_2
- function [ue,un]=LW_utux0_2(v,dt,t) 一个简单的双曲型偏微分方程： ut + ux = 0 初始条件为： u(x,0) = exp[-10(4x-1)^2] 边界条件为： u(-1,t)=0,u(1,t)=0. 本题要求： 使用Lax-Windroff格式，选择 v=0.5, 计算并画出当dt=0.01和0.0025时， 方程在t=0.5，x在(-1,1)时的数值解和精确解 输入： v--即a
UPW_utux0
- function [ue,un]=UPW_utux0(v,dt,t) 一个简单的双曲型偏微分方程： ut + ux = 0 初始条件为： u(x,0) = 1, x≤0 0, x＞0. 边界条件为： u(-1,t)=1,u(1,t)=0. 本题要求： 使用迎风格式，选择 v=0.5, 计算并画出当dt=0.01和0.0025时， 方程在t=0.5，x在(-1,1)时的数值解和精确解 输入： v--即a*dt/dx