›› 2016, Vol. 31 ›› Issue (1): 217-224.doi: 10.1007/s11390-016-1622-x

Special Issue: Artificial Intelligence and Pattern Recognition; Computer Graphics and Multimedia

• Regular Paper • Previous Articles    

Adaptive Photon Mapping Based on Gradient

Chun-Meng Kang(康春萌), Lu Wang*(王璐), Yan-Ning Xu(徐延宁), Xiang-Xu Meng(孟祥旭), and Yuan-Jie Song(宋元杰), Member, CCF   

  1. 1 School of Computer Science and Technology, Shandong University, Jinan 252000, China;
    2 Engineering Research Center of Digital Media Technology, Ministry of Education, Jinan 252000, China
  • Received:2014-04-16 Revised:2015-06-08 Online:2016-01-05 Published:2016-01-05
  • Contact: Lu Wang E-mail:luwang_hcivr@sdu.edu.cn
  • About author:Chun-Meng Kang is a Ph.D. candidate in School of Computer Science and Technology, Shandong University, Jinan. She received her Bachelor's degree in software engineering from Shandong University in 2011. Her research interests include photorealistic rendering and high performance computing.
  • Supported by:

    This work was partly supported by the National Natural Science Foundation of China under Grant Nos. 61472224 and 61472225, the National High Technology Research and Development 863 Program of China under Grant No. 2012AA01A306, the Special Funding of Independent Innovation and Transformation of Achievements in Shandong Province of China under Grant No. 2014ZZCX08201, Shandong Key Research and Development Program under Grant No. 2015GGX106006, Young Scholars Program of Shandong University under Grant No. 2015WLJH41, and the Special Funds of Taishan Scholar Construction Project.

Photon mapping can simulate some special effects efficiently such as shadows and caustics. Photon mapping runs in two phases:the photon map generating phase and the radiance estimation phase. In this paper, we focus on the bandwidth selection process in the second phase, as it can affect the final quality significantly. Poor results with noise arise if few photons are collected, while bias appears if a large number of photons are collected. In order to solve this issue, we propose an adaptive radiance estimation solution to obtain trade-offs between noise and bias by changing the number of neighboring photons and the shape of the collected area according to the radiance gradient. Our approach can be applied in both the direct and the indirect illumination computation. Finally, experimental results show that our approach can produce smoother quality while keeping the high frequency features perfectly compared with the original photon mapping algorithm.

[1] Jensen H W. Global illumination using photon maps. In Rendering Techniques'96, Pueyo X, Schröder P(eds.), Springer Vienna, 1996, pp.21-30.

[2] Jensen H W, Christensen N J. Photon maps in bidirectional Monte Carlo ray tracing of complex objects. Computers & Graphics, 1995, 19(2):215-224.

[3] Schjøth L, Sporring J, Olsen O F. Diffusion based photon mapping. Computer Graphics Forum, 2008, 27(8):2114- 2127.

[4] Spencer B, Jones M W. Into the blue:Better caustics through photon relaxation. Computer Graphics Forum, 2009, 28(2):319-328.

[5] Spencer B, Jones M W. Photon parameterisation for robust relaxation constraints. Computer Graphics Forum, 2013, 32(2):83-92.

[6] Hachisuka T, Ogaki S, Jensen H W. Progressive photon mapping. ACM Transactions on Graphics (TOG), 2008, 27(5):130:1-130:8.

[7] Fu Z, Jensen H W. Noise reduction for progressive photon mapping. In Proc. ACM SIGGRAPH 2012 Talk, August 2012, Article No. 29.

[8] Kaplanyan A S, Dachsbacher C. Adaptive progressive photon mapping. ACM Transactions on Graphics (TOG), 2013, 32(2):16:1-16:13.

[9] Myszkowski K. Lighting reconstruction using fast and adaptive density estimation techniques. In Proc. the Eurographics Workshop on Rendering Techniques, June 1997, pp.251- 262.

[10] Roland S. Bias compensation for photon maps. Computer Graphics Forum, 2003, 22(4):729-742.

[11] Walter B, Hubbard P M, Shirley P et al. Global illumination using local linear density estimation. ACM Transactions on Graphics (TOG), 1997, 16(3):217-259.

[12] Walter B. Density estimation techniques for global illumination[Ph.D. Thesis]. Cornell University, 1998.

[13] Havran V, Bittner J, Herzog R et al. Ray maps for global illumination. In Proc. the 16th Eurographics Conference on Rendering Techniques, June 29-July 1, 2005, pp.43-54.

[14] Kajiya J T. The rendering equation. ACM SIGGRAPH Computer Graphics, 1986, 20(4):143-150.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] Tang Tonggao; Zhao Zhaokeng;. Stack Method in Program Semantics[J]. , 1987, 2(1): 51 -63 .
[2] Min Yinghua;. Easy Test Generation PLAs[J]. , 1987, 2(1): 72 -80 .
[3] Zhou Chaochen; Liu Xinxin;. Denote CSP with Temporal Formulas[J]. , 1990, 5(1): 17 -23 .
[4] Min Yinghua; Yashwant K. Malaiya; Jin Boping;. Aliasing Errors in Parallel Signature Analyzers[J]. , 1990, 5(1): 24 -40 .
[5] Xue Xing; Sun Zhongxiu; Zhou Jianqiang; Xu Xihao;. A Message-Based Distributed Kernel for a Full Heterogeneous Environment[J]. , 1990, 5(1): 47 -56 .
[6] Zhu Mingyuan;. Two Congruent Semantics for Prolog with CUT[J]. , 1990, 5(1): 82 -91 .
[7] Liu Weiyi;. An Efficient Algorithm for Processing Multi-Relation Queries in Relational Databases[J]. , 1990, 5(3): 236 -240 .
[8] Zhang Xing er; Zhu Xiaojun; Li Jianxin; Dong Jianning;. Source-to-Source Conversion Based on Formal Definition[J]. , 1991, 6(2): 178 -184 .
[9] Liao Xianzhi; Jin Lan;. A Mechanism Supporting the Client/Server Relationship in the Operating System of Distributed System “THUDS”[J]. , 1991, 6(3): 256 -262 .
[10] Sui Yuefei;. The Polynomially Exponential Time Restrained Analytical Hierarchy[J]. , 1991, 6(3): 282 -284 .

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved