Camera Relocalization Using Key Frames to Correct Planar Tracking Drift
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The SLAM technology experiences error accumulation in planar tracking due to noise and asymptotic inter-frame matching, leading to drift in tracking results over time.
Innovation Solution
A relocalization method that involves determining a relocalization condition, acquiring feature points and descriptors, performing feature matching with stored key frames, and replacing the current camera pose with the pose of the target key frame to correct errors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If asymptotic inter-frame matching is used for planar tracking, then tracking continuity is maintained, but error accumulation occurs leading to drift in tracking results
Solution Approach 1:
The system pre-stores multiple key frames with their corresponding camera poses and feature points before tracking drifts too far. When relocalization is needed, the current frame is compared against these pre-stored key frames to find the best match, allowing the system to jump back to a known good pose without accumulating errors from continuous incremental tracking.
Solution Approach 2:
The system implements a feedback mechanism by continuously monitoring tracking quality metrics (such as feature match quality and pose consistency) and triggering relocalization when degradation is detected. This feedback loop allows the system to correct drift by returning to a previously verified accurate pose, thereby maintaining long-term tracking accuracy while preserving continuous tracking capability.
2Measurement precision
If relocalization is performed frequently to correct error accumulation, then tracking accuracy is improved, but computational overhead and processing time increase
Solution Approach 1:
Instead of performing exhaustive feature matching with all stored key frames, the system uses partial matching strategies such as comparing against a subset of key frames, using approximate nearest neighbor search, or limiting the number of comparison iterations. This reduces computational overhead while still achieving sufficient accuracy for error correction.
Solution Approach 2:
Key frames are pre-processed and stored with extracted feature points and descriptors before they are needed for relocalization. This preliminary preparation allows the relocalization process to proceed more quickly by comparing against pre-computed data rather than processing raw images in real-time, thereby reducing the time penalty associated with frequent accuracy corrections.
Data Source
AI summary
The disclosure provides a method of relocalization, including: in response to a determination that a current image frame satisfies a relocalization condition, acquiring feature points of the current image frame and descriptors of the feature points; performing, based on the feature points of the current image frame and the descriptor of each feature point, feature matching on the current image frame and each stored key frame respectively to obtain feature point pairs after matching the current image frame with each key frame respectively; determining a matching degree of the current image frame and each key frame respectively based on the feature point pairs; determining a key frame with the highest matching degree with the current image frame as a target key frame; and replacing a camera pose corresponding to the current image frame with a camera pose corresponding to the target key frame.


