Estimating Inhomogeneous Fields Using Wireless Sensor Networks
IEEE Journal on Selected Areas in CommunicationsPublished 1 August 2004Open access
Robert D. Nowak, Urbashi Mitra, Rebecca Willett
Citations133
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A theory and methodology for estimating inhomogeneous, two-dimensional fields using wireless sensor networks, based on a hierarchical data-handling and communication architecture, provides a near-optimal balance of accuracy and energy consumption.
Abstract
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Keywords
Computer ScienceEngineering
BiometricsClassification and Regression Trees.
23,841 Citations1984Alexander Gordon, Leo Breiman +3 more
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Curvelets: A Surprisingly Effective Nonadaptive Representation for Objects with Edges
1,335 Citations2000Emmanuel J. Candès, David L. Donoho
The basic issues of efficient m-term approximation, the construction of efficient adaptive representation, theConstruction of the curvelet frame, and a crude analysis of the performance of curvelet schemes are explained.
IEEE Transactions on Information TheoryDistributed source coding using syndromes (DISCUS): design and construction
959 Citations2003S. Sandeep Pradhan, Kannan Ramchandran
This work addresses the problem of compressing correlated distributed sources, i.e., correlated sources which are not co-located or which cannot cooperate to directly exploit their correlation and provides a constructive practical framework based on algebraic trellis codes dubbed as DIstributed Source Coding Using Syndromes (DISCUS), that can be applicable in a variety of settings.
The Annals of StatisticsWedgelets: nearly minimax estimation of edges
639 Citations1999David L. Donoho
An overcomplete collection of atoms called wedgelets, dyadically organized indicator functions with a variety of locations, scales, and orientations are developed, which provides nearly-optimal representations of objects in the Horizon model, as measured by minimax description length.
Lecture notes in statisticsMinimax Theory of Image Reconstruction
375 Citations1993A. P. Korostelev, A. B. Tsybakov
This book is concerned with a technique for image reconstruction known as the asymptotic minimax approach, which is based on non-parametric regression and change-point analysis, and presents results under the simplest assumptions.
IEEE Transactions on Medical ImagingPlatelets: a multiscale approach for recovering edges and surfaces in photon-limited medical imaging
277 Citations2003Rebecca Willett, Robert D. Nowak
Experimental results suggest that platelet-based methods can outperform standard reconstruction methods currently in use in confocal microscopy, image restoration, and emission tomography.
On the interdependence of routing and data compression in multi-hop sensor networks
248 Citations2002Anna Scaglione, S.D. Servetto
A large class of physically-motivated stochastic models for sensor data is constructed, for which it is able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a).
Lecture notes in computer scienceOn the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data
242 Citations2003Daniel De Marco, Enrique J. Duarte‐Melo +2 more
This paper investigates the capability of large-scale sensor networks to measure and transport a two-dimensional field in which densely deployed sensors take periodic samples of the sensed field, and then scalar quantize, encode and transmit them to a single receiver/central controller where snapshot images of the sensing field are reconstructed.
Mixture Density Estimation
236 Citations1999Jonathan Q. Li, Andrew R. Barron
For mixture density estimation, it is shown that a k-component mixture estimated by maximum likelihood (or by an iterative likelihood improvement that is introduced) achieves log-likelihood within order 1/k of the log- likelihood achievable by any convex combination.
Backcasting
212 Citations2004Rebecca Willett, Aline Martin +1 more
Back-casting operates by first having a small subset of the wireless sensors communicate their information to a fusion center, which provides an initial estimate of the environment being sensed, and guides the allocation of additional network resources.
An evaluation of multi-resolution storage for sensor networks
202 Citations2003Deepak Ganesan, Ben Greenstein +3 more
This system demonstrates the use of in-network wavelet-based summarization and progressive aging of summaries in support of long-term querying in storage and communication-constrained networks.
Lecture notes in computer scienceBoundary Estimation in Sensor Networks: Theory and Methods
199 Citations2003Robert Nowak, Urbashi Mitra
This paper investigates a strategy by which sensor nodes detect and estimate non-localized phenomena such as "boundaries" and "edges"(e.g., temperature gradients, variations in illumination or contamination levels).
Ad Hoc NetworksLocalized edge detection in sensor fields
173 Citations2003Krishna Chintalapudi, Ramesh Govindan
Rice Digital Scholarship Archive (Rice University)Multiscale Likelihood Analysis and Complexity Penalized Estimation
105 Citations2007Eric D. Kolaczyk, Robert D. Nowak +2 more
Sensing lena-massively distributed compression of sensor images
33 Citations2004S.D. Servetto
This paper proves an asymptotic optimally result for these protocols: the rate of growth for the traffic they generate is /spl Theta/(log(n/D)) (n nodes, total distortion D), matching exactly the rates of growth of the rate/distortion function.
eScholarship (California Digital Library)An evaluation of multi-resolution search and storage in resource-constrained sensor networks
33 Citations2003Deepak Ganesan, Ben Greenstein +3 more
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEApplications of localized image processing techniques in wireless sensor networks
15 Citations2003Divya Devaguptapu, Bhaskar Krishnamachari
The application of image processing techniques for data refinement in sensor networks are described, by mapping network nodes to pixels in an image, and the performance of these processing techniques depends critically upon both sensor density and radio range.