1. Introduction In May 2003, Institute of Space and Science (ISAS) is launched asteroid explorer gHayabusah. The main purpose of the mission is sample return from the asteroid gItokawah. In November 2005 Hayabusa touched down the Itokawa twice. Its landing point was restricted by the safety of the spacecraft and the scientific requirement. Thus high accurate navigation and guidance were required. The decent phase was divided into two stages according to the altitude. When the altitude is less than 500m, called eFinal decent phasef, the spacecraft descended toward the target marker which was dropped at rehearsal decent. On the other hand, when the altitude is 500~3000m, target range of this study, new developed navigation software eGCP-NAVf was used [1]. GCP-NAV enabled high accurate position estimation of the spacecraft using the images which were taken at decent phase and geometrical model of Itokawa. The geometrical model was based on the observation at global mapping phase. The characteristic of GCP-NAV is that position estimation process is done by operators. Man can recognize landmarks on the image with robustness and accurately. For example, we can recognize the particular object even when light source is changed to some extent. GCP-NAV enabled high accurate navigation at decent phase. However there was problem of the delay caused by round trip time of radio wave between the earth and the asteroid, because the images for estimation need to be sent to the ground station. In the case of Hayabusa, the round trip time was approximately 30 minutes. Considering that decent speed of Hayabusa was 2~3m/s, in the worst case, it descended more than 100m during the round trip time. This delay problem becomes serious if the target celestial body is far from the Earth or the decent speed is fast. The way to solve the delay problem is to make the estimation process autonomously. In this paper, the outline of GCP-NAV is introduced in the section 2. The matching method is divided into two patterns according to the distance between the Hayabusa and the Itokawa. The autonomous algorithm for each pattern is proposed in the section 3 and 4. And in the section 5 the validity of the algorithm is tested by the computer simulation using actual data obtained at the decent phase. 2. GCP-NAV 2-1. Introduction of GCP-NAV GCP-NAV is the navigation tool using at the decent phase. It determines the Hayabusa position using images taken by Optical Navigation Wide Camera (ONC-W), the attitude date of Hayabusa, and the GCPs position data. The GCPs position data were determined by observation at global mapping phase. The matching method is divided into 2 patterns as follows: 1. Shape matching 2. Landmark matching Method 1 and 2 are selected according to the distance between the spacecraft and the asteroid. Shape matching is used at far point, and Landmark matching is at near point. 2-2. Coordinate systems The definitions of coordinates system are as follows, E Inertia coordinate system: J2000. The origin is the Sun. E HP coordinate system: axis is toward the Earth,z+x+axis is on the Itokawa-Earth-Sun plane and taken at the Sun side, andaxis is determined to complete right handed system. At the time of Hayabusa touchdowns, is almost corresponded with altitude direction. y+z+E ONC fixed coordinate system: ONC-W fixed coordinate. axis points out of screen. z+E HV coordinate system: 2 dimensional coordinate which shows the position on the image. 3. Shape matching 3-1. Outline GCPs are located almost uniformly on the Itokawafs surface. When the asteroid size on the image is small i.e. the distance between spacecraft and asteroid is large, rough shape of the asteroid is recognized from the location of GCPs as shown in Fig. 1. The position vector from estimated spacecraft position to each GCP is calculated, and translated into HV coordinate. In the shape matching, the criterion is whether the size and the position of the asteroid on the image correspond with calculated GCPsf location at HV coordinate. Fig.1 Shape matching 3-2. Selection of GCP This subsection described about how to select GCPs which are used in the matching. The total number of GCP is 74. However some of them cannot be observed from spacecraft according to the relative position and attitude between the spacecraft and the asteroid. The observable conditions are that GCP is at spacecraft side and sunny side as Fig shows. Those conditions are shown in following equations. (1) 0nipi>vvi (2) 0niSUN>vviWhere is a normal vector of th GCP, nivipiv is the vector form th GCP to spacecraft, and is the vector from the asteroid to the sun. If the shape of the target asteroid can be approximated the ellipsoidal body, the normal vector is calculated using position data as follows: iSUNv 222Tiiinxyzabc??=????v (3) Where are the radii of target asteroid. This selection algorithm is also used in the landmark matching described in the next section. ,,abc Fig.2 Selection of GCP 3-3. Algorithm The procedure of the shape matching consists of Sun lightSpacecraft (camera) Visible area Asteroid three steps. ‡@ Binarize acquired image. In this procedure the image is divided into two regions, asteroid region and the other (=space). The acquired image is binarized as follows: {0On the asteroid(,)1Out of asteroidHij= (4) Threshold gray level using at binarization is set as 20 (max gray level is 255). ‡A Calculate initial value for estimation. Initial valueis calculated using the position of centroid of asteroid on the image0ekr(,cc) HV, and estimated distance of previous step(1)ek?r. 0(1)cekekc?=rrrr (5) (6) ccpHpVf???=????r c ? whereis the focal length andis the pixel pitch of ONC. fp‡B Estimate spacecraft position. The criterion of estimation is smallness of the estimated distanceekr. Whenekrbecomes minimum on the condition that all GCPs are on the asteroid on the image, the estimated position is regarded as the most probable position. The position of GCP at HV coordinate is calculated using information of the relative position and attitude between spacecraft and asteroid. Supposed thatHVirshows the position of th GCP on the image when the spacecraft is at the estimated position. , the number of GCPs which are not on the asteroid in the image, is calculated as follows: ioutN (7) 1((0),(1)selectNoutHViHViiNH==‡”rr ) Where selectN is number of GCPs selected in section 3-2. 4. Landmark matching 4-1 Outline Shape matching is valid on condition that asteroid image size is smaller than whole image size. If a part of the asteroid runs out of the image area, the accuracy of the shape matching becomes worse. On the other hand, when the asteroid size on the image becomes large, landmarks on the asteroid surface become recognizable. Thus landmark matching is suitable at near point. In theory, minimum required number of GCP for the landmark matching is two. So the landmark matching is valid even when the asteroid runs out of image area. In the landmark matching, characteristic points are extracted from image, and compare with the GCPs position at HV coordinate. The criterion of this method is how many GCPs are at the extracted characteristic point. 4-2. Extraction method of landmark In this subsection, how to extract landmark from acquired image is described. In GCP-NAV, rocks on the asteroid surface were set as landmarks. Man detects landmarks on the image using the information of change in a gray level. So to extract landmarks we should examine the change of gray level. In general, to examine the change of gray level, differentiation of image, for example gradient or Laplacian, is used [2]. Supposed thatshows the gray level at element of the image. Horizontal gradient is shown as Eq. (8), and Laplacian is shown as Eq. (9). (,)fij(,)ij(,1)(,1)(,)2fijfijDij+??= (8) (,)(1,)(1,)(,1)(,14(,)Lijfijfijfijfijfij=++?+++?? ) (9) Gradient and Laplacian have property similar to high pass filter. They are sensitive to change of value. As the spacecraft descend, details of the surface become observable. As a result, landmark candidates are increased, when differentiation of the image is examined. On the other hand, the landmark size of landmark varies according to the distance. So we need to pick up landmark with arbitrary size. In the other word, we hope to pick up the point with arbitrary special frequency. Thus wavelet transform is adopted in this study. Wavelet transform is suitable to investigate frequency at arbitrary point in the signal along time or space [3]. The property and usage of the wavelet transform are described below. At first, basis function (wavelet function) is shown as follows, ,1()abxbxaaƒĠƒĠ??=??? ?? (10) Where()xƒĠis the function located near, and whose mean is 0. is parameter for dilation of 0x=a()xƒĠ, andis that for shift. In the next step, to examine the frequency at arbitrary point of signal, correlation betweenandb()fx()fx,()abxƒĠis calculated with changingand. Eq. (11) shows wavelet transform of. ab()fxevƒĈSun light 1(,)()xbWbafxdtaaƒĠ???=????çR (11) Where )ƒĠ(i is complex conjugate of ()ƒĠi. For the discrete signal,andchange discretely. There are many types of wavelet function. In this study, we use Harr type wavelet (Eq. (12)) as a wavelet function. ab (12) 1())1()bxabxabxbƒĠ??+?(=???+?