1 Distortion-Rate for Non-Distributed and Distributed Estimation with WSNs Presenter: Ioannis D. Schizas May 5, 2005 EE8510 Project May 5, 2005 EE8510.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

1 Closed-Form MSE Performance of the Distributed LMS Algorithm Gonzalo Mateos, Ioannis Schizas and Georgios B. Giannakis ECE Department, University of.
Dimension reduction (2) Projection pursuit ICA NCA Partial Least Squares Blais. “The role of the environment in synaptic plasticity…..” (1998) Liao et.
The Stability of a Good Clustering Marina Meila University of Washington
General Classes of Lower Bounds on Outage Error Probability and MSE in Bayesian Parameter Estimation Tirza Routtenberg Dept. of ECE, Ben-Gurion University.
Online Performance Guarantees for Sparse Recovery Raja Giryes ICASSP 2011 Volkan Cevher.
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
ECE Department Rice University dsp.rice.edu/cs Measurements and Bits: Compressed Sensing meets Information Theory Shriram Sarvotham Dror Baron Richard.
On Systems with Limited Communication PhD Thesis Defense Jian Zou May 6, 2004.
Discovery of Conservation Laws via Matrix Search Oliver Schulte and Mark S. Drew School of Computing Science Simon Fraser University Vancouver, Canada.
0 Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
A Single-letter Characterization of Optimal Noisy Compressed Sensing Dongning Guo Dror Baron Shlomo Shamai.
Ergodic Capacity of MIMO Relay Channel Bo Wang and Junshan Zhang Dept. of Electrical Engineering Arizona State University Anders Host-Madsen Dept. of Electrical.
Location Estimation in Sensor Networks Moshe Mishali.
1 Network Source Coding Lee Center Workshop 2006 Wei-Hsin Gu (EE, with Prof. Effros)
© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Gerhard Maierbacher Scalable Coding Solutions for Wireless Sensor Networks IT.
BASiCS Group University of California at Berkeley Generalized Coset Codes for Symmetric/Asymmetric Distributed Source Coding S. Sandeep Pradhan Kannan.
Computing Sketches of Matrices Efficiently & (Privacy Preserving) Data Mining Petros Drineas Rensselaer Polytechnic Institute (joint.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Linear Codes for Distributed Source Coding: Reconstruction of a Function of the Sources -D. Krithivasan and S. Sandeep Pradhan -University of Michigan,
The Role of Specialization in LDPC Codes Jeremy Thorpe Pizza Meeting Talk 2/12/03.
Matrix Approach to Simple Linear Regression KNNL – Chapter 5.
RLSELE Adaptive Signal Processing 1 Recursive Least-Squares (RLS) Adaptive Filters.
Signal Strength based Communication in Wireless Sensor Networks (Sensor Network Estimation) Imran S. Ansari EE 242 Digital Communications and Coding (Fall.
Distributed Constraint Optimization Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
Design Criteria and Construction of Non-coherent Space-Time Constellations Mohammad Jaber Borran, Ashutosh Sabharwal, and Behnaam Aazhang Rice University.
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
Adaptive CSMA under the SINR Model: Fast convergence using the Bethe Approximation Krishna Jagannathan IIT Madras (Joint work with) Peruru Subrahmanya.
November 1, 2012 Presented by Marwan M. Alkhweldi Co-authors Natalia A. Schmid and Matthew C. Valenti Distributed Estimation of a Parametric Field Using.
May 7, 2014, Florence, Italy Retrospective Interference Alignment for the 3-user MIMO Interference Channel with.
Image Restoration using Iterative Wiener Filter --- ECE533 Project Report Jing Liu, Yan Wu.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.
Brian Macpherson Ph.D, Professor of Statistics, University of Manitoba Tom Bingham Statistician, The Boeing Company.
CS 782 – Machine Learning Lecture 4 Linear Models for Classification  Probabilistic generative models  Probabilistic discriminative models.
Efficient computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L 1 Norm Anders Eriksson and Anton van den Hengel.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
BCS547 Neural Decoding.
Lecture 2: Statistical learning primer for biologists
Simulation Study for Longitudinal Data with Nonignorable Missing Data Rong Liu, PhD Candidate Dr. Ramakrishnan, Advisor Department of Biostatistics Virginia.
By: Aaron Dyreson Supervising Professor: Dr. Ioannis Schizas
1 Consensus-Based Distributed Least-Mean Square Algorithm Using Wireless Ad Hoc Networks Gonzalo Mateos, Ioannis Schizas and Georgios B. Giannakis ECE.
A Low-Complexity Universal Architecture for Distributed Rate-Constrained Nonparametric Statistical Learning in Sensor Networks Avon Loy Fernandes, Maxim.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
1 WELCOME Chen. 2 Simulation of MIMO Capacity Limits Professor: Patric Ö sterg å rd Supervisor: Kalle Ruttik Communications Labortory.
Yi Jiang MS Thesis 1 Yi Jiang Dept. Of Electrical and Computer Engineering University of Florida, Gainesville, FL 32611, USA Array Signal Processing in.
Rate Distortion Theory. Introduction The description of an arbitrary real number requires an infinite number of bits, so a finite representation of a.
Chapter 8 Estimation ©. Estimator and Estimate estimator estimate An estimator of a population parameter is a random variable that depends on the sample.
Dimension reduction (2) EDR space Sliced inverse regression Multi-dimensional LDA Partial Least Squares Network Component analysis.
ベーテ自由エネルギーに対するCCCPアルゴリズムの拡張
Computing and Compressive Sensing in Wireless Sensor Networks
Tirza Routtenberg Dept. of ECE, Ben-Gurion University of the Negev
Motion Segmentation with Missing Data using PowerFactorization & GPCA
General Strong Polarization
Power-Efficient Non-coherent Space-Time Constellations
Basic Algorithms Christina Gallner
Random Noise in Seismic Data: Types, Origins, Estimation, and Removal
Nuclear Norm Heuristic for Rank Minimization
Unfolding Problem: A Machine Learning Approach
Towards Understanding the Invertibility of Convolutional Neural Networks Anna C. Gilbert1, Yi Zhang1, Kibok Lee1, Yuting Zhang1, Honglak Lee1,2 1University.
Bounds for Optimal Compressed Sensing Matrices
Jamming Resistant Encoding
Foundation of Video Coding Part II: Scalar and Vector Quantization
Recursively Adapted Radial Basis Function Networks and its Relationship to Resource Allocating Networks and Online Kernel Learning Weifeng Liu, Puskal.
CIS 700: “algorithms for Big Data”
Unfolding with system identification
Chapter 8 Estimation.
Compute-and-Forward Can Buy Secrecy Cheap
Sebastian Semper1 and Florian Roemer1,2
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

1 Distortion-Rate for Non-Distributed and Distributed Estimation with WSNs Presenter: Ioannis D. Schizas May 5, 2005 EE8510 Project May 5, 2005 EE8510 Project Presentation Presentation Acknowledgements: Profs. G. B. Giannakis and N. Jindal

2 Motivation and Prior Work  Energy/Bandwidth constraints in WSN call for efficient compression-encoding  Bounds on minimum achievable distortion under prescribed rate important for :  Compressing and reconstructing sensor observations Best known inner and outer bounds in [Berger-Tung’78] Iterative determination of achievable D-R region [Gastpar et. al’04]  Estimating signals (parameters) under rate constraints The CEO problem [Viswanathan et. al’97, Oohama’98, Chen et. al’04, Pandya et. al’04] Rate-constrained distributed estimation [Ishwar et. al’05]

3 Problem Statement  Linear Model:  s, n uncorrelated and Gaussian and .. .. is known and full column rank .. Goal: Determine D-R function or more strict achievable D-R regions than obvious upper bounds when estimating s under rate constraints.

4 Point-to-Point Link (Single-Sensor)  Two non-distributed encoding options  Estimation errors i.Compress-Estimate (C-E) ii. Estimate-Compress (E-C) = f (terms due to compression), =1,2

5 E-C outperforms C-E  Special Cases: Scalar case: Vector case (p=1): If If, then Matrix case: Theorem 1:, then similar ‘threshold rates’ for which

6 Optimality of Estimate-Compress  Extends the result in [Sakrison’68, Wolf-Ziv’70] in linear models & N>p. Theorem 2:

7 Numerical Results   and  EC converges faster than CE to the D-R lower bound

8 Distributed Setup  Desirable D-R  Treatas side info. with and  MMSEand  Let  Optimal output of encoder 1: and 

9 Distributed E-C  Extends [Gastpar,et.al’04] to the estimation setup  Steps of iterative algorithm:  Initialize assuming each sensor works independently  Create M random rate increments r(i) s.t.  During iteration j: Retain pair of matrices with smallest distortion  Convergence to a local minimum is guaranteed, Assign r(i) to the corresponding encoder Determine

10 Numerical Experiment SNR=2,  and  Distributed E-C yields tighter upper bound for D-R than the marginal E-C

11 Conclusions  Comparison of two encoders for estimation from a D-R perspective  D-R function for the single-sensor non-distributed setup  Optimality of the estimate-first & compress-afterwards option  Numerical determination of an achievable D-R region, or, at best the D-R function for distributed estimation with WSNs Thank You!