Abstract

Registration of remote sensing images has been approached using different strategies; one of the most popular is based on similarity measures. There are different measures of similarity in the literature: Normalized Cross-Correlation (NCC), Mutual Information (MI), etc. Normalized Mutual Information (NMI) has received the most attention in image processing; among the most important limitations are its high computational cost and lack of robustness to strong radiometric changes. For this reason, in this work, we introduce a co-registration approach based on the Histogram Kernel Predictability (HKP). This formulation reduces numerical errors and requires less computing time in comparison to NMI. To the best of our knowledge, this is the first work for registering any remote sensing images by using HKP. Additionally, we propose to use an algorithm based on meta-heuristics called Evolutionary Centers Algorithm (ECA), which allows having fewer iterations to solve the registration problem. In addition, we incorporate a parallelization scheme that permits reducing processing times. The results show that our proposal can solve co-registration problems that the NMI cannot solve while obtaining competitive computational times and registration errors comparable with other existing works in the literature. The HKP approach solves most of all the transformations of a set of simulated registration problems, while the NMI, in some cases, only solves half of the registration problems. Moreover, we compare our approach with feature-based methods in real datasets. This research presents an alternative to remote sensing problems where MI has traditionally been used.

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.