Fast Access for Star Catalog Based on Locality-Sensitive Hashing
In order to improve the access speed and robustness of star catalog database during star identification, an algorithm based on locality-sensitive hashing is proposed. First, according to principle of star identification, the angle distances are quantified on the basis of angle distance error limit,...
| Format: | Article |
|---|---|
| Language: | zho |
| Published: |
EDP Sciences
2018-10-01
|
| Series: | Xibei Gongye Daxue Xuebao |
| Subjects: | |
| Online Access: | https://www.jnwpu.org/articles/jnwpu/pdf/2018/05/jnwpu2018365p988.pdf |
| _version_ | 1797423655544684544 |
|---|---|
| collection | DOAJ |
| description | In order to improve the access speed and robustness of star catalog database during star identification, an algorithm based on locality-sensitive hashing is proposed. First, according to principle of star identification, the angle distances are quantified on the basis of angle distance error limit, and the order star set pattern is transformed into an array of integers, which has locally sensitive hash characteristics. Then key of hash obtain by hashing the array of integers with Stlport, and the value of hashing is a set of central star number in the ordered star point set pattern. Numerical simulation results indicate that the time complexity of proposed algorithm is O(1), which is much better than direct search, binary search and k-vector search technology. In addition, the proposed algorithm is robustness due to the affect is not significant as the performance influenced by angle distance error limit. Considering practical application, the error limit of angle distance could be chose as 1 pixel, the number of quantified angle distances could be chosen as 3. Under this condition, the collision rate in hashing table is 0.74%, the average searching time is 1.007 4 and the average consuming time is 22 μs during star identification. |
| first_indexed | 2024-03-09T07:51:04Z |
| format | Article |
| id | doaj.art-c6f3ffb12e364d0f9384ec3a8d5b03e5 |
| institution | Directory Open Access Journal |
| issn | 1000-2758 2609-7125 |
| language | zho |
| last_indexed | 2024-03-09T07:51:04Z |
| publishDate | 2018-10-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | Xibei Gongye Daxue Xuebao |
| spelling | doaj.art-c6f3ffb12e364d0f9384ec3a8d5b03e52023-12-03T01:54:53ZzhoEDP SciencesXibei Gongye Daxue Xuebao1000-27582609-71252018-10-0136598899410.1051/jnwpu/2018365988jnwpu2018365p988Fast Access for Star Catalog Based on Locality-Sensitive Hashing012Department of Automation, Tsinghua UniversityDepartment of Automation, Tsinghua UniversityDepartment of Automation, Tsinghua UniversityIn order to improve the access speed and robustness of star catalog database during star identification, an algorithm based on locality-sensitive hashing is proposed. First, according to principle of star identification, the angle distances are quantified on the basis of angle distance error limit, and the order star set pattern is transformed into an array of integers, which has locally sensitive hash characteristics. Then key of hash obtain by hashing the array of integers with Stlport, and the value of hashing is a set of central star number in the ordered star point set pattern. Numerical simulation results indicate that the time complexity of proposed algorithm is O(1), which is much better than direct search, binary search and k-vector search technology. In addition, the proposed algorithm is robustness due to the affect is not significant as the performance influenced by angle distance error limit. Considering practical application, the error limit of angle distance could be chose as 1 pixel, the number of quantified angle distances could be chosen as 3. Under this condition, the collision rate in hashing table is 0.74%, the average searching time is 1.007 4 and the average consuming time is 22 μs during star identification.https://www.jnwpu.org/articles/jnwpu/pdf/2018/05/jnwpu2018365p988.pdfstar identificationordered star points setlocality-sensitive hashingquantized star angle distanceerror limit of angle distancedesign of experiments |
| spellingShingle | Fast Access for Star Catalog Based on Locality-Sensitive Hashing Xibei Gongye Daxue Xuebao star identification ordered star points set locality-sensitive hashing quantized star angle distance error limit of angle distance design of experiments |
| title | Fast Access for Star Catalog Based on Locality-Sensitive Hashing |
| title_full | Fast Access for Star Catalog Based on Locality-Sensitive Hashing |
| title_fullStr | Fast Access for Star Catalog Based on Locality-Sensitive Hashing |
| title_full_unstemmed | Fast Access for Star Catalog Based on Locality-Sensitive Hashing |
| title_short | Fast Access for Star Catalog Based on Locality-Sensitive Hashing |
| title_sort | fast access for star catalog based on locality sensitive hashing |
| topic | star identification ordered star points set locality-sensitive hashing quantized star angle distance error limit of angle distance design of experiments |
| url | https://www.jnwpu.org/articles/jnwpu/pdf/2018/05/jnwpu2018365p988.pdf |