A regularized matrix factorization approach to induce structured sparse-low-rank solutions in the EEG inverse problem

7Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the estimation of the Brain Electrical Sources (BES) matrix from noisy electroencephalographic (EEG) measurements, commonly named as the EEG inverse problem. We propose a new method to induce neurophysiological meaningful solutions, which takes into account the smoothness, structured sparsity, and low rank of the BES matrix. The method is based on the factorization of the BES matrix as a product of a sparse coding matrix and a dense latent source matrix. The structured sparse-low-rank structure is enforced by minimizing a regularized functional that includes the l 21-norm of the coding matrix and the squared Frobenius norm of the latent source matrix. We develop an alternating optimization algorithm to solve the resulting nonsmooth-nonconvex minimization problem. We analyze the convergence of the optimization procedure, and we compare, under different synthetic scenarios, the performance of our method with respect to the Group Lasso and Trace Norm regularizers when they are applied directly to the target matrix. © 2014 Montoya-Martínez et al.; licensee Springer.

Cite

CITATION STYLE

APA

Montoya-Martínez, J., Artés-Rodríguez, A., Pontil, M., & Hansen, L. K. (2014). A regularized matrix factorization approach to induce structured sparse-low-rank solutions in the EEG inverse problem. Eurasip Journal on Advances in Signal Processing, 2014(1). https://doi.org/10.1186/1687-6180-2014-97

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free