Deep Opacity Maps
dc.contributor.author | Yuksel, Cem | en_US |
dc.contributor.author | Keyser, John | en_US |
dc.date.accessioned | 2015-02-21T16:19:48Z | |
dc.date.available | 2015-02-21T16:19:48Z | |
dc.date.issued | 2008 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/j.1467-8659.2008.01165.x | en_US |
dc.description.abstract | We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a depth map to obtain a per pixel distribution of opacity layers. This approach eliminates the layering artifacts of opacity shadow maps and requires far fewer layers to achieve high quality shadow computation. Furthermore, it is faster than the density clustering technique, and produces less noise with comparable shadow quality. We provide qualitative comparisons to these previous methods and give performance results. Our algorithm is easy to implement, faster, and more memory efficient, enabling us to generate high quality hair shadows in real-time using graphics hardware on a standard PC. | en_US |
dc.publisher | The Eurographics Association and Blackwell Publishing Ltd | en_US |
dc.title | Deep Opacity Maps | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 27 | en_US |
dc.description.number | 2 | en_US |
dc.identifier.doi | 10.1111/j.1467-8659.2008.01165.x | en_US |
dc.identifier.pages | 675-680 | en_US |
Files in this item
This item appears in the following Collection(s)
-
27-Issue 2
EG 2008 - Conference Issue -
Full Papers 2008 - CGF 27-Issue 2
Eurographics 2008 - Conference Papers