当前位置：
首页 资源下载
搜索资源 - Euclidean distance
搜索资源列表
-
0下载：
基于欧式距离的最邻近改进算法，该算法在提高SIFT算法的特征点匹配效率-Euclidean distance based on the nearest improved algorithm SIFT algorithm to improve the efficiency of matching feature points
-
-
0下载：
Euclidean distance algorithm, C + +, and can be used directly, suitable for image professional friends
-Euclidean distance algorithm, C++, and can be used directly, suitable for image professional friends
-
-
0下载：
一种实现流形学习ISOMAP的matlab算法 即将mds中的欧氏距离替换为测地距离 保证其拓扑空间不变 实现数据的特征提取-An matlab program that can realize ISOMAP algorithm. To replace the Euclidean distance to the distance measurement.To ensure the realization of the same topological space data feature ext
-
-
1下载：
proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details
in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean
distance between the two correspon
-
-
1下载：
C++与FORTRAN混编程序。考虑各向异性的克里金法及序贯高斯法。在地质，油藏建模中很有用处
Author--Jeff Boisvert and Clayton V. Deutsch-for incorporating locally varying anisotropy in kriging or sequential Gaussian simulation is based on modifying how locations in space are related. Norm
-
-
1下载：
按照模式相似性测度算法计算待测样品与样品库中的样品相似度，包括模块匹配法、基于PCA的模块匹配法、基于类中心的欧氏距离法和马氏距离法-Similarity measure in accordance with the mode algorithm to calculate the sample similarity in the sample and sample libraries , including the module matching method based on PCA modu
-
-
0下载：
利用欧氏距离计算三维模型的中轴，希望对大家有用！-Medial Axis (MA), also known as Centres of Maximal Disks, is a useful representation of a shape for image descr iption and analysis.
MA can be computed on a distance transform, where each point is labelled to its distance t
-
-
0下载：
SIFT keypoints of objects are first extracted from a set of reference images[4] and stored in a database. An object is recognized in a new image by individually comparing each feature from the new image to this database and finding candidate matching
-
-
0下载：
模式识别作业，贝叶斯分类，欧式距离马氏距离-Pattern recognition operation, the Bayesian classifier, the Euclidean distance, Mahalanobis distance
-
-
0下载：
独立主成分分析与主成分分析代码，速度比较快，而且比较好用-In these first experiments, both ICA and whitened PCA are used to compress the data, and all the components are used for classifying the examples. The classifier used is a 1-NN with Euclidean distance. The results shown i
-
-
1下载：
ANN是一个构造数据索引结果的程序，可以实现最近邻、KD树等功能。ANN is designed for data sets that
are small enough that the search structure can be stored in main memory (in contrast to approaches from databases that assume that the data resides in secondary storage). Points ar
-
-
1下载：
义了一个欧氏距离和监督信息相混合的新的最近邻计算函数，从而将K一均值算法很好地应用于半
监督聚类问题。针对K一均值算法初始质心敏感的缺陷，用粒子群算法的搜索空间模拟聚类的欧氏空间，迭代搜
索找到较优的聚类质心，同时提出动态管理种群的策略以提高粒子群算法搜索效率。算法在UCI的多个数据集
上测试都得到了较好的聚类准确率。-Righteousness of a Euclidean distance and supervision of a mixture of new nearest n
-
-
0下载：
程序按照随即生成若干个点作为点坐标 ，根据欧式距离 进行聚类分析 ，图像处理对象是灰度值，这里是用随即生成的点做例子 展示，这个程序有界面！-Procedures in accordance with the randomly generated a number of points as the point coordinates, cluster analysis based on Euclidean distance, the image processing is the gray va
-
-
0下载：
利用索贝尔算子两种模板提取图像梯度，幅度选取分别利用欧式距离、城区距离和棋盘距离。-Using two templates of Sobel operator to extract the gradient of a image. Magnitude was selected by using Euclidean distance, city distance and chessboard distance.
-
-
0下载：
Map saliency based on euclidean distance
-
-
0下载：
采用小波变换，利用小波系数，作为图像纹理特征的检索。并采用欧式距离，将最相似的图像，按序排列下来-The wavelet transform using the wavelet coefficients as the retrieval of image texture features. And Euclidean distance, the most similar images in descending order down
-
-
0下载：
data preprocessing, feature extraction by using PCA, and recognition by using euclidean distance
-
-
0下载：
基于gabor特征提取与欧式距离分类的人脸识别-Based on the gabor feature extraction and face recognition of the Euclidean distance.
-
-
0下载：
基于欧几里得距离的聚类分析算法程序，只需要用户输入矩阵即可完成-Euclidean distance-based clustering analysis algorithm procedure, but requires the user to complete input matrix
-
-
0下载：
用于建模数据分集。计算各样本点的欧式距离，首先将距离最大的两个点放入第一个样本集，接着将余下距离最大的两个点放入第二个样本集，依次计算，将剩余数据点分别放入上述两个样本集。- This algorithm starts by selecting the two points furthest from each other (euclidean distance) and puts them both in a first set. Then the next two points furthe
-
«
1
2
3
4
5
6
78
9
10
11
12
...
50
»
