Signal Processing with Compressive Measurements

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Signal Processing with Compressive Measurements Mark Davenport, Petros Boufounos, Michael Wakin, Richard Baraniuk TR2010-002 February 2010 Abstract The recently introduced theory of compressive sensing enables the recovery of sparse or compressive signals from a small set of nonadaptive, linear measurements. If properly chosen, the number of measurements can be much smaller than the number of Nyquist-rate samples. In- terestingly, it has been shown that random projections are a near-optimal measurement scheme. This has inspired the design of hardware systems that directly implement random measurement protocols. However, despite the intense focus of the community on signal recovery, many (if not most) signal processing problems do not require full signal recovery. In this paper, we take some first steps in the direction of solving inference problems - such as detection, classification, or estimation - and filtering problems using only compressive measurements and without ever reconstructing the signals involved. We provide theoretical bounds along with experimental results. Journal of Special Topics in Signal Processing This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Copyright c Mitsubishi Electric Research Laboratories, Inc., 2010 201 Broadway, Cambridge, Massachusetts 02139 MERLCoverPageSide2 1 Signal Processing with Compressive Measurements Mark A. Davenport, Student Member, IEEE, Petros T. Boufounos, Member, IEEE, Michael B. Wakin, Member, IEEE, and Richard G. Baraniuk, Fellow, IEEE Abstract—The recently introduced theory of compressive flexible, cheaper and, therefore, more ubiquitous than sensing enables the recovery of sparse or compressible sig- their analog counterparts. nals from a small set of nonadaptive, linear measurements. As a result of this success, the amount of data gener- If properly chosen, the number of measurements can be much smaller than the number of Nyquist-rate samples. ated by sensing systems has grown from a trickle to a Interestingly, it has been shown that random projections torrent. We are thus confronted with the challenges of: are a near-optimal measurement scheme. This has inspired 1) acquiring signals at ever higher sampling rates, the design of hardware systems that directly implement 2) storing the resulting large amounts of data, and random measurement protocols. However, despite the in- 3) processing/analyzing large amounts of data. tense focus of the community on signal recovery, many (if not most) signal processing problems do not require full Until recently the first challenge was largely ignored by signal recovery. In this paper, we take some first steps in the signal processing community, with most advances the direction of solving inference problems—such as de- being made by hardware designers. Meanwhile, the tection, classification, or estimation—and filtering problems signal processing community made tremendous progress using only compressive measurements and without ever on the remaining two challenges, largely via research in reconstructing the signals involved. We provide theoretical bounds along with experimental results. the fields of modeling, compression, and dimensionality reduction. However, the solutions to these problems typically rely on having a complete set of digital samples. I. INTRODUCTION Only after the signal is acquired—presumably using a A. From DSP to CSP sensor tailored to the signals of interest—could one In recent decades the digital signal processing (DSP) distill the necessary information ultimately required by community has enjoyed enormous success in developing the user or the application. This requirement has placed algorithms for capturing and extracting information from a growing burden on analog-to-digital converters [1]. As signals. Capitalizing on the early work of Whitaker, the required sampling rate is pushed higher, these devices Nyquist, and Shannon on sampling and representation move inevitably toward a physical barrier, beyond which of continuous signals, signal processing has moved from their design becomes increasingly difficult and costly [2]. the analog to the digital domain and ridden the wave of Thus, in recent years, the signal processing community Moore’s law. Digitization has enabled the creation of has also begun to address the challenge of signal acquisi- sensing and processing systems that are more robust, tion more directly by leveraging its successes in address- ing the second two. In particular, compressive sensing Copyright (c) 2009 IEEE. Personal use of this material is (CS) has emerged as a framework that can significantly permitted. However, permission to use this material for any other reduce the acquisition cost at a sensor. CS builds on the purposes must be obtained from the IEEE by sending a request to [email protected]. work of Candes,` Romberg, and Tao [3], and Donoho [4], MAD and RGB are with the Department of Electrical and Computer who showed that a signal that can be compressed using Engineering, Rice University, Houston, TX 77005. They are supported classical methods such as transform coding can also be by the grants NSF CCF-0431150, CCF-0728867, CNS-0435425, and CNS-0520280, DARPA/ONR N66001-08-1-2065, ONR N00014-07-1- efficiently acquired via a small set of nonadaptive, linear, 0936, N00014-08-1-1067, N00014-08-1-1112, and N00014-08-1-1066, and usually randomized measurements. AFOSR FA9550-07-1-0301, ARO MURI W311NF-07-1-0185, ARO A fundamental difference between CS and classical MURI W911NF-09-1-0383, and by the Texas Instruments Leader- ship University Program. PTB is with Mitsubishi Electric Research sampling is the manner in which the two frameworks Laboratories, Cambridge, MA 02139. MBW is with the Division deal with signal recovery, i.e., the problem of recovering of Engineering, Colorado School of Mines, Golden, CO 80401. He the signal from the measurements. In the Shannon- is supported by NSF grants DMS-0603606 and CCF-0830320, and DARPA Grant HR0011-08-1-0078. Email: fmd, [email protected], pet- Nyquist framework, signal recovery is achieved through [email protected], [email protected] sinc interpolation—a linear process that requires little computation and has a simple interpretation. In CS, ate. However, a key objective of this paper is to illustrate however, signal recovery is achieved using nonlinear the agnostic and universal nature of random compressive and relatively expensive optimization-based or iterative measurements as a compact signal representation. These algorithms [3–5]. Thus, up to this point, most of the features enable the design of exceptionally efficient and CS literature has focused on improving the speed and flexible compressive sensing hardware that can be used accuracy of this process [6–9]. for the acquisition of a variety of signal classes and However, signal recovery is not actually necessary applied to a variety of inference tasks. in many signal processing applications. Very often we As has been demonstrated in the CS literature, for are only interested in solving an inference problem example, random measurements can be used to acquire (extracting certain information from measurements) or any sparse signal without requiring advance knowledge in filtering out information that is not of interest before of the locations of the nonzero coefficients. Thus, com- further processing. While one could always attempt to re- pressive measurements are agnostic in the sense that they cover the full signal from the compressive measurements capture the relevant information for the entire class of and then solve the inference or filtering problem using possible K-sparse signals. We extend this concept to the traditional DSP techniques, this approach is typically CSP framework and demonstrate that it is possible to suboptimal in terms of both accuracy and efficiency. design agnostic measurement schemes that preserve the This paper takes some initial steps towards a general necessary structure of large signal classes in a variety of framework for what we call compressive signal process- signal processing settings. ing (CSP), an alternative approach in which signal pro- Furthermore, we observe that one can select a random- cessing problems are solved directly in the compressive ized measurement scheme without any prior knowledge measurement domain without first resorting to a full- of the signal class. For instance, in conventional CS it scale signal reconstruction. In espousing the potential is not necessary to know the transform basis in which of CSP we focus on four fundamental signal processing the signal has a sparse representation when acquiring problems: detection, classification, estimation, and filter- the measurements. The only dependence is between the ing. The first three enable the extraction of information complexity of the signal class (e.g., the sparsity level from the samples, while the last enables

Load more