Prospective comparison of SURF and binary keypoint descriptors for fast hyperspectral remote sensing registration
Image registration is a crucial process that involves determining the geometric transformation required to align multiple images. It plays a vital role in various remote sensing image processing tasks that involve analyzing changes among images. To enable real-time response, it is essential to have computationally efficient registration algorithms, especially when dealing with large datasets as is the case of hyperspectral images. This article presents a comparative analysis of two descriptors used to characterize local features of images prior to their matching and registration. The objective is to analyze whether the LATCH binary keypoint descriptor, which produces compact descriptors, provides similar results to the gradient-based SURF descriptor in terms of execution time and registration precision. To obtain the best computational performance, multithreaded implementations using OpenMP have been proposed. LATCH has proven to be 7 times faster and as reliable as SURF in terms of accuracy on scale differences of up to 1.2 times.
keywords: Binary descriptor, Hyperspectral, multispectral, Image registration, OpenMP
Publication: Congress
1693393668331
August 30, 2023
/research/publications/prospective-comparison-of-surf-and-binary-keypoint-descriptors-for-fast-hyperspectral-remote-sensing-registration
Image registration is a crucial process that involves determining the geometric transformation required to align multiple images. It plays a vital role in various remote sensing image processing tasks that involve analyzing changes among images. To enable real-time response, it is essential to have computationally efficient registration algorithms, especially when dealing with large datasets as is the case of hyperspectral images. This article presents a comparative analysis of two descriptors used to characterize local features of images prior to their matching and registration. The objective is to analyze whether the LATCH binary keypoint descriptor, which produces compact descriptors, provides similar results to the gradient-based SURF descriptor in terms of execution time and registration precision. To obtain the best computational performance, multithreaded implementations using OpenMP have been proposed. LATCH has proven to be 7 times faster and as reliable as SURF in terms of accuracy on scale differences of up to 1.2 times. - Adrián Rodríguez-Molina, Álvaro Ordóñez, Dora B. Heras, Francisco Argüello, Jose F. López - 10.1109/IGARSS52108.2023.10281734 - 979-8-3503-2010-7
publications_en