TY - GEN
T1 - An incremental photon-mapping algorithm for fast walk-through animations
AU - Ikeda, Kosuke
AU - Takizawat, Hiroyuki
AU - Kobayashi, Hiroaki
PY - 2005
Y1 - 2005
N2 - A photo-realistic walk-through animation is required for entertainment and industrial uses. Although photon-mapping is an effective approach to photo-realistic image synthesis based on global illumination, it is difficult to apply photon-mapping to generation of such animations because of its high computational cost. This paper proposes a new algorithm to accelerate the generation of walk-through animations using photon-mapping. The proposed algorithm stores diffuse radiances, which do not depend on the camera position, and reprojects these radiances onto the screen when rendering the subsequent frame. The algorithm uses photon-mapping incrementally only when required. The pixel intensities not determined by the reprojection are preciously recalculated by photon-mapping. As the cost of the reprojection is much lower than that of the recalculation, the algorithm can generate the subsequent frame much faster than the standard photon-mapping algorithm. The algorithm can also render the scenes with participating media that photon mapping can efficiently handle. The experimental results indicate that the proposed algorithm can achieve significant acceleration of generating a walk-through animation based on photon mapping without remarkable degradation of visual quality.
AB - A photo-realistic walk-through animation is required for entertainment and industrial uses. Although photon-mapping is an effective approach to photo-realistic image synthesis based on global illumination, it is difficult to apply photon-mapping to generation of such animations because of its high computational cost. This paper proposes a new algorithm to accelerate the generation of walk-through animations using photon-mapping. The proposed algorithm stores diffuse radiances, which do not depend on the camera position, and reprojects these radiances onto the screen when rendering the subsequent frame. The algorithm uses photon-mapping incrementally only when required. The pixel intensities not determined by the reprojection are preciously recalculated by photon-mapping. As the cost of the reprojection is much lower than that of the recalculation, the algorithm can generate the subsequent frame much faster than the standard photon-mapping algorithm. The algorithm can also render the scenes with participating media that photon mapping can efficiently handle. The experimental results indicate that the proposed algorithm can achieve significant acceleration of generating a walk-through animation based on photon mapping without remarkable degradation of visual quality.
KW - Diffuse cache
KW - Photon-mapping
KW - Reprojection
KW - Walk-through animation
UR - http://www.scopus.com/inward/record.url?scp=33644512392&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33644512392&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33644512392
SN - 0889865140
SN - 9780889865143
T3 - Proceedings of the Eighth IASTED International Conference on Computer Graphics and Imaging, CGIM 2005
SP - 1
EP - 7
BT - Proceedings of the Eighth IASTED International Conference on Computer Graphics and Imaging, CGIM 2005
A2 - Hamza, M.H.
T2 - Eighth IASTED International Conference on Computer Graphics and Imaging, CGIM 2005
Y2 - 15 August 2005 through 17 August 2005
ER -