摘要
本文把星表匹配问题转化成计算机视觉中的对应点匹配问题,接着使用二维Delaunay三角化方法对星表进行三角化,然后用RANSAC方法对星表的自动匹配问题进行了研究。研究结果表明,我们的方法能够快速有效地完成星表匹配。在总共960个样本中,除了两幅不符合匹配的星表之外,全部获得了正确的匹配结果。
This paper introduces an automatic star-atlas matching technique based on RANSAC (Random Sample Consensus), which has been widely and successfully used for corresponding problems in computer vision field. A 21) Delaunay triangulation was used at first to triangulate star atlas, then a standard RANSAC technique was employed to determine the 4 matching parameters. The experiments on a data set of 960 showed that our proposed technique can find all correct matching pairs except for two of them that are unmatchable, with high computational efficiency.
出处
《光谱学与光谱分析》
SCIE
EI
CAS
CSCD
北大核心
2003年第5期1024-1027,共4页
Spectroscopy and Spectral Analysis
基金
国家自然科学基金(No.60202013)
863计划(No.2001AA133010)
中科院自动化所创新基金资助