Paper: A Robust Matching Pursuit Algorithm Using Information Theoretic Learning

September 22nd, 2020

Current orthogonal matching pursuit (OMP) algorithms calculate the correlation between two vectors using the inner product operation and minimize the mean square error, which are both suboptimal when there are non-Gaussian noises or outliers in the observation data.

To overcome these problems, a new OMP algorithm is developed based on the information theoretic learning (ITL), which is built on the following new techniques:

  1. An ITL-based correlation (ITL-Correlation) is developed as a new similarity measure which can better exploit higher-order statistics of the data, and is robust against many different types of noise and outliers in a sparse representation framework;
  2. A non-second order statistic measurement and minimization method is developed to improve the robustness of OMP by overcoming the limitation of Gaussianity inherent in cost function based on second-order moments.

The experimental results on both simulated and real-world data consistently demonstrate the superiority of the proposed OMP algorithm in data recovery, image reconstruction, and classification.

Fig. 3. Sample images from the extended Yale B dataset. (a) original, (b) randomly generated block occlusion, (c) real image block occlusion.

M. Zhang, Y. Gao, C. Sun, and M. Blumenstein, A Robust Matching Pursuit Algorithm Using Information Theoretic Learning, Pattern Recognition, 107:107415, November 2020.

Download the full paper here.

For more information, contact us.

Subscribe to our News via Email

Enter your email address to subscribe and receive notifications of new posts by email.