Random access for compressed light fields using multiple representations

被引:0
|
作者
Ramanathan, P [1 ]
Girod, B [1 ]
机构
[1] Stanford Univ, Dept Elect Engn, Informat Syst Lab, Stanford, CA 94305 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from or streaming the data set. Efficient compression usually depends upon prediction between images, which creates dependencies between them, making random access more difficult. Independent encoding of the images is less efficient but provides random access, and in many cases is superior to predictive coding when considering the rate-distortion performance for certain viewing trajectories of the light field. In this paper, we describe a method which can obtain the best of both worlds: random access to any image; and compression efficiency, through predictive coding. We store multiple representations of each light field image, and decode using the appropriate representation depending on the available images that are already decoded. To eliminate prediction mismatch between the representations, we employ the idea of "SP-frames" from video coding. This allows us to generate identical reconstruction images from all representations. Our experimental results show a significant improvement in terms of view-trajectory-dependent rate-distortion performance over independent coding of the images.
引用
收藏
页码:383 / 386
页数:4
相关论文
共 50 条
  • [21] Dimensionality of random light fields
    Norrman, Andreas
    Friberg, Ari T.
    Gil, Jose J.
    Setala, Tero
    JOURNAL OF THE EUROPEAN OPTICAL SOCIETY-RAPID PUBLICATIONS, 2017, 13
  • [22] On internal organization in compressed random-access memories
    Franaszek, PA
    Robinson, JT
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 2001, 45 (02) : 259 - 270
  • [23] RANDOM ACCESS TO GRAMMAR-COMPRESSED STRINGS AND TREES
    Bille, Philip
    Landau, Gad M.
    Raman, Rajeev
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    Weimann, Oren
    SIAM JOURNAL ON COMPUTING, 2015, 44 (03) : 513 - 539
  • [24] On internal organization in compressed random-access memories
    Franaszek, P.A. (paf@us.ibm.com), 1600, IBM Corporation (45):
  • [25] Dynamic Compressed Sensing Approach for Unsourced Random Access
    Nassaji, Ehsan
    Truhachev, Dmitri
    IEEE COMMUNICATIONS LETTERS, 2024, 28 (07) : 1644 - 1648
  • [26] Interactive rendering from compressed light fields
    Tong, X
    Gray, RM
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2003, 13 (11) : 1080 - 1091
  • [27] Compressive Random Access Using Multiple Resource Blocks for MTC
    Choi, Jinho
    Lee, Kyungjun
    Yu, Nam Yul
    2016 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2016,
  • [28] Random coding in noise-free multiple access networks over finite fields
    Ray, S
    Médard, M
    Abounadi, J
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 1898 - 1902
  • [29] On Multiple Access Random Medium Access Control
    Cui, Tao
    Ho, Tracey
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1869 - 1873
  • [30] Spatial random multiple access with multiple departure
    Foss, Sergey
    Turlikov, Andrey
    Grankin, Maxim
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2728 - 2731