Lectures (by week)

1. Image acquisition, storage and display. Compositing and Matting
   • pdf
   • Up to and including Solution 3 in the Smith and Blinn paper.
2. Drawing primitives, anti-aliasing
   • Ignore the last page!! pdf
   • Sections 3.1 and 3.2 from Hearn and Baker
   Edge detection
   • pdf
   • Section 5.6.1 from Shapiro & Stockman 1
3. Edge detection, painterly effects
   • pdf
   • Section 5.6.2 from Shapiro & Stockman 1
   More edge detection, zero crossings, image smoothing, intelligent scissors
   • pdf
   • Section 5.7 (except 5.7.2) from Shapiro & Stockman 2
   • Optional Painterly effects
4. Scissoring and Image Representation
   • pdf
   • Scissoring paper (up to section 3.3) in pdf ps. Mortensens homepage
   • A note on Floyd's Algorithm in pdf or in ps.
   Image Representation, Gaussian and Laplacian Pyramids, Wavelets
   • pdf
   • Pyramids
   • Section 1, 2 (not 2.3), 3.1 (skip nonstandard decomposition technique), 3.2 in Haar Wavelets Tutorial Part 1
   • (Optional)Haar Wavelets Tutorial Part 2
   • Easy paper on Haar Wavelets and image compression
5. Multiresolution editing
   • pdf
   • Up to 2.3 in the Berman paper on multiresolution editing.
   Fourier Transform
   • We covered up to the top of page 8 of Fourier Transform
   • Play with the Fourier Transform
   • Fourier Transforms of Images
6. Indepth look at the Scissoring paper
   • Read (up to section 3.3) (in pdf or in ps).
   • Dijkstra's Shortest Path Algorithm
     • link 1
     • link2
7. Image Transformations (Texture Mapping) all notes were on the board.
   • pdf
   • Perspective and Orthographic projections
   • Affine Transformations
   • Forward and Backward mapping
   • Mapping quadrilaterals to quadrilaterals using a linear transformation
8. Image Transformations (notes from last week) and Anti-aliasing techniques for texture mapping
   • pdf
   • Official Image Transformation notes were on the board.
   Image Mosaicing
   • pdf
9. Test this week during lecture
10. Computational Geometry
    • Preliminaries: Working over R², points, lines, linesegments, polygons and conventions, what a right turn means, a collection of problems.
    • Official notes were on the board, but here is an excellent set of online lecture notes.
    Convex hull algorithms
    • An O(n³) algorithm.
    • An O(n log₂n) algorithm (Grahams Scan)
11. Computational Geometry
    • An O(n log₂n) algorithm for determining the closest pair of points.
    • Antipodal pair of points on a convex hull and the farthest pair of points.
    Image Morphing
    • A sketch of Beier-Neely Morphing
    • The paper can be found here
12. More details about Image Morphing
    • notes.pdf
    Simulation and Particle Systems
    • notes
13. We reviewed and discussed test2
    • Review questions can be found in ps and pdf. The polygon triangulation problem is harder than anything you would see on the test, so don't be scared by that question. Try for example, triangulating a convex polygon. The test will focus mostly on weeks 7 on, so, for example, Anti-aliasing techniques for texture mapping was not in the review, but it could be on the test.