CN100342213C - Method for recognising star map based on triangle character - Google Patents

Method for recognising star map based on triangle character Download PDF

Info

Publication number
CN100342213C
CN100342213C CNB2004101025854A CN200410102585A CN100342213C CN 100342213 C CN100342213 C CN 100342213C CN B2004101025854 A CNB2004101025854 A CN B2004101025854A CN 200410102585 A CN200410102585 A CN 200410102585A CN 100342213 C CN100342213 C CN 100342213C
Authority
CN
China
Prior art keywords
star
triangle
observation
angular distance
coupling
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CNB2004101025854A
Other languages
Chinese (zh)
Other versions
CN1796938A (en
Inventor
张广军
魏新国
江洁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Beijing University of Aeronautics and Astronautics
Original Assignee
Beihang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CNB2004101025854A priority Critical patent/CN100342213C/en
Publication of CN1796938A publication Critical patent/CN1796938A/en
Application granted granted Critical
Publication of CN100342213C publication Critical patent/CN100342213C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Navigation (AREA)

Abstract

The present invention belongs to the spaceflight technical field, which relates to the improvement of a star map identifying method. The method of the present invention comprises the following steps: 1. making and storing star pair databank corresponding to angular distance; 2. selecting an observing triangle; 3. identifying the triangle; 4. verification. The present invention has the advantages of storing space saving, no accurate luminance information need, strong fault tolerance ability and quick searching and identifying speed.

Description

A kind of method for recognising star map based on triangle character
Technical field
The invention belongs to the spationautics field, relate to improvement method for recognising star map.
Background technology
Star sensor is a kind of high precision that extensively adopts in the current aerospacecraft, the attitude measurement parts of high reliability, its principle of work is: CCD (perhaps CMOS) imageing sensor is taken the starry sky image in the current field range, image is through signal Processing, extract position (and brightness) information of celestial body in the observation visual field, and in navigational star table, find the correspondence coupling of observation star by star Pattern Recognition Algorithm, utilize these coupling stars to calculating the three-axis attitude of star sensor at last.Star Pattern Recognition Algorithm is a core in the star sensor.In existing numerous star Pattern Recognition Algorithm, the triangle algorithm is the most general a kind of method for recognising star map of using from now on, it obtains extensive studies and the application of many reality is arranged, as the Oersted moonlet of Denmark, the miniature star tracker of DIGISTAR I of the U.S. etc.Triangle is to be recognition feature with three triangles that star is constituted, if observation trigonometric sum navigation triangle can mate, then must satisfy simultaneously
| d ( i , j ) - d m 12 | ≤ ϵ
| d ( j , k ) - d m 23 | ≤ ϵ
| d ( i , k ) - d m 13 | ≤ ϵ
As shown in Figure 1, d m 12, d m 23And d m 13Be respectively the angular distance of observation three sides of a triangle correspondence, d (i, j), d (j, k) and d (i k) is respectively the angular distance of three limit correspondences of navigational triangle.Liebe diabolo algorithm the earliest studies, and he stores the navigational triangle that nautical star can constitute for search matched.The triangle algorithm of its proposition is picked out 1000 stars and is made up the navigation triangle from 8000 nautical stars, required memory capacity still needs 1MByte, and the navigation triangle of being stored is 185000.The high energy of this recognition methods obtains 94.6% discrimination, and be 10s the averaging time of whole day identification.
Because all possible navigational triangle of storage, therefore traditional triangle algorithm generally needs bigger storage space, because too much navigational triangle comprises a large amount of redundant informations, makes that the recognition time of algorithm is long simultaneously, and discrimination is not high yet.People such as Quine and Heide proposes improved triangle algorithm respectively on the basis of Liebe triangle algorithm, its basic thought is roughly the same, and promptly utilizing monochrome information is that every star is determined a specific triangle.Adopt such method, every star is only used triangle of storage, thereby makes the capacity of navigational triangle database significantly reduce, and discrimination and recognition time also increase than traditional triangle algorithm.But because the accurate monochrome information of this method utilization needs the conversion between the apparent magnitude and the instrument magnitude.Because imaging system is often very limited to the resolving power of brightness, makes these methods be subjected to certain limitation in application.
Summary of the invention
The objective of the invention is: can bring memory capacity huge at all navigational triangles of direct storage, many and the Quine of redundant coupling and Heide select triangle like that to the requirement of monochrome information problem such as relative harshness again, diabolo algorithm of the present invention improves, a kind of method that adopts the storage star form of angular distance to be realized the triangle coupling is proposed, to significantly reduce memory capacity, simultaneously, accelerate recognition speed.
Technical scheme of the present invention is: a kind of method for recognising star map based on triangle character, it is characterized in that,
1.1, structure and the storage star corresponding with angular distance be to database, scanning screening navigational star table, if the angular distance that has two stars is less than d, then store this angular distance and the right sequence number of this star, d be the visual field to angular distance, when the visual field is 12 ° * 12 °, get d=12  °, store the right sequence number of the right angular distance of all stars and this star and constitute the star corresponding with angular moment to database, the right storage of star is arranged according to the big or small ascending order of angular distance;
1.2, select the observation triangle, from the observation star chart, pick out 6 the brightest stars, with any three stars wherein form the observation triangle to be selected that might form, if 6 of observation star number order less thaies, then utilize all observation stars to form observation triangle to be selected, then, from observation triangle to be selected, select an observation triangle, choose and observe leg-of-mutton principle be:
1. the preferential observation triangle of selecting the brightest star to constitute, establishing the brightness that constitutes leg-of-mutton three stars is M 1, M 2And M 3, brightness is weighed with the gray-scale value of asterism, definition M=M 1M 2M 3, the triangle that preferential selection has minimum M value;
2. preferentially select the less observation triangle of angular distance value, under the roughly suitable situation of M value, preferentially select the less triangle of angular distance value, promptly preferentially be chosen in the triangle of longest edge angular distance value minimum in three limits; According to above principle, observation triangle to be selected is sorted, the forward triangle that sorts will be used for discerning successively,, if discern correct result, the triangle that then comes the back will be skipped over; Otherwise, select remaining triangle in order successively and discern;
1.3, leg-of-mutton identification,
1.3.1, to seek the star that mates with leg-of-mutton three angular distances of observation right, establishes d m 12, d m 23And d m 13Be i.e. three angular distances of observation three sides of a triangle, find its coupling star right at star respectively in to database, establish d according to these three angular distances m 12, d m 23And d m 13Coupling star pair set be respectively C (d m 12), C ( m 23) and C (d m 13), its star that comprises is n (d to number m 12), n (d m 23) and n (d m 13);
1.3.2, carry out triangle coupling, the definition of triangle coupling is: it is right to seek three stars p 1 ∈ C ( d m 12 ) , p 2 ∈ C ( d m 23 ) , p 3 ∈ C ( d m 13 ) , And satisfy p 1, p 2And p 3End to end, promptly have between any two and a common star is only arranged, satisfy (the p of such condition 1, p 2, p 3) constitute and observe leg-of-mutton coupling triangle;
Searching method below adopting is sought qualified (p 1, p 2, p 3), its concrete steps are as follows:
1. scan C (d m 12), all stars in the set all are changed to I to the nautical star state that is comprised, and write down with this set in the sequence number j of right another star of each nautical star composition star;
2. scan C ( m 23), if this set culminant star has been changed to I to the state of the nautical star that comprised, then the status indication with this nautical star is changed to II, and writes down the sequence number k that forms another right nautical star of star with it;
3. scan C (d m 13), if ( j , k ) ∈ C ( d m 13 ) , Then find a coupling triangle, will with (j, k) state of forming right another nautical star i of star becomes III by II, (i, j k) be and navigational triangle that the observation triangle mates; Find out navigational triangle all and observation triangle coupling;
1.4, the checking, the navigational triangle with observation triangle coupling that utilization is found produces a width of cloth and is called simulation star chart with reference to star chart, compare with original observation star chart, if all can find corresponding observation star in the less radius of neighbourhood in the star chart in observation with reference to the star in the star chart, promptly think consistent with the observation star chart with reference to star chart, then identification is correct; Otherwise the navigational triangle of other couplings of checking that use the same method if reference star chart that generates and observation star chart are all inconsistent, is then observed the triangle recognition failures; Continuation is chosen the forward triangle of ordering and is repeated identical identifying from remaining observation triangle, till identification is correct.
Advantage of the present invention is: improved triangle algorithm proposed by the invention is compared its advantage with triangle algorithm in the past and is shown:
1. adopt the method for angular distance coupling to come the observation triangle is discerned, the form of angular distance storage can be saved a lot of storage spaces.
2. select brighter star and form the observation triangle, do not need accurate monochrome information.Select a plurality of observation triangles and discern, have stronger fault-tolerant ability.
3. utilize status indicator to carry out leg-of-mutton identification, have the speed of very fast search identification.
4. introduce the checking link, not only can verify the correctness of identification, screen the redundancy coupling, and mate star for star as much as possible in the observation star chart finds its correspondence.The checking link also provides rough attitude output, and is extremely important to identification and Tracking Recognition that initial attitude is arranged.
Description of drawings
Fig. 1 is general triangle recognition methods synoptic diagram.
Fig. 2 is a triangle identifying synoptic diagram of the present invention.
Fig. 3 is the nautical star that distributes on the celestial sphere and the corresponding synoptic diagram of the observation star in the visual field.
Fig. 4 is the main program flow chart of the inventive method.
Fig. 5 is the influence of asterism position noise to identification.
Fig. 6 is the influence of magnitude noise to identification.
Embodiment
Below the present invention is described in further details.
Generation that star is right and storage.
The present invention adopts the form of angular distance coupling to realize leg-of-mutton coupling, and the star of therefore necessary one of structure earlier and angular distance correspondence is to database.Do not consider the restriction of visual field, can to form N (N-1)/2 star right for N nautical star in theory, be much smaller than the leg-of-mutton number N (N-1) that may form (N-2)/6.The right generative process of star is as follows: scanning screening back navigational star table, if the angular distance that has two stars less than d, is then noted the sequence number of this angular distance and two stars (star to).Here, d be the visual field to angular distance, when the visual field is 12 ° * 12 °, get d=12  °.The right storage of star is arranged according to the big or small ascending order of angular distance.For convenience star is carried out match search to angular distance, all angular distances are divided into a lot of segments, the angular distance of each segment representative is spaced apart λ, stores 0.1 ° 〉=λ>0 then.Like this, calculate that the angular distance of two observation stars just can be very fast find may be right with the navigation star of its coupling.
Select the observation triangle.
Because the information that provides of the higher star of brightness ratio is reliable, arrived easilier by image capture sensor, therefore, the present invention preferentially selects the brightest star and forms the observation triangle in the observation star chart.Different with triangle algorithm in the past is that the present invention chooses a unique observation triangle to discern, but therefrom chooses one group of brighter star, forms an observation triangle arbitrarily and discerns.If should observe the triangle recognition failures, then recomposition another one observation triangle is discerned, up to obtaining correct being identified as.Therefore, this method only needs rough monochrome information, need not point-device monochrome information so that strict comparison is done in brightness.By experiment, from the observation star chart, pick out 6 the brightest stars in order to form the observation triangle.If 6 of observation star number order less thaies are then selected all observation stars.The leg-of-mutton number that 6 stars can be formed is C 6 3 = 20 。For 20 possible observation triangles, the principle of choosing is:
1. the preferential observation triangle of selecting the brightest star to constitute.If constituting the brightness of leg-of-mutton three stars is M 1, M 2And M 3(brightness is weighed with the gray-scale value of asterism), definition M=M 1M 2M 3, the triangle with minimum M value is preferred.
2. preferentially select the less observation triangle of angular distance value.The angular distance value is big more, and star is many more to number to the star of database respective bins, and the possibility of redundant coupling is also big more.Therefore, under the roughly suitable situation of M value, should preferentially select the less triangle of angular distance value.Here, the present invention adopts the principle of longest edge minimum, and promptly the triangle of longest edge angular distance value minimum is preferred in three limits.
According to above principle, will observe triangle sort.The forward triangle that sorts will be used for discerning successively, if discern correct result, the triangle that then comes the back will be skipped over.Otherwise, select remaining triangle in order successively and discern.
Leg-of-mutton identification.
If d m 12, d m 23And d m 13Be observation three sides of a triangle (angular distance), find its coupling star right at star respectively in to database according to these three angular distances.If d m 12, d m 23And d m 13Coupling star pair set be respectively C (d m 12), C (d m 23) and C (d m 13), its star that comprises is n (d to number m 12), n (d m 23) and n (d m 13).It is right that the process of triangle coupling is actually three stars of searching p 1 ∈ C ( d m 12 ) , p 2 ∈ C ( d m 23 ) , p 3 ∈ C ( d m 13 ) , And satisfy p 1, p 2And p 3End to end, promptly there is and only has a common star between any two.Satisfy (the p of such condition 1, p 2, p 3) can constitute the coupling triangle of observing triangle.
Generally speaking, adopt the method that travels through to carry out leg-of-mutton match search and need n (d m 12) * n (d m 23) * n (d m 13) inferior comparison operation, if the star that the coupling star pair set of every limit correspondence comprises is about 100 to number, then once coupling just needs 10 6Inferior comparison operation, such search need consume the considerable time.For fear of this situation, the present invention adopts a kind of searching method simply fast, and it seeks qualified (p by status indicator is set 1, p 2.p 3).As shown in Figure 2, its concrete steps are as follows:
1. scan C (d m 12), all stars in the set all are changed to I to the nautical star state that is comprised, and write down with this set in the sequence number j of right another star of each nautical star composition star;
2. scan C (d m 23), if this set culminant star has been changed to I to the state of the nautical star that comprised, then the status indication with this nautical star is changed to II, and writes down the sequence number k that forms another right nautical star of star with it;
3. scan C (d m 13), if ( j , k ) ∈ C ( d m 13 ) , Then find a coupling triangle, will with (j, k) state of forming right another nautical star i of star becomes III by II, (i, j k) be and navigational triangle that the observation triangle mates; Find out navigational triangle all and observation triangle coupling; Employing is provided with the method for status indicator, and searching times only is n (d m 12)+n (d m 23)+n ( m 13).
Checking.
By above identifying, the navigational triangle that the observation triangle can mate may be not unique, at this moment must rely on additive method and further screen.In order to realize this purpose, we introduce the checking link, and it has mainly acted on:
1. the correctness of checking identification filters out wrong coupling simultaneously.
2. find its coupling star, the precision that helps Tracking Recognition like this and improve Attitude Calculation for observation star as much as possible in the observation star chart.
3. can provide rough attitude information.
The basic thought of checking link is: if identification is correct, promptly navigational triangle is the leg-of-mutton correct coupling of observation, then utilize these couplings calculate attitude should be accurately.And then the star chart (being called with reference to star chart) of the width of cloth simulation that produces according to this attitude also should consistent with original observation star chart (position of asterism be corresponding consistent).Be illustrated in figure 3 as the nautical star that distributes on the celestial sphere and the corresponding synoptic diagram of the observation star in the visual field.Under the correct situation of identification, not only navigational triangle and the corresponding coupling of observation triangle, its separately other star of neighborhood also should be corresponding coupling.
If all can find corresponding observation star in the less radius of neighbourhood in the star chart in observation with reference to the star in the star chart, promptly think consistent with reference to star chart and observation star chart, then identification is correct, the algorithm end.Otherwise the navigational triangle of other couplings of checking that use the same method if reference star chart that generates and observation star chart are all inconsistent, is then observed the triangle recognition failures.Continuation is chosen the forward triangle of ordering and is repeated identical identifying from remaining observation triangle.Correctly do not discerned if there is the observation triangle, then the entire identification process failure is returned.The main flow chart of the inventive method as shown in Figure 4.From the observation star chart, select 6 the brightest stars earlier, form triangle, triangle is sorted, select the forward triangle of ordering successively and discern according to brightness principle and the minimum principle of longest edge with these 6 stars.Identifying is: three pairing angular distances in limit of first diabolo carry out the angular distance coupling, and the navigational triangle that can mate by the method search of status indicator is judged the correctness of identification and rejected wrong coupling with the checking link at last then.
Emulation experiment and performance evaluation.
In order to assess the performance of the inventive method, adopted the star chart of simulation to carry out emulation experiment.The parameters of emulation experiment is as shown in table 1.Angular distance λ=0.05 ° at interval in the experiment.Emulation experiment is mainly investigated the influence of identification with regard to asterism position noise and magnitude (brightness) noise.
The position noise of asterism is mainly derived from the error of asterism center segmented positioning method.In the experiment, the star map image for simulation generates adds Gaussian distributed on true asterism position, and average is 0, the noise that standard deviation from 0 to 2 pixel changes.Its recognition result as shown in Figure 5.Under the situation of noise level very little (σ<0.5), the discrimination of improved triangle algorithm nearly can reach 100%, and this discrimination of 94.6% than traditional triangle shape algorithm improves a lot.When σ=2 pixels, the discrimination of traditional triangle shape algorithm quickly falls to about 70%, still can reach about 97% and improve triangle algorithm identified rate.
The magnitude noise has reflected the sensitivity of imageing sensor to brightness.In the experiment, in the star image simulation process, magnitude is added that the average of Gaussian distributed is 0, standard deviation is from 0 to the 1Mv noise that changes, and is reflected in to be the noise of asterism gradation of image amplitude in the star chart.Equally, get 1000 width of cloth star charts from the whole day ball at random and discern statistics, Fig. 6 is a statistics.As can be seen from the figure, improved triangle algorithm has stronger robustness to the magnitude noise.Still can reach 93% discrimination when the magnitude noise standard deviation is 1Mv, during less than 0.5Mv, discrimination is near 100% at the magnitude noise standard deviation.The improvement algorithm of Quine and Heide is responsive to the magnitude noise ratio, and when magnitude noise during to certain level, discrimination decline is very fast.

Claims (2)

1, a kind of method for recognising star map based on triangle character is characterized in that,
1.1, structure and the storage star corresponding with angular distance be to database, scanning screening navigational star table, if the angular distance that has two stars is less than d, then store this angular distance and the right sequence number of this star, d be the visual field to angular distance, when the visual field is 12 ° * 12 °, get d=12  °, store the right sequence number of the right angular distance of all stars and this star and constitute the star corresponding with angular moment to database, the right storage of star is arranged according to the big or small ascending order of angular distance;
1.2, select the observation triangle, from the observation star chart, pick out 6 the brightest stars, with any three stars wherein form the observation triangle to be selected that might form, if 6 of observation star number order less thaies, then utilize all observation stars to form observation triangle to be selected, then, from observation triangle to be selected, select an observation triangle, choose and observe leg-of-mutton principle be:
1. the preferential observation triangle of selecting the brightest star to constitute, establishing the brightness that constitutes leg-of-mutton three stars is M 1, M 2And M 3, brightness is weighed with the gray-scale value of asterism, definition M=M 1M 2M 3, the triangle that preferential selection has minimum M value;
2. preferentially select the less observation triangle of angular distance value, under the roughly suitable situation of M value, preferentially select the less triangle of angular distance value, promptly preferentially be chosen in the triangle of longest edge angular distance value minimum in three limits; According to above principle, observation triangle to be selected is sorted, the forward triangle that sorts will be used for discerning successively, if discern correct result, the triangle that then comes the back will be skipped over; Otherwise, select remaining triangle in order successively and discern;
1.3, leg-of-mutton identification,
1.3.1, to seek the star that mates with leg-of-mutton three angular distances of observation right, establishes d m 12, d m 23And d m 13Be i.e. three angular distances of observation three sides of a triangle, find its coupling star right at star respectively in to database, establish d according to these three angular distances m 12, d m 23And d m 13Coupling star pair set be respectively C (d m 12), C (d m 23) and C (d m 13), its star that comprises is n (d to number m 12), n (d m 23) and n (d m 13);
1.3.2, carry out triangle coupling, the definition of triangle coupling is: it is right to seek three stars p 1 ∈ C ( d m 12 ) , p 2 ∈ C ( d m 23 ) , p 3 ∈ C ( d m 13 ) , And satisfy p 1, p 2And p 3End to end, promptly have between any two and a common star is only arranged, satisfy (the p of such condition 1, p 2, p 3) constitute and observe leg-of-mutton coupling triangle;
Searching method below adopting is sought qualified (p 1, p 2, p 3), its concrete steps are as follows:
1. scan C (d m 12), all stars in the set all are changed to I to the nautical star state that is comprised, and write down with this set in the sequence number j of right another star of each nautical star composition star;
2. scan C (d m 23), if this set culminant star has been changed to I to the state of the nautical star that comprised, then the status indication with this nautical star is changed to II, and writes down the sequence number k that forms another right nautical star of star with it;
3. scan C (d m 13), if ( j , k ) ∈ C ( d m 13 ) , Then find a coupling triangle, will with (j, k) state of forming right another nautical star i of star becomes III by II, (i, j k) be and navigational triangle that the observation triangle mates; Find out navigational triangle all and observation triangle coupling;
1.4, the checking, the navigational triangle with observation triangle coupling that utilization is found produces a width of cloth and is called simulation star chart with reference to star chart, compare with original observation star chart, if all can find corresponding observation star in the less radius of neighbourhood in the star chart in observation with reference to the star in the star chart, promptly think consistent with the observation star chart with reference to star chart, then identification is correct; Otherwise the navigational triangle of other couplings of checking that use the same method if reference star chart that generates and observation star chart are all inconsistent, is then observed the triangle recognition failures; Continuation is chosen the forward triangle of ordering and is repeated identical identifying from remaining observation triangle, till identification is correct.
2, method for recognising star map according to claim 1, it is characterized in that, at structure and the storage star corresponding during to database with angular distance, all angular distances are divided into a lot of segments, the angular distance of each segment representative is spaced apart λ, store then, the value of λ is relevant with the position noise level of asterism, generally gets 0.1 ° 〉=λ>0.
CNB2004101025854A 2004-12-28 2004-12-28 Method for recognising star map based on triangle character Expired - Fee Related CN100342213C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2004101025854A CN100342213C (en) 2004-12-28 2004-12-28 Method for recognising star map based on triangle character

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2004101025854A CN100342213C (en) 2004-12-28 2004-12-28 Method for recognising star map based on triangle character

Publications (2)

Publication Number Publication Date
CN1796938A CN1796938A (en) 2006-07-05
CN100342213C true CN100342213C (en) 2007-10-10

Family

ID=36818156

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2004101025854A Expired - Fee Related CN100342213C (en) 2004-12-28 2004-12-28 Method for recognising star map based on triangle character

Country Status (1)

Country Link
CN (1) CN100342213C (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102313549A (en) * 2011-07-28 2012-01-11 北京航空航天大学 Identification method for triangular star atlas based on characteristic of inertia ratio

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100390023C (en) * 2006-12-01 2008-05-28 北京航空航天大学 Quick method for recognizing star map
CN101363733A (en) * 2008-09-17 2009-02-11 北京航空航天大学 Ultra-high accuracy star sensor
CN102072730B (en) * 2010-11-04 2012-11-21 北京航空航天大学 Method for identifying triangular star map
CN103363987B (en) * 2013-06-26 2015-09-02 哈尔滨工业大学 The method for recognising star map of a kind of many visual fields star sensor
CN103335648B (en) * 2013-06-27 2015-11-11 北京航天自动控制研究所 A kind of autonomous method for recognising star map
CN103925922B (en) * 2013-08-05 2016-12-28 中国航天科工集团第三研究院第八三五八研究所 A kind of fixed star recognition methods being applicable to ICCD star chart under high dynamic condition
CN106123891B (en) * 2016-06-22 2018-11-16 中国人民解放军63680部队 Faint star autonomous classification method based on perimeter feature
CN106595702B (en) * 2016-09-22 2019-08-09 中国人民解放军装备学院 A kind of multisensor spatial registration method based on astronomy calibration
CN109405822B (en) * 2018-12-03 2022-06-24 北京遥感设备研究所 Star watch making and rapid angular moment matching method and device
CN113483751B (en) * 2021-06-29 2022-07-05 北京航空航天大学 Radial triangle mapping matrix-based star map identification method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61272612A (en) * 1985-05-29 1986-12-02 Hitachi Ltd Star identification system of star sensor
US6324475B1 (en) * 1997-02-13 2001-11-27 Centre National D'etudes Spatiales Method for identifying in a pre-established catalogue stars detected by a star sensor

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61272612A (en) * 1985-05-29 1986-12-02 Hitachi Ltd Star identification system of star sensor
US6324475B1 (en) * 1997-02-13 2001-11-27 Centre National D'etudes Spatiales Method for identifying in a pre-established catalogue stars detected by a star sensor

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于三角形几何结构的星图识别算法 郑胜,吴伟仁,田金文,柳健,田岩,光学技术,第30卷第1期 2004 *
一种改进的全天自主三角形星图识别算法 李立宏,林涛,宁永臣,张福恩,光学技术,第26卷第4期 2000 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102313549A (en) * 2011-07-28 2012-01-11 北京航空航天大学 Identification method for triangular star atlas based on characteristic of inertia ratio

Also Published As

Publication number Publication date
CN1796938A (en) 2006-07-05

Similar Documents

Publication Publication Date Title
CN110132263B (en) Star map identification method based on representation learning
CN100342213C (en) Method for recognising star map based on triangle character
CN112287931B (en) Scene text detection method and system
CN103295239B (en) A kind of autoegistration method of the laser point cloud data based on datum plane image
CN107480203A (en) It is a kind of to be directed to identical and similar pictures duplicate removal view data cleaning method
CN112633382B (en) Method and system for classifying few sample images based on mutual neighbor
US20200380653A1 (en) Image processing device and image processing method
CN1755706A (en) Image construction method, fingerprint image construction apparatus, and program
CN101441082A (en) Rapid triangle star map recognition method
CN111724335A (en) Detection method and detection system
CN114166211B (en) Double-view-field star sensor star map identification method
CN109284700B (en) Method, storage medium, device and system for detecting multiple faces in image
US20230401691A1 (en) Image defect detection method, electronic device and readable storage medium
CN1130077C (en) Motion compensation device and method matched by gradient mode
CN1958394A (en) Quick method for recognizing star map
CN112488043A (en) Unmanned aerial vehicle target detection method based on edge intelligence
CN115565044A (en) Target detection method and system
CN107907126A (en) A kind of method for recognising star map based on triangle map, apparatus and system
CN116778346B (en) Pipeline identification method and system based on improved self-attention mechanism
CN113792686A (en) Vehicle weight identification method based on cross-sensor invariance of visual representation
CN104964684A (en) High-dynamic rapid star tracking method
CN114998397B (en) Multi-view satellite image stereopair optimization selection method
CN117274754A (en) Gradient homogenization point cloud multi-task fusion method
CN109697693B (en) Method for realizing operation based on big data space
CN116343056A (en) Low-resolution star map target identification method based on cyclic matching

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20071010

Termination date: 20111228