Crater Triangle Matching Algorithm Based on Fused Geometric and Regional Features

Abstract

Craters are regarded as significant navigation landmarks during the descent and landing process in small body exploration missions for their universality. Recognizing and matching craters is a crucial prerequisite for visual and LIDAR-based navigation tasks. Compared to traditional algorithms, deep learning-based crater detection algorithms can achieve a higher recognition rate. However, matching crater detection results under various image transformations still poses challenges. To address the problem, a composite feature-matching algorithm that combines geometric descriptors and region descriptors (extracting normalized region pixel gradient features as feature vectors) is proposed. First, the geometric configuration map is constructed based on the crater detection results. Then, geometric descriptors and region descriptors are established within each feature primitive of the map. Subsequently, taking the salience of geometric features into consideration, composite feature descriptors with scale, rotation, and illumination invariance are generated through fusion geometric and region descriptors. Finally, descriptor matching is accomplished by computing the relative distances between descriptors and adhering to the nearest neighbor principle. Experimental results show that the composite feature descriptor proposed in this paper has better matching performance than only using shape descriptors or region descriptors, and can achieve a more than 90% correct matching rate, which can provide technical support for the small body visual navigation task.

1. Introduction

Exploring small bodies contributes to understanding the formation and evolution of the universe for human beings and researching the origin of life [1]. In the past decade, many countries have conducted a series of exploration missions targeting small bodies, such as the United States’ OSIRIS-REx and Lucy’s mission [2,3,4], the European Space Agency’s Rosetta mission [5], and Japan’s Hayabusa2 mission [6]. Craters have played an important role in different extraterrestrial body exploration navigation missions in recent asteroid missions [7,8,9]. In small body exploration missions, craters often serve as navigation landmarks for their wide distribution and remarkable terrain features. However, detecting and recognizing craters from navigation images obtained during the descent and landing process are influenced by variations in scale, illumination, and other factors. As a result, the effectiveness of crater detection and recognition is diminished, consequently affecting the accuracy of image matching [10,11].

Deep learning-based crater detection methods extract deep-level crater features to achieve crater detection, resulting in a higher recognition rate compared to traditional image processing algorithms [12,13]. Wang et al. proposed a deep learning network called CraterIDNet for the detection and recognition of craters by integrating the CNN network framework. They enhanced the recognition rate of craters by optimizing anchor box scales and adjusting the density in the crater detection pipeline [14]. Chen et al. designed a single-stage crater detection network called DPCDN, which uses CReLU modules to reduce the number of parameters and improve the speed of crater detection [15]. Tewari et al. leveraged the Mask R-CNN framework to detect craters from optical images, the digital elevation model, and the slope model, aiming at eliminating duplicate craters and extracting their positions [16]. Delatte and Silburt et al. employed an enhanced U-Net model to segment and extract craters on Mars and Mercury, thereby achieving crater detection [17,18]. Wang et al. designed ERU-Net, which enhances the capability of crater feature extraction by incorporating deep residual network modules [19]. Yang et al. proposed an end-to-end high-resolution feature pyramid network (HRFPNet), which uses feature aggregation modules to enhance the feature extraction capability of small- to medium-sized craters [20]. The deep learning-based methods for crater detection learn various deep features of the small body terrain from existing crater image data and achieve crater recognition in different illumination and viewing conditions, demonstrating high accuracy and robustness [21,22].

It is necessary to further achieve the matching of crater recognition results to provide navigation guidance for visual navigation. Composite matching algorithms are an important direction in the current research on image matching. By integrating multiple features and strategies in the matching process, the accuracy and robustness of matching can be improved. Compared to methods that rely solely on image features, incorporating geometric information constraints can reduce the interference of factors such as illumination changes on the matching results. Lu et al. proposed a crater matching algorithm that matches detected craters with an crater database based on the geometric similarity of crater triangles [23]. Park et al. approached crater matching from the perspective of geometric configuration, proposing an algorithm that improves matching accuracy as the number of craters increases [24]. Alfredo et al. achieved the matching of crater triangles by using the ratio of interior angles to the radius of craters and the distance between their centroids [25]. Doppenberg et al., in their matching process, used the invariant order of triangular craters and established feature descriptors for the matching of craters [26]. All of the above algorithms need to fit the crater geometric information. However, under different states and complex small body terrain conditions, the recognized craters form the captured images with scale, rotation and illumination variations. These factors significantly impact the accuracy of crater rim fitting. Therefore, it is necessary to combine the geometric features and regional pixel gradient features extracted within generated crater triangle to further improve the accuracy and robustness of the matching algorithm.

To achieve accurate matching of real small body crater images, deep learning results for crater detection can be integrated with geometric information constraints to match the crater images. In this paper, we propose a composite feature matching method. During the landing process of the detector, a deep learning-based method is used to detect craters. Based on the recognition results, a geometric configuration map is constructed, and feature primitives are designed. After that, support regions are selected to construct geometric descriptors and region descriptors. The salience of geometric features is quantified, and all descriptors are weighted and fused to generate composite feature descriptors. Finally, the generated descriptors are matched by calculating their relative distances based on the nearest neighbor principle. Experimental verification explores the matching effect of composite feature descriptors under scale, illumination and rotation transformations.

This paper is organized as follows: Section 2 describes the process of constructing geometric configuration map. In Section 3, we introduce the process of composite feature descriptors description and matching. Section 4 shows the matching results and discussion. Finally, the paper ends with conclusions in Section 5.

2. Construction of the Geometric Configuration Feature Map

In this section, we will introduce a deep learning-based algorithm to detect craters, then the geometric configuration feature map is constructed by the process of the Delaunay triangulation algorithm.

2.1. Crater Detection Based on Deep Learning Method

Deep learning methods possess strong capabilities in extracting deep features from data, presenting significant advantages over traditional algorithms in extracting crater features. In the process of visual navigation tasks for target recognition and obstacle avoidance, the Yolov7 network [27] is used for crater detection. Various data augmentation techniques, including known environmental morphology feature images and navigation images captured during flyby and hover segments, combined with perspective transformation, are employed to construct a benchmark dataset of surface terrain features for small body crater detection. The recognition results of the deep learning-based small body crater detection algorithm for Vesta and Eros are shown in Figure 1, with a detection rate of 85.42%, and a single-frame detection time of 10 ms.

2.2. Delaunay Triangulation

To acquire the geometric features of craters, the Delaunay triangulation algorithm is initially employed to handle the crater detection results. The process of Delaunay triangulation involves partitioning the deep learning crater recognition results into triangular meshes, using a set of central points extracted from crater locations [28]. The algorithmic flow is illustrated in Figure 2.

In the planar crater set shown in Figure 3a, an initial polygon surrounding all crater centroids is obtained, and an initial triangular mesh is established. Then, the remaining points are individually inserted, and optimization is performed using the empty circumcircle algorithm (no other nodes are included inside the circumcircle of any triangle) to generate a Delaunay triangulation. As shown in Figure 3b, detected crater set $\mathrm{P}=\left\{p_1,\cdots ,p_n\right\}$ is transformed into triangle set $\mathrm{T}=\left\{t_1,,t_n\cdots \right\}$, where $p_i$ is the centroid of the $i_{th}$ detected crater.

3. Descriptor Construction and Matching

In this section, we will introduce the process of establishing geometric descriptors and region descriptors. Taking the salience of geometric features into consideration, composite feature descriptors are later generated with fused weight values. Based on the nearest neighbor principle, the matching results are obtained.

3.1. Geometric Descriptor Construction

Figure 4 shows a schematic diagram of constructing triangular feature primitive based on crater detection results.

In the set of triangles T, the feature primitive corresponding to the $k_{th}$ triangular unit $O_1{O}_2{O}_3$ is composed of three craters $C_i$ with centers at $O_i(i=1,2,3)$ and radii $r_i(i=1,2,3)$ forming triangles with the crater centers as vertices.

The vertices $O1$, $O2$, and $O3$ correspond to three edges, respectively, as a, b, and c, satisfying $a\ge b\ge c$. Geometric descriptors are established using the ratios $r1$, $r2$, $r3$, b, and c with respect to a. Geometric descriptors are represented by $S_D=[{\delta }_1,{\delta }_2,{\delta }_3,{\delta }_4,{\delta }_5]$:

$${\delta }_1=\frac{r_1}{a},{\delta }_2=\frac{r_2}{a},{\delta }_3=\frac{r_3}{a},{\delta }_4=\frac{b}{a},{\delta }_5=\frac{c}{a}$$

(1)

The crater triangles to be matched in the captured small body scene image are similar to the corresponding matching crater triangles in the database, and the corresponding matching crater radii are proportional. Introducing crater radius constraints into the geometric descriptors, each parameter is normalized to ensure scale invariance of the geometric descriptors. Rotational invariance is achieved by arranging the vectors of shape descriptors in the order of the three craters’ sizes, the second longest side of the triangle, and the shortest side of the triangle.

3.2. Region Descriptor Construction

Based on the geometric descriptors constructed for each feature primitive in Section 3.1, in order to avoid mismatch of descriptors formed by triangular feature primitives with poor geometric significance (i.e., triangles obtained by triangulation converge to equilateral triangles, and crater radius differences are small), we introduce the region descriptor that uses pixel gradient features in the support region to eliminate triangular feature primitives with similar shape descriptors, which is unlike traditional feature matching methods, where regional pixel gradient features play a dominant role.

(1) Construction of support region

To address the problem of image scale variation, images are downsampled and undergo Gaussian blur processing as illustrated in Figure 5. The downsampling factor is $\sqrt{2}$ as a way to ensure continuity in space. The input image size is related to the number of Gaussian pyramid layers $octave$:

$$octave=\frac{lg\left(min\right(width,height\left)\right)}{lg2}-2$$

(2)

and $width$ and $height$ are the size of the original image, respectively. The function $min\left(\right)$ is to select the minimum value of the width and height of the original image.

By simulating multi-scale features of the images, descriptors are generated for each image in the pyramid. Within the coverage area of the feature primitive, the inscribed circle of triangle $\Delta O_1{O}_2{O}_3$ is selected as the supporting region for the region descriptor. We will make the selection in the following Section 4.1.

(2) Computing gradient histograms and acquiring dominant direction.

The gradient magnitude $m(x,y)$ and direction $\alpha (x,y)$ of pixel $(x,y)$ within the supporting region G is precomputed using pixel differences:

$$G_x=\left[\begin{array}{ccc}-1& 0& 1\\ -2& 0& 2\\ -1& 0& 1\end{array}\right]\ast I_{x,y},G_y=\left[\begin{array}{ccc}-1& -2& -1\\ 0& 0& 0\\ 1& 2& 1\end{array}\right]\ast I_{x,y}$$

(3)

$$m_{x,y}=\sqrt{G_x^2+G_y^2},{\alpha }_{x,y}=arctan\left(\frac{G_y}{G_x}\right)$$

(4)

where $I_{x,y}$ means the pixel value in $(x,y)$ of the image.

The pixels within the supporting region are divided into eight sectors based on their gradient direction $\alpha (x,y)$. According to the divided gradient directions, the gradient magnitudes of the pixels within each sector are summed up, and then the gradient histogram is generated. The peak of the gradient histogram represents the dominant gradient direction of the pixels within the supporting region. Traversing all sectors counterclockwise, the sum of the gradient magnitudes within the $t_{th}$ direction sector can be expressed as:

$$M_t=\sum _{\alpha (x,y)\in i}^{n}m(x,y),i\in [1,2,\cdots ,8]$$

(5)

(3) Traversing the gradient histogram to construct the feature descriptor vector.

Starting from the dominant direction, traverse the sectors in sequence and use $M_t$ to construct the feature descriptor vector $I={[M_t,\cdots ,M_8,M_1,\cdots ,M_{t-1}]}^T$, thereby maintaining the rotational invariance of the region descriptor. The $t_{th}$ sector is the one where the dominant direction lies as illustrated in Figure 6 and Figure 7.

(4) Establishing normalized region descriptors.

The obtained feature descriptor vectors $M_t$ in Equation (2) are normalized to ${\tilde{M}}_t$ to ensure scale invariance, resulting in the final generation of region descriptors $B_D$:

$$B_D=\left[\begin{array}{c}{\tilde{M}}_t\\ ⋮\\ {\tilde{M}}_n\\ {\tilde{M}}_1\\ ⋮\\ {\tilde{M}}_{t-1}\end{array}\right]=\left[\begin{array}{c}\frac{M_t-M_{min}}{M_{max}-M_{min}}\\ ⋮\\ \frac{M_n-M_{min}}{M_{max}-M_{min}}\\ \frac{M_1-M_{min}}{M_{max}-M_{min}}\\ ⋮\\ \frac{M_{t-1}-M_{min}}{M_{max}-M_{min}}\end{array}\right]$$

(6)

3.3. Generating Composite Descriptor

To allocate weights for geometric descriptors and region descriptors in composite feature descriptors, geometric descriptor weight vectors $w_s(x_T,x_C)$ and region descriptor weight vectors $w_B(x_T,x_C)$ are introduced, where $x_T$ is a set containing the lengths of the three sides of the triangle, $x_C$ is a set containing the values of the radii of three craters, and the sum of the two weights equals 1:

$$w_s(x_T,x_C)+w_B(x_T,x_C)=1$$

(7)

Define geometric feature similarity function $G_S(x_T,x_C)$ and geometric feature saliency quantification function $Q_S(x_T,x_C)$:

$$G_S(x_T,x_C)=\frac{\frac{1}{3}{\displaystyle \sum _{i=1}^3}{x}_{Ti}}{max\left(x_T\right)}+\frac{\frac{1}{3}{\displaystyle \sum _{i=1}^3}{x}_{Cj}}{max\left(x_C\right)}$$

(8)

$$Q_S(x_T,x_C)=l{n}^{G_S(x_T,x_C)}$$

(9)

where $Q_S(x_T,x_C)$ controls the sensitivity to geometric feature similarity. The obtained result is used to assign values to the geometric descriptor weight vector after it has been normalized:

$$w_s(x_T,x_C)\frac{Q_S(x_T,x_C)-Q_{Smin}}{Q_{Smax}-Q_{Smin}}$$

(10)

Finally, by weightedly fusing the geometric descriptor and region descriptor, we obtained the composite feature descriptor:

$$D=\left[\begin{array}{c}{w}_S(x_T,x_C)·S_D\\ w_B(x_T,x_C)·B_D\end{array}\right]$$

(11)

3.4. Descriptor Matching

To evaluate the matching performance of crater matching, the correct matching rate is defined as the ratio of the number of correct matches to the total number of matches. The nearest neighbor criterion is an effective standard for feature matching. When performing descriptor matching, the matching effectiveness is evaluated by computing the distance between two descriptor vectors. When matching descriptor $D_1$, if the best matching option is $D_2$, then the condition for determining a successful match is:

$$1-\frac{\parallel D_1-D_2\parallel }{\parallel D_1\parallel }>\gamma$$

(12)

where $\gamma$ represents the Euclidean distance threshold of the relative distance between descriptors.

4. Experiments and Results

During the descent and landing process, the captured navigation image will undergo scale, rotation and illumination transformations, so the algorithm is validated in three cases, respectively. The real small body images are obtained from NASA’s official website [29,30] with different image quality: 62 m, 410 m and 0.5 m per pixel. They are used for the experiments on the algorithm proposed in this paper. The images in Figure 8 are the results of crater detection. The images in Figure 9 are the results of constructing a geometric configuration feature map by detecting craters.

4.1. Parameter Selection

To examine the influence of different support region selections and relative distance threshold $\gamma$ between descriptors on the matching results, relevant parameter selection experiments were conducted. The experiments were performed using the aforementioned images of Ceres under transformations with scale of 0.8, illumination intensity of 0.8, and rotation of 180°, and the matching results are generated.

To address the problem of support region selection mentioned in Section 3.2, we conducted tests on the circumscribed circle, triangle, and inscribed circle support regions, respectively, as is shown in Figure 10. Using the circumcircle, triangle, and incircle regions respectively resulted in average consumption times of 529.8 ms, 73.2 ms, and 12.5 ms, with corresponding average correct matching rates of 96.5%, 97.9%, and 97.8% as is shown in Figure 11. Considering the matching performance and consumption time, we chose to use the incircle as the support region.

In response to the problem of threshold selection in Section 3.4, we examined the influence of different $\gamma$ values on the correct matching rate through experiments. The smaller the $\gamma$ value, the greater the amount of feature matching pairs obtained, but the probability of mismatching is also greater, meaning the matching accuracy will decrease. Therefore, choosing different $\gamma$ values will result in different matching results. We set the Euclidean distance threshold $\gamma$ to vary from 0.05 to 0.95, totaling 19 simulations. It can be observed in Figure 12 that when the $\gamma$ value exceeds 0.8, the correct matching rate no longer increases. Therefore, we selected 0.8 as the descriptor Euclidean distance threshold.

4.2. Ablation Study

Then, on the basis of the obtained geometric configuration feature map results, we respectively verified the matching performance of geometric descriptors and region descriptors under scale, rotation, and illumination transformations as illustrated in Figure 13 and Figure 14, where (a) shows the scale transformation matching result, (b) shows the illumination matching result, and (c) shows the rotation transformation matching result.

As shown in Figure 13 and

Table 1. Geometric descriptor matching results.

Transformation	Scale	Rotation	Illumination
Correct matching rate/%	95.8	41.2	67.1

, when only using geometric descriptors for matching, the correct matching rate under rotation and illumination transformations is notably diminished. This result arises from significant disparities in the detected positions of craters between images under rotation and illumination transformation compared to the original image, as well as missed detections. Consequently, the geometric configuration features generated under such conditions exhibit considerable noise, thereby diminishing the matching rate.

As shown in Figure 14 and

Table 2. Region descriptor matching results.

Transformation	Scale	Rotation	Illumination
Correct matching rate/%	96.5	86.3	91.2

, when using only region descriptors for matching, the correct matching rate is reduced due to the distortion of regional pixel features caused by illumination and rotation variations on the calculation of gradients within each region.

We comprehensively verify the matching performance of composite descriptors under scale, rotation, and illumination crater images, with crater images of Ceres and Vesta as illustrated in Figure 15, Figure 16 and Figure 17. Figure 15 shows the matching results under transformations with scales of 0.8, 0.65 and 0.5. Figure 16 shows the matching results under transformations with illumination intensities of 0.8, 0.9 and 1.2. Figure 17 shows the matching results under transformations with rotation angles of 180°, 90° and 5°.

As shown in Figure 15, Figure 16 and Figure 17 and

Table 3. Average composite descriptor matching results.

Transformation	Scale	Rotation	Illumination
Correct matching rate/%	100	98.9	94.2

, compared to only using geometric descriptors and region descriptors separately, using the fused composite feature descriptors can simultaneously increase the number of matches and the accuracy of matches, and the invariance of feature descriptors to illumination and rotation variations is enhanced. It achieves a 100% correct matching rate under scale transformation, a 98.9% correct matching rate under brightness variation, and a 94.2% correct matching rate under rotation transformation. Therefore, the proposed method meets the navigation task requirements during the landing descent process.

5. Conclusions

This paper proposes a composite feature matching algorithm for craters that fuses geometric descriptors and region descriptors, which mainly includes crater recognition, composite feature descriptor construction and descriptor matching. Based on the results of crater detection using deep learning, a geometric configuration feature map is constructed. In each feature primitive, a composite feature descriptor is obtained by fusing geometric descriptors and region descriptors. Compared with the traditional descriptor algorithm, this proposed algorithm integrates regional pixel gradient features and geometric feature constraints. Experimental results show that the proposed algorithm can achieve more than a 90% correct matching rate.

However, there are certain limitations associated with the algorithm. The proposed algorithm for crater matching is not invariant under affine transformations, perspective transformations, and more complex transformations. Therefore, we will take further measures to incorporate viewpoint invariance into this feature descriptor, which will also be a key focus of future work. In this paper, the deep learning-based crater detection method is independent of the crater matching algorithm. Although crater detection algorithms based on deep learning achieve a high recognition rate, the instability of the crater detection results due to the lighting and view changes of the crater detection results leads to considerable disturbances in the established geometric configurations.

In the future, we will try to establish more robust geometric constraints with projective invariance (a property that remains unchanged under projective transformations so that the descriptors can stay invariant despite changes in viewing angles) to enhance the matching performance of the composite feature algorithm and support crater landmark navigation in future missions.