scispace - formally typeset
Proceedings ArticleDOI

Efficient cross-correlation via sparse representation in sensor networks

TLDR
This work proposes cross-correlation via sparse representation: a new framework for ranging based on l1-minimization, which shows that the proposed framework, together with the proposed correlation domain achieved up to two order of magnitude better performance compared to naive approaches such as working on DCT domain and downsampling.
Abstract
Cross-correlation is a popular signal processing technique used in numerous localization and tracking systems for ob-taining reliable range information. However, a practical efficient implementation has not yet been achieved on resource constrained wireless sensor network platforms. We propose cross-correlation via sparse representation: a new framework for ranging based on l1-minimization. The key idea is to compress the signal samples on the mote platform by efficient random projections and transfer them to a central device, where a convex optimization process estimates the range by exploiting its sparsity in our proposed correlation domain. Through sparse representation theory validation, extensive empirical studies and experiments on an end-to-end acoustic ranging system implemented on resource limited off-the-shelf sensor nodes, we show that the proposed framework, together with the proposed correlation domain achieved up to two order of magnitude better performance compared to naive approaches such as working on DCT domain and downsampling. Furthermore, compared to cross-correlation results, 30–40% measurements are sufficient to obtain precise range estimates with an additional bias of only 2–6 cm for high accuracy application requirements, while 5% measurements are adequate to achieve approximately 100 cm precision for lower accuracy applications.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Energy-Efficient Sensing in Wireless Sensor Networks Using Compressed Sensing

TL;DR: It is shown that, for some applications, compressed sensing and distributed compressed sensing can provide greater energy efficiency than transform coding and model-based adaptive sensing in wireless sensor networks.
Journal ArticleDOI

Ear-phone: a context-aware noise mapping using smart phones

TL;DR: Ear-Phone as discussed by the authors leverages context-aware sensing and develops classifiers to accurately determine the phone sensing context, upon context discovery, Ear-Phone automatically decides whether to sense or not.
Proceedings ArticleDOI

Radio-based device-free activity recognition with radio frequency interference

TL;DR: This paper investigates the impact of RFI on device-free CSI-based location-oriented activity recognition and proposes a number of counter measures to mitigate the impact on the CSI vectors and improve the location- oriented activity recognition performance.
Journal ArticleDOI

Mining Road Network Correlation for Traffic Estimation via Compressive Sensing

TL;DR: This paper presents a transport traffic estimation method which leverages road network correlation and sparse traffic sampling via the compressive sensing technique to achieve a city-scale traffic estimation with only a small number of probe vehicles, largely reducing the system operating cost.
Proceedings ArticleDOI

Efficient background subtraction for real-time tracking in embedded camera networks

TL;DR: This paper proposes a new background subtraction method which is both accurate and computational efficient and demonstrates the feasibility of the proposed method by the implementation and evaluation of an end-to-end real-time embedded camera network target tracking application.
References
More filters
Journal ArticleDOI

Regression Shrinkage and Selection via the Lasso

TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Book

Compressed sensing

TL;DR: It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.
Journal ArticleDOI

Atomic Decomposition by Basis Pursuit

TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI

Robust Face Recognition via Sparse Representation

TL;DR: This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.
Journal ArticleDOI

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
Related Papers (5)