[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2005, Vol. 31 Issue (03) :311-315    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
����Delaunay�����ʷֵ�ȫ��������ͼʶ���㷨
������1, ȫΰ2, ��С��2*
1. �������պ����ѧ ������ѧ���繤��ѧԺ, ���� 100083;
2. �й����ʴ�ѧ ������������Ϣ����ѧԺ, ���� 100083
All-sky autonomous star map identification algorithm based on Delaunay triangulation cutting algorithm
Fang Jiancheng1, Quan Wei2, Meng Xiaohong2*
1. School of Instrument Science and Opto-electronics Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083, China;
2. School of Physical Geography and Information Technology, China University of Geosciences, Beijing 100083, China

ժҪ
�����
�������
Download: PDF (128KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �ڵ�������ģ��,Delaunay�����ʷ�����Ը����㼯���������ʷ־����ʷֽ��Ψһ����һ��Ҫ�ص���õ��㷺Ӧ��.����Delaunay �ʷ���һ����,�״ν�Delaunay�ʷ��㷨Ӧ�õ���ͼʶ����.����ȫ������ͼ���ʷֲ�����,�����н������ʷֵı߽�ݹ鷨,��������������С���걸�����ǿ�;���ö�άDelaunay�����ʷֶ��ӳ��ں�����ͼ�����ʷ�,���������п���ƥ��ʶ��.����ʵ�������������е���ͼʶ���㷨���,���㷨���иߵ�ʶ����,���õ�ʵʱ�Ժ�³����,�����赼���ǿ������С,�����ٶȿ�.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� Delaunay�����ʷ�   ��ͼʶ��   �����ǿ�     
Abstract�� In the field of geophysical model building,Delaunay triangulation cutting algorithm has been widely used because of having a very important characteristic which is the result of this triangulation cutting method being unique in a specifically set of points.This character was adopted, the algorithm to identify star map for the first time was used.Making use of the invariability of cutting in all-sky star atlas and adopting the boundary recursive method for constrained triangulation of surfaces,the guidance stars database which was arranged under specific rules and whose size was comparatively small was constructed;the recognition algorithm utilized the result generated by Delaunay cutting star map in a specified field of view to match and identify quickly.The simulation results show that compared with the current star map identification algorithms,this algorithm has a high rate of discrimination,the advantages of real-time properties and robust;and it only needs a small content database and searches more rapidly.
Keywords�� Delaunay triangulation   star map identification   database of guide star     
Received 2003-09-03;
Fund:

������Ȼ��ѧ����������Ŀ(60174031);���ú���Ԥ��������Ŀ;����863�ƻ�������Ŀ(2002AA713031)

About author: ������(1965-),��,ɽ��������,����, qw-quanwei@sina.com.
���ñ���:   
������, ȫΰ, ��С��.����Delaunay�����ʷֵ�ȫ��������ͼʶ���㷨[J]  �������պ����ѧѧ��, 2005,V31(03): 311-315
Fang Jiancheng, Quan Wei, Meng Xiaohong.All-sky autonomous star map identification algorithm based on Delaunay triangulation cutting algorithm[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2005,V31(03): 311-315
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2005/V31/I03/311
Copyright 2010 by �������պ����ѧѧ��