1 / 47

Richard Baraniuk Rice University

Scalable Distributed Networked Sensing. Richard Baraniuk Rice University. The Digital Universe. Size: 281 billion gigabytes generated in 2007 digital bits > stars in the universe growing by a factor of 10 every 5 years > Avogadro’s number (6.02x10 23 ) in 15 years

Download Presentation

Richard Baraniuk Rice University

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. ScalableDistributed Networked Sensing Richard Baraniuk Rice University

  2. The Digital Universe • Size: 281 billion gigabytes generated in 2007 digital bits > stars in the universe growing by a factor of 10 every 5 years > Avogadro’s number (6.02x1023) in 15 years • Growth fueled by multimedia data audio, images, video, surveillance cameras, sensor nets, … • In 2007 digital data generated > total storage by 2011, ½ of digital universe will have no home [Source: IDC Whitepaper “The Diverse and Exploding Digital Universe” March 2008]

  3. Networked Sensing Goals • sense • communicate • fuse • infer (detect, recognize, etc.) • predict • actuate/navigate UAVs networkinfrastructure UGVs humanintelligence

  4. Networked Sensing Challenges • growing volumes of sensor data • increasingly diverse data • diverse and changing operating conditions • increasing mobility UAVs networkinfrastructure UGVs humanintelligence

  5. Research Challenges • Shear amount of data that must be acquired and communicated J sensors N samples/pixels per sensor • Amount of data grows as O(JN) • leads to communication and computation collapse • Must fuse diverse data types

  6. Our Approach • Re-think the sensing and data processing pipeline • New data representation: random encoding • preserves info in a wide range of data types • acts as source/channel fountain code • supports efficient processing and inference algorithms • supports efficient fusion from multiple sensors • supports a range of actuation/navigation strategies • scalable in resolution N and number of sensors J

  7. -0-Randomized Encoding

  8. Today’s Data Pipeline • based onShannon-Nyquist theory (sample 2x faster than the signal BW) • wide-band signals require high-rate sampling • ADC performanceFOM doubles every 6-8 years analog world ADC digital processing info • compression • detection • classification • estimation • tracking …

  9. analog world ADC digital processing info IDFT signal Fourier coefficients

  10. analog world ADC digital processing info IDFT digitalmsmnts sampling operator signal

  11. analog world ADC digital processing info • Sampling rate determined by bandwidth of • But in many applications, is sparse IDFT digitalmsmnts sampling operator signal

  12. Sparsity largewaveletcoefficients (blue = 0) largeGabor (TF)coefficients pixels widebandsignalsamples frequency time

  13. Sparsity • Communications: large spectral bandwidth but small information rate (spread spectrum) • Sensor arrays: large number of sensors but small number of emitters • Wide-field imaging: large surveillance area but small number of targets • Key (recent) mathematical fact:Sparse signals support dimensionality reduction(sub-Nyquist sampling)

  14. analog world ADC digital processing info IDFT digitalmsmnts sampling operator signal

  15. analog world CS-ADC digital processing info • Dimensionality reduction (compressive sensing, CS) • Can preserve all information in sparse in • Can recover from IDFT digitalmsmnts sampling operator signal

  16. analog world CS-ADC digital processing info • Can preserve all information in sparse in • Natural to design “random sampling” systems IDFT digitalmsmnts sampling operator signal

  17. analog world CS-ADC digital processing info N = Nyquist BW of K = information rateex: number of active tones IDFT digitalmsmnts sampling operator signal Sampling rate: M = O(K log N)

  18. analog world CS-ADC digital processing info • Reduces demands on: • hardware • processing algorithms • communication network IDFT digitalmsmnts sampling operator signal Sampling rate: M = O(K log N)

  19. -1-Scalable Sensingvia Randomized Encoding

  20. Single-Pixel Camera scene single photon detector imagereconstructionorprocessing DMD DMD random pattern on DMD array w/ Kevin Kelly

  21. Example Image Acquisition target 65536 pixels 1300 measurements (2%) 11000 measurements (16%)

  22. -2-Scalable Decision Makingvia Randomized Encoding

  23. Scalable Decision Making • Many applications involve signal inferencedetection < classification < estimation < reconstruction • Good news: RE supports efficient learning, inference, processing directly on compressive measurements • Random projections ~ sufficient statisticsfor signals with concise geometrical structure

  24. Matched Filter • Detection/classification with L unknown articulation parameters • Ex: position and pose of a vehicle in an image • Ex: time delay of a radar signal return • Matched filter: joint parameter estimation and detection/classification • compute sufficient statistic for each potential target and articulation • compare “best” statistics to detect/classify

  25. Matched Filter Geometry data • Detection/classification with L unknown articulation parameters • Images are points in • Classify by finding closesttarget template to datafor each class (AWG noise) • distance or inner product target templatesfromgenerative modelor training data (points)

  26. Matched Filter Geometry data • Detection/classification with L unknown articulation parameters • Images are points in • Classify by finding closesttarget template to data • As template articulationparameter changes, points map out a L-dimnonlinear manifold • Matched filter classification = closest manifold search articulation parameter space

  27. CS for Manifolds • Theorem: random measurements stably embed manifoldwhp [B, Wakin, FOCM ’08]related work:[Indyk and Naor, Agarwal et al., Dasgupta and Freund] • Stable embedding • Proved via concentration inequality arguments(JLL/CS relation)

  28. CS for Manifolds • Theorem: random measurements stably embed manifoldwhp • Enables parameter estimation and MFdetection/classificationdirectly on compressivemeasurements • L very small in many applications (# articulations)

  29. Smashed Filter • Geometry of the matched filtering process amenable to dimensionality reduction (manifold) • Can implement matched filter directly on compressive measurements

  30. Smashed Filter • Random shift and rotation (L=3 dim. manifold) • Noise added to measurements • Goal: identify most likely position for each image class identify most likely class using nearest-neighbor test more noise classification rate (%) avg. shift estimate error more noise number of measurements M number of measurements M

  31. -3-Scalable Data Fusionvia Randomized Encoding

  32. Multisensor Inference • Example: Network of J cameras observing an articulating object • Each camera’s images lie on L-dim manifold in • How to efficiently fuse imagery from J cameras to solve an inference problem while minimizing network communication?

  33. Multisensor Fusion • Fusion: stack corresponding image vectors taken at the same time • Fused images still lie on L-dim manifold in“joint manifold”

  34. Multisensor Fusion via JM+RE • Can take random RE measurements of stacked images and process or make inferences w/ unfused RE w/ unfused and no RE

  35. Multisensor Fusion via JM+RE • Can compute RE measurements in-network • ex: as we transmit to collection/processing point

  36. Simulation Results • J=3 CS cameras, each N=320x240 resolution • M=200 random measurements per camera • Two classes • truck w/ cargo • truck w/ no cargo • Goal: classify a test image class 1 class 2

  37. Simulation Results • J=3 CS cameras, each N=320x240 resolution • M=200 random measurements per camera • Two classes • truck w/ cargo • truck w/ no cargo • Smashed filtering • independent • majority vote • joint manifold Joint Manifold

  38. -4-Scalable Communicationvia Randomized Encoding

  39. Scalable Communication • RE is democratic • each measurement carries the same amount of information • robust to measurement loss and quantization simple encoding • Ex: wireless streaming application with data loss • conventional: complicated (unequal) error protection of compressed data • DCT/wavelet low frequency coefficients • RE: merely stream additional measurements and reconstruct using those that arrive safely (fountain-like) • Joint manifold fusion supports in-network computation

  40. -5-Scalable Navigationvia Randomized Encoding

  41. Scalable Navigation • Manifold-based pattern recognition supports adaptive navigation (to improve recognition performance) • Both manifolds and navigation strategies preserved by random encoding

  42. Summary • Scalable distributed sensing requires a re-think of the entire sensing and data processing pipeline • New data representation: random encoding • preserves info in a wide range of data types • acts as source/channel fountain codes • supports efficient processing and inference algorithms • supports efficient fusion from multiple sensors • supports a range of actuation/navigation strategies • scalable in resolution N and number of sensors J dsp.rice.edu/cs

  43. Manifold Learning via Joint Manifolds • Goal: Learn embeddingof 2D translating ellipse(with noise) N=45x45=2025 pixelsJ=20 views at different angles

  44. Manifold Learning via Joint Manifolds • Goal: Learn embeddingof 2D translating ellipse(with noise) N=45x45=2025 pixelsJ=20 views • Embeddingslearnedseparately

  45. Manifold Learning via Joint Manifolds • Goal: Learn embeddingof 2D translating ellipse(with noise) N=45x45=2025 pixelsJ=20 views • Embeddingslearnedseparately • Embedding learned jointly

  46. Manifold Learning via JM+RE • Goal:Learn embeddingvia random compressivemeasurements N=45x45=2025 pixels J=20 views • Embeddingslearnedseparately • Embedding learned jointly M=100 measurements per view

More Related