Filters








81,007 Hits in 3.4 sec

Gradient-domain path tracing

Markus Kettunen, Marco Manzi, Miika Aittala, Jaakko Lehtinen, Frédo Durand, Matthias Zwicker
2015 ACM Transactions on Graphics  
Figure 1 : Comparing gradient-domain path tracing (G-PT, L1 reconstruction) to path tracing at equal rendering time (2 hours).  ...  Finally, we describe Gradient-Domain Path Tracing (G-PT), a relatively simple modification of the standard path tracing algorithm that can yield far superior results.  ...  Comparing the characteristics of the error between gradient-domain MLT, gradient-domain path tracing, and regular path tracing.  ... 
doi:10.1145/2766997 fatcat:cmgc4iad7zbmbaq22mx6fm4fha

Temporal gradient-domain path tracing

Marco Manzi, Markus Kettunen, Frédo Durand, Matthias Zwicker, Jaakko Lehtinen
2016 ACM Transactions on Graphics  
Path Tracing Gradient-Domain PT Ours 3D Poisson solution Figure 1 : a) In addition to standard path sampling, our method also estimates spatial, temporal and mixed finite differences for the frames of  ...  We demonstrate that our approach effectively reduces temporal flickering in animation sequences, significantly improving the visual quality compared to both path tracing and gradient-domain rendering of  ...  Manzi et al. [2015] extend gradient-domain path tracing to bidirectional path tracing, combining the advantages of gradient and bidirectional sampling.  ... 
doi:10.1145/2980179.2980256 fatcat:kiv3fmwwhffl5au6xxe5caiam4

Gradient-Domain Bidirectional Path Tracing [article]

Marco Manzi, Markus Kettunen, Miika Aittala, Jaakko Lehtinen, Frédo Durand, Matthias Zwicker
2015 Symposium on Rendering  
Gradient-domain path tracing has recently been introduced as an efficient realistic image synthesis algorithm.  ...  It also improves over unidirectional gradient-domain path tracing in challenging visibility conditions, similarly to how conventional bidirectional path tracing improves over its unidirectional counterpart  ...  bidirectional path tracing (G-BDPT), path tracing (PT), and gradient-domain path tracing (G-PT) at equal render time.  ... 
doi:10.2312/sre.20151168 fatcat:4j6lexfijbfpjotgzjn3iprgbq

Gradient-domain volumetric photon density estimation

Adrien Gruson, Binh-Son Hua, Nicolas Vibert, Derek Nowrouzezahrai, Toshiya Hachisuka
2018 ACM Transactions on Graphics  
We show that naïve extensions of gradient domain path-space and density estimation methods to volumetric media, while functional, can result in inefficient estimators.  ...  We introduce the first gradient-domain formulation of image synthesis with homogeneous participating media, including four novel and efficient gradient-domain volumetric density estimation algorithms.  ...  We additionally implement novel extensions of gradient-domain path tracing (G-PT) ] and gradient-domain bidirectional path tracing (G-BDPT) ] to volumetric light transport.  ... 
doi:10.1145/3197517.3201363 fatcat:m2o7kyfyizfardstklbqbjs7zy

Gradient-Domain Vertex Connection and Merging [article]

Weilun Sun, Xin Sun, Nathan A. Carr, Derek Nowrouzezahrai, Ravi Ramamoorthi
2017 Eurographics Symposium on Rendering  
path tracing.  ...  Our method enables robust gradient sampling in the presence of complex transport, such as specular-diffuse-specular paths, while retaining the denoising power and fast convergence of gradient-domain bidirectional  ...  Later, gradient-domain path tracing [KMA * 15] extended standard path tracing to the gradient domain through sampling correlated offset paths from the base paths.  ... 
doi:10.2312/sre.20171197 dblp:conf/rt/Sun0CNR17 fatcat:3w24mbnc2fhkpkapxxwtpjopn4

A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions

Madhuri Karnik, Bhaskar Dasgupta, Vinayak Eswaran
2004 Future generations computer systems  
the domain boundary.  ...  Harmonic functions, by virtue of their extrema appearing only on the domain boundary, are known to have an advantage as a global potential function in the potential field based approach for robot path  ...  In the present work, the actual path is not drawn, but the possibility and efficiency of tracing the path is investigated from the nature of the harmonic function in the domain.  ... 
doi:10.1016/j.future.2003.07.008 fatcat:l4vznkht2fao3bjxjhxjywqyfq

A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions

M Karnik
2003 Future generations computer systems  
the domain boundary.  ...  Harmonic functions, by virtue of their extrema appearing only on the domain boundary, are known to have an advantage as a global potential function in the potential field based approach for robot path  ...  In the present work, the actual path is not drawn, but the possibility and efficiency of tracing the path is investigated from the nature of the harmonic function in the domain.  ... 
doi:10.1016/s0167-739x(03)00185-7 fatcat:jyfrh4fbfjdstipmxheojrycdq

A Comparative Study of Dirichlet and Neumann Conditions for Path Planning through Harmonic Functions [chapter]

Madhuri Karnik, Bhaskar Dasgupta, Vinayak Eswaran
2002 Lecture Notes in Computer Science  
the domain boundary.  ...  Harmonic functions, by virtue of their extrema appearing only on the domain boundary, are known to have an advantage as a global potential function in the potential field based approach for robot path  ...  In the present work, the actual path is not drawn, but the possibility and efficiency of tracing the path is investigated from the nature of the harmonic function in the domain.  ... 
doi:10.1007/3-540-46080-2_46 fatcat:k4iilj6rlnhqbiqf3epqgr5dy4

[Paper] Pencil Tracing Mirage

Katsuhisa Kanazawa, Yuma Sakato, Tokiichiro Takahashi
2013 ITE Transactions on Media Technology and Applications  
We focus on pencil tracing technique that is an extension of the conventional ray tracing technique based on the paraxial approximation theory.  ...  Ray tracing is the most well-known technique to synthesize a realistic image.  ...  Conclusion We propose a simple method that extends pencil tracing technique for simulating mirages.  ... 
doi:10.3169/mta.1.307 fatcat:6w72kkcz5bg7znueshodvumzmm

Path differentials and applications [chapter]

Frank Suykens, Yves D. Willems
2001 Eurographics  
Additionally the path gradient is introduced; it gives the rate of change of the path contribution. When this change is too steep the size of the footprint is reduced.  ...  Knowledge about the neighborhood of the path, such as an estimated footprint, can be used to reduce these artefacts without having to trace additional paths.  ...  The domain of all possible paths with M degrees of freedom (g X M ) is the Mdimensional unit hypercube. A point in the domain determines a path.  ... 
doi:10.1007/978-3-7091-6242-2_24 fatcat:4eqgmmpis5azhdlnayaxklp6ga

Path differentials and applications [article]

Frank Suykens, Yves D. Willems
2001 Symposium on Rendering  
Additionally the path gradient is introduced; it gives the rate of change of the path contribution. When this change is too steep the size of the footprint is reduced.  ...  Knowledge about the neighborhood of the path, such as an estimated footprint, can be used to reduce these artefacts without having to trace additional paths.  ...  The domain of all possible paths with M degrees of freedom (g X M )is the Mdimensional unit hypercube. A point in the domain determines a path.  ... 
doi:10.2312/egwr/egwr01/257-268 fatcat:2kxgw3flovhsfo55tzif7z53du

Deep convolutional reconstruction for gradient-domain rendering

Markus Kettunen, Erik Härkönen, Jaakko Lehtinen
2019 ACM Transactions on Graphics  
Our results significantly improve the quality obtained from gradientdomain path tracing, allowing it to overtake state-of-the-art comparison techniques that denoise traditional Monte Carlo samplings.  ...  The reasons can be traced to the frequency content of the light transport integrand and its interplay with the gradient operator.  ...  adapt Path Tracing to Gradient-Domain Rendering.  ... 
doi:10.1145/3306346.3323038 fatcat:5d3alsh4hneqzgoiasg6myyldi

On Divergence-based Distance Functions for Multiply-connected Domains [article]

Renjie Chen and Craig Gotsman and Kai Hormann
2018 arXiv   pre-print
Thus D can be used to trace a gradient-descent path within Ω from x to y by following ∇_x D(x,y), which has significant computational advantages over tracing the gradient of G.  ...  This result can be used for robotic path-planning in complex geometric environments.  ...  This implies that the divergence distance function may be used to trace paths between pairs of points in the domain by gradient descent.  ... 
arXiv:1801.07099v1 fatcat:mezi2zkynfhmlkmeivqshcg27e

A hybrid computational model to predict chemotactic guidance of growth cones

Iolanda Morana Roccasalvo, Silvestro Micera, Pier Nicola Sergi
2015 Scientific Reports  
An increased level of [Ca 2+ ] i was found to be spread across the growth cone domain as well as clustered in micro-domains.  ...  The overall strategy used by growing axons to find their correct paths during the nervous system development is not yet completely understood.  ...  The displacement of the barycentre of the GC area was considered to trace paths. Quantitative comparison between in silico and biological paths.  ... 
doi:10.1038/srep11340 pmid:26086936 pmcid:PMC4471899 fatcat:uuiyurlvo5brbdaz7z23aznblm

Adaptive Multi-view Path Tracing

Basile Fraboni, Jean-Claude Iehl, Vincent Nivoliers, Guillaume Bouchard
2019 Eurographics Symposium on Rendering  
This set of hit points and bouncing directions is then used within a regular path tracing solution.  ...  Rendering photo-realistic image sequences using path tracing and Monte Carlo integration often requires sampling a large number of paths to get converged results.  ...  Our method is not incompatible with gradient domain methods and merely allows to get more paths using reprojections, and gradient domain solutions could benefit from our approach.  ... 
doi:10.2312/sr.20191217 dblp:conf/rt/FraboniINB19 fatcat:5ljmnuaynjg7rnz3rhdtyvd4iu
« Previous Showing results 1 — 15 out of 81,007 results