This paper presents a novel approach to terrain rendering, which mostly relies on GPU/shader rather than CPU. The most popular representation for terrain data is uniformly sampled height field. As the height field is stored as a texture map, it is directly accessible by a pixel shader. The pixel shader uses a ray casting algorithm, and the CPU and the vertex shader provide ray information to be...

Despite increased complexity sub-pixel motion estimation and compensation significantly outperforms integer motion estimation and compensation in HEVC/MPEGH/H.265 Video Codec’s, since moving objects do not necessarily move by integer pixel locations between successive video frames. Typically, fractional pixel accuracy is obtained by means of bilinear interpolation producing a spatially blurred ...

In this paper we investigate low-bitrate compression of scalar textures such as alpha maps, down to one or two bits per pixel. We present two new techniques for 4× 4 blocks, based on the idea from ETC to use index tables. We demonstrate that although the visual quality of the alpha maps is greatly reduced at these low bit rates, the quality of the final rendered images appears to be sufficient ...

This paper presents a complete coding system for compression of natural color still images represented with 24 bits per pixel. The original 8-bit red, green, and blue (RGB) image components are rst transformed to a luminance (Y) and two chrominance components (Cb, Cr) according to the ITU-R Recommendation 601 1]. Each of the Y, Cb, and Cr tristimulus values are then decomposed separately in a s...

Adaptive multiresolution hierarchies are highly efficient at representing spatially coherent graphics data. We introduce a framework for compressing such adaptive hierarchies using a compact randomly-accessible tree structure. Prior schemes have explored compressed trees, but nearly all involve entropy coding of a sequential traversal, thus preventing fine-grain random queries required by rende...

Many works have demonstrated that the performance of the prediction error (PE) based reversible watermarking algorithm depends on the precision of the prediction value. However, most algorithms compute the prediction value by exploiting only the correlation between the embedding pixel and its neighboring pixels, thus limiting the watermarking performance of these algorithms. In this work, we ob...