-
mpegcode_matlab
对单幅图像进行编解码程序，经过DCT,量化，扫描，编码及其逆过程实现编解码(Single image codec on the program, after DCT, quantization, scanning, coding and decoding achieve reverse process)
- 2010-07-04 22:45:34下载
- 积分：1
-
contours
The Canny edge detector is an edge detection operator that uses a multi-stage algorithm to detect a wide range of edges in images
- 2013-05-09 04:17:58下载
- 积分：1
-
Matlab
matlab 教程。。。对于没用过matlab的 可以作为入门学习(matlab tutorial. . . For matlab can not used as a learning portal)
- 2013-12-06 12:15:15下载
- 积分：1
-
GA.zip
多种群遗传算法的函数优化算法以及其的应用程序(Function optimization algorithm of multi population genetic algorithm and its application program)
- 2018-05-23 11:31:55下载
- 积分：1
-
synthetic_aperture_radar
合成孔径.ppt,合成孔径雷达.ppt,脉冲压缩雷达.ppt,目标分辨与模糊.ppt(Synthetic aperture. Ppt, synthetic aperture radar. Ppt, pulse compression radar. Ppt, objectives and fuzzy to tell. Ppt)
- 2008-04-20 00:07:20下载
- 积分：1
-
MATLAB_Turbo_Code
Matlab Turbo coding
- 2009-05-09 07:02:07下载
- 积分：1
-
class
说明： 具体什么内容，自己看了就知道了，学到的用了才是最好的，否则不看也罢(What is the specific content of their reading will know, learn to use the best, otherwise do not look worth mentioning)
- 2010-04-12 17:09:49下载
- 积分：1
-
DCT_DFT_FFT(matlab)
无限长的序列也往往可以用有限长序列来逼近。对于有限长的序列我们可以使用离散傅立叶变换（DFT）。DFT是对序列傅立叶变换的等距采样。是序列傅立叶变换的等距采样。
本源码是对DCT、DFT、FFT的matlab实现(Infinitely long sequence is often a long sequence with limited approximation. For the finite length of the sequence we can use the discrete Fourier transform (DFT). DFT is a sequence of equidistant sampling Fourier transform. Is a sequence of equidistant sampling Fourier transform. The source is the DCT, DFT, FFT in matlab implementation)
- 2011-01-02 12:24:41下载
- 积分：1
-
F7EA6D2B-BDB9-137E-CC74F951EBB8FCA0_45593
说明： 通过matlab编程来优化层状光栅的尺寸，从而实现光栅在1.3微米作为100％效率的反射镜设计。(Through the matlab programming to optimize the size of lamellar grating in order to achieve the 1.3-micron grating as 100 percent efficient reflector design.)
- 2008-12-02 21:48:39下载
- 积分：1
-
cebk_tsp
用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。
(Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
- 2011-05-22 08:12:37下载
- 积分：1
