Translator Disclaimer
13 February 2008 Dimensionality of visual complexity in computer graphics scenes
Author Affiliations +
Proceedings Volume 6806, Human Vision and Electronic Imaging XIII; 68060E (2008)
Event: Electronic Imaging, 2008, San Jose, California, United States
How do human observers perceive visual complexity in images? This problem is especially relevant for computer graphics, where a better understanding of visual complexity can aid in the development of more advanced rendering algorithms. In this paper, we describe a study of the dimensionality of visual complexity in computer graphics scenes. We conducted an experiment where subjects judged the relative complexity of 21 high-resolution scenes, rendered with photorealistic methods. Scenes were gathered from web archives and varied in theme, number and layout of objects, material properties, and lighting. We analyzed the subject responses using multidimensional scaling of pooled subject responses. This analysis embedded the stimulus images in a two-dimensional space, with axes that roughly corresponded to "numerosity" and "material / lighting complexity". In a follow-up analysis, we derived a one-dimensional complexity ordering of the stimulus images. We compared this ordering with several computable complexity metrics, such as scene polygon count and JPEG compression size, and did not find them to be very correlated. Understanding the differences between these measures can lead to the design of more efficient rendering algorithms in computer graphics.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ganesh Ramanarayanan, Kavita Bala, James A. Ferwerda, and Bruce Walter "Dimensionality of visual complexity in computer graphics scenes", Proc. SPIE 6806, Human Vision and Electronic Imaging XIII, 68060E (13 February 2008);

Back to Top