Summary: BASIS PURSUIT IN SENSOR NETWORKS
João F. C. Mota1,2
, João M. F. Xavier2
, Pedro M. Q. Aguiar2
, and Markus Püschel3
1
Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, USA
2
Institute of Systems and Robotics, Instituto Superior Técnico, Lisbon, Portugal
3
Department of Computer Science, ETH Zurich, Switzerland
ABSTRACT
Basis Pursuit (BP) finds a minimum 1-norm vector z that satisfies
the underdetermined linear system Mz = b, where the matrix M
and vector b are given. Lately, BP has attracted attention because of
its application in compressed sensing, where it is used to reconstruct
signals by finding the sparsest solutions of linear systems. In this
paper, we propose a distributed algorithm to solve BP. This means
no central node is used for the processing and no node has access to
all the data: the rows of M and the vector b are distributed over a set

Source: Aguiar, Pedro M. Q. - Institute for Systems and Robotics (Lisbon)
Instituto de Sistemas e Robotica - Polo de Lisboa (Institute for Systems and Robotics, Lisbon pole) Portugal

Collections: Engineering