Light Field Duality: Concept and Applications: Difference between revisions

No edit summary
 
(4 intermediate revisions by the same user not shown)
Line 1: Line 1:
Light Field Duality: Concept and Applications
Light Field Duality: Concept and Applications (VRST 2002)


Authors: George Chen, Li Hong, Kim Ng, Peter McGuinness, Christian Hofsetz, Yang Liu, Nelson Max
Authors: George Chen, Li Hong, Kim Ng, Peter McGuinness, Christian Hofsetz, Yang Liu, Nelson Max
Affiliations: STMicroelectronics, UC Davis
Affiliations: STMicroelectronics, UC Davis


* [https://dl.acm.org/doi/abs/10.1145/585740.585743 ACM DL] [https://dl.acm.org/doi/pdf/10.1145/585740.585743 ACL DL PDF]
* [https://dl.acm.org/doi/abs/10.1145/585740.585743 ACM DL] [https://dl.acm.org/doi/pdf/10.1145/585740.585743 ACL DL PDF] [https://escholarship.org/content/qt0fp8x522/qt0fp8x522.pdf escholorship.org mirror]


==Background==
==Background==
Line 25: Line 25:
See the figure to the right.
See the figure to the right.


With some algebra, this constraint can be written as either:
With some algebra, this constraint can be written as either:
<math>
<math>
\begin{bmatrix}
\begin{bmatrix}
Line 40: Line 40:
\end{bmatrix}
\end{bmatrix}
</math>   
</math>   
Or: 
<math>
<math>
\begin{bmatrix}
\begin{bmatrix}
Line 104: Line 105:


==GHL Light Field Rendering==
==GHL Light Field Rendering==
Rendering lightfields using geometry hyperlines is equivalent to rendering point clouds. 
For each virtual ray, you can compute the dual <math>(s_r, t_r, u_r, v_r)</math>. 
Then for each GHL, you can compute the optimal ray closest to the virtual ray. 
Then blend over selected GHLs.
The paper has details on addressing issues with holes and opacity using clustering.