Abstract

In this paper, we proposed a registration algorithm based on the combination of pyramid hierarchical idea and graph theory. It can solve the challenging problem of extracting consistent characteristics and matching the infrared and visible images. First, extracting the maximally stable extremal regions (MSERs) in the determining maximum down-sampling images and each MSER is represented by a polygon. Then constructing the gragh features and the mapping relationship of MSERs between the infrared and visible images are determined by the graph matching method. Next we can construct the initial point set for matching according to the mapping relationship. Finally, using the random sample consensus (RANSAC) algorithm to obtain the optimal parameters and determine the error evaluation parameters. According to the idea of pyramid stratification, the above process is repeated in the high resolution images under the constraint condition of current matching error. The experiment results show that the algorithm can make full use of the visual similarity structures between images, and can achieve a smaller matching error under the premise of ensuring the robustness of the matching.

Highlights

  • In this paper, we proposed a registration algorithm based on the combination of pyramid hierarchical idea and graph theory

  • The regional mapping relationship between the IR and visible images (VI) is determined by the graph matching method

  • We can construct the initial set of matching points based on the regional mapping and obtain the optimum matching parameters using the random sample consensus (RANSAC) algorithm and determine the error evaluation parameters

Read more

Summary

Introduction

We proposed a registration algorithm based on the combination of pyramid hierarchical idea and graph theory. It can solve the challenging problem of extracting consistent characteristics and matching the infrared and visible images. Constructing the gragh features and the mapping relationship of MSERs between the infrared and visible images are determined by the graph matching method. We proposed a registration algorithm which combines pyramid hierarchical idea and graph theory. We can construct the initial set of matching points based on the regional mapping and obtain the optimum matching parameters using the random sample consensus (RANSAC) algorithm and determine the error evaluation parameters. Where m0 , m1 , m2 , m3 , m4 , m5 represent six independent degrees of freedom, an affine transformation can be expressed as follows:

Methods
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.