Homeworks:
We will have 8 homework assignments, which will be listed below as they are assigned. The assignments will be given out every week starting week 2.
Note that there is a deadline for each assignment. Anything uploaded after the deadline will be marked late. Please be careful to not overwrite an in time assignment with a late assignment when uploading near the deadline.
Each student has 8 penalty-free late days for the whole quarter; other than that any late submission will be penalized for each day it is late.
Please let the TA know if you cannot access any of the pages.
- Homework 0: Fun with color!, due October 10th at midnight
- Homework 1: Image resizing, due October 17th at midnight
- Homework 2: Image filtering, due October 24th at midnight
- Homework 3: Panoramas!, due November 5th at midnight
- Homework 4: Optical Flow, due November 14th at midnight
- Homework 5: Neural Networks, due November 21st at midnight
- Optional: Homework 6: PyTorch
Turn in all homeworks on canvas.
Final Project:
There will be a final project worth 20% of your final grade. The project can be done individually or in teams. We will have a poster session in the CSE Atrium at 12pm on December 9th.
Pick any area of computer vision that interests you and pursue some independent work in that area. Each project should have a significant technical component, software implementation, or large-scale study. Projects can focus on developing new techniques or tools in computer vision or applying existing tools to a new domain. If you don't have an idea you can train a classifier on birds and compete in the Kaggle competition posted on the message board.
For your poster you can use this template from graduate student Kiana Ehsani: here. If you send your poster using the template by Sunday at noon we can print them for the poster session. Otherwise, feel free to make your own poster, print it, and assemble it for the poster session!
Syllabus Overview:
-
9/26
- Lecture: Introduction
-
10/1
- Lecture: Human Vision, Color Spaces and Transforms
- Optional reading: Computer Vision - 2.3.2 Color
- Other resources: Computer Vision A Modern Approach - 3 Color
- A painter's take on vision and color (very extensive!): Color Vision
-
10/3
- Lecture: Image coordinates, resizing
-
10/8
- Lecture: Resizing, filters, convolutions
- Optional reading: Computer Vision: A Modern Approach - 7 Linear Filters and Convolution
-
10/10
- Lecture: Edges and features
-
10/15
- Lecture: Harris, matching, RANSAC
-
10/17
- Lecture: Matching, RANSAC, HOG, SIFT
-
10/22
- Lecture: Optical Flow
-
10/24
- Lecture: 3D, Depth Perception, and Stereo
-
10/29
-
10/31
- Lecture: Machine Learning
- Happy Halloween!
-
11/5
-
11/7
- Lecture: Neural Networks
-
11/12
- Lecture: Convolutional Neural Networks
-
11/14
- Lecture: Network Architectures
-
11/19
- Lecture: Semantic Segmentation
-
11/21
- Lecture: Object Detection
-
11/26
- Lecture: Detection and Instance Segmentation
-
11/28
- No Class, Happy Thanksgiving!
-
12/3
- Lecture: Generative Adversarial Networks
-
12/5
- TBD
Text Books:
- Optional: Computer Vision: Algorithms and Applications Rick Szeliski, 2010.
Grading:
The final grade will consist of homeworks (80%) and a final project (20%)
Course Administration and Policies
- Collaboration is encouraged! Feel free to discuss howemork and class material with other students. However, make sure you understand the concepts. Each student will complete and submit their own work. Do not directly or indirectly copy other students' work.
- If you are working together or helping another student, work on teaching them concepts and answering general questions, not directly telling them what code to write. You're all smart; you should understand the line between productive collaboration and giving someone answers.
- Each student has 8 penalty-free late day for the whole quarter. Beyond that, late submissions are penalized.
- Comments can be sent to the instructor or TA using this anonymous feedback form here. We take all feedback very seriously and will do whatever we can to address any concerns.