1. 03/24/03© 2003 University of Wisconsin Last Time Image Based Rendering from Sparse Data

2. 03/24/03© 2003 University of Wisconsin Today Image-Based Rendering from Dense Data

3. 03/24/03© 2003 University of Wisconsin Mental Exercise What are some parameterizations of lines in 2D? –Vectors? –Implicit formulas? –Others? How many numbers does it take to describe a line in 2D? Some parameterizations of lines in 3D? –Vectors? –Implicit? –Plucker coordinates? –Others? How many numbers in 3D?

4. 03/24/03© 2003 University of Wisconsin Light Field Rendering or Lumigraphs Aims: –Sample the plenoptic function, or light field, densely –Store the samples in a data structure that is easy to access –Rendering is simply averaging of samples The plenoptic function gives the radiance passing through a point in space in a particular direction In free space: Gives the radiance along a line –Recall that radiance is constant along a line

5. 03/24/03© 2003 University of Wisconsin Storing Light Fields Each sample of the light field represents radiance along a line Required operations: –Store the radiance associated with an oriented line –Look up the radiance of lines that are “close” to a desired line Hence, we need some way of describing, or parameterizing, oriented lines –A line is a 4D object –There are several possible parameterizations

6. 03/24/03© 2003 University of Wisconsin Parameterizing Oriented Lines Desirable properties: –Efficient conversion from lines to parameters –Control over which subset of lines is of interest –Ease of uniform sampling of lines in space Parameterize lines by their intersection with two planes in arbitrary positions –Take (s,t) as intersection of line in one plane, (u,v) as intersection in other: L(s,t,u,v) –Light Slab: use two quadrilaterals (squares) and restrict each of s,t,u,v to (0,1)

7. 03/24/03© 2003 University of Wisconsin A Slab

8. 03/24/03© 2003 University of Wisconsin Line Space An alternate parameterization is line space –Better for looking at subset of lines and verifying sampling patterns –In 2D, parameterize lines by their angle with the x-axis, and their perpendicular distance form the origin –Extension to 3D is straightforward Every line in space maps to a point in line space, and vice versa –The two spaces are dual –Some operations are much easier in one space than the other

9. 03/24/03© 2003 University of Wisconsin Verifying Sampling Patterns

10. 03/24/03© 2003 University of Wisconsin Light Field Visualization

11. 03/24/03© 2003 University of Wisconsin Capturing Light Fields Render synthetic images Capture digitized photographs –Use a gantry to carefully control which images are captured Makes it easy to control the light field sampling pattern Hard to build the gantry –Use a video camera Easy to acquire the images Hard to control the sampling pattern

12. 03/24/03© 2003 University of Wisconsin Tightly Controlled Capture Use a computer controlled gantry to move a camera to fixed positions and take digital images Looks in at an object from outside –Must acquire multiple slabs to get full coverage –Care must be taken with camera alignment and optics Object is rotated in front of gantry to get multiple slabs –Must ensure lighting moves with the object Effectively samples light field on a regular grid, so rendering is easier

13. 03/24/03© 2003 University of Wisconsin Gantry Capture

14. 03/24/03© 2003 University of Wisconsin Capture from Hand Held Video Place the object on a calibrated stage –Colored to allow blue-screening –Markers to allow easy determination of camera pose Wave the camera around in front of the object –Map to help guide where more samples are required Camera must be calibrated beforehand Output: A large number of non-uniform samples Problem: Have to re-sample to get regular sampling for rendering

15. 03/24/03© 2003 University of Wisconsin Video Based Capture

16. 03/24/03© 2003 University of Wisconsin Re-Sampling the Light Field Basic problem: –Input: The set of irregular samples from the video capture process –Output: Estimates of the radiance on a regular grid in parameter space Algorithm outline: –Use a multi-resolution algorithm to estimate radiance in under- sampled regions –Use a binning algorithm to uniformly resample without bias

17. 03/24/03© 2003 University of Wisconsin Compression Light fields samples must be dense for good rendering Dense light fields are big: 1.6GB –When rendering, samples could come from any part of the light field –All of the light field must be in memory for real-time rendering –But lots of data redundancy, so compression should do well Desirable compression scheme properties: –Random access to compressed data –Asymmetric – slow compression, fast decompression

18. 03/24/03© 2003 University of Wisconsin Compression Scheme Vector Quantization: –Compression: Choose a codebook of reproduction vectors Replace all the vectors in the data with the index into the “nearest” vector in the codebook –Storage: The codebook plus the indexes –Decompression: Replace each index with the vector from the codebook Follow up with Lempel-Ziv entropy encoding (gzip) –Decompress into memory

19. 03/24/03© 2003 University of Wisconsin Render synthetic images Decide which line you wish to sample, and cast a ray, or Render an array of images from points on the (u,v) plane – pixels in the images are points on the (s,t) plane Antialiasing is essential, both in (s,t) and (u,v) –Standard anitaliasing and aperture filtering

20. 03/24/03© 2003 University of Wisconsin Rendering Ray-tracing: For each pixel in the image: –Determine the ray passing through the eye and the pixel –Interpolate the radiance along that ray from the nearest rays in the light-field Texture Mapping: –Finding the (u,v) and (s,t) coordinates is exactly the texture mapping operation –Use graphics hardware to do the job, or write a software texture mapper (maybe faster – only have to texture map two polygons) Use various interpolation schemes to control aliasing

21. 03/24/03© 2003 University of Wisconsin Results

22. 03/24/03© 2003 University of Wisconsin Results

23. 03/24/03© 2003 University of Wisconsin Exploiting Geometry When using the video capture approach, build a geometric model –Use a volume carving technique When determining the “nearest” samples for rendering, use the geometry to choose better samples This has been further extended: –Surface point used for improving sampling determines focus –By default, we want focus at the object, so use the object geometry –Using other surfaces gives depth of field and variable focus

24. 03/24/03© 2003 University of Wisconsin Depth Correction

25. 03/24/03© 2003 University of Wisconsin Surface Light Fields Instead of storing the complete light-field, store only lines emanating from the surface of interest –Parameterize the surface mesh (standard technique) –Choose sample points on the surface –Sample the space of rays leaving the surface from those points –When rendering, look up nearby sample points and appropriate sample rays Best for rendering complex BRDF models –An example of view dependent texturing

26. 03/24/03© 2003 University of Wisconsin Surface Light Field Set-Up

27. 03/24/03© 2003 University of Wisconsin Surface Light Field System Capture with range-scanners and cameras –Geometry and images Build Lumispheres and compress them –Several compression options, discussed in some detail Rendering methods –A real-time version exists

28. 03/24/03© 2003 University of Wisconsin Surface Light Field Results

29. 03/24/03© 2003 University of Wisconsin Surface Light Field Results PhotosRenderings

30. 03/24/03© 2003 University of Wisconsin Surface Light Fields Analysis Why doesn’t this solve the photorealistic rendering problem? How could it be extended?

31. 03/24/03© 2003 University of Wisconsin Summary Light-fields capture very dense representations of the plenoptic function –Fields can be stitched together to give walkthroughs –The data requirements are large –Sampling still not dense enough – filtering introduces blurring Next time: Using domain specific knowledge