Parallel Fractal Compression Method for Big Video Data. (3rd October 2018)

• Record Type: Journal Article
• Authors: Liu, Shuai; Bai, Weiling; Liu, Gaocheng; Li, Wenhui; Srivastava, Hari M.
• Other Names: Bellavista Paolo Academic Editor.
• Is Part Of: Complexity. Volume 2018(2018)
• Publication Date: 2018-10-03
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2018/2016976
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : With the development of technologies such as multimedia technology and information technology, a great deal of video data is generated every day. However, storing and transmitting big video data requires a large quantity of storage space and network bandwidth because of its large scale. Therefore, the compression method of big video data has become a challenging research topic at present. Performance of existing content-based video sequence compression method is difficult to be effectively improved. Therefore, in this paper, we present a fractal-based parallel compression method without content for big video data. First of all, in order to reduce computational complexity, a video sequence is divided into several fragments according to the spatial and temporal similarity. Secondly, domain and range blocks are classified based on the color similarity feature to reduce computational complexity in each video fragment. Meanwhile, a fractal compression method is deployed in a SIMD parallel environment to reduce compression time and improve the compression ratio. Finally, experimental results show that the proposed method not only improves the quality of the recovered image but also improves the compression speed by compared with existing compression algorithms.