Back to Search
Start Over
Research on a Fast Image-Matching Algorithm Based on Nonlinear Filtering.
- Source :
-
Algorithms . Apr2024, Vol. 17 Issue 4, p165. 12p. - Publication Year :
- 2024
-
Abstract
- Computer vision technology is being applied at an unprecedented speed in various fields such as 3D scene reconstruction, object detection and recognition, video content tracking, pose estimation, and motion estimation. To address the issues of low accuracy and high time complexity in traditional image feature point matching, a fast image-matching algorithm based on nonlinear filtering is proposed. By applying nonlinear diffusion filtering to scene images, details and edge information can be effectively extracted. The feature descriptors of the feature points are transformed into binary form, occupying less storage space and thus reducing matching time. The adaptive RANSAC algorithm is utilized to eliminate mismatched feature points, thereby improving matching accuracy. Our experimental results on the Mikolajcyzk image dataset comparing the SIFT algorithm with SURF-, BRISK-, and ORB-improved algorithms based on the SIFT algorithm conclude that the fast image-matching algorithm based on nonlinear filtering reduces matching time by three-quarters, with an overall average accuracy of over 7% higher than other algorithms. These experiments demonstrate that the fast image-matching algorithm based on nonlinear filtering has better robustness and real-time performance. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19994893
- Volume :
- 17
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 176878919
- Full Text :
- https://doi.org/10.3390/a17040165