Distributed sampling and compression of scenes with finite rate of innovation in camera sensor networks

We study the problem of distributed sampling and compression in sensor networks when the sensors are digital cameras that acquire a 3-D visual scene of interest from different viewing positions. We assume that sensors cannot communicate among themselves, but can process their acquired data and transmit it to a common central receiver. The main task of the receiver is then to reconstruct the best possible estimation of the original scene and the natural issue, in this context, is to understand the interplay in the reconstruction between sampling and distributed compression. In this paper, we show that if the observed scene belongs to the class of signals that can be represented with a finite number of parameters, we can determine the minimum number of sensors that allows perfect reconstruction of the scene. Then, we present a practical distributed coding approach that leads to a rate-distortion behaviour at the decoder that is independent of the number of sensors, when this number increases beyond the critical sampling. In other words, we show that the distortion at the decoder does not depend on the number of sensors used, but only on the total number of bits that can be transmitted from the sensors to the receiver

[1]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[2]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[3]  Thierry Blu,et al.  Exact sampling results for signals with finite rate of innovation using Strang-Fix conditions and local kernels , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[4]  Pier Luigi Dragotti,et al.  Dfferent - distributed and fully flexible image encoders for camera sensor networks , 2005, IEEE International Conference on Image Processing 2005.

[5]  Martin Vetterli,et al.  Sampling and interpolation of the plenoptic function , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[6]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[7]  Harry Shum,et al.  Plenoptic sampling , 2000, SIGGRAPH.

[8]  Pier Luigi Dragotti,et al.  Distributed compression of the plenoptic function , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[9]  Martin Vetterli,et al.  Exact sampling results for some classes of parametric nonbandlimited 2-D signals , 2004, IEEE Transactions on Signal Processing.

[10]  M. Vetterli,et al.  Approximation and compression of piecewise smooth functions , 1999, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[11]  Kannan Ramchandran,et al.  Distributed Sampling for Dense Sensor Networks: A "Bit-Conservation Principle" , 2003, IPSN.

[12]  A. Scaglione,et al.  Dense sensor networks that are also energy efficient: when 'more' is 'less' , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[13]  D. Marco,et al.  Reliability vs. efficiency in distributed source coding for field-gathering sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[14]  David L. Neuhoff,et al.  An Upper Bound to the Rate of Ideal Distributed Lossy Source Coding of Densely Sampled Data , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[15]  M. Landy,et al.  The Plenoptic Function and the Elements of Early Vision , 1991 .

[16]  Pier Luigi Dragotti,et al.  Sampling schemes for 2-D signals with finite rate of innovation using kernels that reproduce polynomials , 2005, IEEE International Conference on Image Processing 2005.

[17]  Cathy H. Xia,et al.  Distributed source coding in dense sensor networks , 2005, Data Compression Conference.