Abstract

Image feature detection and matching technologies are crucial aspects in machine vision. However it is still facing the dilemma between fast operation for real-time application and robust matching. To address this issue, we propose a robust and relatively fast method for image feature extraction and matching with linear adjustment and adaptive thresholding (LAAT) in this paper. The major challenge of this method is reducing the sensitivity to the brightness. To solve this problem, we adopt brightness and contrast adjustment for image pairs processed by Gaussian filtering. An adaptive thresholding FAST approach is applied for feature selection to improve the performance. The proposed method is compared with the traditional and state-of-the-art extraction methods on public dataset. Particularly, this paper focuses on the illumination change, image blur, and image rotation aspects. Experiments show that our proposed algorithm is superior to other algorithms in the comprehensive evaluation of various parameters, especially for illumination and blur transformations.

Highlights

  • Machine vision is a branch of artificial intelligence which is developing rapidly

  • Feature detection and matching play important roles in machine vision. They are widely used in many fields, such as 3D reconstruction{Mouragnon, 2006 #158}., posture estimation [2], Smart device application [3], AR [4], SLAM [5], [6], robot navigation [7], object recognition [8], etc

  • Image feature detection and matching algorithms consist of three main steps: (1)detect feature and compute descriptors; (2)match descriptor; (3)remove false matches

Read more

Summary

Introduction

Machine vision is a branch of artificial intelligence which is developing rapidly. In short, machine vision uses cameras instead of human eyes to measure and judge surrounding environment. ORB uses FAST [12] algorithm to detect feature points. Li et al [20] developed a fast matching algorithm based on the combination of FAST feature points and SURF descriptor.

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.