We present a star catalog extracted from the Lunar-based Ultraviolet Telescope （LUT） survey program. LUT＇s observable sky area is a circular belt around the Moon＇s north pole, and the survey program covers a prefe...We present a star catalog extracted from the Lunar-based Ultraviolet Telescope （LUT） survey program. LUT＇s observable sky area is a circular belt around the Moon＇s north pole, and the survey program covers a preferred area of about 2400 deg2 which includes a region of the Galactic plane. The data are processed with an automatic pipeline which copes with stray light contamination, artificial sources, cosmic rays, flat field calibration, photometry and so on. In the first release version, the catalog provides high confidence sources which have been cross-identified with the Tycho-2 catalog. All the sources have signalto-noise ratio larger than 5, and the corresponding magnitude limit is typically 14.4 mag, but can be as deep as -16 mag if stray light contamination is at the lowest level. A total of 86 467 stars are recorded in the catalog. The full catalog in electronic form is available online.展开更多
The usage of a subset of observed stars in a CCD image to find their corresponding matched stars in a stellar catalog is an important issue in astronomical research. Subgraph isomorphic-based algorithms are the most w...The usage of a subset of observed stars in a CCD image to find their corresponding matched stars in a stellar catalog is an important issue in astronomical research. Subgraph isomorphic-based algorithms are the most widely used methods in star catalog matching. When more subgraph features are provided, the CCD images are recognized better. However, when the navigation feature database is large, the method requires more time to match the observing model. To solve this problem, this study investigates further and improves subgraph isomorphic matching algorithms. We present an algorithm based on a locality-sensitive hashing technique, which allocates quadrilateral models in the navigation feature database into different hash buckets and reduces the search range to the bucket in which the observed quadrilateral model is located. Experimental results indicate the effectivity of our method.展开更多
基金supported by the Key Research Program of Chinese Academy of Sciences (KGED-EW-603)the National Basic Research Program of China (973-program, Grant No. 2014CB845800)the National Natural Science Foundation of China (Grant Nos. 11203033, 11473036, U1231115 and U1431108)
文摘We present a star catalog extracted from the Lunar-based Ultraviolet Telescope （LUT） survey program. LUT＇s observable sky area is a circular belt around the Moon＇s north pole, and the survey program covers a preferred area of about 2400 deg2 which includes a region of the Galactic plane. The data are processed with an automatic pipeline which copes with stray light contamination, artificial sources, cosmic rays, flat field calibration, photometry and so on. In the first release version, the catalog provides high confidence sources which have been cross-identified with the Tycho-2 catalog. All the sources have signalto-noise ratio larger than 5, and the corresponding magnitude limit is typically 14.4 mag, but can be as deep as -16 mag if stray light contamination is at the lowest level. A total of 86 467 stars are recorded in the catalog. The full catalog in electronic form is available online.
基金supported by the National Natural Science Foundation of China(U1431227)Guangzhou Science and Technology Planning Project(201604010037)
文摘The usage of a subset of observed stars in a CCD image to find their corresponding matched stars in a stellar catalog is an important issue in astronomical research. Subgraph isomorphic-based algorithms are the most widely used methods in star catalog matching. When more subgraph features are provided, the CCD images are recognized better. However, when the navigation feature database is large, the method requires more time to match the observing model. To solve this problem, this study investigates further and improves subgraph isomorphic matching algorithms. We present an algorithm based on a locality-sensitive hashing technique, which allocates quadrilateral models in the navigation feature database into different hash buckets and reduces the search range to the bucket in which the observed quadrilateral model is located. Experimental results indicate the effectivity of our method.
