CS 348B - Computer Graphics: Image Synthesis Techniques

Description

This course provides a broad overview of the theory and practice of rendering. Classic rendering algorithms will be covered, however, most of the course will cover current results in physically-based rendering algorithms.

Prerequisites

Attendees should have a working knowledge of computer graphics (at the level of CS248 and CS348A). In particular, you should fully understand the basic 3D display pipeline, viewing and modeling transformations, simple geometric modeling using polygons and quadrics, and hidden surface algorithms like the z-buffer algorithm.

Solid knowledge of integral calculus and basic geometric algorithms is an absolute must. Some exposure to signal processing and probability is also assumed.

Information

Personnel

Instructor

Pat Hanrahan
hanrahan@cs.stanford.edu
Rm 370 Gates Computer Science Building
(650) 723-8530
Office hours: 11:00-12:00noon Thu

Teaching assistant

Mike Cammarano
mcammara at graphics dot stanford dot edu
Rm. 372 Gates Computer Science Building
Office hours: 4:00-5:00 Tuesday, Thursday

Secretary

Ada Glucksman
ada@graphics.stanford.edu
Room 368 Gates Computer Science Building
(next to Pat Hanrahan's office)
(650) 725-3724
Office hours: Mon-Fri, 9:00 to 4:30

Readings and Optional Texts

There is no required text for the course. Additional readings will be assigned from research monographs, papers from journals and conference proceedings, and excerpts from conference tutorials. Only papers NOT available online will be handed out in class.

Optional texts

Andrew Glassner,
An Introduction to Ray Tracing,
Academic Press.

This book contains a collection of chapters written by many of the original inventors of major ray tracing algorithms. Although somewhat dated, it is filled with both practical and theoretical information that not available in other books.

Michael Cohen and John Wallace,
Radiosity and Realistic Image Synthesis,
Academic Press.

The book by Cohen and Wallace is a good introduction to physically-based rendering, although they emphasize radiosity.

Andrew Glassner,
Principles of Digital Image Synthesis,
Morgan Kaufmann, 1995.

An encyclopedic overview of rendering.

Henrik Wann Jensen, Realistic Image Synthesis Using Photon Mapping A. K. Peters, 2001.

A great book that describes the best current technique for global illumination calculations, the photon map.

Peter Shirley,
Realistic Ray Tracing,
A. K. Peters, 2001.

This ray tracing book by Peter Shirley is highly recommended. It covers much of the material in the class at an introductory level.

Francois Sillion, Claude Puech,
Radiosity and Global Illumination,
Morgan Kaufmann, 1994.
Another good introduction to physically-based rendering, emphasizing radiosity.

Additional texts

Anthony Apodaca and Larry Gritz,
Advanced Renderman: Creating CGI for the Motion Pictures,
Morgan Kaufmann, 1999.
David Ebert, F. Kenton Musgrave, Darwyn Peachey, Steven Worley, Ken Perlin,
Texturing and Modeling,
second edition, Morgan Kaufmann, 1998.
Steve Upstill,
The RenderMan Companion: A Programmers Guide to Realistic Computer Graphics,
Addison-Wesley, 1989.

The book by Ebert et al. is a excellent overview of procedural modeling and texturing. The book by Upstill is the standard reference on the RenderMan interface; the other book on RenderMan by Apadoca and Gritz is the best current overview of advanced rendering from the user's point of view.

All books are on reserve in the Math and Computer Science Library.

Topics and Schedule

All lecture slides will be placed online the night before class. Please try to do the readings in advance. Note: these lecture slides were not designed to be self-explanatory. I write on the slides and add a great deal of material during class.

Apr 2 The Goals of Rendering
Apr 4 Ray Tracing I: Basic Algorithms
Apr 9 Ray Tracing II: Acceleration Techniques
Apr 11 The Light Field I
Apr 16 The Light Field II
Apr 18 Monte Carlo Integration I
Apr 23 Cameras and Film
Apr 25 Sampling and Reconstruction: Filtering, Aliasing and Antialiasing
Apr 30 Monte Carlo Integration II
May 2 Reflection Models I: BRDFs, Diffuse
May 7 Reflection Models II: Glossy
May 9 Texture and Materials
May 14 Participating Media and Volumetric Scattering
May 16 Light Transport and the Rendering Equation
May 21 Monte Carlo Methods I: Path Tracing
May 23 Monte Carlo Methods II: Irradiance Caching and Photon Maps
May 28 Radiosity
May 30 Current Topics in Rendering (Optional)
June 7 Final Projects Due; Rendering Competition

Assignments and Grading

The project for this quarter is to build a working a ray tracer. To help focus your efforts on the most interesting parts, we have built a ray tracing systems called lrt (for literate ray tracer).

Matt Pharr, Greg Humphreys
A Literate Ray Tracer,
Unpublished manuscript.
This is a work in progress. The manuscript will be available electronically.

lrt is is written using noweb, a system originally developed by Don Knuth and reimplemented and improved by Norman Ramsey for describing large software systems. lrt is a very modular rendering system and provides an architectural framework for exploring different rendering algorithms. lrt reads models that use PIXAR's RenderMan Interface.

The first part of the course involves three progamming assignments:

Stage 1: Implement ray-surface intersection methods for terrains.
Stage 2: Implement a automatic camera model that controls exposure, depth-of-field, and motion blur
Stage 3: Use Monte Carlo techniques to compute reflections from anisotropic surfaces illuminated by a linear light source.
Finally, in the last part of the course you will enhance your system so that it is capable of reproducing an image of a real object, for example, a gemstone, a puff of smoke, a candle flame, etc. Check out the results produced by previous students.

Evaluation criteria: The first three programming assignments will each count as 20% of your grade, and the last programming project will count as 40%. There will be no exams.

Collaboration: For the first three programming projects, you may discuss the assignment with friends, but you are expected to implement your own solutions. On the last programming project, you are permitted (and encouraged) to form teams of two people and partition your planned extensions among the team members. Teams may discuss their project with other teams, but may not share code.

Late assignments: Since each assignment builds on the previous one, it is important that assignments be completed on time. To allow for unforeseeable circumstances, you will be allowed three weekdays of grace during the quarter. Beyond this, late assignments will be penalized by 10% per weekday that they are late. On the last programming project, neither the demo nor the writeup may be late. Incompletes in this course are given only in exceptional circumstances.

Hardware and software

Hardware: To do the assignments you will have access to the Stanford Graphics Laboratory. The lab is located in two rooms in the basement of Sweet Hall. One room contains 15 PCs (Dell Optiplex 150, 997 Mhz PIII, 512MB main memory) with NVIDIA Quadro Graphics Cards. These machines are named raptor1 - raptor15 and run RedHat Linux 7.2. The other room contains 15 PCs (Dell Precision 420, 730 Mhz PIII, 256MB) with NVIDIA Quadro Graphics Cards. These machines are named firebird1 - firebird15 and run RedHat Linux 7.2. Use ssh for remote access. Students in CS 348B have non-exclusive priority access to this laboratory, whose door is opened using your Stanford ID.

All students with leland accounts automatically have accounts on these machines. Home directories on these machines are shared with other Stanford Computing Clusters using AFS. If you do not have a leland account, follow these instructions. Registered students will get an extra 60MB of disk quota and 200 pages of print quota for the quarter.

Using other machines: Our software will be installed on the Stanford Graphics Laboratory machines in Sweet Hall. We may also provide one or more 3D modeling programs. If you prefer working in your dorm room or workplace, and have access to a machine there, you are welcome to do the assignments on your own machines. We will make as many of these tools available via ftp as we are permitted by the terms of our licensing agreements, but we will not support them on any other platform. Moreover, your code must run on the PCs in Sweet Hall.

Rendering competition

In case the delight of learning does not sufficiently motivate you to exert yourselves heroically on the programming assignments, there will also be a rendering competition. At 3:00pm on Friday, June 7, a judging will be held to select the best rendering made using the ray tracer you have written in the course. While grades for the projects are based solely on "technical merit", the competition will be judged on both "technical merit" and "artistic impression". The jury, to be named later, will consist of computer graphics experts from both industry and academia. There will be several awards and one grand prize - an all-expenses-paid trip to Siggraph 2002 in San Antonio. Total value: about $1,000.

Copyright © 2002 Pat Hanrahan