-
gu_Morlet
自编小波变换程序，小波基Morlet，matlab环境。(Self wavelet transform process, wavelet Morlet, matlab environment.)
- 2011-02-10 02:52:45下载
- 积分：1
-
Hab
entropy measurement of image
- 2014-11-16 16:28:11下载
- 积分：1
-
DDS_32_half
使用MATLAB 实现得仅有一半存储量的DDS。(MATLAB to achieve half of the storage capacity of DDS)
- 2015-01-20 11:05:07下载
- 积分：1
-
数值积分与函数极值实验
matlab求数值积分以及数值求导函数源码(Matlab for numerical integration and numerical derivation function source code)
- 2017-09-15 20:57:41下载
- 积分：1
-
carphone
CAR PHONE SOFTWARE VIET NAM
- 2015-04-26 02:24:49下载
- 积分：1
-
att_faces
用离散傅里叶变换编写的人脸识别的代码，基于matlab平台，附带了专用的用于识别的人脸图片(Face recognition code using the discrete Fourier transform, based on matlab platform, comes with face photos dedicated used to identify)
- 2013-01-02 11:17:06下载
- 积分：1
-
Monte-Carlo-simulation-Matlab-code
在matlab下，利用monte carlo方法模拟光在混浊介质中的传输(In matlab, monte carlo simulation of the transmission of light in turbid media)
- 2012-12-20 18:17:32下载
- 积分：1
-
PCA_basedPFacePRecognitionPSystem
说明： 基于PCA的人脸识别程序，可做学习用，是本人千辛万苦找到的，不错的！(PCA-based face recognition program, learning to do, is I worked extremely hard to find, good!)
- 2011-03-23 19:34:58下载
- 积分：1
-
Matlab6
Matlab6应用开发指南,介绍matlab6的应用与开发，数值计算与统计，M文件编辑等(Matlab6 Application Development Guide, Introduction matlab6 the application and development of numerical and statistical, M file editing, etc.)
- 2013-08-07 15:30:52下载
- 积分：1
-
Fastdiscretecurvelettransforms
This paper describes two digital implementations of a new mathematical transform, namely,
the second generation curvelet transform [12, 10] in two and three dimensions. The first digital
transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is
based on the wrapping of specially selected Fourier samples. The two implementations essentially
differ by the choice of spatial grid used to translate curvelets at each scale and angle. Both
digitaltransformations return a table of digital curvelet coefficients indexed by a scale
parameter, anorientation parameter, and a spatial location parameter. And both implementations are
fast in
the sense that they run in O(n2 log n) flops for n by n Cartesian arrays in addition, they are
also invertible, with rapid inversion algorithms of about the same complexity.
- 2011-10-30 15:57:56下载
- 积分：1
