arrow
Return

Exploiting global redundancy in big surveillance video data for efficient coding

delete2015-02-18
delete19
PRE
AI
J
Jing Xiao *
L
Liang Liao
J
Jinhui Hu
Y
Yu Chen
胡瑞敏 cover
胡瑞敏 (Ruimin Hu)
DOI:10.1007/s10586-015-0434-zdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In the era of big data, the gap between the fast increasing size of the surveillance video data and the relatively stable video compression rate has become prominent. Existing data compression methods based on the known redundancies are not able to eliminate the dominant redundancy embedded in the big surveillance video data (BSVD) of multiple sources in large time span. In this study, a new approach based on global redundancy of the BSVD has been explored. We first analyze the compositions of the global redundancy based on characteristics of BSVD. A coding framework is proposed to eliminate global redundancy. Simulated experiments have been performed to examine the performance of the approach in comparison with the high efficiency video coding. The experimental result showed that the proposed approach can reach a compression rate of 1/400 for a huge dataset of surveillance videos.
Keywords:
Big surveillance video data
Global redundancy
Compression efficiency
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
Papers:
5.0K
Citations:
7.5K

Organization

W
wuhan university
Scholars:
8.1W
Papers: 5.8W
Citations: 70