Nonparametric Sparse Representation

Details Nonparametric Sparse Representation Nonparametric Sparse Representation

2012-01-13

arxiv.org/abs/1201.2843v1

Computer Science

Computer Vision and Pattern Recognition

4 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Nonparametric Sparse Representation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nonparametric Sparse Representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonparametric Sparse Representation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471725