English
Related papers

Related papers: Dynamic Sensor Selection for Reliable Spectrum Sen…

200 papers

We develop an algorithm to explore an environment to generate a measurement model for use in future localization tasks. Ergodic exploration with respect to the likelihood of a particular class of measurement (e.g., a contact detection…

Robotics · Computer Science 2018-08-29 Ian Abraham , Anastasia Mavrommati , Todd D. Murphey

This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, asymptotic sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical compressed sensing and…

Functional Analysis · Mathematics 2014-07-08 Bogdan Roman , Anders Hansen , Ben Adcock

We consider designing a robust structured sparse sensing matrix consisting of a sparse matrix with a few non-zero entries per row and a dense base matrix for capturing signals efficiently We design the robust structured sparse sensing…

Signal Processing · Electrical Eng. & Systems 2019-02-06 Tao Hong , Xiao Li , Zhihui Zhu , Qiuwei Li

Technological advancements in miniaturization and wireless communications are yielding more affordable and versatile sensors and, in turn, more applications in which a network of sensors can be actively managed to best support overall…

Systems and Control · Electrical Eng. & Systems 2025-09-10 Patrick Kreidl

A compressed sensing method consists of a rectangular measurement matrix, $M \in \mathbbm{R}^{m \times N}$ with $m \ll N$, together with an associated recovery algorithm, $\mathcal{A}: \mathbbm{R}^m \rightarrow \mathbbm{R}^N$. Compressed…

Information Theory · Computer Science 2013-02-26 M. A. Iwen

Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy this…

Computational Complexity · Computer Science 2012-11-06 Pascal Koiran , Anastasios Zouzias

A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming the number of targets K is small (i.e., K much less than N^2), then we can transmit a sufficiently "incoherent"…

Numerical Analysis · Mathematics 2015-05-13 Matthew A. Herman , Thomas Strohmer

This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples…

Information Theory · Computer Science 2015-05-28 Thong T. Do , Lu Gan , Nam H. Nguyen , Trac D. Tran

Consider the estimation of an unknown parameter vector in a linear measurement model. Centralized sensor selection consists in selecting a set of k_s sensor measurements, from a total number of m potential measurements. The performance of…

Information Theory · Computer Science 2012-08-07 Fabian Altenbach , Steven Corroy , Georg Böcherer , Rudolf Mathar

We consider the design of a linear sensing system with a fixed energy budget assuming that the sampling noise is the dominant noise source. The energy constraint implies that the signal energy per measurement decreases linearly with the…

Signal Processing · Electrical Eng. & Systems 2019-05-22 Yang Lu , Wei Dai , Yonina C. Eldar

In this paper, we propose a multiobjective optimization framework for the sensor selection problem in uncertain Wireless Sensor Networks (WSNs). The uncertainties of the WSNs result in a set of sensor observations with insufficient…

Systems and Control · Computer Science 2016-09-21 Nianxia Cao , Sora Choi , Engin Masazade , Pramod K. Varshney

In this paper we address the problem of finding the sensing capacity of sensor networks for a class of linear observation models and a fixed SNR regime. Sensing capacity is defined as the maximum number of signal dimensions reliably…

Information Theory · Computer Science 2007-07-13 Shuchin Aeron , Manqi Zhao , Venkatesh Saligrama

The weak-$\ell^p$ norm can be used to define a measure $s$ of sparsity. When we compute $s$ for the discrete cosine transform coefficients of a signal, the value of $s$ is related to the information content of said signal. We use this value…

Information Theory · Computer Science 2020-02-25 Alfredo Nava-Tudela

In dynamic MRI, sufficient time resolution can often only be obtained using imaging protocols which produce undersampled data for each image in the time series. This has led to the popularity of compressed sensing (CS) based image…

Sparse representation has attracted great attention because it can greatly save storage resources and find representative features of data in a low-dimensional space. As a result, it may be widely applied in engineering domains including…

Neural and Evolutionary Computing · Computer Science 2022-11-09 Chunming Jiang , Yilei Zhang

We introduce a learning-based algorithm to obtain a measurement matrix for compressive sensing related recovery problems. The focus lies on matrices with a constant modulus constraint which typically represent a network of analog phase…

Signal Processing · Electrical Eng. & Systems 2021-10-15 Michael Koller , Wolfgang Utschick

Compressive sensing (CS) is a signal processing technique that enables sub-Nyquist sampling and near lossless reconstruction of a sparse signal. The technique is particularly appealing for neural signal processing since it avoids the issues…

Signal Processing · Electrical Eng. & Systems 2021-02-02 Hyunseok Park , Xilin Liu

Soft sensing is a way to indirectly obtain information of signals for which direct sensing is difficult or prohibitively expensive. It may not \textit{a priori} be evident which sensors provide useful information about the target signal,…

Systems and Control · Electrical Eng. & Systems 2024-09-17 Le Wang , Ying Wang , Yu Qiu , Mian Li , Håkan Hjalmarsson

In this paper, we exploit the theory of compressive sensing to perform detection of a random source in a dense sensor network. When the sensors are densely deployed, observations at adjacent sensors are highly correlated while those…

Information Theory · Computer Science 2017-07-27 Thakshila Wimalajeewa , Pramod K. Varshney

In this work, we consider a sensor selection drawn at random by a sampling with replacement policy for a linear time-invariant dynamical system subject to process and measurement noise. We employ the Kalman filter to estimate the state of…

Systems and Control · Electrical Eng. & Systems 2023-03-15 Christopher I. Calle , Shaunak D. Bopardikar
‹ Prev 1 4 5 6 7 8 10 Next ›