View and rate scalable multiview image coding with depth-image-based rendering

V. Velisavljevic, V. Stanković, Jacob Chakareski, Gene Cheung
{"title":"View and rate scalable multiview image coding with depth-image-based rendering","authors":"V. Velisavljevic, V. Stanković, Jacob Chakareski, Gene Cheung","doi":"10.1109/ICDSP.2011.6005019","DOIUrl":null,"url":null,"abstract":"“Texture plus depth” refers to the format where a sender encodes both texture and depth maps at multiple camera-captured viewpoints. Having received such a representation, the decoder can synthesize novel intermediate view images via depth-image-based rendering (DIBR), using as anchors the texture and depth maps of the two closest captured viewpoints. Ideally then, one would optimally allocate available source coding bits among the encoded texture and depth maps, such that the synthesized view distortion is minimized. However, in many practical application scenarios the precise rate constraint may either: i) be unknown at encoding time, or ii) it can take on multiple values for clients of heterogeneous connectivities. In this paper, we propose a flexible codec and an associated bit allocation strategy to address both of these scenarios. In particular, we first present an edge-adaptive wavelet multiview image codec capable of producing a scalable bitstream from which proper subsets can be extracted and decoded at different bit-rates. Given our scalable codec, we then propose a rate allocation algorithm that performs one of the following two actions. The algorithm will either incrementally increase the number of bits for encoding texture or depth maps of already encoded viewpoints, or it will introduce into the scalable representation new texture or depth maps of previously uncoded captured viewpoints. The incremental choice of either refining an existing view or introducing a new one is carried out one layer at a time, such that the associated rate-distortion tradeoff is locally optimized. By employing our novel bit allocation strategy the proposed coder outperforms the state-of-the-art H.264/SVC codec as well as the same wavelet-based coder when armed with a simple suboptimal bit allocation with the same rate allocated to each map, in all coding scenarios studied in our experiments. Furthermore, our coder can achieve an arbitrarily fine granularity of encoding bit rates, while providing the additional functionality of view embedded encoding, unlike the other related coders that we examined.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 17th International Conference on Digital Signal Processing (DSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2011.6005019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

“Texture plus depth” refers to the format where a sender encodes both texture and depth maps at multiple camera-captured viewpoints. Having received such a representation, the decoder can synthesize novel intermediate view images via depth-image-based rendering (DIBR), using as anchors the texture and depth maps of the two closest captured viewpoints. Ideally then, one would optimally allocate available source coding bits among the encoded texture and depth maps, such that the synthesized view distortion is minimized. However, in many practical application scenarios the precise rate constraint may either: i) be unknown at encoding time, or ii) it can take on multiple values for clients of heterogeneous connectivities. In this paper, we propose a flexible codec and an associated bit allocation strategy to address both of these scenarios. In particular, we first present an edge-adaptive wavelet multiview image codec capable of producing a scalable bitstream from which proper subsets can be extracted and decoded at different bit-rates. Given our scalable codec, we then propose a rate allocation algorithm that performs one of the following two actions. The algorithm will either incrementally increase the number of bits for encoding texture or depth maps of already encoded viewpoints, or it will introduce into the scalable representation new texture or depth maps of previously uncoded captured viewpoints. The incremental choice of either refining an existing view or introducing a new one is carried out one layer at a time, such that the associated rate-distortion tradeoff is locally optimized. By employing our novel bit allocation strategy the proposed coder outperforms the state-of-the-art H.264/SVC codec as well as the same wavelet-based coder when armed with a simple suboptimal bit allocation with the same rate allocated to each map, in all coding scenarios studied in our experiments. Furthermore, our coder can achieve an arbitrarily fine granularity of encoding bit rates, while providing the additional functionality of view embedded encoding, unlike the other related coders that we examined.
使用基于深度图像的渲染来查看和评估可扩展的多视图图像编码
“纹理加深度”指的是发送者在多个摄像机捕获的视点上编码纹理和深度图的格式。接收到这样的表示后,解码器可以使用最近捕获的两个视点的纹理图和深度图作为锚点,通过基于深度图像的渲染(DIBR)合成新的中间视图图像。理想情况下,人们会在编码的纹理和深度图中最佳地分配可用的源编码位,这样合成的视图失真就会最小化。然而,在许多实际应用场景中,精确的速率约束可能是:i)在编码时未知,或者ii)对于异构连接的客户端,它可能具有多个值。在本文中,我们提出了一种灵活的编解码器和相关的位分配策略来解决这两种情况。特别是,我们首先提出了一种边缘自适应小波多视图图像编解码器,能够产生可扩展的比特流,从中可以提取适当的子集并以不同的比特率进行解码。给定我们的可伸缩编解码器,然后我们提出一个执行以下两个操作之一的速率分配算法。该算法要么增量地增加编码已经编码的视点的纹理或深度图的位数,要么将以前未编码的捕获视点的新纹理或深度图引入可扩展表示。细化现有视图或引入新视图的增量选择每次执行一层,这样相关的速率失真权衡就会在局部进行优化。通过采用我们新颖的比特分配策略,在我们实验中研究的所有编码场景中,当为每个映射分配相同速率的简单次优比特分配时,所提出的编码器优于最先进的H.264/SVC编解码器以及相同的基于小波的编码器。此外,我们的编码器可以实现任意细粒度的编码比特率,同时提供视图嵌入编码的附加功能,这与我们研究的其他相关编码器不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信