Polygon star identification based on ant colony algorithm

Baolin Ma; Jie Wu; Hongbo Zhang

doi:10.1117/12.2072394

24 November 2014 Polygon star identification based on ant colony algorithm

Baolin Ma, Jie Wu, Hongbo Zhang

Proceedings Volume 9301, International Symposium on Optoelectronic Technology and Application 2014: Image Processing and Pattern Recognition; 93011V (2014) https://doi.org/10.1117/12.2072394
Event: International Symposium on Optoelectronic Technology and Application 2014, 2014, Beijing, China

Abstract

In order to enhance the rate of star identification under different view fields and reduce memory storage, this paper presents a polygon star identification based on ACO algorithm .First, fast cluster analysis. Second, calculate argument for each guide star, using the advantages of ACO in fast path optimization to complete building feature polygon. Third, comparing optimization results and optimization data of guide database to realize match and identifying. Through the simulation shows that the above method can simplify searching process and structure of storage. It can promise the completeness of characteristic patterns of star image. The robustness and reliability are better than traditional triangle identification.

Citation Download Citation

Baolin Ma, Jie Wu, and Hongbo Zhang "Polygon star identification based on ant colony algorithm", Proc. SPIE 9301, International Symposium on Optoelectronic Technology and Application 2014: Image Processing and Pattern Recognition, 93011V (24 November 2014); https://doi.org/10.1117/12.2072394

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available