.png){kind=icon}
Return
Sparsity-Based Online Missing Data Recovery Using Overcomplete Dictionary
.png){kind=icon}
PRE
AI
DOI：10.1109/JSEN.2011.2178826.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Estimating missing sample values is an inherent problem in sensor network applications. In wireless sensor networks, due to power outage at a sensor node, hardware dysfunction, or bad environmental conditions, not all sensor samples can be successfully gathered at the sink. Additionally, in the context of data streams, some nodes may continually miss samples for a period of time. To address these issues, a sparsity-based online data recovery approach is proposed in this paper. First, we construct an overcomplete dictionary composed of past data frames and traditional fixed transform bases. Assuming the current frame can be sparsely represented using only a few elements of the dictionary, missing samples in each frame can be estimated by basis pursuit. If some delay is acceptable, the estimation of the current frame can be further improved by leveraging the observation from the next frames. Our method was tested on data from a real sensor network application, monitoring the temperatures of the disk drive racks at a data center. Simulations show that in terms of estimation accuracy and stability, the proposed approach outperforms existing average-based interpolation methods, and is more robust to burst missing along the time dimension.
Keywords:
Data recovery
dictionary
sensor
sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
2.2W
Citations:
7.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more