Human visual system model

About: Human visual system model is a research topic. Over the lifetime, 8697 publications have been published within this topic receiving 259440 citations.

Designing JPEG quantization tables based on human visual system

Abstract: In this paper, a quantization table based on the human visual system is designed for the baseline JPEG coder By incorporating the human visual system with the uniform quantizer, a perceptual quantization table is derived The quantization table is easy to adapt to the specified resolution for viewing and printing Experimental results indicate that the HVS-based quantization table can achieve improvements in PSNR about 02-20 dB without increasing the complexity in both encoder and encoder

Efficient spatio-temporal decomposition for perceptual processing of video sequences

Abstract: This paper presents a vision model for moving pictures. The model is an extension of a normalization model by Teo and Heeger (1994). It accounts for normalization of the cortical receptive field responses and inter-channel masking. The model is compared with a simpler vision model for video by presenting results on quality assessment of MPEG compressed video.

Stereoscopic video compression using temporal scalability

Abstract: Despite the fact that human ability to perceive a high degree of realism is directly related to our ability to perceive depth accurately in a scene, most of the commonly used imaging and display technologies are able to provide only a 2D rendering of the 3D real world. Many current as well as emerging applications in areas of entertainment, remote operations, industrial and medicine can benefit from the depth perception offered by stereoscopic video systems which employ two views of a scene imaged under the constraints imposed by human visual system. Among the many challenges to be overcome for practical realization and widespread use of 3D/stereoscopic systems are efficient techniques for digital compression of enormous amounts of data while maintaining compatibility with normal video decoding and display systems. After a brief discussion on the relationship of digital stereoscopic 3DTV with digital TV and HDTV, we present an overview of tools in the MPEG-2 video standard that are relevant to our discussion on compression of stereoscopic video, which is the main topic of this paper. Next, we determine ways in which temporal scalability concepts can be applied to exploit redundancies inherent between the two views of a scene comprising stereoscopic video. Due consideration is given to masking properties of stereoscopic vision to determine bandwidth partitioning between the two views to realize an efficient coding scheme while providing sufficient quality. Simulations are performed on stereoscopic video of normal TV resolution to compare the performance of the two temporal scalability configurations with each other and with the simulcast solution. Preliminary results are quite promising and indicate that the configuration that exploits motion and disparity compensation significantly outperforms the one that exploits disparity compensation alone. Compression of both views of stereo video of normal TV resolution appears feasible in a total of 8 or 9 Mbit/s. Finally, the implication of our results is discussed and potential directions for future research are identified.© (1995) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Method and apparatus providing efficient rasterization with data dependent adaptations

Abstract: The invention reveals faster techniques for scan conversion, slope calculations, and z-buffer and frame-buffer access in the rasterization process of a computer graphics system. This is accomplished by optimizing the method and apparatus to exploit the small size of triangles in applications, and also by taking into account the response of the human visual system to color and depth. Additionally, depth and color information in the z-buffer and image buffer are prefetched into cache memory, thus eliminating the bottleneck associated with accessing these buffers.