Information-theoretic generalized orthogonal matching pursuit for robust pattern classification

摘要

Owing to its simplicity and efficacy, orthogonal matching pursuit (OMP) has been a popular sparse representation method for compressed sensing and pattern classification. As a recent extension of OMP, generalized OMP (GOMP) improves the efficiency of OMP by identifying multiple atoms each iteration. Nonetheless, GOMP utilizes the mean square error (MSE) criterion as the loss function, which has been proven to rely on the Gaussianity assumption of the noise distribution and sensitive to non-Gaussian noise. In this paper, we propose a robust sparse representation method, called information-theoretic generalized OMP (ITGOMP), to reduce the limitation of GOMP. The key idea is to minimize the correntropy based information-theoretic loss function, which is independent of the noise distribution. We also devise a half-quadratic based algorithm to tackle the optimization problem. Finally, an ITGOMP based classifier is developed for robust pattern classification. The experiments on public real-world databases verify the effectiveness and robustness of the proposed method for classification.