Welcome![Sign In][Sign Up]
Location:
Search - Euclidean

Search list

[Graph RecognizeAutomatic_Fingerprint_Authentication_System

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:

[Windows Developfuzzy

Description: 模糊模式识别,包括最小最大贴近度、最小平均贴近度、海明贴近度、欧几里德贴近度等-Fuzzy pattern recognition, including the largest close to the smallest degree, the smallest average close degree, Haiming close degree, close to the degree of Euclidean
Platform: | Size: 2048 | Author: 李明 | Hits:

[Algorithmk_means_upde

Description: 不使用欧式距离,而是采用相关性对数列进行聚类-Do not use Euclidean distance, instead of using the related series of cluster
Platform: | Size: 2048 | Author: 赵妍 | Hits:

[OtherE_poisson

Description: 课件资料 关于泊松到达的清晰说明 一个泊松过程是在每个有界的时间区间或在某个空间(例如:一个欧氏平面或三维的欧氏空间)中的每一个有界的区域,赋予一个随机的事件数 用于无线通信系统中的信道接受data的过程的仿真-Poisson arrival of courseware information on a clear description of a Poisson process is bounded in each time interval, or in a space (for example: a Euclidean plane or three-dimensional Euclidean space) in every sector of the regional given a random number of events for the wireless communications system to receive data channel of the process simulation
Platform: | Size: 98304 | Author: 廖琦 | Hits:

[Graph Recognizeyuchuli

Description: 此代码实现了一个对汉字识别的一个预处理过程,把汉字的笔画按照书写顺序编程数字序列,易变后续处理-This code has a Chinese character recognition as a pretreatment process, the number of strokes of Chinese characters in accordance with the written order of the digital programming sequence, the follow-up to deal with volatile
Platform: | Size: 109568 | Author: armzm | Hits:

[AI-NN-PRkmeans

Description: 聚类算法kmeans,比较简单的聚类算法,通过欧几里德距离确定聚类的标准,对二维的点进行聚类-Clustering algorithm kmeans, relatively simple clustering algorithm, through the Euclidean distance to determine the standard clustering of the points of two-dimensional clustering
Platform: | Size: 3072 | Author: huang | Hits:

[matlabIDASimulation

Description: 本文针对SLAM数据关联中使用最为广泛的最近邻方法作了改进,利用特征估计位置与载体预测位置之间的欧氏距离计算代替了全部特征与每个量测之间的马氏距离计算,避免了大量的矩阵乘法计算。该算法简单易行,降低了算法的计算复杂度,有利于SLAM算法的实时执行,且关联效果与全局最近邻法相同-In this paper, SLAM data association in the most widely used methods of improving the nearest neighbor, using the characteristics of the estimated location and the location of vector prediction Euclidean distance between the calculation instead of all the characteristics of each measurement between the Mahalanobis distance calculation, to avoid a large number of matrix multiplication calculation. The algorithm is simple, the algorithm to reduce computational complexity and is conducive to the implementation of real-time SLAM algorithm, and the effects associated with the same overall nearest neighbor method
Platform: | Size: 8192 | Author: liancb | Hits:

[Algorithmeuclid

Description: 欧几里德算法和一些其他的简单功能。 求最大公约数之类-Euclidean algorithm and some other simple functions. Such as seeking common denominator
Platform: | Size: 450560 | Author: xiaolin | Hits:

[JSP/JavaMesh_Pnt

Description: Points in Euclidean space, implemented as double[].Includes simple geometric operations.Uses matrices a matrix is represented as an array of Pnts-Points in Euclidean space, implemented as double []. Includes simple geometric operations.Uses matrices a matrix is represented as an array of Pnts
Platform: | Size: 4096 | Author: cstar | Hits:

[Special Effectscbir

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:

[OS program69491719BayesClassier(1)

Description: 实现模式识别,实现最小欧式距离分类器的实现与形成-Achieve pattern recognition, achieve the minimum Euclidean distance classifier and the formation of implementation
Platform: | Size: 3072 | Author: 姜娜 | Hits:

[SCMou

Description: 欧几里德算法:辗转求余  原理: gcd(a,b)=gcd(b,a mod b)  当b为0时,两数的最大公约数即为a  getchar()会接受前一个scanf的回车符-Euclidean algorithm: Principles of travel for more than: gcd (a, b) = gcd (b, a mod b) when b is 0, the two common denominator is the number of a getchar () will accept the previous scanf carriage return
Platform: | Size: 2048 | Author: 俞佳 | Hits:

[Crack HackO_ji_li_de_expand

Description: 有关欧几里德的扩展算法,非常实用,经测试好用- The expansion of the Euclidean algorithm, is very practical, easy to use as test
Platform: | Size: 126976 | Author: xueqingshui | Hits:

[AI-NN-PRmaugis.tar

Description: Simulated annealing (SA) for the Symmetric Euclidean TSP
Platform: | Size: 28672 | Author: foxman | Hits:

[AI-NN-PRk_means

Description: k-means(欧氏距离)聚类算法是最基本的聚类算法,是理解和应用聚类算法的基础,通过k-means(欧氏距离)聚类算法我们才可以初步了解数据挖掘的原理。-k-means (Euclidean distance) clustering algorithm is the most basic clustering algorithm, is understanding and the basis for the application of clustering algorithm, through the k-means (Euclidean distance) clustering algorithm we are able to a preliminary understanding of the principles of data mining .
Platform: | Size: 276480 | Author: 徐加子 | Hits:

[Graph programfenxingc

Description: 基于传统欧几里得几何学的各门自然科学总是把研究对象想象成一个个规则的形体,而我们生活的世界竟如此不规则和支离破碎,与欧几里得几何图形相比,拥有完全不同层次的复杂性。分形几何则提供了一种描述这种不规则复杂现象中的秩序和结构的新方法。-Based on the traditional Euclidean geometry, the door is always to study the natural sciences to imagine a body of rules, and we live in a world that was so irregular and fragmented, compared with the Euclidean geometry, with full different levels of complexity. Fractal geometry provides a description of this complex phenomenon in irregular order and the structure of the new method.
Platform: | Size: 1024 | Author: weili | Hits:

[Graph Recognizehand_try

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:

[Windows DevelopCOD

Description: 这是data mining的维度魔咒实作之一 简单介绍在资料库中当资料的dim愈高愈多,在计算Euclidean Distance时会降低,如图所示 资料皆为乱数产生-This is the dimension of data mining as one of curse is a brief introduction in the database when the information the higher the more dim, when the Euclidean Distance in the calculation will be reduced, as shown both information Random Number Generator
Platform: | Size: 76800 | Author: 洪武 | Hits:

[SCMEuclideanalgorithmfGCD

Description: In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not require factoring the two integers, and it is also significant in that it is one of the oldest algorithms known, dating back to the ancient Greeks. -In number theory, the Euclidean algorithm (also called Euclid' s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not require factoring the two integers, and it is also significant in that it is one of the oldest algorithms known, dating back to the ancient Greeks.
Platform: | Size: 8192 | Author: wonder | Hits:

[Multimedia DevelopDirectLDA

Description: This a MFC program to test direct linear discriminant analysis (direct LDA) for face recognition. Histogram equalization is used as a preprocessing and direct LDA is used to reduce a dimension in feature space from train images. Minimum Euclidean distance is used for face recognition of test images. -This is a MFC program to test direct linear discriminant analysis (direct LDA) for face recognition. Histogram equalization is used as a preprocessing and direct LDA is used to reduce a dimension in feature space from train images. Minimum Euclidean distance is used for face recognition of test images.
Platform: | Size: 8902656 | Author: SUNGWOONG KIM | Hits:
« 1 2 3 4 5 6 78 9 10 11 12 ... 50 »

CodeBus www.codebus.net