Efficient homography estimation using a recursive algorithm with a mixture of weighted Gaussian kernels

In this study, we propose an efficient recursive algorithm, named GK-RLS, defined with a mixture of weighted Gaussian kernels for efficient homography estimation. By defining the homography estimation problem as a least square problem and optimizing the estimation parameters based on minimizing expected estimation errors, GKRLS offers efficient incremental processing of feature points, rather than processing them as a batch like RANSAC, resulting in reduced computation time (CT) when handling a large number of paired features. To address real-world challenges such as noise and outliers commonly encountered in feature extraction and pairing, GKRLS incorporates a small-pass filter defined with Gaussian kernels to effectively attenuate their resulting large prediction errors, thus reducing outlier drawbacks. The algorithm's effective stopping criteria are established based on a concept akin to RANSAC, with termination occurring when the estimated homography matrix yields low geometric error for a predefined portion of paired feature points. The CT of the algorithm is crucial for online applications or scenarios requiring the sharing of feature data points within communication networks, such as between multiple drones or between drones and a ground station. Therefore, leveraging the iterative structure and effective stopping criteria of GK-RLS, it estimates the homography matrix using only a limited number of feature points, resulting in a smaller CT compared to RANSAC while having a similar estimation performance. Extensive evaluations, including sensitivity analysis, a drone simulation, and experimental implementation, demonstrate the superiority of GK-RLS over RANSAC, especially concerning the required CT. Overall, GK-RLS presents a promising solution for robust and efficient homography matrix estimation in various real-world scenarios that require process data in high sampling frequencies.