快速查找重叠于某点的所有区间集是计算机图形学、模式匹配及其他应用中急需解决的问题之一。
Highspeed finding of the collection of all intervals overlapping a point is one of the urgent problems to be solved in the applications of computer graphology and mode matching.
首先在序列的两幅图像中检测兴趣点，并运用灰度差分不变量进行两点集之间的匹配。
Firstly, we detect the points of interest in a pair of images in image sequence, and then match the point set using the gray value differential invariants.
然后用一种张弛法去改善匹配可信度。这过程一直反复进行到最大匹配点集出现。
Then a relaxation algorithm is used to raise the confidence of matching: The process will be iterated until the largest matched point set is obtained.
利用兴趣点进行序列图像匹配可以利用兴趣点及其邻域的灰度信息和兴趣点集的几何信息。
The information available for image matching includes the gray-level of or near interest points and the geometrical relation of interest points.
此算法首先结合RAC和K -均值聚类方法对未知模型的特征点进行预匹配，得到的匹配结果称为聚类点集。
Firstly, RAC and K-means clustering method are combined in this algorithm by the way of searching pre-matches feature points, which are called the cluster point set, of the unknown model.
此算法首先结合RAC和K -均值聚类方法对未知模型的特征点进行预匹配，得到的匹配结果称为聚类点集。
Firstly, RAC and K-means clustering method are combined in this algorithm by the way of searching pre-matches feature points, which are called the cluster point set, of the unknown model.
应用推荐