|Lectures:||Tuesday, Thursday 12:30 pm - 2:00 pm in MCS B19|
|Labs:||Friday 11-12 (A2) or 3-4 (A3) in EMA 304|
|Instructor:||Prof. Margrit Betke|
|Teaching Assistant:||Elham Saraee|
|Class web page:
|Class mailing list:
|Staff||Phone||Office Hours / Homework Demo Hours||Office|
|Margrit Betke||betke @ bu.edu||353-8919||
Tuesdays 3-5 pm, Thursdays 2-3 pm,
and by appointment
|Elham Saraee||esaraee @ bu.edu||Please email||
Tuesdays 3:30-4:30 pm, Wednesdays 2-4 pm,
and by appointment
| Undergrad CS Lab,
730 Commonwealth Ave
Seeing Me in My Office:
Please feel free to stop by my office anytime. My office is in MCS 286 (111 Cummington Mall). I am generally around every day, but often in meetings, so the best time to reach me is during 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:
Elham is responsible for teaching the Laboratory section, helping you out during her office hours, and grading of the homework (or managing graders). Please talk to Elham if you have questions about your homework grades.
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., C++ or Java at CAS CS 112 level), linear algebra or geometric algorithms, and calculus.
Handouts: The updated course syllabus and most handouts are made available online. Check our course web page at least once a week for homework assignments and other information.
Textbook: I recommend some chapters in Robot Vision by BKP Horn, MIT Press. The book is not required. I will propose alternative reading material, and I will place the book on reserve in the Science Library.
Computing Environment: You will use one of the Computer Science Department's servers csa2.bu.edu or csa3.bu.edu, to download code and submit programming solutions.
To get an account, go to the Computer Science Department's Undergraduate Lab located at 730 Commonwealth Ave. You can work on various platforms in the Lab there, use the cameras, and have immediate access to the computing staff. You can also access the servers remotely using scp and ssh.
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 Elham or the grader 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 may work in a group. 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 (typically Tuesdays, 2-3 pm, MCS 148) and the CS Department Colloquia (typically Wednesdays 11-12 or 3-4 pm, MCS 148) on course related topics.
Class Participation: Come to class 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. I may give a short (announced) quiz so that shy students have a chance to discuss a topic in written form.
Take-Home Exam: There will be one take-home exam on the material discussed in the class and practiced with homeworks. To prepare for the exam, come to class, participate in our discussions, and keep up with homework assignments. There will not be a final in-class 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 take-home exam. 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!
You may also ask help from graduate students who are tutors in the undergraduate laboratory. Many of them have expertise in image and video computing. The names of tutors and their hours are listed on the Tutoring Schedule.
|9/6|| Course Introduction: Why study IVC?
Industry successes and current needs.
Image formation, image and video formats, color.
|Handout of slides. Lecture 1 links and Wiki Intro or Horn Ch. 1.||A1 out|
|9/8||Programming with Images: Pitfalls. Representations of object location, image projections, template matching, the flood fill algorithm, background differencing. Skin-based face detection. Similarity Functions (SSD, NCC), Motion: Template-based Tracking. Image Pyramids.||Wiki on template matching, normalized correlation.||.|
Binary Image Analysis: Moments,
Orientation, circularity measures, distance measures.
ROC analysis. Tumor Detection in Computed Tomography Images.
Neighborhoods, Multiple Component Labeling. Inspection, Virtual
Colonoscopy ||Moments and distances. Image Moments, Binary Image Analysis. Handout on Sequential Labeling, Horn Ch. 3, Fawcett (ROC analysis), Hu Moments, Hausdorff distance. Border following algorithm.||A1 due, A2 out.|
|9/20-22||Morphology. Thinning and Swelling, Circuit Board Inspection, Object Skeletons. Segmentation: Thresholding techniques, Region Merging, Splitting, and Growing, Region Representations.||Horn Ch. 4, Morphology, Erosion, Skeleton, Euler number. Thresholding, Segmentation (not all covered). Handout on Region Segmentation. Optional: Wang et al. 2005.||A2 due, A3 out.|
|9/27-9/29||Medical Image Databases. Image Smoothing, Edge Detection. Lung Fissure Detection. Active Contours.||Petrakis and Faloutsos, 1997, Wiki on: Edge Detection, Sobel, Prewitt, Roberts, Mexican Hat, Difference of Gaussians, Canny Edge Detector. Curve Growing for Lung Fissure Detection. Williams and Shah, 1992: paper, figures, and lecture.||.|
|10/4-6|| Tracking Methods and Applications: Tracking with Alpha-beta
Filter, Kalman Filter, Tracking Groups of Animals
Last day to drop class (without a 'W' grade), Wednesday, 10/12/2011.
|Alpha beta filter, Kalman filter. Censusing Millions of Bats.|| A3 due, A4 out.
Project proposal P1 out.
Multiple Object Tracking and Data Association. Optical Flow. Horn-and-Schunk Algorithm.
No class on Tuesday, October 13 (Monday schedule).
|Optical Flow, Horn 81||A4 due.|
|10/25-27||Structure from Motion. Rotation.||
Expressions, Black/Yacoob 95
Recovering Motion, Horn 88
|11/1-3||Absolute Orientation in 2D. Lung Nodule Registration. Quaternions, Absolute Orientation in 3D. In Lab: Feature-based Detection (SIFT),||Absolute Orientation, Horn 89, Wiki on SIFT. Paper on SIFT.||
Project proposal feedback. Project assignment P2 out.
Iterative Closest Point Algorithm. Lung Surface Alignment.
Stereoscopy, relative orientation, calibration.
Thursday, 11/10/2011: Last day to drop class (with a 'W' grade).
|Besl and McKay, 1992. Ko and Betke, 2001. Betke, Hong et al., 2003||P2 due, P3 out.|
|11/15, 17, 22||Epipolar geometry, binocular stereo. Image formation: Lenses, Shading, Lambert's Law, Phong's Model.||Theriault et al., 2014. Wiki on Lambert's law, Lambertian reflectance, Phong's model. Horn papers (or Chs. 10, 11, 17).||Tue 11/15: Exam out. Tue 11/22: Exam due.|
|11/29-12/1||Photometric Stereo, Shape from Shading.||Lecture slides||A6 out (no programming).|
|12/6-8||Student Projects: Guidelines, Topics, Schedule||12/6: Projects (P3) due, 12/8: A6 due.|
The links inks will become active as 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.
The take-home exam is due on Tuesday, November 22, in class. It is not available electronically. Make sure to come to class on Tuesday, November 15, to receive a copy.
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.