Minimum Description Length Sparse Modeling and Region Merging for Lossless Plenoptic Image Compression

被引:19
作者
Helin, Petri [1 ]
Astola, Pekka [1 ]
Rao, Bhaskar [2 ]
Tabus, Ioan [1 ]
机构
[1] Tampere Univ Technol, Tampere 33720, Finland
[2] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
关键词
Lossless compression; light-field coding; minimum description length segmentation; plenoptics; sparse prediction; ALGORITHM;
D O I
10.1109/JSTSP.2017.2737967
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a complete lossless compression method for exploiting the redundancy of rectified light-field data. The light-field data consist of an array of rectified subaperture images, called for short views, which are segmented into regions according to an optimized partition of the central view. Each region of a view is predictively encoded using a specifically designed sparse predictor, exploiting the smoothness of each color component in the current view, and the cross similarities with the other color components and already encoded neighbor views. The views are encoded sequentially, using a spiral scanning order, each view being predicted based on several similar neighbor views. The essential challenge for each predictor becomes choosing the most relevant regressors from a large number of possible regressors belonging to the neighbor views. The proposed solution here is to couple sparse predictor design and minimum description length (MDL) principle, where the data description length is measured by an implementable code length, optimized for a class of probability models. This paper introduces a region merging segmentation under the MDL criterion for partitioning the views into regions having their own specific sparse predictors. In experiments, several fast sparse design methods are considered. The proposed scheme is evaluated over a database of plenoptic images, achieving better lossless compression ratios than straightforward usage of standard image and video compression methods for the spiral sequence of views.
引用
收藏
页码:1146 / 1161
页数:16
相关论文
共 31 条
[1]  
[Anonymous], 2016, MDTV
[2]  
[Anonymous], P 24 EUR SIGN PROC C
[3]  
[Anonymous], P IEEE ICIP
[4]  
[Anonymous], 2014, P 3DTV C TRUE VIS CA
[5]   ORTHOGONAL LEAST-SQUARES METHODS AND THEIR APPLICATION TO NON-LINEAR SYSTEM-IDENTIFICATION [J].
CHEN, S ;
BILLINGS, SA ;
LUO, W .
INTERNATIONAL JOURNAL OF CONTROL, 1989, 50 (05) :1873-1896
[6]   FAST ORTHOGONAL LEAST-SQUARES ALGORITHM FOR EFFICIENT SUBSET MODEL SELECTION [J].
CHEN, S ;
WIGGER, J .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (07) :1713-1715
[7]   Mean shift: A robust approach toward feature space analysis [J].
Comaniciu, D ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (05) :603-619
[8]   HEVC-BASED LIGHT FIELD IMAGE CODING WITH BI-PREDICTED SELF-SIMILARITY COMPENSATION [J].
Conti, Caroline ;
Nunes, Paulo ;
Soares, Luis Ducla .
2016 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA & EXPO WORKSHOPS (ICMEW), 2016,
[9]   HEVC-based 3D holoscopic video coding using self-similarity compensated prediction [J].
Conti, Caroline ;
Soares, Luis Ducla ;
Nunes, Paulo .
SIGNAL PROCESSING-IMAGE COMMUNICATION, 2016, 42 :59-78
[10]   Forward sequential algorithms for best basis selection [J].
Cotter, SF ;
Adler, J ;
Rao, BD ;
Kreutz-Delgado, K .
IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, 1999, 146 (05) :235-244