Difference between revisions of "Applied Computer Vision Lecture Schedule"

From David Vernon's Wiki
Jump to: navigation, search
Line 12: Line 12:
 
! scope="col" style="width: 13%;" | Assignments
 
! scope="col" style="width: 13%;" | Assignments
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 18 Jan.
+
| Mon. 28 Aug.
 
| 1
 
| 1
−
| Introduction & The Software Development Life Cycle
+
| Overview of human and computer vision
−
|Motivation. Goals of the course. Syllabus and lecture schedule. Course operation. Preview of course material. Overview of labs, assignments, and exercises. Software development tools for assignments. Levels of abstraction in information processing systems. The software development life cycle: Yourdon Structured Analysis - functional,  data, and behavioural models (hierarchical decomposition trees, architecture diagrams, data flow diagrams DFD, data dictionaries, entity relationship ER diagrams, state transition diagrams). Software process models: waterfall, evolutionary, formal transformation, re-use, hybrid, spiral.
+
|
−
|[http://www.vernon.eu/04-630/04-630_Lecture_01_Intro_and_SW_Dev_Life_Cycle.pdf Lecture 1 Slides]. Harel 2004, Chapter 13. [http://agile.csc.ncsu.edu/SEMaterials/AgileMethods.pdf Williams 2007]. Optional: [http://www.vernon.eu/04-630/Software_Development_Life_Cycle.pdf Software Development Life Cycle], [http://www.vernon.eu/wiki/The_CINDY_Cognitive_Architecture#Software_Engineering_Standards Software Standards]
+
|[http://www.vernon.eu/ACV/ACV_01.pdf Lecture 1 Slides]. Szeliski 2010, Chapter 1. ]
 
|
 
|
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 23 Jan.
+
| Wed. 30 Aug.
 
| 2  
 
| 2  
 
| Formalisms for Representing Algorithms
 
| Formalisms for Representing Algorithms
Line 26: Line 26:
 
| [http://www.vernon.eu/04-630/04-630_Assignment_1.pdf Assignment 1]
 
| [http://www.vernon.eu/04-630/04-630_Assignment_1.pdf Assignment 1]
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 25 Jan.
+
| Mon. 4 Sept.
 
| 3
 
| 3
 
| Analysis of Complexity I
 
| Analysis of Complexity I
Line 33: Line 33:
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 30 Jan.
+
| Wed. 6 Sept.
 
| 4
 
| 4
 
| Analysis of Complexity II
 
| Analysis of Complexity II
Line 40: Line 40:
 
|  [http://www.vernon.eu/04-630/04-630_Assignment_2.pdf Assignment 2]
 
|  [http://www.vernon.eu/04-630/04-630_Assignment_2.pdf Assignment 2]
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 6 Feb.
+
| Mon. 11 Sept.
 
| 5
 
| 5
 
| Searching and Sorting Algorithms I
 
| Searching and Sorting Algorithms I
Line 47: Line 47:
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 8 Feb.
+
| Wed. 13 Sept.
 
| 6
 
| 6
 
| Searching and Sorting Algorithms I
 
| Searching and Sorting Algorithms I
Line 54: Line 54:
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 13 Feb.
+
| Mon. 18 Sept.
 
| 7
 
| 7
 
| Abstract Data Types (ADT)
 
| Abstract Data Types (ADT)
Line 61: Line 61:
 
|
 
|
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 15 Feb.
+
| Wed. 20 Sept.
 
| 8
 
| 8
 
| Containers, Dictionaries, and Lists I
 
| Containers, Dictionaries, and Lists I
Line 68: Line 68:
 
|  [http://www.vernon.eu/04-630/04-630_Assignment_3.pdf Assignment 3] <!-- <BR> [[Assignment 3 Status]] -->
 
|  [http://www.vernon.eu/04-630/04-630_Assignment_3.pdf Assignment 3] <!-- <BR> [[Assignment 3 Status]] -->
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 20 Feb.
+
| Mon. 25 Sept.
 
| 9
 
| 9
 
| Containers, Dictionaries, and Lists II
 
| Containers, Dictionaries, and Lists II
Line 75: Line 75:
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 22 Feb.
+
| Wed. 27 Feb.
 
| 10
 
| 10
 
| Stacks
 
| Stacks
Line 82: Line 82:
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 27 Feb.
+
| Mon. 2 Oct.
 
| 11
 
| 11
−
| Queues
+
|  
 
|  Queue (FIFO ADT). Implementation using List ADT (array and linked-list).  Comparison of order of complexity.  Dedicated ADT. Circular queues.  Queue applications.
 
|  Queue (FIFO ADT). Implementation using List ADT (array and linked-list).  Comparison of order of complexity.  Dedicated ADT. Circular queues.  Queue applications.
 
|  [http://www.vernon.eu/04-630/04-630_Lecture_11_Queues.pdf Lecture 11 Slides]. [http://www.vernon.eu/04-630/poisson.pdf  On the Simulation of Random Events].
 
|  [http://www.vernon.eu/04-630/04-630_Lecture_11_Queues.pdf Lecture 11 Slides]. [http://www.vernon.eu/04-630/poisson.pdf  On the Simulation of Random Events].
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 1 Mar.
+
| Wed. 4 Oct.
 
| 12
 
| 12
−
| Trees I
+
|
 
| 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
 
| 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
 
|  [http://www.vernon.eu/04-630/04-630_Lecture_12_Trees_I.pdf Lecture 12 Slides].
 
|  [http://www.vernon.eu/04-630/04-630_Lecture_12_Trees_I.pdf Lecture 12 Slides].
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 6 Mar.
+
| Mon. 9 Oct.
 
| 13
 
| 13
−
| Trees II
+
|
−
| Binary trees and binary search trees. Tree traversals: inorder, preorder, postorder.
+
|  
 
|  [http://www.vernon.eu/04-630/04-630_Lecture_13_Trees_II.pdf Lecture 13 Slides].
 
|  [http://www.vernon.eu/04-630/04-630_Lecture_13_Trees_II.pdf Lecture 13 Slides].
 
| [http://www.vernon.eu/04-630/04-630_Lab_Exercise_1.pdf Lab Exercise 1]
 
| [http://www.vernon.eu/04-630/04-630_Lab_Exercise_1.pdf Lab Exercise 1]
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 8 Mar.
+
| Wed. 11 Oct.
 
| 14
 
| 14
−
| Trees III
+
|
−
| Height-balanced trees: AVL Trees, RR, RL, LR, LL rotations. 
+
|
−
| [http://www.vernon.eu/04-630/04-630_Lecture_14_Trees_III.pdf Lecture 14 Slides].
+
|  
−
| [http://www.vernon.eu/04-630/04-630_Assignment_4.pdf Assignment 4] <!-- <BR> [[Assignment 4 Status]] -->
+
|
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 13 Mar.
+
| Mon. 16 Oct.
 
| 15
 
| 15
−
| Trees IV
+
|
−
| Height-balanced trees: Red-Black Trees, single promotion, zig-zag promotion, recolouring and restructuring. 
+
|  
−
| [http://www.vernon.eu/04-630/04-630_Lecture_15_Trees_IV.pdf Lecture 15 Slides].
+
|  
−
| [http://www.vernon.eu/04-630/04-630_Lab_Exercise_2.pdf Lab Exercise 2]
+
|
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 15 Mar.
+
| Wed. 18 Oct.
 
| 16
 
| 16
−
| Trees V
+
|
−
| Tree applications. Fixed-length codes & variable length codes. Optimal code trees.  Huffman's algorithm. <!-- and implementation. -->
+
|  
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_16_Trees_V.pdf Lecture 16 Slides].
+
|   
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 20 Mar.
+
| Mon. 23 Oct.
 
| 17
 
| 17
−
| Heaps
+
|
−
| Priority queues. Heap basics. Types of heap: min heaps and max heap. Heap characteristics.  Implementation of heap. Heap operations: delete max/min, down heap, up heap, merge, construct, heapify. Complexity of operations.  Heap sort.  <!-- Operating systems heaps.  d-ary heaps. Leftist heaps. -->
+
|  
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_17_Heaps.pdf Lecture 17 Slides].
+
|   
−
| [http://www.vernon.eu/04-630/04-630_Lab_Exercise_3.pdf Lab Exercise 3] <BR> [http://www.vernon.eu/04-630/04-630_Lab_Exercise_3_Alternative.pdf Lab Exercise 3 Alternative]
+
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 22 Mar.
+
| Wed. 25 Oct.
 
| 18
 
| 18
−
| Graphs I
+
|  
−
| Types of graphs: directed, undirected, weighted, unweighted, cyclic, acyclic, directed acyclic, simple, non-simple, implicit, explicit, embedded, topological. Adjacency matrix representation. Adjacency list representation. 
+
|  
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_18_Graphs_I.pdf Lecture 18 Slides]
+
|   
−
| [http://www.vernon.eu/04-630/04-630_Assignment_5.pdf Assignment 5] <!-- <BR> [[Assignment 5 Status]] -->
+
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 27 Mar.
+
| Mon. 30 Oct.
 
| 19
 
| 19
−
| Graphs II
+
|
−
| Graph traversal: breadth-first search and depth-first search; implementation and application.   Topological sort. <!-- Euler's theorem. -->
+
|   
−
|   [http://www.vernon.eu/04-630/04-630_Lecture_19_Graphs_II.pdf Lecture 19 Slides]
+
|  
−
|  [http://www.vernon.eu/04-630/04-630_Lab_Exercise_4.pdf Lab Exercise 4]
+
|   
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 29 Mar.
+
| Wed. 1 Nov.
 
| 20
 
| 20
−
| Graphs III
+
|
−
| Spanning trees and minimum spanning trees, Kruskal's algorithm, Prim's algorithm.  
+
|   
−
|   [http://www.vernon.eu/04-630/04-630_Lecture_20_Graphs_III.pdf Lecture 20 Slides]
+
|  
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 3 Apr.
+
| Mon. 6 Nov.
 
| 21
 
| 21
−
| Graphs IV
+
|
−
| Dijkstra's shortest path algorithm. Floyd-Warshall's all-pairs algorithm. 
+
|  
−
|   [http://www.vernon.eu/04-630/04-630_Lecture_21_Graphs_IV.pdf Lecture 21 Slides]
+
|  
−
|  [http://www.vernon.eu/04-630/04-630_Lab_Exercise_5.pdf Lab Exercise 5]
+
|   
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 5 Apr.
+
| Wed. 8 Nov.
 
| 22
 
| 22
−
| Complex Networks I
+
|
−
| Euler's theorem: the Bridges of Königsberg. Networks vs. graphs. Degree, average degree, and degree distribution. Bipartite networks. Path length, BFS, Connectivity, Components.  Clustering coefficient.  Random graph model. Small world phenomena. Scale free networks.  
+
|   
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_22_Complex_Networks_I.pdf Lecture 22 Slides]
+
|   
−
|  [http://www.vernon.eu/04-630/04-630_Assignment_6.pdf Assignment 6] <!-- <BR> [[Assignment 6 Status]] -->
+
|   
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 19 Apr.
+
| Mon. 13 Nov.
 
| 23
 
| 23
−
| Complex Networks II
+
|
−
|  Communities. Fundamental Hypothesis. Connectedness and Density Hypothesis. Strong and weak communities. Graph partitioning. Community detection. Hierarchical clustering. Girvan-Newman Algorithm. Modularity. Random Hypothesis. Maximum Modularity Hypothesis. Greedy algorithm for community detection by maximizing modularity. Overlapping communities. Clique percolation algorithm and CFinder.
+
|   
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_23_Complex_Networks_II.pdf Lecture 23 Slides]
+
|   
 
|  
 
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Mon. 24 Apr.
+
| Wed. 15 Nov.
 
| 24
 
| 24
−
| Algorithmic Strategies
+
|
−
| Classes of algorithms. Brute force. Divide and conquer. Greedy algorithms. Dynamic programming. Combinatorial search. Backtracking. Pruning. Branch and bound. <!-- Heuristics and heuristic algorithms. Probabilistic algorithms. -->
+
|   
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_24_Algorithmic_Strategies.pdf Lecture 24 Slides]
+
|   
−
| [http://www.vernon.eu/04-630/04-630_Lab_Exercise_6.pdf Lab Exercise 6]
+
|  
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 26 Apr.
+
| Mon. 20 Nov.
 
| 25
 
| 25
−
| Hashing
+
|
−
|Dictionaries. Hashing. Hash functions. Collision resolution. Complexity. Applications. <!-- Using keys to address data. Mappings: injection, surjection, bijection.  Map ADT. Hash functions. Hash tables: current value tables, direct access tables. Managing collisions: chaining, overflow areas, re-hashing, linear probing, quadratic probing.  Evaluating hash functions: prime division, mid-square, folding, load factor. Example application: dictionaries. Generating hash functions and using hash structures. -->
+
|  
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_25_Hashing.pdf Lecture 25 Slides]
+
|   
−
|  [http://www.vernon.eu/04-630/04-630_Assignment_7.pdf Assignment 7]
+
|   
 
|- style="vertical-align: top;"
 
|- style="vertical-align: top;"
−
| Wed. 3 May
+
| Wed. 22 Nov.
 
| 26
 
| 26
−
| Analysis of Correctness
+
|   
−
|Types of software defects. Code module design. Syntactic, semantic, logical defects. (Semi-)formal verification: partial vs. total correctness. Invariant assertion method. Simple proof strategies: by contradiction, counterexample, induction. Dynamic testing: unit tests, test harness, stubs, drivers, integration testing, regression testing. Static tests: reviews, walkthroughs, inspections, reviewing algorithms and software. Pair programming. Verification and validation strategies.
+
−
|  [http://www.vernon.eu/04-630/04-630_Lecture_26_Analysis_of_Correctness.pdf Lecture 26 Slides]
+
 
|  
 
|  
−
<!-- |- style="vertical-align: top;"
+
| 
−
| Wed. 3 May
+
|
 +
|- style="vertical-align: top;"
 +
| Mon. 27 Nov.
 
| 27
 
| 27
−
| Automata & Computability Theory
+
|
−
| Regular Languages. Finite Automata. Nondeterminism.- Regular Expressions. Nonregular Languages. Context-free Languages. Context-free Grammars.  Pushdown Automata. Deterministic Context-Free Languages. The Church-Turing Thesis. Turing Machines. Variants of Turing Machines. The Definition of Algorithm. Decidability. Decidable Languages. Undecidability. Reducibility.
+
|   
 
|  
 
|  
 +
| 
 +
|- style="vertical-align: top;"
 +
| Wed. 29 Nov.
 +
| 28
 +
| 
 +
| 
 +
|
 +
| 
 +
|- style="vertical-align: top;"
 +
| Mon. 4 Dec.
 +
| 29
 +
| 
 +
| 
 +
|
 +
|
 +
|- style="vertical-align: top;"
 +
| Wed. 6 Dec.
 +
| 30
 +
| 
 +
| 
 
|  
 
|  
−
-->
+
| 
 
|}
 
|}
 
</small>
 
</small>
Line 206: Line 226:
  
 
----
 
----
−
Back to [[Applied Computer Vision]]
+
Back to [http://www.vernon.eu/ACV.htm Applied Computer Vision]

Revision as of 15:33, 20 August 2017

|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

Retrieved from "http://www.vernon.eu/w/index.php?title=Applied_Computer_Vision_Lecture_Schedule&oldid=1500"