0 minimization, which is an NP-hard problem with high computational complexity. To solve it, we propose a novel recursive intelligent matching pursuit(RIMP) algorithm in this paper. The idea of RIMP lies in utilizing the recursive reconstruction to reduce the sparsity and applying the superiorities of intelligent optimization algorithm to solve the l₀ minimization essentially, which is beneficial to improving the reconstruction accuracy. To reduce the computational complexity, some matching strategies of greedy algorithm are used to design the intelligent searching strategies to accelerate the reconstruction speed. Also, based on the high reconstruction accuracy of the intelligent searching, RIMP can significantly improve the reconstruction accumulation in recursive reconstruction for image sequences. Numerical simulations on several image sequences have been used to demonstrate that the theoretical reconstruction performance of RIMP can be achieved.">

Recursive intelligent matching pursuit method for image sequences reconstruction based on l0 minimization (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.