|Lectures:||Tuesday, Thursday 9:30 am - 10:45 pm in CAS 502.|
|Labs:||Friday 2:30-3:20 and 3:35-4:25 in KCB 107 and 4:40-5:30 in EMA 304|
|Instructor:||Prof. Margrit Betke|
|Teaching Assistants:||Hao Yu and Ryan Yu|
|Class web page:
|Class mailing list:
|Piazza page:||https://piazza.com/class/kkcsajmqq235sh||Contact Information:|
|Staff||Best Way to Contact||Zoom Office Hours||Zoom Link|
|Margrit Betkefirstname.lastname@example.org||Mon 16:00-18:00, Tue/Thu 10:45-11:15||https://bostonu.zoom.us/my/margritbetke|
|Hao and Ryan||
Piazza. But note that there is a 24-hour timer on your Piazza questions
to encourage other students to answer questions before TFs will able to see
Only send an email if your question is urgent and requires an answer earlier than 24 hours. In that case, send an email to both TFs: Hao email@example.com and Ryan firstname.lastname@example.org
| Tue 16:00-18:00 EST,
Wed 7:00-9:00 EST
|TF zoom link|
Seeing Me in My Office:
Due to the pandemic, I will mostly work from home. Please try to reach me after class or on Monday afternoon during my office hours. You can also make an appointment by email. I'm happy to talk with you about the course, computer vision research, your plans for the future, or anything else. Check out my personal web page to get to know me a little.
Teaching Fellow Responsibilities:
The TFs are responsible for teaching the Laboratory section, helping you out during their office hours, and grading of the homework (or managing graders).
Our goal is to build computer systems that analyze images automatically and determine what the computer "sees" or "recognizes." The course gives you a fundamental introduction to computer vision methods. Applications include human-computer interfaces, face detection, medical image processing, infrared image analysis of animals, and vision systems for intelligent vehicles.
Prerequisites: 1 year programming experience (e.g., Python, C++ or Java at CAS CS 112 level), linear algebra or geometric algorithms, and calculus.
The syllabus below will be updated throughout the semester with lecture notes, videos, and reading materials. Links to homework assignments will come alive when the assignment is ready for you to work on.
Textbook: I recommend some chapters in Robot Vision by BKP Horn, MIT Press. The book is not required. I will propose alternative reading material.
Computing Environment: You will use the Computer Science Department's main server csa2.bu.edu to submit programming solutions. If you do not have a CS account yet, you may activate your account online at http://www.bu.edu/cs/account. You can also access csa2 remotely using scp and ssh (linux) or putty and WinSCP (Windows). You also have the opportunity to use GPUs provided by the BU IST Department's Scientific Computing Cluster.
Homework: The homework includes bi-weekly programming, reading assignments, and problem sets. The due dates are listed below. Programs and reports must be submitted electronically. Solutions to problem sets must be submitted in class. They do not need to be typed but should look professional, in particular, write legibly and leave a margin for grading comments.
Guidelines for submission are provided with each assignment. Late solutions will be levied a late penalty of 20% per day (up to three days). After three days, no credit will be given.
You must demo your bi-weekly programming projects and your final class project to the TFs or the graders within one of the offered time slots in order to receive full credit for your project submission. A signup sheet with available demo times will be circulated during class before the due date.
Your electronic project submission should include detailed instructions for compiling and setting up your program. The grader will recompile your program and test it on your input videos.
Project: Please read the project guidelines. You can propose your own project topic or use one of my project suggestions. I will discuss your project's scope, design, and presentation with you in my office hours and provide guidance throughout the semester. You must work in a group of 2-4 students. You will be asked to select a project topic by the middle of the semester and present the final project in class at the end of the semester. Here will be the project schedule.
Computer Vision Talks: Students are strongly encouraged to attend the Image and Video Computing talks, which are part of the new AI Research Seminar series on Mondays, 11-12 am, online.
Class Participation: Come to class, either in person or remotely, and participate regularly. Reading the textbook and listening in class will only give you a "passive understanding" of the material. I encourage discussions in class to help you acquire an "active understanding" of the material so that you can evaluate existing computer vision techniques critically and develop your own creative solutions. Participation counts toward your overall grade. If you have trouble connecting via zoom in real time, let us know and make sure to be active on Piazza so that you do not receive a failing grade in participation.
Talk Writups: You must attend at least two talks on subjects related to CS 585 and write a summary on each talk (at most 2 pages per summary). Your summary should give a problem definition, summarize the algorithms and results, discuss the work critically, and also briefly explain how the work relates to material discussed in class. You must submit a printout of your summary at the beginning of class on the dates listed in the syllabus. Check your text for typographical and grammatical errors (e.g., use grammarly.com). You will lose points if you simply copy the speaker's abstract, your review is late, contains typographical and grammatical errors, does not contain a discussion, and does not contain a statement how the talk relates to class material. New update: The lower score of the two talk writeups you submit will be dropped.
Exams: There will be two exams on the material discussed in the class and practiced with homeworks. The exams will be quite easy for students who come to class, participate in our discussions, and keep up with homework assignments and programming projects. The date of the midterm exam is Thursday, February 25 the date of the final exam is in the final exam period, as determined by the Registrar's Office. The final exam will focus on material discussed in the second part of the course, but may test earlier material. You are allowed to use one double-sided page of notes in each exam.
Grading Policy: Your final grade will be determined roughly as follows:
Collaboration and Academic Integrity
You are encouraged to collaborate on the solution of the homework. If you do, you must acknowledge your collaborators. Each student must submit his or her own electronic version of the solutions. You can request an exception to this rule for your final project. If you use algorithms or code that are not your own original work and that were not provided in class or discussed in the textbook, you must give a detailed acknowledgment of your source .
You are not allowed to collaborate on the solution of the exams. Sources must be acknowledged.
Cheating and plagiarism are not worthy of Boston University students. I expect you to abide by the rule stated above and the standards of academic honesty and computer ethics policy described in http://www.bu.edu/computing/ethics/ and http://www.bu.edu/academics/policies/academic-conduct-code
Image and Video Computing is an elective course that will introduce you to an exciting topic in computer science. It should be fun and not too much of a struggle for you. Make sure that you have had the prerequisites. Depending on your level of programming experience and/or mathematics background, the course may be challenging for you. If you do not understand the material, ask for help immediately. Ask questions in class. If one student is confused about something, then maybe others are also confused and grateful that someone asked. Come and see me or the TF for help or send us email. Our task is to help you learn a very interesting topic!
|Dates||Topics --- Links will become active with lecture||Readings --- Links will become active||Assignments|
|1/26/21||Course Introduction: Why study IVC? Industry successes and current needs.||Lecture 1 links, Wiki Intro or Horn Ch. 1.|
|1/28/21||Image and video formats, color (RGB, HSV), Image Projections, Flood Fill Algorithm, Sequential Multi-object Labeling Algorithm. Skin-color based face detection algorithm.||Lecture 2 slides.||1/29/21: A1 out (after lab)|
|2/2/21||Programming with Images: Pitfalls. Binary Image Analysis: Moments, centroid.||Moments and distances. Image Moments, Binary Image Analysis. Horn Ch. 3.||.|
|2/4/21||Binary Image Analysis: Object orientation, circularity measures. Lecture notes photos: 1, 2, 3.||Image Moments, Binary Image Analysis. Horn Ch. 3.||A1 due|
|2/9/21||Sequential Labeling Algorithm. Template matching background differencing. Skin-based face detection. Similarity Functions (SSD, NCC), Motion: Template-based Tracking. Image Pyramids: Lecture notes.||Wiki on template matching, normalized correlation. Image Moments, Binary Image Analysis. Skeleton, Horn Ch. 3,||.|
|2/11/21||Tumor Detection in Computed Tomography Images. Confusion matrix analysis. Motion energy.||Fawcett (confusion matrix analysis), Horn Ch. 4.||A2 out.|
No class on Tuesday, February 16 (Monday schedule).
Segmentation: Thresholding techniques. Neighborhoods. Border following algorithm. Hausdorff Distance. Lecture notes.
|Border following algorithm. Segmentation (most algorithms covered). Hausdorff distance. Thresholding.||A2 due, A3 out|
|2/23||Lecture notes on edge detection & active contours Canny Edge Detection. Active Contours.||Sobel, Prewitt, Roberts, Mexican Hat, Difference of Gaussians, Canny Edge Detector. Williams and Shah, 1992: paper, figures, and lecture. Hausdorff distance.||A3 due.|
|2/25||No lecture. Midterm Exam: Available on Gradescope 2/25, 9:30 am, due on Gradescope, 2/26, 9:30 am|
|3/2 - 3/4/21||
Last day to drop class (without a 'W' grade), 3/1/2021. Deep learning and computer vision
|3/9||Vision and Language||.|
|3/11, 3/16||Optical flow and Pinhole Model, Binocular Stereo, Lens Equation||
Lecture video by Margrit Betke.
Lecture video by Xide Xia.
Thin lens equation for image formation.
|3/18||No class. Wellness Day||A4 Out 3/19|
Binocular Stereo, Multiview Stereo, Epipolar Geometry, Active Stereo with Structured Light, Photometric Stereo
Lecture video by Margrit Betke.
Wiki on Lambert's law, Lambertian reflectance, Lecture slides on photometric stereo
|3/25, 3/30||Active Contours. Tracking Methods and Applications: Tracking with Alpha-beta Filter, Kalman Filter, Tracking groups of Animals, Multiple Object Tracking and Data Associattion.||Bat tracking presentation, Alpha beta filter, Kalman filter. Multiple-Object Tracking||A4 Due (3/26). A5 out (3/26). Team Registration Deadline (3/30)|
|4/1, 4/6, 4/7, 4/13||Guest Lectures - Topics TBA||A5 due (4/2)|
|4/15/21||Lung Image Analysis of COVID19 and Cancer Patients. Absolute Orientation in 2D.||
Lecture video by Margrit Betke.
Absolute Orientation, Horn 89
|4/20||Lung Image Analysis of COVID-19 and Cancer Patients: CT Scan Alignment Part 2: Quaternions. Horn's 3D Absolute Orientation Algorithm. Iterative Closest Point Algorithm. Lung Surface Alignment.||
Lecture video by Margrit Betke.
Besl and McKay, 1992. Ko and Betke, 2001. Betke, Hong et al., 2003
|4/22/21||Style Transfer with Neural Models||.|
|4/27/21, 4/29/21||Student Projects: Guidelines, Topics, Schedule||Project Deadline (Code, Slides)|
|Wed., May 6, 12-2||Student Presentations Continued (if needed)|
The links will become active as the semester progresses.
The assignments will have some programming components and some paper-and-pencil exercises. The links will became active when the assignment is announced.
There will be two assignments that relate to your projects (P1 and P2). For project ideas, check here.
Please find your grades here: CS585 Grades.
Computer Vision Links
Check out http://www.cs.bu.edu/faculty/betke/links.html if you need additional ideas for your class project, if you are looking for a job in computer vision (list of companies), or if you are interested in computer vision research. You will find a list of links to computer vision conferences, journals, research groups, and companies.
I do not expect you to have a background multivariate calculus. I will introduce the tools we will need. You may find the first few chapters of these notes by Cain and Herod useful, in particular, partial derivatives, Taylor polynomial, Multivariate Taylor polynomial.