-
DCT_Compression
Image Compression using DCT
- 2010-06-25 01:33:59下载
- 积分：1
-
ImageprocessingwithMATLAB6.5
关于用MATLAB6.5进行图像处理的书籍，适合初学者，内有代码(Image processing with MATLAB6.5 on the books, for beginners, there are code)
- 2010-10-29 15:13:21下载
- 积分：1
-
Ansoft12
Ansoft，必不可少的工程电磁场分析使用说明。(The operator direction of ansoft, whichi is necessary during the design of E&M.)
- 2011-01-14 13:20:19下载
- 积分：1
-
LpMethodFusion
基于拉普拉斯塔型分解图像融合算法,采用matlab实现,算法用三层分解(Lapulashida-based decomposition algorithm for image fusion using Matlab realized, with the three-tier decomposition algorithm)
- 2007-05-30 22:51:06下载
- 积分：1
-
phase
hilditch.m是hilditch细化算法。
RC_unwrap.m是逐行逐列去包裹算法。
least_unwrap.m是最小二乘去包裹算法。
FTP.m是利用傅里叶变换提取相位。
sincosfilter.m是正余弦滤波算法。
以上算法在相位图的相关计算中常用到，比如电子散斑干涉、全息干涉、相移技术等。
(hilditch.m is hilditch refinement algorithm. RC_unwrap.m is listed line by line unwrapping algorithm. least_unwrap.m is the least squares unwrapping algorithm. FTP.m is extracted by Fourier transform phase. sincosfilter.m is the cosine filter. Above algorithm in the calculation of phase diagrams related to the commonly used, such as electronic speckle pattern interferometry, holographic interferometry, phase shift technology.)
- 2010-11-30 17:31:19下载
- 积分：1
-
MyKmeans
实现聚类K均值算法： K均值算法：给定类的个数K，将n个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。 缺点：产生类的大小相差不会很大，对于脏数据很敏感。 改进的算法：k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用，这样的一个medoid就标识了这个类。步骤： 1，任意选取K个对象作为medoids（O1,O2,…Oi…Ok）。 以下是循环的： 2，将余下的对象分到各个类中去（根据与medoid最相近的原则）； 3，对于每个类（Oi）中，顺序选取一个Or，计算用Or代替Oi后的消耗—E（Or）。选择E最小的那个Or来代替Oi。这样K个medoids就改变了，下面就再转到2。 4，这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感，但计算量显然要比K均值要大，一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))
- 2005-07-26 01:32:58下载
- 积分：1
-
ransac_homography
this code is to realize a RANSAC algorithm
- 2012-03-30 23:24:47下载
- 积分：1
-
Grid_Connected_Fuel_Cell
基于simulink编写的燃料电池并网模型(Prepared based on simulink model of a fuel cell and network)
- 2020-11-21 10:39:37下载
- 积分：1
-
基于双隐含层BP神经网络的预测
说明： bp神经网络预测模型，可以很好的进行训练集和测试集建模，实用方便(BP neural network prediction model can model training set and test set very well, which is practical and convenien)
- 2020-06-10 19:50:39下载
- 积分：1
-
matlabwavelet
说明： matlab 小波去噪的程序 系转载 欢迎大家批评指正(matlab&wavelet)
- 2010-03-26 12:23:48下载
- 积分：1
