-
COMPRESS-RLE
Gray code and RLE compression.
- 2010-10-29 20:03:44下载
- 积分：1
-
CalendarTable
用matlab做的趣味日历 感觉还不错(Matlab to do with feeling good fun calendar)
- 2010-12-01 21:19:10下载
- 积分：1
-
Meanshift
摄像头固定情况下的运动行人跟踪进行研究，Mean Shift算法，与目标区域灰度直方图结合，进行运动目标的检测跟踪(tracking study of the movement of pedestrians in case of a fixed camera introduces a better application of Mean Shift algorithm)
- 2015-03-16 23:03:49下载
- 积分：1
-
danpao3
matlab程序，地震数据单炮的模拟，震源为Ricker子波(matlab program to simulate the seismic data in a single shot, the source for the Ricker wavelet)
- 2014-02-20 16:52:56下载
- 积分：1
-
image_compress
本程序利用奇异值分解对3通道彩色图像进行压缩分解，具体步骤如下：
压缩过程：
1. 选取子图像大小K值，把图像分解成M×M个子图像，IMG(s),s=1,2,…, M2，其中M=N/K，原始图像IMG大小为N×N。
2. 计算这M2个子图像的平均值average，对每幅子图像减去均值图像得到新图像。
3. 计算相关矩阵R，其元素定义为 。
4. 计算R的特征值与特征向量，计算每幅子图像与最大特征向量的内积，便得到编码，即压缩后的图像。
(This procedure using singular value decomposition of 3-channel color image compression decomposition, concrete steps are as follows: compression process: 1. Select the sub-image size K value, the image is decomposed into M × M sub-image, IMG (s), s = 1, 2, ..., M2, in which M = N/K, the original image IMG size N × N. 2. M2 calculate the average of sub-image average, for each sub-image minus the new images mean images. 3. Calculation of correlation matrix R, defined as its elements. 4. Calculation of the characteristics of R value and eigenvector calculated each sub-image with the largest eigenvector of the inner product, they will have to code, that is, the compressed images.)
- 2008-01-03 23:00:33下载
- 积分：1
-
Untitled2
上传的是SIR的代码，给粒子滤波初学者提供一些简单的基础的代码。(SIR code is uploaded to the particle filter for beginners to provide some simple basic code.)
- 2015-03-26 19:24:25下载
- 积分：1
-
lapack
Matlab 与 LAPACK数值库的接口库(Interface code between matlab and Lapack library.)
- 2010-06-30 15:25:46下载
- 积分：1
-
EMdemo
This is Expectation Maximization algorithm code.
- 2010-07-17 05:36:15下载
- 积分：1
-
matlabDSS
DSS simulation program
- 2012-06-04 00:21:18下载
- 积分：1
-
TSP
旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)
- 2015-01-18 21:43:12下载
- 积分：1
