Cauchy greedy algorithm for robust sparse recovery and multiclass classification

Yulong Wang

doi:10.1016/j.sigpro.2019.06.006

Cauchy greedy algorithm for robust sparse recovery and multiclass classification

2019-11-01

4

PRE

AI

DOI：10.1016/j.sigpro.2019.06.006

Original

Original request for help

Save

Abstract

En 中文

Greedy algorithms have attracted considerable interest for sparse signal recovery (SSR) due to their appealing efficiency and performance recently. However, conventional greedy algorithms utilize the l(2) norm based loss function and suffer from severe performance degradation in the presence of gross corruption and outliers. Furthermore, they cannot be directly applied to the recovery of quaternion sparse signals due to the noncommutativity of quaternion multiplication. To alleviate these problems, we propose a robust greedy algorithm referred as Cauchy matching pursuit (CauchyMP) for SSR and extend it for quaternion SSR. By leveraging the Cauchy estimator and generalizing it to the quaternion space to measure the residual error, our method can robustly recover the sparse signal in both real and quaternion space from noisy data corrupted by various severe noises and outliers. To tackle the resulting quaternion optimization problem, we develop an efficient half-quadratic optimization algorithm by introducing two quaternion operators. In addition, we have also devised a CauchyMP based classifier termed CauchyMPC for robust multiclass classification. The experiments on both synthetic and real-world datasets validate the efficacy and robustness of the proposed methods for SSR, block SSR, quaternion SSR and multiclass classification. (C) 2019 Elsevier B.V. All rights reserved.

Keywords:

Greedy algorithm

Robust signal recovery

Multiclass classification

Cauchy greedy algorithm for robust sparse recovery and multiclass classification

Abstract

AI Summary

Journal

Organization