University of Wisconsin Computer Sciences Header Map (repeated with 
textual links if page includes departmental footer) Useful ResourcesResearch at UW-Madison CS DeptUW-Madison CS Undergraduate ProgramUW-Madison CS Graduate ProgramUW-Madison CS PeopleUseful InformationCurrent Seminars in the CS DepartmentSearch Our SiteUW-Madison CS Computer Systems LaboratoryUW-Madison Computer Sciences Department Home PageUW-Madison Home Page

Population Monte Carlo Path Tracing

We present a novel global illumination algorithm which distributes more image samples on regions with perceptually high variance. Our algorithm iterates on a population of pixel positions used to estimate the intensity of each pixel in the image. A member kernel function, which automatically adapts to approximate the target ditribution by using the information collected in previous iterations, is responsible for proposing a new sample position from the current one during the mutation process. The kernel function is designed to explore a proper area around the population sample to reduce the local variance. The resampling process eliminates samples located in the low-variance or well-explored regions and generates new samples to achieve ergocity. New samples are generated by considering two factors: the perceptual variance and the stratification of the sample distributions on the image plane. Our results show that the visual quality of the rendered image can be improved by exploring the correlated information among image samples.


Yu-Chi Lai, Shaohua Fan, Stephen Chenney, Charles Dyer Population Monte Carlo Path Tracing, Submit to PG 2007

Back To Main Page

Questions/Comments: Yu-Chi Lai