搜索资源列表
最短距离问题
- 求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest pat
IM0623
- （1）变换模块 本模块包含两部分内容：利用 反变换规则将 坐标系下的两相电流转换成三相电流；利用间接矢量控制，得到转子角位移，公式如下（2） 电流滞环控制器(Hysteresis current controller)模块（3） 电压源型逆变器(Voltage sourse inverter,VSI)模块 （4） 变换模块（5） 感应电机(IM)模块 该感应电机模型是基于交流电机的电路方程、转矩方程以及运动方程建立起来的。该仿真模块为一个三输入、六输出的系统子模块。输入为 坐标系中定
decomp_reconst_W
- Decompose image into subbands, denoise using BLS-GSM method, and recompose again. fh = decomp_reconst(im,Nsc,filter,block,noise,parent,covariance,optim,sig) im: image Nsc: number of scales filter: type of filter used (see namedFilt
decomp_reconst_WU
- Decompose image into subbands (undecimated wavelet), denoise, and recompose again. fh = decomp_reconst_wavelet(im,Nsc,daub_order,block,noise,parent,covariance,optim,sig) im : image Nsc: Number of scales daub_order: Order of the daubec
li9_23
- clear all I=imread( lena.bmp ) figure imshow(I) I2=imrotate(I,-4, bilinear ) 逆时针旋转4度 figure imshow(I2) I3=fliplr(I) 垂直镜像 figure imshow(I3) I4=imresize(I,0.5, bilinear ) 缩小为原图的1/2 figure imshow(I4) A=double(I) 转换为double类型
bwt
- BWT decomposition Version 1.2 Arguments: im: A square image side length must be a power of 3 Result: decomp: The decomposition is laid out -BWT decomposition Version 1.2 Arguments: im: A square image side leng
unit_opt
- The architecture of this set of codes and the interaction among them is shown in Figure 1. The main testing code main code.m calls the code riemann grad unit opt.m that performs Riemannian optimization under unitary matrix constraint. Steepest De
Edge-based-text-region-extraction-from-natural-im
- The basic steps of the edge-based text extraction algorithm are given below 1. Create a Gaussian pyramid by convolving the input image with a Gaussian kernel and successively down-sample each direction by half. (Levels: 4) 2. Create directiona