Scribd
Upload
78 views

CS-541 Wireless Sensor Networks: Spring Semester 2016-2017

This document discusses signal sampling techniques for wireless sensor networks. It covers compressed sensing recovery using iterative thresholding algorithms and dictionary learning approaches. It also describes how compressive sensing principles can be applied to gather data efficiently in wireless sensor networks and for imaging applications using single photon detectors.

Uploaded by

Kumar Sarthak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
78 views

CS-541 Wireless Sensor Networks: Spring Semester 2016-2017

This document discusses signal sampling techniques for wireless sensor networks. It covers compressed sensing recovery using iterative thresholding algorithms and dictionary learning approaches. It also describes how compressive sensing principles can be applied to gather data efficiently in wireless sensor networks and for imaging applications using single photon detectors.

Uploaded by

Kumar Sarthak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

CS-541

Wireless Sensor Networks


Lecture 5: Signal Sampling for WSN
PART B

Spring Semester 2016-2017

Prof Panagiotis Tsakalides, Dr Athanasia Panousopoulou, Dr Gregory Tsagkatakis

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 1
University of Crete, Computer Science Department
Today’s objectives

Compressed Sensing recovery

Dictionary Learning

Structured sparsity models

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 2
University of Crete, Computer Science Department
Compressed Sensing
(or compressive sensing, compressed sampling…)

• Goal: Recover signal


from measurements
• Problem: Random
projection not full rank
(ill-posed inverse problem)
• Solution: Exploit the sparse/compressible
geometry of acquired signal
• Recovery via (convex) sparsity penalty or greedy algorithms

𝑥 = arg min 𝑥 0 subject to Φ𝑥 = 𝑦


𝑥
[Donoho; Candes, Romberg, Tao, 2004]
NP-hard!
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 3
University of Crete, Computer Science Department
What about recovery?

Can we recovery the original signal from its RP?


YES…. for sparse signal

Biological Environmental Astronomical

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 4
University of Crete, Computer Science Department
How many measurements?

Φ satisfies Restricted Isometry Property (RIP)


For all x that are K sparse

When Φ MxN satisfies RIP of order 2K with δ<√(2)-1,

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 5
University of Crete, Computer Science Department
Standard CS Recovery
• Iterative Thresholding

update signal estimate


prune signal estimate
(best K-term approx)
update residual

Adapted from “Model-based Compressive Sensing”, by Volkan Cevher


CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 6
University of Crete, Computer Science Department
Sparsity in a basis: Dictionaries

Sound WSN

Images

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 7
University of Crete, Computer Science Department
Sparsity on dictionaries

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 8
University of Crete, Computer Science Department
Sparse Modeling: Approach 1

• Step 1: Choose a signal model with structure


• e.g. bandlimited, smooth with r vanishing moments, etc.
• Step 2: Analytically design a sparsifying basis/frame
that exploits this structure
• e.g. DCT, wavelets, Gabor, etc.
DCT Wavelets Gabor

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 9
University of Crete, Computer Science Department
WSN data on dictionaries

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 10
University of Crete, Computer Science Department
Sparse Modeling: Approach 2

• Learn the sparsifying basis/frame from training data


• Problem formulation: given a large number of training signals,
design a dictionary D that simultaneously sparsifies the training
data

• Called sparse coding / dictionary learning

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 11
University of Crete, Computer Science Department
Dictionary Learning

• Requirement: Incoherence: correlation between  and D

 (, d )  N  max | i , d j
1i , j  N

• Typical formulation: Given training data

• Efficient algorithms, MOD, K-SVD

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 12
University of Crete, Computer Science Department
K–SVD – An Overview

Initialize D
D
Sparse Coding
Use MP or BP
T
X
Dictionary
Update
Column-by-Column by SVD
computation

Aharon, Elad & Bruckstein (‘04)


CS-541 Wireless Sensor
Networks University of
Spring Semester 2016-2017 13
Crete, Computer Science
Department
Complex Signal Reconstruction

Possible if signal is sparse in dictionary


where

Reconstruction based on L1 minimization

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 14
University of Crete, Computer Science Department
Compressive Data Gathering in WSN

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 15
University of Crete, Computer Science Department
Compressive Data Gathering in WSN

y4m  y3m   4 x4m


y3m  y2m  3 x3m
y2m  y1m   2 x2m

Routing path y1m  1 x1m


1 {1,1}
random

x1
…… ……………………
x2
…… …………………… x3
…… …………………… .
ylmm 1  2 3....l ,.... m
xn

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 16
University of Crete, Computer Science Department
Compressive Data Gathering

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 17
University of Crete, Computer Science Department
CS in Wireless Video Sensor Networks

image
reconstruction
scene
or
single photon processing
detector

DMD
D
random
pattern on
DMD array

…
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 18
University of Crete, Computer Science Department
Extending CS

Joint sparsity
• share sparse components
• different coefficients

Mixed -norm solutions

Greedy solutions: simultaneous orthogonal matching pursuit

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 19
University of Crete, Computer Science Department
Universal Distributed Sensing via Random Projections
M. F. Duarte, M. B. Wakin, D. Baron, and R. G. Baraniuk
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 20
University of Crete, Computer Science Department
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 21
University of Crete, Computer Science Department
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 22
University of Crete, Computer Science Department
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 23
University of Crete, Computer Science Department
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 24
University of Crete, Computer Science Department
CS-541 Wireless Sensor Networks
Spring Semester 2016-2017 25
University of Crete, Computer Science Department
Reading material

Rubinstein, R., Bruckstein, A.M., and Elad, M. (2010), "Dictionaries


for Sparse Representation Modeling", Proceedings of the IEEE, 98 (6):
1045–1057, doi:10.1109/JPROC.2010.2040551

Luo, Chong, Feng Wu, Jun Sun, and Chang Wen Chen. "Compressive
data gathering for large-scale wireless sensor networks." In ACM
Proceedings of the 15th annual international conference on Mobile
computing and networking, pp. 145-156., 2009.

CS-541 Wireless Sensor Networks


Spring Semester 2016-2017 26
University of Crete, Computer Science Department

You might also like