Name
Abstract | ||
|---|---|---|
This paper gives a novel wavelet image two-line (Wi2l) coder that is designed to fulfill the memory constraints of a typical wireless sensor node. The algorithm operates line-wisely on picture data stored on the sensor's flash memory card while it requires approximatively 1.5 kByte RAM to compress a monochrome picture with the size of 256x256 Bytes. The achieved data compression rates are the same as with the set partitioning in hierarchical trees (Spiht) algorithm. The coder works recursively on two lines of a wavelet subband while intermediate data of these lines is stored to backward encode the wavelet trees. Thus it does not need any list but three small buffers with a fixed dimension. The compression performance is evaluated by a PC-implementation in C, while time measurements are conducted on a typical wireless sensor node using a modified version of the PC-code. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/DCC.2009.30 | DCC |
Keywords | Field | DocType |
wavelet image,wireless sensor node,wavelet tree,sensor node,flash memory card,compression performance,wavelet subband,two-line coder,picture data,novel wavelet image two-line,intermediate data,typical wireless,data compression rate,data compression,wireless sensor networks,time measurement,encoding,image sensors,ram,wavelet transforms,set partitioning in hierarchical trees,memory management,pixel,quantization | Set partitioning in hierarchical trees,Computer science,Theoretical computer science,Memory management,Pixel,Data compression,Wireless sensor network,Encoding (memory),Wavelet,Wavelet transform | Conference |
ISSN | Citations | PageRank |
1068-0314 | 6 | 0.47 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephan Rein | 1 | 83 | 7.48 |
| Stephan Lehmann | 2 | 13 | 1.35 |
| Clemens Gühmann | 3 | 17 | 4.36 |