Description: LVQ学习矢量化算法源程序
This directory contains code implementing the Learning vector quantization
network. Source code may be found in LVQ.CPP. Sample training data is found
in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The
LVQ program accepts input consisting of vectors and calculates the LVQ
network weights. If a test set is specified, the winning neuron (class) for
each neuron is identified and the Euclidean distance between the pattern and
each neuron is reported. Output is directed to the screen.-LVQ learning vector algorithm This directory contains source co de implementing the Learning vector quantizat ion network. Source code may be found in LVQ.CPP . Sample training data is found in LVQ1.PAT. Sam ple test data is found in LVQTEST1.TST and LVQTE ST2.TST. The program accepts input LVQ consist ing of vectors and calculates the network we LVQ ights. If a test set is specified, the winning Neurology (class) for each of Neurology is id entified and the Euclidean distance between th e pattern and each of Neurology is reported. Output is directed to the screen. Platform: |
Size: 37888 |
Author:张伟华 |
Hits:
Description: 这个是采用欧氏距离下的K-means算法的matlab实现-this is the Euclidean distance between the K-means algorithm to achieve the Matlab Platform: |
Size: 5120 |
Author:李序 |
Hits:
Description: This function computes Euclidean distance transform for 3D binary image with non-trivial aspect ratio (i.e. anisotropic pixels). The algorithm uses fast optimized line-scans and is actually faster than MATLAB s BWDIST implementation of search on optimized kd-tree for many cases. It also uses cell-array representation for internal data, and thus is less demanding to physical memory. Platform: |
Size: 49152 |
Author:fangfei |
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: 计算2组象素的最小距离 minimum euclidean distance calculation between 2 groups pixels and returns the distance and pixel coordinations文件内容:test_min_distance5a.tif, CONTENTS.M, euclidean_distance.m, test_calculate_min_distance.m, test_min_distance1a.tif, test_min_distance1b.tif, test_min_distance2a.tif, test_min_distance2b.tif, test_min_distance3a.tif, test_min_distance3b.tif, test_min_distance4a.tif, test_min_distance4b.tif, calculate_min_distance.m, test_min_distance5b.tif-Group 2-pixel calculation of minimum distance between a minimum euclidean distance calculation between 2 groups pixels and returns the distance and pixel coordinations the content of the document: test_min_distance5a.tif, CONTENTS.M, euclidean_distance.m, test_calculate_min_distance.m, test_min_distance1a.tif, test_min_distance1b.tif, test_min_distance2a.tif, test_min_distance2b.tif, test_min_distance3a.tif, test_min_distance3b.tif, test_min_distance4a.tif, test_min_distance4b.tif, calculate_min_distance.m, test_min_distance5b.tif Platform: |
Size: 30720 |
Author:田卉 |
Hits:
Description: A novel texture-based Automatic Fingerprint Authentication System (AFAS) is proposed. A fingerprint image is preprocessed to enhance the image by Short Time Fourier Transform (STFT) analysis. Then, three sets of invariant moment features, as a kind of texture features, are extracted from three different sizes of Region of Interest (ROI) areas based on the reference point from the enhanced fingerprint image. Each set of invariant moments contain seven invariant moments. Fingerprint verification is realized by Euclidean distance between the two corresponding features of the test fingerprint image and template fingerprint image in the database. -A novel texture-based Automatic Fingerprint Authentication System (AFAS) is proposed. A fingerprint image is preprocessed to enhance the image by Short Time Fourier Transform (STFT) analysis. Then, three sets of invariant moment features, as a kind of texture features, are extracted from three different sizes of Region of Interest (ROI) areas based on the reference point from the enhanced fingerprint image. Each set of invariant moments contain seven invariant moments. Fingerprint verification is realized by Euclidean distance between the two corresponding features of the test fingerprint image and template fingerprint image in the database. Platform: |
Size: 421888 |
Author:ruan |
Hits:
Description: 產生k個d維的常態分布樣本，產生某個事前機率為P(wi)的常態分布的discriminant
function，計算任兩點間的Euclidean distance及Mahalanobis distance
-Generated k-d-dimensional normal distribution of samples to generate a prior probability P (wi) of the normal distribution of the discriminant function, calculated between any two points in Euclidean distance and Mahalanobis distance Platform: |
Size: 38912 |
Author:amy |
Hits:
Description: 本文针对SLAM算法中数据关联过程，提出了一种简单易行的改进方法，将欧氏距离与马氏距离结合用于数据关联。算法不必计算地图所有特征与所有量测之间的马氏距离，而是首先利用相对简单的欧氏距离计算缩小了待关联特征的搜寻范围。利用人工合成数据的仿真结果表明，改进后的数据关联方法可以大幅减少系统计算量，提高关联效率，且不会造成错误关联的增加。-This article SLAM algorithm for data association process, a simple method to Euclidean distance combined with the Mahalanobis distance for data association. Algorithms do not have to calculate all the characteristics of the map with all measurements between the Mahalanobis distance, but the first to use a relatively simple calculation of Euclidean distance to be associated characteristics of narrowing the search. The use of synthetic data simulation results show that the improved methods of data association can significantly reduce the system to calculate the volume and improve the efficiency of association, and will not lead to errors associated with an increase. Platform: |
Size: 13312 |
Author:liancb |
Hits:
Description: 用matlab实现的几种模式识别的方法，有切比雪夫距离法，马氏距离法，欧氏距离法。而且每种方法都给出了多种编程-Matlab achieved using several methods of pattern recognition, there are Chebyshev distance, Mahalanobis distance method, Euclidean distance method. But each method are given a variety of programming Platform: |
Size: 82944 |
Author:mr yao |
Hits:
Description: 用的是局部颜色特征，再说细点是用里面的区域颜色直方图的方法。把图像归一化到256X256，把图像分成4X4块，计算16个区域的颜色直方图、、、
最后计算相似度是用欧氏距离.-Using local color feature, repeat fine-point is inside the regional color histogram method. The normalized image to 256X256, the image is divided into 4X4 blocks, the calculation of the 16 regional color histogram, calculated similarity is Euclidean distance. Platform: |
Size: 12361728 |
Author:周文 |
Hits:
Description: 这个是准备做笔迹识别用的程序，很齐全哦~~想做gabor 再用kpca，最后用欧氏距离-Prepared to do this is to use handwriting recognition process, it is complete Oh ~ ~ gabor want to reuse kpca, the last with Euclidean distance Platform: |
Size: 2048 |
Author:zhouqin |
Hits:
Description: 将图像提取gist向量，然后计算各向量之间的欧氏距离，进行比较。-Extracted gist vector image, and then calculate the Euclidean distance between vectors, for comparison. Platform: |
Size: 1024 |
Author:刘洋 |
Hits:
Description: Euclidean Distance Transform has been widely studied in computational geometry, image processing, computer graphics and pattern recognition. Euclidean distance has been computed through different algorithms like parallel, linear time algorithms etc. On the basis of efficiency, accuracy and numerical computations, existing and proposed techniques has been compared. This study proposed a new technique of finding Euclidian distance using sequential algorithm. An experimental evaluation has shown that proposed technique has reduced the drawbacks of existing techniques. And the use of sequential algorithm scans has reduced the computational cost. Platform: |
Size: 101376 |
Author:yasora |
Hits:
Description: Compute nearest neighbours (by Euclidean distance) to a set of points of interest from a set of candidate points.
The points of interest can be specified as either a matrix of points (as columns) or indices into the matrix of candidate points.
Points can be of any (within reason) dimension.
nearestneighbour can be used to search for k nearest neighbours, or neighbours within some distance (or both)
If only 1 neighbour is required for each point of interest, nearestneighbour tests to see whether it would be faster to construct the Delaunay Triangulation (delaunayn) and use dsearchn to lookup the neighbours, and if so, automatically computes the neighbours this way. This means the fastest neighbour lookup method is always used. Platform: |
Size: 30720 |
Author:nadir |
Hits:
Description: Matlab表情识别，特征脸[1 ]作为面部表情分类的方法。首先，利用训练图像创建低维人脸空间（pca）。这是通过训练图像集主成分分析（PCA）及图片主成分分析（即具有较大特征值的特征向量）获得的。
结果，所有的测试图像以所选择的主成分表示，计算投影图像与所有投影列车图像的欧几里得距离，选择最小值以找出与试验图像最相似的训练图像。(The feature face [1] is used as a facial expression classification method. Firstly, a low-dimensional face space (pca) is created using training images. This is obtained by training principal component analysis (PCA) of image set and principal component analysis of image (i.e. eigenvectors with larger eigenvalues).
As a result, all the test images are represented by the selected principal components, the Euclidean distance between the projected image and all the projected train images is calculated, and the minimum value is selected to find the training image most similar to the test image.) Platform: |
Size: 4684800 |
Author:bbqQq |
Hits:
Search - Euclidean distance MATLAB