Applied Computer Vision Lecture Schedule
From David Vernon's Wiki
|CARNEGIE MELLON UNIVERSITY AFRICA|
| Date | Lecture | Topic | Material covered | Reading | Assignments |
|---|---|---|---|---|---|
| Mon. 28 Aug. | 1 | Overview of human and computer vision | Lecture 1 Slides. Szeliski 2010, Chapter 1. ] | ||
| Wed. 30 Aug. | 2 | Formalisms for Representing Algorithms | Definition of an algorithm. Modelling software. Relational modelling. State modelling. Practical representations. Pseudo code. Flow charts. Finite state machines. UML. Predicate logic. Analysis. | Lecture 2 Slides. Harel 2004, Chapters 1 and 2. | Assignment 1 |
| Mon. 4 Sept. | 3 | Analysis of Complexity I | Performance of algorithms, time and space tradeoff, worst case and average case performance. Big O notation. Recurrence relationships. Analysis of complexity of iterative and recursive algorithms. Recursive vs. iterative algorithms: runtime memory implications. | Lecture 3 Slides. Aho et al. 1983, Chapter 1. | |
| Wed. 6 Sept. | 4 | Analysis of Complexity II | Complexity theory: tractable vs intractable algorithmic complexity. Example intractable problems: travelling salesman problem, Hamiltonian circuit, 3-colour problem, SAT, cliques. Determinism and non-determinism. P, NP, and NP-Complete classes of algorithm. | Lecture 4 Slides. Aho et al. 1983, Chapter 1. | Assignment 2 |
| Mon. 11 Sept. | 5 | Searching and Sorting Algorithms I | Linear and binary search (iterative and recursive). In-place sorts: bubblesort (efficient and inefficient), selection sort, insertion sort. | Lecture 5 Slides. Aho et al. 1983, Chapter 8. | |
| Wed. 13 Sept. | 6 | Searching and Sorting Algorithms I | Not-in-place sorts: Quicksort, merge sort. Complexity analysis. Characteristics of a good sort. Speed, consistency, keys, memory usage, length & code complexity, stability. Other sorts ordered by complexity. | Lecture 6 Slides. Aho et al. 1983, Chapter 8. | |
| Mon. 18 Sept. | 7 | Abstract Data Types (ADT) | Abstract Data Types (ADT). Information hiding. Types and typing. Design Goals. Design practices. | Lecture 7 Slides. | |
| Wed. 20 Sept. | 8 | Containers, Dictionaries, and Lists I | Container and dictionaries: mechanisms for accessing data in a list. List ADT. Implementation with arrays. | Lecture 8 Slides. | Assignment 3 |
| Mon. 25 Sept. | 9 | Containers, Dictionaries, and Lists II | List ADT. Implementation with linked lists. Doubly linked lists and circular lists. Performance considerations. | Lecture 9 Slides. | |
| Wed. 27 Feb. | 10 | Stacks | Stack (LIFO) ADT. Implementation using List ADT (array and linked-list). Comparison of order of complexity. Stack applications, including token matching, evaluation of postfix expressions, and conversion of infix expressions to postfix. | Lecture 10 Slides. | |
| Mon. 2 Oct. | 11 | Queue (FIFO ADT). Implementation using List ADT (array and linked-list). Comparison of order of complexity. Dedicated ADT. Circular queues. Queue applications. | Lecture 11 Slides. On the Simulation of Random Events. | ||
| Wed. 4 Oct. | 12 | Concepts and terminology: level, height, external and internal nodes, skinny, fat, complete, left-complete, perfect, multi-way, d-ary. Types of tree: binary, binary search, B-tree, 2-3 tree, AVL, Red-Black | Lecture 12 Slides. | ||
| Mon. 9 Oct. | 13 | Lecture 13 Slides. | Lab Exercise 1 | ||
| Wed. 11 Oct. | 14 | ||||
| Mon. 16 Oct. | 15 | ||||
| Wed. 18 Oct. | 16 | ||||
| Mon. 23 Oct. | 17 | ||||
| Wed. 25 Oct. | 18 | ||||
| Mon. 30 Oct. | 19 | ||||
| Wed. 1 Nov. | 20 | ||||
| Mon. 6 Nov. | 21 | ||||
| Wed. 8 Nov. | 22 | ||||
| Mon. 13 Nov. | 23 | ||||
| Wed. 15 Nov. | 24 | ||||
| Mon. 20 Nov. | 25 | ||||
| Wed. 22 Nov. | 26 | ||||
| Mon. 27 Nov. | 27 | ||||
| Wed. 29 Nov. | 28 | ||||
| Mon. 4 Dec. | 29 | ||||
| Wed. 6 Dec. | 30 |
Back to Applied Computer Vision
