Dimensionality Reduction and Noise Removal in Wireless Sensor Network Datasets

  title={Dimensionality Reduction and Noise Removal in Wireless Sensor Network Datasets},
  author={Ehsan O. Sheybani and Giti Javidi},
  journal={2009 Second International Conference on Computer and Electrical Engineering},
  • E. Sheybani, G. Javidi
  • Published 28 December 2009
  • Computer Science
  • 2009 Second International Conference on Computer and Electrical Engineering
Many wireless sensor network datasets suffer from the effects of acquisition noise, channel noise, fading, and fusion of different nodes with huge amounts of data. Any of these effects alone or their combination could adversely affect the decision made at the fusion center. We have developed computationally low power, low bandwidth, and low cost filters that will remove the noise and compress the data so that a decision can be made at the node level. This wavelet-based method is guaranteed to… 

Figures from this paper

Digital Signal Processing for Analytics in Biostatistics & Biometric Applications

  • E. Sheybani
  • Computer Science
    Annals of Biostatistics & Biometric Applications
  • 2019
Biostatistics and biometric provide alternative means for analysis and visualization of the scientific and medical information and services, providing patients and researchers with an extraordinary new range of options.

Advanced Image Processing for Analytics in Biomedicine and Bioscience

Advanced biomedical imaging systems provide alternative means for analysis and visualization of the scientific and medical information and services, providing patients and researchers with an extraordinary new range of options.



Optimal Dimensionality Reduction for Multi-Sensor Fusion in the Presence of Fading and Noise

  • I. SchizasG. GiannakisZ. Luo
  • Computer Science
    2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings
  • 2006
We derive linear estimators of stationary random signals based on reduced-dimensionality observations collected at distributed sensors and communicated over wireless fading links to a fusion center,

Communication-estimation tradeoffs in wireless sensor networks

A simple sensor network under dependent Gaussian noise is studied and analytical expressions for the maximum likelihood estimator under "geometric" dependent noise are provided, showing that the performance is only marginally degraded when the noise is assumed to be independent.

Average consensus algorithms robust against channel noise

A theoretical analysis is provided of two algorithms: a method, reminiscent of stochastic approximation algorithms, using a decreasing step size, with proper decaying law, and a leakage method imposing that the consensus cannot be too distant from the initial measurements.

Analysis of Distributed Noise Canceling

  • A. AbdallahW. Wolf
  • Computer Science
    The 2nd International Conference on Distributed Frameworks for Multimedia Applications
  • 2006
This paper tackles the issues which arise when the process of porting conventional algorithms, especially signal processing ones, from their normal centralized form to a parallel distributed form is

Coupling noise effect in self-synchronizing wireless sensor networks

Computer simulation results are provided discussing the coupling noise effect and the obtained theoretical lower bound and a simple signal model for the transmission of states from node to node and study its Cramer-Rao Bound and the asymptotically efficient Maximum Likelihood estimator.

Wireless sensor networks with local fusion

This paper proposes wireless sensor networks with local fusion to reduce the degradation caused by observation noise, channel noise, and fading, and shows that the proposed systems can achieve good energy-efficiency and the total energy consumption of the system with likelihood decision is smaller than that of the systems with majority decision when the influence of observation noise is large.

Characterization of Signals from Multiscale Edges

The authors describe an algorithm that reconstructs a close approximation of 1-D and 2-D signals from their multiscale edges and shows that the evolution of wavelet local maxima across scales characterize the local shape of irregular structures.

A translation-invariant wavelet representation algorithm with applications

The time-varying problem of wavelet transforms is addressed, and a new translation-invariant wavelet representation algorithm is proposed that can reduce the distortion substantially, if the input signals are transients that are sensitive to time shifts.

Zero-crossings of a wavelet transform

  • S. Mallat
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1991
An alternative projection algorithm is described that reconstructs a signal from azero-crossing representation, which is stabilized by keeping the value of the wavelet transform integral between each pair of consecutive zero-crossings.

Orthonormal shift-invariant wavelet packet decomposition and representation