Abstract
To solve the problem of high time and space complexity of traditional image fusion algorithms, this paper elaborates the framework of image fusion algorithm based on compressive sensing theory. A new image fusion algorithm based on improved K-singular value decomposition and Hadamard measurement matrix is proposed. This proposed algorithm only acts on a small amount of measurement data after compressive sensing sampling, which greatly reduces the number of pixels involved in the fusion and improves the time and space complexity of fusion. In the fusion experiments of full-color image with multispectral image, infrared image with visible light image, as well as multispectral image with full-color image, this proposed algorithm achieved good experimental results in the evaluation parameters of information entropy, standard deviation, average gradient, and mutual information.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Algorithms & Computational Technology
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.