In the compressed processing of hyperspectral images, orthogonal matching pursuit algorithm (OMP) can be used to obtain sparse decomposition results. Aimed at the time-complex and difficulty in applying real-time processing,… Click to show full abstract
In the compressed processing of hyperspectral images, orthogonal matching pursuit algorithm (OMP) can be used to obtain sparse decomposition results. Aimed at the time-complex and difficulty in applying real-time processing, an evolutionary multi-objective optimization sparse decomposition algorithm for hyperspectral images is proposed. Instead of using OMP for the matching process to search optimal atoms, the proposed algorithm explores the idea of reference point non-dominated sorting genetic algorithm (NSGA) to optimize the matching process of OMP. Take two objective function to establish the multi-objective sparse decomposition optimization model, including the largest inner product of matching atoms and image residuals, and the smallest correlation between atoms. Utilize NSGA-III with advantage of high accuracy to solve the optimization model, and the implementation process of NSGA-III-OMP is presented. The experimental results and analysis carried on four hyperspectral datasets demonstrate that, compared with the state-of-the-art algorithms, the proposed NSGA-III-OMP algorithm has effectively improved the sparse decomposition performance and efficiency, and can effectively solve the sparse decomposition optimization problem of hyperspectral images.
               
Click one of the above tabs to view related content.