Article

Receiver-and Channel-adaptive Compression for Remote Browsing of Image-Based Scene Representations

ABSTRACT

Remote navigation in compressed image-based scene representations requires random access to arbitrary parts of the reference image data to recompose virtual views. The degree of inter-frame dependencies exploited during compression has an impact on the effort needed to access reference images and delimits the rate distortion (RD) trade-off that can be achieved. This work considers conventional RD optimization but additionally takes a given receiver hardware and a maximum available transmission bitrate into account. This leads to an extension of the traditional rate-distortion optimization to a trade-off between the four parameters rate (server side file size), distortion, transmission data rate, and decoding complexity. This RDTC optimization framework allows us to adapt to channel properties and client resources and can significantly improve the user satisfaction in a remote navigation scenario.

Full-text preview

Available from: psu.edu
  • Source
    • "As the decoding complexity and transmission data rate per virtual view are strong measures for the performance (like frame rate or response time) of an interactive remote walkthrough system, it is essential to consider different computational capabilities and different access bitrates of different user devices [21] [22]. Therefore, jointly considering all four RDTC measures leads to efficient compression in the rate-distortion sense while providing a certain rendering quality and frame rate during online operation. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Remote navigation in image-based scene representations requires random access to the compressed reference image data to compose virtual views. When using block-based hybrid video coding concepts, the degree of inter frame dependencies introduced during compression has an impact on the effort that is required to access reference image data and at the same time delimits the rate distortion trade-off that can be achieved. If, additionally, a maximum available channel bitrate is taken into account, the traditional rate-distortion (RD) trade-off can be extended to a trade-off between the storage rate (R), distortion (D), transmission data rate (T), and decoding complexity (C). In this work we present a theoretical analysis of this RDTC space. Experimental results qualitatively match those predicted by theory and show that an adaptation of the encoding process to scenario specific parameters like computational power of the receiver and channel throughput can significantly reduce the user perceived delay or required storage for RDTC optimized streams compared to RD optimized or independently encoded scene representations.
    Preview · Conference Paper · Dec 2007
  • Source
    • "In this paper, we introduce RDTC optimization [13] with a client side caching model and measure the performance of the RDTC streaming system using a testbed implementation. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Remote navigation in compressed image-based scene representations requires random access to arbitrary parts of the reference image data to recompose virtual views. The degree of inter-frame dependencies exploited during compression has an impact on the effort needed to access reference images and delimits the rate distortion (RD) trade-off that can be achieved. If, additionally, a given receiver hardware and a maximum available channel bitrate is taken into account, the traditional rate-distortion optimization is extended to an RDTC trade-off between rate (R), distortion (D), transmission data rate (T), and decoding complexity (C). In this work we introduce our RDTC optimized compression framework. In addition, an experimental testbed for streaming of these RDTC optimally compressed image-based scene representations is described and the impact of client side caching is investigated. Our results show a significant reduction in user perceived delay for RDTC optimized streams in such a remote browsing environment compared to RD optimized or independently encoded scene representations.*
    Preview · Conference Paper · Jun 2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: Rendering of virtual views in interactive streaming of compressed image-based scene representations requires random access to arbitrary parts of the reference image data. The degree of interframe dependencies exploited during encoding has an impact on the transmission and decoding time and, at the same time, delimits the (storage) rate-distortion (RD) tradeoff that can be achieved. In this work, we extend the classical RD optimization approach using hybrid video coding concepts to a tradeoff between the storage rate (R), distortion (D), transmission data rate (T), and decoding complexity (C). We present a theoretical model for this RDTC space with a focus on the decoding complexity and, in addition, the impact of client side caching on the RDTC measures is considered and evaluated. Experimental results qualitatively match those predicted by our theoretical models and show that an adaptation of the encoding process to scenario specific parameters like computational power of the receiver and channel throughput can significantly reduce the user-perceived delay or required storage for RDTC optimized streams compared to RD optimized or independently encoded scene representations.
    No preview · Article · Jun 2008 · IEEE Transactions on Image Processing
Show more