Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
Digital Image Processing Using MATLAB
Digital Image Processing Using MATLAB
A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Collaborative image coding and transmission over wireless sensor networks
EURASIP Journal on Applied Signal Processing
A spatial correlation model for visual information in wireless multimedia sensor networks
IEEE Transactions on Multimedia - Special issue on quality-driven cross-layer design for multimedia communications
PRISM: A Video Coding Paradigm With Motion Estimation at the Decoder
IEEE Transactions on Image Processing
Overview of the H.264/AVC video coding standard
IEEE Transactions on Circuits and Systems for Video Technology
Mini-sink mobility with diversity-based routing in wireless sensor networks
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Barrier coverage in camera sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
On the optimal randomized clustering in distributed sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS in Wireless Multimedia Sensor Networks: A Layered and Cross-Layered Approach
Wireless Personal Communications: An International Journal
QMOR: QoS-Aware Multi-sink Opportunistic Routing for Wireless Multimedia Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Data redundancy caused by correlation has motivated the application of collaborative multimedia in-network processing for data filtering and compression in wireless multimedia sensor networks (WMSNs). This paper proposes an information theoretic data compression framework with an objective to maximize the overall compression of the visual information gathered in a WMSN. To achieve this, an entropy-based divergence measure (EDM) scheme is proposed to predict the compression efficiency of performing joint coding on the images collected by spatially correlated cameras. The novelty of EDM relies on its independence of the specific image types and coding algorithms, thereby providing a generic mechanism for prior evaluation of compression under different coding solutions. Utilizing the predicted results from EDM, a distributed multi-cluster coding protocol (DMCP) is proposed to construct a compression-oriented coding hierarchy. The DMCP aims to partition the entire network into a set of coding clusters such that the global coding gain is maximized. Moreover, in order to enhance decoding reliability at data sink, the DMCP also guarantees that each sensor camera is covered by at least two different coding clusters. Experiments on H.264 standards show that the proposed EDM can effectively predict the joint coding efficiency from multiple sources. Further simulations demonstrate that the proposed compression framework can reduce 10% - 23% total coding rate compared with the individual coding scheme, i.e., each camera sensor compresses its own image independently.