搜索资源列表
hough
- 对于较粗的样本点集 hough 算法是不可能做到检测全部直线的. 另一方面 hough 还会测出许多不存在的直线. 在应用的时候只能根据需要自己标定 精度. 以下是我在MATLAB下开发的hough函数 输入一个灰度图形矩阵, 返回 最长直线斜率. 用来做图形倾斜校正的. 希望贴出来还能有点用吧~-For a sample point set coarse algorithm hough it is not possible to do all the straight line de
pointset
- 基于OPenCV的源码,用于分割而为点集,函数执行二次方程的算法,将集合拆分成一个或更多的等效类。-Based on the source OPenCV for partition and for the point set, function to implement the algorithm quadratic equation will be split into a set of equivalent or more categories.
Delaunay_T945726142002
- vb lisp的三角剖分,可以稳健剖分点集-trianglization of vb-lisp
GA
- 基于佳点集的遗传算法求解tsp问题 用java开发,-Based on good point set genetic algorithm tsp problem with java development,
123
- 基于Hough 变换的SAR 图像舰船尾迹检测方法。该文引进了K均值聚类方法,将这些点集归类,归类后的每一类的类心能很好的代表一条尾迹,实验结果表明方法是有效的。-Hough transform based on SAR images of ship wake detection. The introduction of the K-means clustering method to classify these points, is classified in each category a
BallFit
- 用有限的数据点采用最小二乘的方法拟合一个球,算出了球心坐标和半径。数据点来源与Solidworks软件中绘制的一个球上的点集-With limited data points using least squares method of fitting a ball, calculate the coordinates and radius of the core. Solidworks data sources and mapping software on a ball point set
Autoclust.pdf.tar
- 这就是点集自动聚类的算法,基于delaunay三角剖分。-This is the point set automatic clustering algorithm, based on the delaunay triangulation.
tcphandoff
- 采用TCP handoff技术实现服务器集群。减少接入点的负载负担,使得集群的性能大大提高。-Using TCP handoff technology for server clusters. The burden of reducing the load on the access point, making the performance of the cluster increased substantially.
one
- 单射函数问题 设函数f将点集S = {0,1, , n -1}映射为f (S) = { f (i) | iÎ S} Í S 。单射函数问题要 从S中选取最大子集X Í S 使f (X )是单射函数。 例如,当n=7, f (S) = {1,0,0,2,2,3,6} Í S 时, X = {0,1,6} Í S 是所求的最大子集。-Injective function, the function f the pro
!!Computing3DNon-rigid
- 在这篇文章中,对目前的鲁棒点扩展匹配框架,以提高其处理能力提高计算效率较大的点集。-In this paper we present extensions to the Robust Point Matching framework to improve its ability to handle larger point sets with greater computational effi ciency.
uniform_dataset
- 生成均匀随机分布数据点集的程序。Fortran90编程。 The program allows the user to choose: M, the spatial dimension N, the number of points to generate SEED, the initial seed value. Once these parameters are set, the program generates the data, and writes
hausdorff
- 摘 要: 提出了一种基于改进 Ha u s d o r f f距离的人脸相似度匹配的方法, 该方法首先将人脸划分为脸型、 双眼、 鼻、 嘴等几个特征点 集, 分别计算各部分的改进 Ha u s d o r f f 距离, 然后进行加权计算相似度。利用该方法, 在 A S M( 主动形状模型) 定位人脸的基础上进 行了人脸检索。 实验表明, 利用人脸相似度计算方法对人脸特征库进行搜索, 达到 了较好的效果。同时结合 A S M 自动人脸检测, 本 方法可以全自动完成人脸匹配, 应
PointMatch
- 点集匹配算法实现。包括二分图匹配。可广泛应用计算机视觉领域-Point set matching algorithm. Including two sub-graph matching. Can be widely used in the field of computer vision
sjpf
- 三角剖分求二维平面上的点集的一个最小生成树,算法复杂度为O(nlogn)。-Seeking two-dimensional triangulation of points on the set of a minimum spanning tree, the algorithm complexity is O (nlogn).
tubao
- 实现点集凸包的算法,把众多随机分布的点用一条折线以最小的长度使其全部包括其中-Achieve point set convex hull algorithms, the number of random distribution of points with a polyline with a minimum length of it all including the
TrianPPS
- 计算平面点集的Delaunay三角剖分。使用DCEL数据结构。右键点击可以实现平面的直线穿刺。-Calculate the Delaunay triangulation of planar point set
leastsquaresfitting
- 把积分变成求和,再以所得到关于点集正交的多项式作基求最小二乘的拟合曲线-The integral into a sum of them, and then got on the point set of orthogonal polynomials for least-squares fitting curve of the base demand
Triangulation_source_code
- 任意大小点集的三角化,鲁棒,UI为在C#下编写-Triangulate of the points set
DelaunaySourceCodeJava14
- 经典的Delaunay三角化方法,可以实现鲁棒的点集三角化操作-The classic Delaunay triangulation method can achieve robust operation point set triangulation
Delaunay_Triangles_VB_Code
- 能够任意对任意创建的二维点集动态构建DELAUNAY三角网-Constructing Delaunay Triangulations with any Points set created.