DeepAI AI Chat
Log In Sign Up

Nonparametric Sparse Representation

by   Mahmoud Ramezani Mayiami, et al.

This paper suggests a nonparametric scheme to find the sparse solution of the underdetermined system of linear equations in the presence of unknown impulsive or non-Gaussian noise. This approach is robust against any variations of the noise model and its parameters. It is based on minimization of rank pseudo norm of the residual signal and l_1-norm of the signal of interest, simultaneously. We use the steepest descent method to find the sparse solution via an iterative algorithm. Simulation results show that our proposed method outperforms the existence methods like OMP, BP, Lasso, and BCS whenever the observation vector is contaminated with measurement or environmental non-Gaussian noise with unknown parameters. Furthermore, for low SNR condition, the proposed method has better performance in the presence of Gaussian noise.


Impulsive Noise Robust Sparse Recovery via Continuous Mixed Norm

This paper investigates the problem of sparse signal recovery in the pre...

Multichannel sparse recovery of complex-valued signals using Huber's criterion

In this paper, we generalize Huber's criterion to multichannel sparse re...

Automatic Subspace Learning via Principal Coefficients Embedding

In this paper, we address two challenging problems in unsupervised subsp...

Impulsive Noise Mitigation in Powerline Communications Using Sparse Bayesian Learning

Additive asynchronous and cyclostationary impulsive noise limits communi...

Refined Least Squares for Support Recovery

We study the problem of exact support recovery based on noisy observatio...

Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise

In presence of sparse noise we propose kernel regression for predicting ...