-
test5
matlab数字图象处理 matlab数字图象处理 (Matlab digital image processing digital image processing Matlab Matlab digital image processing)
- 2007-07-06 08:44:40下载
- 积分：1
-
computeremulational
说明： 这是一个计算机仿真技术用matlab编的小程序，可以识别颜色的程序并能把它分裂出来(This is a computer simulation using Matlab series of small programs, color identification procedures and make it seceded)
- 2006-03-22 11:05:01下载
- 积分：1
-
Wavelet-denoising
基 于 小 波 变 换 的 信 号 去 噪 研究 算 法 (Signal denoising based on wavelet transform algorithm research
)
- 2011-10-09 10:39:16下载
- 积分：1
-
mcmcexamples
MCMC toolbox for Matlab - Examples
These examples are all Matlab scripts and the web pages are generated using the publish function in Matlab. The collection of examples can be downloaded as file mcmcexamples.zip. They use the MCMC toolbox
- 2010-01-09 03:14:22下载
- 积分：1
-
Compression
JPEG2000 Image Compression: Efficient Methods for Encoding Regions of Interest in the Upcoming JPEG2000 Still Image Coding Standard
- 2011-08-14 23:09:22下载
- 积分：1
-
PSO
A viable particle swarm optimization to update algorithm, MATLAB code to run correctly simulation, ease of use
- 2015-02-06 14:03:23下载
- 积分：1
-
stripmap
PULSED STRIPMAP SAR SIMULATION AND RECONSTRUCTION,
u domain parameters and arrays for SAR signal,
u domain parameters and arrays for compressed SAR signal,
Fast-time domain parameters and arrays Resolution Parameters of Targets, SIMULATION, This code performs "narrow-bandwidth" digital spotlighting.To improve results, convert the code to "wide-bandwidth" ,
2D BEAM PATTERN MATCHED FILTERING SLOW-TIME, DOPPLER SUBSAMPLING RECONSTRUCTION
- 2012-03-30 16:45:07下载
- 积分：1
-
ex4
仿真V-BALST结构MMSE检测算法性能，调制方式为QPSK(Simulation V-BALST structure MMSE detection algorithm performance, the modulation scheme is QPSK)
- 2014-10-31 14:29:38下载
- 积分：1
-
adi_fdtd.m
Program ADI-FDTD with PEC made in MATLAB whithou PML
- 2020-06-29 19:20:01下载
- 积分：1
-
simAnealing
Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.
- 2010-07-07 12:57:40下载
- 积分：1
