A Crater Matching Method and System Based on Sparse Binary Structure Graphs

The crater matching method based on sparse binary structure graph construction and kernel window mechanism solves the problems of high computational overhead and incomplete matching in existing technologies, and achieves efficient and real-time crater matching, supporting high-precision autonomous navigation of the Moon and other celestial bodies.

CN123119005APending Publication Date: 2026-11-17TONGJI UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611514054.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-09-28
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing crater matching methods in lunar exploration suffer from high computational overhead, incomplete or mismatched matching, and poor real-time performance, making it difficult to meet the requirements of high precision and real-time performance.

Method used

A sparse binary structure graph construction method is adopted. By constructing a sparse binary structure graph of the crater library and a sparse binary structure graph of image detection, a kernel window mechanism is introduced. A lightweight sliding window and logical judgment strategy are adopted to perform matching statistics only on sparse target regions to obtain the optimal matching offset and matching pair set.

Benefits of technology

It significantly reduces computational overhead, enhances matching robustness, and possesses strong adaptability to lighting conditions, high computational efficiency, and good real-time matching performance, enabling it to support high-precision autonomous navigation tasks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123119005A_ABST
    Figure CN123119005A_ABST
Patent Text Reader

Abstract

This invention relates to a crater matching method and system based on sparse binary structure graphs. The method includes: acquiring projection points from a crater database and crater centers detected by image analysis; further constructing a sparse binary structure graph of the crater database and a sparse binary structure graph of the image-detected craters; setting a kernel window for each projection point in the crater database sparse binary structure graph to obtain an updated crater database sparse binary structure graph; sliding the image-detected crater sparse binary structure graph within a preset translation search range and obtaining the corresponding offset; determining whether the values ​​of the image-detected crater sparse binary structure graph and the updated crater database sparse binary structure graph match point by point, and calculating the corresponding matching score; using the offset with the highest matching score as the optimal matching offset; and further establishing a set of crater matching pairs. Compared with existing technologies, this invention has the advantages of strong adaptability to illumination, low computational overhead, good real-time matching performance, and strong anti-disturbance capability.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the fields of computer vision and photogrammetry, and in particular to a crater matching method and system based on sparse binary structure graphs for lunar navigation and positioning. Background Technology

[0002] Lunar exploration is a crucial step for humanity in exploring the universe and expanding our living space. As lunar exploration missions place higher demands on landing accuracy, traditional landing positioning and navigation methods, such as inertial navigation, radio ground control, and Doppler radar and lidar measurements, are increasingly revealing problems such as large communication delays, low transmission efficiency, and celestial obstruction, making them insufficient to meet the navigation requirements of future high-precision landings. Therefore, developing high-precision autonomous navigation technology is of great significance for ensuring the safe and stable landing of lunar probes.

[0003] Currently, terrain relative navigation (TRN) technology is widely used in precise lunar landing missions. As an important component of TRN, crater-based visual navigation methods are gradually becoming a core direction in autonomous navigation research. Because craters are long-standing, stable, and easily observable on the lunar surface, they exhibit better stability under changes in illumination and observation angle compared to other terrain features, making them ideal landmarks for supporting high-precision autonomous lunar navigation. However, in actual missions, the craters in lunar images taken by spacecraft vary in shape and distribution, and are affected by factors such as illumination, angle, and resolution, making it difficult to match detected craters with known targets in the database.

[0004] Existing crater matching methods mainly focus on image detection and geometric matching framework design, and some progress has been made. However, these methods generally suffer from the following problems: First, craters are widely and randomly distributed, and a crater in an image may be any target in the database. Moreover, under different shooting conditions, there are significant differences between detected craters and known targets. Second, the matching process involves transformations between different coordinate systems. Although projection and range constraints can be performed using the initial camera pose, projection errors and initial value deviations in navigation calculations can still lead to incomplete matching or mismatches. Finally, existing matching strategies typically have high computational costs, making it difficult to guarantee real-time performance and high accuracy under resource-constrained conditions.

[0005] The invention disclosed in CN118758288A is a crater matching method based on image orthorectification. It projects the captured image onto the DEM using existing DEM and prior position and attitude information, processes the resulting orthorectified image, performs crater detection, establishes a crater triangle feature library, and matches it with a ground-based navigation crater triangle library. This process can accomplish high-precision image navigation tasks. However, this scheme cannot avoid pixel-by-pixel calculations across the entire image during the matching process, resulting in high computational cost and poor matching robustness. Summary of the Invention

[0006] The purpose of this invention is to overcome the shortcomings of existing technologies by providing a crater matching method and system based on a sparse binary structure graph. This method uses projection points from a 3D crater database and crater center points detected from images as input, and constructs a sparse binary structure graph to characterize the spatial geometric distribution of craters. To improve the robustness of matching, this invention introduces a kernel window mechanism into the database structure graph to tolerate positional disturbances caused by attitude changes, projection errors, or detection biases. The matching stage employs a lightweight sliding window and logical judgment strategy, performing score statistics only on sparse target regions to quickly determine the optimal matching offset and obtain the set of matching pairs. This invention has advantages such as strong adaptability to illumination, low computational overhead, good real-time matching performance, and strong anti-disturbance capability, and can be applied to high-precision autonomous landing and navigation missions on the Moon and other celestial bodies.

[0007] The objective of this invention can be achieved through the following technical solutions: A crater matching method based on sparse binary structure graphs includes: Obtain the crater database projection points and image detection crater centers; construct the crater database sparse binary structure diagram and image detection sparse binary structure diagram corresponding to the crater database projection points and image detection crater centers. A kernel window is set for each projection point in the sparse binary structure map of the crater library to obtain an updated sparse binary structure map of the crater library; the image detection sparse binary structure map of the crater library is slid within a preset translation search range, and the corresponding offset is obtained; At the specified offset, for each crater point, it is determined whether the values ​​of the image-detected sparse binary structure map of craters and the updated crater library sparse binary structure map match, and the corresponding matching score is calculated; the offset with the highest matching score is taken as the optimal matching offset; based on the optimal matching offset, a set of crater matching pairs is established.

[0008] Furthermore, at the aforementioned offset, for each crater point, it is determined whether the values ​​of the image-detected crater sparse binary structure map and the updated crater library sparse binary structure map are both 1, and the corresponding matching score is calculated; if both are 1, the current matching score is incremented by 1; if not both are 1, the current matching score remains unchanged, until all crater points have been traversed to obtain the final matching score at the current offset.

[0009] Furthermore, the formula for calculating the matching score includes: in, The translation offset is Match score at that time express Translation in the direction, for Translation in the direction, For indicator functions, The sparse binary structure map representing the image detection crater in coordinates The value at that location, This represents the updated sparse binary structure graph of the crater library, showing the values ​​at the translated positions. This represents the logical AND operation. Index of the crater point, This represents the total number of impact craters.

[0010] Furthermore, the sparse binary structure map of the crater library and the sparse binary structure map of the image-detected craters are represented as follows: in, Represents a sparse binary structure graph. for axis, for axis, This represents the i-th projection point.

[0011] Furthermore, the core window is a square core window with a side length of k, and its center position is the center of the crater in the crater database.

[0012] Furthermore, the kernel window is represented as: in, This represents the kernel window corresponding to the i-th crater reservoir projection point. Let x be the x-coordinate of the i-th projection point on the image plane. Let be the y-coordinate of the i-th projection point on the image plane. , Represents any point within the kernel window , coordinate, The side length of the kernel window.

[0013] Furthermore, the process of establishing the crater matching pair set includes: Determine whether each image-detected crater point in the image-detected sparse binary structure graph falls within the kernel window of any projection point in the crater library sparse binary structure graph after translating the optimal matching offset; if it falls within the kernel window, associate the image-detected crater point with the projection point corresponding to the center of the kernel window to form a set of crater matching pairs; until all image-detected crater points are traversed to obtain the set of crater matching pairs.

[0014] Furthermore, when calculating the value of the updated crater library sparse binary structure map, if the detected crater point falls into the kernel window after the image is slid, then the value of the crater library sparse binary structure map is 1.

[0015] Furthermore, in the process of constructing the sparse binary structure map of the crater library and the sparse binary structure map of the image-detected craters, the crater points are assigned a value of 1, and the remaining background areas are assigned a value of 0.

[0016] The present invention also provides a crater matching system based on a sparse binary structure graph, including a memory and a processor. The memory stores a computer program, and the processor calls the computer program to execute the steps of the method described above.

[0017] Compared with the prior art, the present invention has the following advantages: (1) This invention constructs a sparse binary structure map of the crater library and a sparse binary structure map of the image detection crater, transforming crater matching into point-by-point logical judgment between sparse binary maps. It only performs matching statistics on the target crater area, which can avoid pixel-by-pixel calculation of the whole map and significantly reduce the computational cost. By setting a kernel window for each projection point in the sparse binary structure map of the crater library, the matching process can tolerate position disturbances caused by changes in illumination, attitude, projection error and detection deviation, which enhances the robustness of matching. It has the advantages of high computational efficiency, good real-time matching, strong illumination adaptability and strong anti-disturbance ability, which can effectively support high-precision autonomous landing navigation missions on the moon and other celestial bodies.

[0018] (2) This invention establishes a matching optimization method based on sparse binary structure graphs. It adopts a set perspective, weakens the dependence of traditional point-to-point matching on spatial rigid constraints, focuses on the sparsity and density of the overall structure in the matching process, and can achieve highly robust matching in the presence of projection uncertainty. It has strong application robustness. Attached Figure Description

[0019] Figure 1This is a flowchart of a crater matching method based on a sparse binary structure graph provided in an embodiment of the present invention; Figure 2 This is a simplified flowchart of a crater matching method based on sparse binary structure graphs provided in an embodiment of the present invention; Figure 3 This is a schematic diagram of the sliding window logic judgment matching of a crater matching method based on a sparse binary structure graph provided in an embodiment of the present invention; Figure 4 This is a simulation data diagram of a crater matching method based on sparse binary structure graphs provided in an embodiment of the present invention; Figure 5 This is a statistical chart of crater matching results provided in an embodiment of the present invention, based on a sparse binary structure graph. Detailed Implementation

[0020] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0021] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0022] It should be noted that similar labels and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.

[0023] Example 1 like Figure 1 As shown, this embodiment provides a crater matching method based on sparse binary structure graphs, which includes the following steps: S1: Obtain the crater database projection points and image detection crater centers; construct the crater database sparse binary structure diagram and image detection sparse binary structure diagram corresponding to the crater database projection points and image detection crater centers. Steps for constructing sparse structure maps of craters: Construct sparse binary structure maps of the craters detected in the images and the crater projection points in the database, respectively, where the point locations are assigned a value of 1 and the remaining background areas are assigned a value of 0.

[0024] Preferred, The sparse binary structure map is constructed by setting the projection of the crater center onto the image coordinate plane as 1 and all other points as 0, thus creating a sparsely distributed binary map. Specifically, it can be represented as: Preferred, In the steps of constructing the sparse structure map of craters, the core window is a square window, the center of which is the center of the crater in the crater library, and the side length is [missing information]. k During the matching process, if the offset range of the detected crater point after translation falls within this range, it is considered a valid match.

[0025] S2: Set a kernel window for each projection point in the sparse binary structure map of the crater library to obtain the updated sparse binary structure map of the crater library; slide the image to detect the sparse binary structure map of the crater library within a preset translation search range and obtain the corresponding offset; The kernel window mechanism is introduced by setting a kernel window for the projection points in the database to tolerate positional disturbances caused by illumination, attitude changes, and detection errors.

[0026] Preferred, If the pixel at the same position in the sliding window is 1, the crater is considered to be successfully matched.

[0027] Preferred, When calculating the value of the updated sparse binary structure map of the crater library, if the detected crater point falls into the kernel window after the image is slid, the value of the sparse binary structure map of the crater library is 1.

[0028] S3: Under the offset, determine whether the values ​​of the image-detected sparse binary structure map of craters and the updated sparse binary structure map of the crater library match point by point, and calculate the corresponding matching score; take the offset with the highest matching score as the optimal matching offset; establish a set of crater matching pairs based on the optimal matching offset.

[0029] The sparse binary structure map matching process involves: within the translational search range of the crater library's binary structure map, a sliding window logic judgment strategy is used to statistically analyze matching scores, and the offset position with the highest score is selected as the optimal matching position, thus obtaining a set of matching crater pairs. In this sparse binary structure map matching process, the sliding window logic judgment matching strategy only performs logical judgment and statistical analysis on target regions with a pixel value of 1 in the binary map, avoiding pixel-by-pixel calculation across the entire image.

[0030] Preferred, At the offset, for each crater point, it is determined whether the values ​​of the image-detected sparse binary structure map of craters and the updated crater library sparse binary structure map are both 1, and the corresponding matching score is calculated; if both are 1, the current matching score is incremented by 1; if not both are 1, the current matching score remains unchanged, until all crater points have been traversed, and the final matching score at the current offset is obtained.

[0031] Preferred, The optimal matching position is determined by selecting the offset with the most effective matching crater points, and using this to establish a one-to-one correspondence between the center of each crater in the observed image and the reference three-dimensional crater database.

[0032] Preferred, The process of establishing the crater matching pair set includes: Determine whether each image-detected crater point in the sparse binary structure graph of the crater library falls within the kernel window of any projection point in the crater library sparse binary structure graph under the optimal translation offset. If it does, associate the image-detected crater point with the projection point corresponding to the center of the kernel window to form a set of crater matching pairs. Continue until all image-detected crater points are traversed to obtain a set of crater matching pairs.

[0033] Example 2 like Figure 2 As shown, this embodiment provides a specific implementation step for a crater matching method based on sparse binary structure graphs. This method weakens the dependence on complex image textures and directly utilizes the location distribution information of craters for fast matching. The main process is divided into three stages: crater sparse structure graph construction, kernel window mechanism introduction, and sparse binary structure graph matching, which will be elaborated in detail below.

[0034] In the crater sparse structure map construction step, sparse binary structure maps are constructed for each projection point in the crater database and the crater detected on the image plane. , The specific construction method is as follows: That is, when points on the image plane The obtained projection point At that time, the corresponding Value If it is not a projection point, then the point corresponds to... Value This allows for the construction of a binary structure that reflects the spatial distribution of craters.

[0035] like Figure 3As shown, in practical applications, due to limitations in crater center extraction accuracy and projection errors such as projection drift caused by elevation changes, non-rigid displacements and projection errors are easily generated, which can affect the accuracy of crater matching. Therefore, a matching kernel window that is resistant to disturbances is constructed based on the sparse binary structure graph.

[0036] For each projection point Construct a square kernel window. Set its side length as Then the kernel window corresponding to each projection point is expressed as: in, The size of the kernel window determines the local area it covers, and this range is designed to accommodate positional changes caused by various perturbations to a certain extent. This applies as long as the offset point remains within the kernel window. If the projection error is within the acceptable range, it is considered an acceptable perturbation, thereby minimizing the impact of the projection error on the matching result.

[0037] In order to calculate the captured image and the reference structure diagram To determine the matching degree between them, this embodiment uses a sliding window approach. The binary structure map obtained from image detection is then... Slide within the preset translation search range and calculate each offset. Match score below: Among them, among them, The translation offset is Match score at that time express Translation in the direction, for Translation in the direction, The sparse binary structure map representing the image detection crater in coordinates The value at that location, This represents the updated sparse binary structure graph of the crater library, showing the values ​​at the translated positions. This represents the logical AND operation. Index of the crater point, The total number of impact craters. It is an indicator function that returns 1 if the condition is true, and 0 otherwise.

[0038] The matching score calculation does not need to be achieved through multiplication and accumulation between binary images. It only requires XOR judgment to count how many observed crater points can accurately fall into the kernel window of the reference binary image.

[0039] This approach differs from traditional matching methods based on image grayscale or texture features. Instead, it focuses more on the geometrical distribution consistency of sparse targets and offers simpler and faster computation.

[0040] After obtaining the optimal matching offset, a one-to-one correspondence can be established between the image-detected craters and the reference 3D crater database. Specifically, if the translated observation point falls within a certain core window... Then the observation point is associated with the three-dimensional crater represented by the center of the window, forming a set of matching pairs.

[0041] This matching optimization method based on binary structure graphs adopts an ensemble perspective, which weakens the dependence of traditional point-to-point matching on rigid spatial constraints and focuses on the sparsity and density of the overall structure during the matching process.

[0042] Verification experiment: I. Data Introduction To simulate a realistic lunar landing scenario and evaluate the algorithm's performance on a sequence of images, this study generated 95 simulated images using 60-meter SLDEM data released by NASA. These images simulate a continuous orbital path near the lunar equator, with simulated flight altitudes ranging from 50 km to 30 km, limited by a 60-meter map resolution. Each image has a 50° field of view and a resolution of 512×512 pixels. The simulated images cover areas with varying crater density and brightness characteristics, and some simulated on-orbit images are shown below. Figure 4 As shown, the morphology of the impact crater is displayed under different lighting and terrain conditions.

[0043] II. Matching Validity Verification and Analysis Figure 5 The results show the trends in the number of crater detections, the number of matches, and the time consumed in the simulation sequence. Although the number of detections (orange bars) and the number of matches (blue bars) fluctuate between frames, their trends are highly consistent, reflecting the good adaptability of this method to different crater distribution densities.

[0044] Experimental results show that even in regions with sparse crater distribution or decreased detection numbers (such as frames 35-45), the number of matches remains at an effective level; while in densely populated crater regions (such as frames 50-60), the number of successful matches steadily increases. This strongly demonstrates that the matching mechanism based on sparse binary structure graphs can weaken the dependence on rigid point-to-point constraints and achieve highly robust matching even in the presence of projection uncertainties by focusing on the overall characteristics of spatial geometry.

[0045] In terms of real-time performance, the single-frame matching time remained stable between 0.62s and 0.79s, with most operations completed within 0.75s. Thanks to the lightweight sliding window strategy and sparse graph logic judgment mechanism, the algorithm avoids redundant image computations. Even in complex scenes with dense craters, the matching time did not fluctuate significantly, fully verifying the efficiency and computational stability of this method in autonomous navigation tasks.

[0046] Example 3 This embodiment provides a crater matching system based on a sparse binary structure graph, including a memory and a processor. The memory stores a computer program, and the processor calls the computer program to execute the steps of the method as described in Embodiment 1.

[0047] The preferred embodiments of the present invention have been described in detail above. It should be understood that those skilled in the art can make numerous modifications and variations based on the concept of the present invention without creative effort. Therefore, all technical solutions that can be obtained by those skilled in the art based on the concept of the present invention through logical analysis, reasoning, or limited experimentation on the basis of existing technology should be within the scope of protection defined by the claims.

Claims

1. A crater matching method based on sparse binary structure graphs, characterized in that, include: Obtain the crater database projection points and image detection crater centers; construct the crater database sparse binary structure diagram and image detection sparse binary structure diagram corresponding to the crater database projection points and image detection crater centers. A kernel window is set for each projection point in the sparse binary structure map of the crater library to obtain an updated sparse binary structure map of the crater library; the image detection sparse binary structure map of the crater library is slid within a preset translation search range, and the corresponding offset is obtained; At the specified offset, for each crater point, it is determined whether the values ​​of the image-detected sparse binary structure map of craters and the updated sparse binary structure map of the crater library match, and the corresponding matching score is calculated; the offset with the highest matching score is taken as the optimal matching offset. Based on the optimal matching offset, a set of crater matching pairs is established.

2. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, At the offset, for each crater point, it is determined whether the values ​​of the image-detected sparse binary structure map of craters and the updated crater library sparse binary structure map are both 1, and the corresponding matching score is calculated. If all values ​​are 1, the current matching score is incremented by 1; if not all values ​​are 1, the current matching score remains unchanged until all crater points have been traversed to obtain the final matching score at the current offset.

3. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, The formula for calculating the matching score includes: in, The translation offset is Match score at that time express Translation in the direction, for Translation in the direction, For indicator functions, The sparse binary structure map representing the image detection crater in coordinates The value at that location, This represents the updated sparse binary structure graph of the crater library, showing the values ​​at the translated positions. This represents the logical AND operation. Index of the crater point, This represents the total number of impact craters.

4. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, The sparse binary structure diagram of the crater library and the sparse binary structure diagram of the image-detected craters are represented as follows: in, Represents a sparse binary structure graph. for axis, for axis, This represents the i-th projection point.

5. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, The kernel window is a square kernel window with a side length of k, and its center position is the center of the crater in the crater database.

6. The crater matching method based on sparse binary structure graphs according to claim 5, characterized in that, The kernel window is represented as follows: in, This represents the kernel window corresponding to the i-th crater reservoir projection point. Let x be the x-coordinate of the i-th projection point on the image plane. Let be the y-coordinate of the i-th projection point on the image plane. , Represents any point within the kernel window , coordinate, The side length of the kernel window.

7. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, The process of establishing the crater matching pair set includes: Determine whether each image-detected crater point in the image-detected sparse binary structure graph falls within the kernel window of any projection point in the crater library sparse binary structure graph after translating the optimal matching offset; if it falls within the kernel window, associate the image-detected crater point with the projection point corresponding to the center of the kernel window to form a set of crater matching pairs; until all image-detected crater points are traversed to obtain the set of crater matching pairs.

8. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, When calculating the value of the updated sparse binary structure map of the crater library, if the detected crater point falls into the kernel window after the image is slid, then the value of the sparse binary structure map of the crater library is 1.

9. The crater matching method based on sparse binary structure graphs according to claim 1, characterized in that, In the process of constructing the sparse binary structure map of the crater library and the sparse binary structure map of the image detection crater, the crater point is assigned a value of 1, and the other background areas are assigned a value of 0.

10. A crater matching system based on sparse binary structure graphs, characterized in that, It includes a memory and a processor, the memory storing a computer program, the processor invoking the computer program to perform the steps of the method as described in any one of claims 1 to 9.