Noise Statistics Oblivious GARD For Robust Regression With Sparse Outliers
- 23 November 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (2) , 383-398
Abstract
Linear regression models contaminated by Gaussian noise (inlier) and possibly unbounded sparse outliers are common in many signal processing applications. Sparse recovery inspired robust regression (SRIRR) techniques are shown to deliver high-quality estimation performance in such regression models. Unfortunately, most SRIRR techniques assume a priori knowledge of noise statistics like inlier noise variance or outlier statistics like number of outliers. Both inlier and outlier noise statistics are rarely known a priori, and this limits the efficient operation of many SRIRR algorithms. This paper proposes a novel noise statistics oblivious algorithm called residual ratio thresholding GARD (RRT-GARD) for robust regression in the presence of sparse outliers. RRT-GARD is developed by modifying the recently proposed noise statistics dependent greedy algorithm for robust denoising (GARD). Both finite sample and asymptotic analytical results indicate that RRT-GARD performs nearly similar to GARD with a priori knowledge of noise statistics. Numerical simulations in real and synthetic data sets also point to the highly competitive performance of RRT-GARD.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Robust Linear Regression via $\ell_0$ RegularizationIEEE Transactions on Signal Processing, 2017
- High SNR Consistent Linear Model Order Selection and Subset SelectionIEEE Transactions on Signal Processing, 2016
- Robust Linear Regression Analysis— A Greedy ApproachIEEE Transactions on Signal Processing, 2015
- Orthogonal Matching Pursuit for Sparse Signal Recovery With NoiseIEEE Transactions on Information Theory, 2011
- A Sparsity-Aware Approach for NBI Estimation in MIMO-OFDMIEEE Transactions on Wireless Communications, 2011
- Highly Robust Error Correction byConvex ProgrammingIEEE Transactions on Information Theory, 2008
- Just relax: convex programming methods for identifying sparse signals in noiseIEEE Transactions on Information Theory, 2006
- Variance estimates and hypothesis tests in least absolute value regressionJournal of Statistical Computation and Simulation, 2006
- Overall view regarding fundamental matrix estimationImage and Vision Computing, 2003
- Random sample consensusCommunications of the ACM, 1981