Video Processing

COURSE SYLLABUS FOR FALL 2004

WEB SITE

<http://www.cs.ccu.edu.tw/~cwlin/courses/vsp/index.htm> This is where you will find most information about this course, including handouts, homework assignments, homework solutions, etc.

INSTRUCTOR

Professor Chia-Wen Lin  Email: cwlin@cs.ccu.edu.tw Phone: x33120

Institute of Engineering Bldg. 1 Room: 511

Office Hours: by email appointment

TEACHING ASSISTANT

TBD (Lab 308, x23126)

Office Hours: by email appointment

LECTURES

TUE 10:10-13:00 (EA205)

COURSE DESCRIPTION

This course introduces technologies for video processing, coding and communications. We will address how to efficiently represent image and video data and how to deliver them over a variety of networks. In the coding aspect, state-of-the-art compression technologies will be presented. Emphasis will be given to a number of standards, including H.26x, MPEG, and JPEG. In the system aspect, special considerations for constructing as well as optimizing a video codec system will be discussed.

PROGRAMMING

The best way to understand an algorithm is to program it. Therefore, this course emphasizes computer assignments and projects. Students will complete individual assignments, and form small groups to complete projects in video coding or related technologies. The use of C/C++ is encouraged. You may also use Matlab to generate some figures. If you plan to use other programming languages, please discuss it with the instructor.

TEXTBOOKS

  • Standard Codecs: Image Communication to Advanced Video coding, Mohammed Ghanbari, IEE, UK, 2003.
  • Video Processing and Communications, by Yao Wang, Joern Ostermann, and Ya-Qin Zhang. Prentice Hall, Sep. 2001. (imported by 新月)

M. Ghanbari’s book

The book by Wang et al.

REFERENCES

  • H.264 and MPEG-4 Video Compression: Video Coding for Next-generation Multimedia, I. E. G. Richardso, Wiley, 2003.
  • Techniques and Standards for Image, Video, and Audio Coding, K. R. Rao and J. J. Hwang, Prentice Hall, , 1996. (imported by 巨擘)
  • Digital Video Processing, A. Murat Tekalp, Prentice Hall, Englewood Cliffs, NJ, 1995
  • Introduction to Data Compression, Khalid Sayood , 2nd Edition, Morgan Kaufmann, San Francisco, CA, 2000
  • More to be provided in class

HOMEWORK

Problem sets will be assigned on a two- or three-week basis, and the due day will be indicated on each homework. A component of the homework will be computer assignments. These computer assignments mainly involve building components that may be used later in the projects. The homework policy is as follows:

  • You can discuss the homework problems with any number of students currently taking the course, the TA, and the instructor. However, solutions and solution-techniques should not be exchanged. You should make sure that you understand the solution you turn in, and should of course write up every word of the solution by yourself. Cribbing others’ homework is definitely prohibited.
  • All the answers you give must be fully justified. However, results proved in the class, in class-given handouts, in past assignments, or in text can be used without proof, provided you specifically cite the source.
  • No late homework.

PROJECTS

During the week when the project is due, each group will schedule a time slot with the instructor and TA to demonstrate the project. The same policy for the homework should apply to the projects as well. If in doubt, please check with the instructor.

GRADING 

Homework

20-30%

Exams

40-50%

Course Project

   Midterm report & seminar

   Final project report

30%