A multi-source image fusion algorithm based on gradient regularized convolution sparse representation

14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Image fusion based on the sparse representation (SR) has become the primary research direction of the transform domain method. However, the SR-based image fusion algorithm has the characteristics of high computational complexity and neglecting the local features of an image, resulting in limited image detail retention and a high registration misalignment sensitivity. In order to overcome these shortcomings and the noise existing in the image of the fusion process, this paper proposes a new signal decomposition model, namely the multi-source image fusion algorithm of the gradient regularization convolution SR (CSR). The main innovation of this work is using the sparse optimization function to perform two-scale decomposition of the source image to obtain high-frequency components and low-frequency components. The sparse coefficient is obtained by the gradient regularization CSR model, and the sparse coefficient is taken as the maximum value to get the optimal high frequency component of the fused image. The best low frequency component is obtained by using the fusion strategy of the extreme or the average value. The final fused image is obtained by adding two optimal components. Experimental results demonstrate that this method greatly improves the ability to maintain image details and reduces image registration sensitivity.

Cite

CITATION STYLE

APA

Jian, W., Chunxia, Q., Xiufei, Z., Ke, Y., & Ping, R. (2020). A multi-source image fusion algorithm based on gradient regularized convolution sparse representation. Journal of Systems Engineering and Electronics, 31(3), 447–459. https://doi.org/10.23919/JSEE.2020.000027

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free