Bounds on the Number of Identifiable Outliers in Source Localization by Linear Programming
Precise localization have attracted considerable interest in the engineering literature. Most publications consider small measurement errors. In this work we discuss localization in the presence of outliers, where several measurements are severely corrupted while sufficient other measurements are reasonably precise. It is known that maximum likelihood or least squares provide poor results under these conditions. On the other hand, robust regression can successfully handle up to 50% outliers but is associated with high complexity. Using the ¿ 1 norm as the penalty function provides some immunity from outliers and can be solved efficiently with linear programming methods. We use linear equations to describe the localization problem and then we apply the ¿ 1 norm and linear programming to detect the outliers and avoid the wild measurements in the final solution. Our main contribution is an exploitation of recent results in the field of sparse representation to obtain bounds on the number of detectable outliers. The theory is corroborated by simulations and by real data.