Compressive Sampling-Based Image Coding for Resource-Deficient Visual Communication

被引:36
作者
Liu, Xianming [1 ]
Zhai, Deming [1 ]
Zhou, Jiantao [2 ]
Zhang, Xinfeng [3 ]
Zhao, Debin [1 ]
Gao, Wen [4 ,5 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China
[2] Univ Macau, Fac Sci & Technol, Dept Comp & Informat Sci, Macau 999078, Peoples R China
[3] Nanyang Technol Univ, Rapid Rich Object Search Lab, Singapore 639798, Singapore
[4] Peking Univ, Sch Elect Engn & Comp Sci, Minist Educ, Natl Engn Lab Video Technol, Beijing 100871, Peoples R China
[5] Peking Univ, Sch Elect Engn & Comp Sci, Minist Educ, Key Lab Machine Percept, Beijing 100871, Peoples R China
基金
美国国家科学基金会;
关键词
Low bit-rates image coding; multiple description coding; local random sampling; compressive sensing; SPARSE; SUPERRESOLUTION;
D O I
10.1109/TIP.2016.2554320
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new compressive sampling-based image coding scheme is developed to achieve competitive coding efficiency at lower encoder computational complexity, while supporting error resilience. This technique is particularly suitable for visual communication with resource-deficient devices. At the encoder, compact image representation is produced, which is a polyphase down-sampled version of the input image; but the conventional low-pass filter prior to down-sampling is replaced by a local random binary convolution kernel. The pixels of the resulting down-sampled pre-filtered image are local random measurements and placed in the original spatial configuration. The advantages of the local random measurements are two folds: 1) preserve high-frequency image features that are otherwise discarded by low-pass filtering and 2) remain a conventional image and can therefore be coded by any standardized codec to remove the statistical redundancy of larger scales. Moreover, measurements generated by different kernels can be considered as the multiple descriptions of the original image and therefore the proposed scheme has the advantage of multiple description coding. At the decoder, a unified sparsity-based soft-decoding technique is developed to recover the original image from received measurements in a framework of compressive sensing. Experimental results demonstrate that the proposed scheme is competitive compared with existing methods, with a unique strength of recovering fine details and sharp edges at low bit-rates.
引用
收藏
页码:2844 / 2855
页数:12
相关论文
共 32 条
[1]   Multiple description coding in networks with congestion problem [J].
Alasti, M ;
Sayrafian-Pour, K ;
Ephremides, A ;
Farvardin, N .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (03) :891-902
[2]  
[Anonymous], 2006, ADV NEURAL INF PROCE
[3]  
[Anonymous], 1987, Unconstrained Optimization: Practical Methods of Optimization
[4]   Compressive sensing [J].
Baraniuk, Richard G. .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (04) :118-+
[5]  
Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
[6]  
Coates Adam, 2012, Neural Networks: Tricks of the Trade. Second Edition: LNCS 7700, P561, DOI 10.1007/978-3-642-35289-8_30
[7]   Robust Image Coding Based Upon Compressive Sensing [J].
Deng, Chenwei ;
Lin, Weisi ;
Lee, Bu-Sung ;
Lau, Chiew Tong .
IEEE TRANSACTIONS ON MULTIMEDIA, 2012, 14 (02) :278-290
[8]   Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization [J].
Dong, Weisheng ;
Zhang, Lei ;
Shi, Guangming ;
Wu, Xiaolin .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2011, 20 (07) :1838-1857
[9]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[10]   The restricted isometry property for random block diagonal matrices [J].
Eftekhari, Armin ;
Yap, Han Lun ;
Rozell, Christopher J. ;
Wakin, Michael B. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2015, 38 (01) :1-31