This paper introduces the usage of non-convex based regularizers to solve the underdetermined MEG inverse problem. The signal to be reconstructed is considered to have a structure which entails group-wise sparsity and within group sparsity among its covariates. We discuss the usage of l2 norm regularization and smoothed l0 (SL0) norm regularization to impose group-wise and within group sparsity respectively. In addition, we introduce a novel criterion which if satisfied, guarantees global optimality while solving this non-convex optimization problem. We use proximal gradient descent as the method of optimization as it promises faster convergence rates. We show that our algorithm can successfully recover a sparse signal with a smaller number of measurements than the conventional l1 regularization framework.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.