...
首页> 外文期刊>Selected Topics in Signal Processing, IEEE Journal of >Minimum Description Length Sparse Modeling and Region Merging for Lossless Plenoptic Image Compression
【24h】

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

机译:最小描述长度稀疏建模和区域合并,实现无损全光图像压缩

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:本文提出了一种完整的无损压缩方法,以利用整流光场数据的冗余性。光场数据由经过校正的子孔径图像阵列(称为短视图)组成,这些图像根据中心视图的优化分区分为多个区域。使用专门设计的稀疏预测器对视图的每个区域进行预测编码,利用当前视图中每个颜色分量的平滑度以及与其他颜色分量和已编码的相邻视图的交叉相似性。使用螺旋扫描顺序对视图进行顺序编码,每个视图基于几个相似的相邻视图进行预测。每个预测变量的基本挑战是从属于相邻视图的大量可能回归变量中选择最相关的回归变量。这里提出的解决方案是将稀疏预测器设计和最小描述长度(MDL)原理结合起来,其中数据描述长度由针对一类概率模型进行优化的可实施代码长度来衡量。本文介绍了一种基于MDL标准的区域合并分割方法,用于将视图划分为具有自己的特定稀疏预测因子的区域。在实验中,考虑了几种快速稀疏设计方法。所提出的方案是在全光图像数据库上进行评估的,与直接使用标准图像和视频压缩方法以实现螺旋视图序列相比,可实现更好的无损压缩率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号