RLFC: Random Access Light Field Compression using Key Views and Bounded Integer Encoding

by   Srihari Pratapa, et al.

We present a new hierarchical compression scheme for encoding light field images (LFI) that is suitable for interactive rendering. Our method (RLFC) exploits redundancies in the light field images by constructing a tree structure. The top level (root) of the tree captures the common high-level details across the LFI, and other levels (children) of the tree capture specific low-level details of LFI. Our decompressing algorithm corresponds to tree traversal operations and gathers the values stored at different levels of the tree. Furthermore, we use bounded integer sequence encoding which provides random access and fast hardware decoding for compressing the blocks of children of the tree. We have evaluated our method for 4D two-plane parameterized light fields. The compression rates vary from 0.1 - 3 bits per pixel (bpp), resulting in compression ratios of around 200:1 to 10:1 for a PSNR quality of 40 to 50 dB. The decompression times for decoding the blocks of LFI are 1 - 3 microseconds per channel on NVIDIA GTX-960 and we can render the LFIs at 100 fps. Our overall scheme is simple to implement and involves only bit manipulations and integer arithmetic operations.


page 3

page 4

page 8


RLFC: Random Access Light Field Compression using Key Views

We present a new hierarchical based compression scheme for encoding ligh...

HMLFC: Hierarchical Motion-Compensated Light Field Compression for Interactive Rendering

We present a new motion-compensated hierarchical compression scheme (HML...

A Modified No Search Algorithm for Fractal Image Compression

Fractal image compression has some desirable properties like high qualit...

Learning-Based Practical Light Field Image Compression Using A Disparity-Aware Model

Light field technology has increasingly attracted the attention of the r...

N-ary Huffman Encoding Using High-Degree Trees – A Performance Comparison

In this paper we implement an n-ary Huffman Encoding and Decoding applic...

EvoZip: Efficient Compression of Large Collections of Evolutionary Trees

Phylogenetic trees represent evolutionary relationships among sets of or...

A Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling

In this paper a new fractal image compression algorithm is proposed in w...

Please sign up or login with your details

Forgot password? Click here to reset