Abstract

Image matching is important for vision-based navigation. However, most image matching approaches do not consider the degradation of the real world, such as image blur; thus, the performance of image matching often decreases greatly. Recent methods try to deal with this problem by utilizing a two-stage framework—first resorting to image deblurring and then performing image matching, which is effective but depends heavily on the quality of image deblurring. An emerging way to resolve this dilemma is to perform image deblurring and matching jointly, which utilize sparse representation prior to explore the correlation between deblurring and matching. However, these approaches obtain the sparse representation prior in the original pixel space, which do not adequately consider the influence of image blurring and thus may lead to an inaccurate estimation of sparse representation prior. Fortunately, we can extract the pseudo-Zernike moment with blurred invariant from images and obtain a reliable sparse representation prior in the blurred invariant space. Motivated by the observation, we propose a joint image deblurring and matching method with blurred invariant-based sparse representation prior (JDM-BISR), which obtains the sparse representation prior in the robust blurred invariant space rather than the original pixel space and thus can effectively improve the quality of image deblurring and the accuracy of image matching. Moreover, since the dimension of the pseudo-Zernike moment is much lower than the original image feature, our model can also increase the computational efficiency. Extensive experimental results demonstrate that the proposed method performs favorably against the state-of-the-art blurred image matching approach.

Highlights

  • Image matching has been an active research area in the eld of computer vision, such as image mosaicing [1, 2], object tracking [3, 4], and character recognition [5,6,7]

  • In our JDM-BISR algorithm, image deblurring and matching are tightly coupled. us, we present the results for image matching and deblurring separately

  • We can observe that our JDM-BISR algorithm performs the best among all the methods in all cases, which denotes that the sparse representation obtained in blurred invariant space is more reliable than that obtained in original pixel space, improving the quality of image deblurring

Read more

Summary

Introduction

Image matching has been an active research area in the eld of computer vision, such as image mosaicing [1, 2], object tracking [3, 4], and character recognition [5,6,7]. Motivated by the above analysis, we propose a joint image deblurring and matching method with blurred invariant-based sparse representation prior (JDM-BISR). Different from JRM-DSR, we obtain the sparse representation coefficients in blurred invariant space rather than original pixel space, improving the accuracy of the sparse representation prior, thereby facilitating the following deblurring and matching tasks. (i) We propose a joint image deblurring and matching method with blurred invariant-based sparse representation prior, to deal with the problem of blurred image matching. (ii) We extract pseudo-Zernike moment with blurred invariants from images and obtain the sparse representation coefficients in blurred invariant space, which alleviates the influence of image blurring and improves the reliability of the sparse representation prior.

Related Work
JRM-DSR
Experiments and Analysis
Method
Conclusions
Full Text
Published version (Free)

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