-
Chapter-12
water marking of an image.you can use the code.please try to run the code
- 2013-08-22 18:37:50下载
- 积分:1
-
asli
2D FDTD of a region with Mur s absorbing boundary condition (ABC)
- 2014-11-24 06:20:28下载
- 积分:1
-
ruggedexplorer22_user_guide
RUGGEDCOM USER GUIDE
- 2014-01-21 05:26:39下载
- 积分:1
-
Rectifier
说明: 12脉动换流器MATLAB-simulink仿真(rectifierSimulation of UHVDC lcc-hvdc, 12-pulse converter by MATLAB-simulink)
- 2020-12-08 09:09:21下载
- 积分:1
-
shearletnew
Demo:演示程序(注意图像路径)
ShearletCoef: 系数计算程序
mybeta: 伪极坐标 Fourier 变换(文件名是暂时的用法)
phi0,psi0,psid: 低高频图像点阵显示(myu,myv用于理论分析,不被 Demo 调用)
psiStock:
FPsi1(2)_x(有编号): shearlet 函数类
bump: 钟形光滑函数
ramp: 斜升光滑函数(即旧版中的 smooth)
新版比旧版提高了框架函数的连续性——对角方向上的生成函数进行了连续化。算法设计上,
伪极坐标 Fourier 变换被独立出来。(Demo: demo program (note the image path) ShearletCoef: coefficient calculation procedure mybeta: pseudo-Polar Fourier transform (the file name is temporary usage) phi0, psi0, psid: low frequency image dot matrix display (myu, myv for theoretical analysis not to be invoked Demo) psiStock: FPsi1 (2) _x (numbered): shearlet function classes bump: bell smooth function ramp: ramp smooth functions (ie legacy of smooth) than the old version of the framework to improve the continuity of functions- diagonal direction of the generating function were continuous. Algorithm design, pseudo-Polar Fourier transform is independent.)
- 2015-03-11 22:42:14下载
- 积分:1
-
diannengzl
电能质量的扰动研究,用matlab仿真,毕业设计的参考资料(Power quality disturbance study, using matlab simulation)
- 2021-04-13 00:58:56下载
- 积分:1
-
m_map1.4
M—map是海洋图像处理的matlab软件包,里面携带大量的坐标信息(no )
- 2010-05-21 17:01:30下载
- 积分:1
-
ASM.T.F.Cootes
Active Shape Models 的创始人 T.F.Cootes的几篇重要论文(the founder of the T. F. Cootes several important papers)
- 2007-05-02 19:55:47下载
- 积分:1
-
DG_PSO
利用PSO算法求解分布式电源的选址定容问题,并考虑了分布式电源的随机性(Randomness of the PSO algorithm DG locating and sizing issues and considered the DG)
- 2021-04-20 09:58:50下载
- 积分:1
-
zuiyou
说明: 本程序是基于方向优先权的机器人最优路径寻找算法,也可用于求解迷宫的最短路径,算法中是以100*100的格点为实例的,其中标0的位置为可行的点,标1的为障碍物,参考者可以根据自己的情况修改场地信息矩阵和起始点、目标点中间的算法不用修改
(This procedure is based on the priority direction of the robot to find the optimal path algorithm can also be used to solve the maze of the shortest path algorithm is 100* 100 grid points for the instance, which marked the location of 0 points as possible, standard 1 for the barrier, reference conditions can modify the site according to their own information matrix and the starting point, target points do not modify the middle of the algorithm)
- 2010-04-19 21:20:46下载
- 积分:1