Description: 聚类算法中常用欧氏距离，这篇文章描述了使用加权的方法。-clustering algorithm common Euclidean distance, this article describes the use of weighted method. Platform: |
Size: 18922 |
Author:石支柱 |
Hits:
Description: 聚类算法中常用欧氏距离，这篇文章描述了使用加权的方法。-clustering algorithm common Euclidean distance, this article describes the use of weighted method. Platform: |
Size: 18432 |
Author:石支柱 |
Hits:
Description: 自己编的一些关于图像灰度直方图处理的MATLAB源程序，包括加权距离，累加直方图，欧氏距离，直方图相交法，中心距法共5种方法，可选择适合的选用。-Own some on the image histogram processing MATLAB source code, including the weighted distance, cumulative histogram, Euclidean distance, histogram intersection of law, from the Law Center, five kinds of methods to choose the appropriate selection. Platform: |
Size: 2048 |
Author:louwutao |
Hits:
Description: 提出一种基于多纹理特征融合的新颖虹膜识别方法。该方法对虹膜图像做Gabor 小波变换
提取不同分辨力不同方向下的纹理特征作为虹膜的全局特征，在滤波后的子窗口图像上运用灰度
级共现矩阵(COM)提取虹膜的局部特征。通过加权欧几里德距离和最小距离分别对全局特征和局部
特征进行分类识别。-A texture feature fusion based on multi-novel iris recognition method. The method of iris image make Gabor wavelet transform extracted under different resolution in different directions as the texture feature of the overall characteristics of the iris, in the post-filter sub-window image using gray level co-occurrence matrix (COM) of the local feature extraction of the iris. Through the weighted Euclidean distance and minimum distance, respectively, on the global features and local features for classification. Platform: |
Size: 770048 |
Author:闫慧 |
Hits:
Description: 编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。
（随机生成n个点，且随机生成k条边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points (x,y) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
Platform: |
Size: 2048 |
Author:许许 |
Hits:
Description: 编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。-Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
Platform: |
Size: 2048 |
Author:许许 |
Hits:
Description: 本系统通过将基于改进的加权的局域颜色直方图的图像检索方法和全局直方图的图像检索方法相结合，提高查全率和查准率。其中，基于分块局域直方图的检索方法利用了图像中间部分的重要性，将图像平均划分成3×3个子块，取中间一块的图像，计算其与参考位图相应位置的颜色特征距离，再计算原图的颜色直方图与参考位图的颜色特征距离，分别赋予权值后得出的值就是图像之间内容的相似程度。本文引入欧氏距离的相似性度量方法实现图像检索。实验表明，该方法具有较好的查全率和查准率。-The system through a combination of improved weighted local color histogram-based image retrieval method based and global image retrieval method to improve the recall rate and precision rate. Wherein chunked local histogram-based retrieval method using the importance of the intermediate portion of the image, the image is evenly divided into 33 sub-blocks, take the middle piece of the image color characteristic distance calculated with reference to the bitmap corresponding positions , then calculate the original color histogram and color characteristics of the reference bitmap distance, respectively assigning weights to the value obtained is the degree of similarity between the images. This paper introduces the Euclidean distance similarity measure image retrieval. Experiments show that the method has good recall and precision. Platform: |
Size: 3716096 |
Author:周佳森 |
Hits:
Description: 对传统欧氏距离进行了改进，利用加权处理对K_means法进行了改进，分割聚类效果较为理想-The traditional Euclidean distance is improved, treatment of K_means method was improved by using the weighted clustering, segmentation effect is ideal
Platform: |
Size: 315392 |
Author:李强 |
Hits:
Description: 针对故障辨识诊断，提出新型未知故障辨识的加权归一化半径判别法，与欧氏距离和归一化半径判别作比较，证明了该方法的有效性。-Failure to diagnose against new, unknown fault identification proposed weighted normalized radius discrimination law, and Euclidean distance and normalized radius of discrimination as compared to prove the effectiveness of this method. Platform: |
Size: 618496 |
Author:程序圆 |
Hits:
Description: 基于欧几里得距离的聚类分析，采用加权网络中节点强度和权重都是幂率分布的模型，双向PCS控制仿真，快速扩展随机生成树算法，从先验概率中采样，计算权重。- Clustering analysis based on Euclidean distance, Using weighted model nodes in the network strength and weight are power law distribution, Two-way PCS control simulation, Rapid expansion of random spanning tree algorithm, Sampling a priori probability, calculate the weight. Platform: |
Size: 8192 |
Author:fccxqt |
Hits:
Description: 抑制载波型差分相位调制，使用高阶累积量对MPSK信号进行调制识别，基于欧几里得距离的聚类分析，采用加权网络中节点强度和权重都是幂率分布的模型，构成不同频率的调制信号，用于图像处理的独立分量分析，到达过程是的泊松过程，GSM中GMSK调制信号的产生。- Suppressed carrier type differential phase modulation, Using high-order cumulants of MPSK signal modulation recognition, Clustering analysis based on Euclidean distance, Using weighted model nodes in the network strength and weight are power law distribution, Constituting the modulated signals of different frequencies, Independent component analysis for image processing, Arrival process is a Poisson process, GSM is GMSK modulation signal generation. Platform: |
Size: 7168 |
Author:frtkpuvn |
Hits:
Description: 采用加权网络中节点强度和权重都是幂率分布的模型，计算两个矩阵之间的欧氏距离，实现了对10个数字音的识别。- Using weighted model nodes in the network strength and weight are power law distribution, Calculation of the Euclidean distance between the two matrices, To achieve the recognition of 10 digital sound. Platform: |
Size: 7168 |
Author:yanniufai |
Hits:
Description: 基于欧几里得距离的聚类分析，采用加权网络中节点强度和权重都是幂率分布的模型，混沌的判断指标Lyapunov指数计算。- Clustering analysis based on Euclidean distance, Using weighted model nodes in the network strength and weight are power law distribution, Chaos indicator for Lyapunov index calculation. Platform: |
Size: 6144 |
Author:seipeibing |
Hits:
Description: IMC-PID是利用内模控制原理来对PID参数进行计算，基于欧几里得距离的聚类分析，采用加权网络中节点强度和权重都是幂率分布的模型。- The IMC- PID is using the internal model control principle for PID parameters is calculated, Clustering analysis based on Euclidean distance, Using weighted model nodes in the network strength and weight are power law distribution. Platform: |
Size: 6144 |
Author:qenpunfai |
Hits:
Description: 计算两个矩阵之间的欧氏距离，包括 MUSIC算法，ESPRIT算法 ROOT-MUSIC算法，采用加权网络中节点强度和权重都是幂率分布的模型。- Calculation of the Euclidean distance between the two matrices, Including the MUSIC algorithm, ESPRIT algorithm ROOT-MUSIC algorithm, Using weighted model nodes in the network strength and weight are power law distribution. Platform: |
Size: 5120 |
Author:余红波 |
Hits:
Search - weighted Euclidean