Abstract
Industrial machine-vision (MV) applications require high-speed stitching of low-textural images from multiple high-resolution cameras for Field-of-View expansion. The most vital step in the stitching process is the effective and efficient extraction of features, which becomes challenging for low-textural images. This paper presents a comparative study of five popular feature descriptor algorithms for image stitching viz. Scale Invariant Feature Transform (SIFT), Speeded Up Robust Feature (SURF), Oriented Fast and Rotated BRIEF (ORB), Binary Robust invariant scalable keypoints (BRISK), and Accelerated-KAZE (AKAZE). The focus of this paper is to present a study of the performance comparison among these feature extraction methods for low-textural images from real-time steel surface inspection systems. Primarily, synchronized images of steel rolled at room temperatures are obtained from a two-camera network with overlapping regions. Feature descriptor algorithms extract features from two images with an overlapping area and further match the features using K-Nearest Neighbour (KNN) algorithm. The performance of the five feature descriptor algorithms is evaluated using a low-textural dataset that consists of a set of 177 images captured from two cameras placed at a fixed distance from each other. The efficiency of these algorithms is quantitatively and qualitatively evaluated using execution time, sensitivity, and specificity. Finally, this paper provides guidelines for future research on problems with FOV expansion in industrial scenarios.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.