Distributed least mean squares strategies for sparsity-aware estimation over Gaussian Markov random fields.

Paolo Di Lorenzo Sergio Barbarossa

Published in: ICASSP (2014)

Keyphrases

gaussian markov random fields
subspace information criterion
adaptive filtering
non stationary
high dimensional
maximum likelihood
computationally efficient
step size
sparse representation
evolutionary algorithm
convergence rate