-
aaa
对火焰惊醒提取轮廓 并求取周长面积 圆形度(Woke up on the flame contour extraction and the degree to strike a circular perimeter area)
- 2011-05-24 15:15:36下载
- 积分:1
-
cg-descent
用共轭梯度下降算法 求解图像压缩感知 并进行比较(Conjugate gradient descent algorithm for image compression and compared perception)
- 2013-08-30 22:33:31下载
- 积分:1
-
pcalda
说明: 包括pca和lda两个文件,先用pca降维后进行lda进行分类,用于人脸识别,实验结果很好。(It includes 2 files pca and lda. After the dimensionality reduction of pca, use lda for classification in face recognition. It has a very good experimental results.)
- 2009-08-22 19:43:06下载
- 积分:1
-
data fusion tools
图像融合,加权平均值,PCA方法,拉普拉斯方法,源程序(Image fusion, weighted average, PCA method, Laplace method, source)
- 2013-05-17 12:09:56下载
- 积分:1
-
#2D_voronoi建立及使用方法
说明: 使用MATLAB生成二维voronoi图的代码,可以用作后续二维voronoi的多晶模型建立(The code of two-dimensional Voronoi diagram generated by MATLAB can be used to build the polycrystalline model of two-dimensional voronoi.)
- 2021-01-06 22:38:53下载
- 积分:1
-
resampling
说明: 粒子滤波改进的重采样程序,Performs the resampling stage of the SIR (Improved particle filter resampling procedure, Performs the resampling stage of the SIR)
- 2008-10-19 22:03:49下载
- 积分:1
-
Supervised
说明: 遥感信息工程学院遥感原理与应用课程实习监督分类(Supervised of Remote Sensing Principle and Application Course Practice)
- 2019-05-24 08:43:58下载
- 积分:1
-
NcutClustering-谱聚类和SVM相结合的图像分割程序
说明: 基于谱聚类和SVM相结合的图像分割程序,在matlab2016b中运行成功(Image segmentation program based on spectral clustering and SVM)
- 2019-11-21 16:18:08下载
- 积分:1
-
Calculate
This is simple calculator program.
I m making a GUI calculator interface in MFC.
this program works pretty well.
- 2011-07-28 15:22:25下载
- 积分:1
-
BFSPDFS
广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点;深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。
(Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)
- 2013-08-10 10:37:12下载
- 积分:1