The goal of this assignment is to learn about a variety of image compression techniques. This assignment has two parts:
Part 1: Write a very short description (one page maximum length) of one of the eight image compression techniques below, using the textbook and five online resources for information. In most cases, one page will not be enough to fully describe the method, so focus on the basic idea behind the compression algorithm, and include a figure/diagram if possible. Be sure to include the full URLs of the five references at the bottom of your report so other students in the class can read your resources. We will randomly distribute topics in class to be sure to get one description of each technique. Email your description to the instructor on the first due date so they can be posted online (use Word or plain text).
Part 2: Your second task is to implement one of the eight image compression algorithms above. Most of these methods are too large and complex to fully implement in our time frame, so you are only required to implement one key part of the algorithm to demonstrate your understanding of the technique. For example, you might build the Huffman coding tree, and use this tree to encode/decode the image data, but you do not need to write/read the variable length Huffman codes to/from disk in binary format.
Once you have selected a method, and read about it in the textbook and online resources compiled above, talk with the instructor to decide what subset of the image compression algorithm to implement. You will also need to design some method to test/demonstrate that your implementation is correct. For example, for predictive coding you would want to make predictions based on an input image, and then use the prediction errors to recover the original image.
For this project, it probably makes sense to implement your compression algorithm outside the image processing class library. You will just need to use the im_short and/or im_color classes to read your input image, and store any intermediate results. My standard advice is to develop your solution incrementally, and save intermediate programs and results as you go. For this project, you are allowed to borrow any source code posted on the class website, but you are NOT allowed to borrow any other source code without express permission of the instructor.
Test your program to check that it operates correctly for all of the requirements listed above. Also check for the error handling capabilities of the code. Save your testing output in text files for submission on the program due date.
When you have completed your program, write a short report (less than one page long) describing what the objectives were, what you did, and the status of the program. Does it work properly for all test cases? Are there any known problems? Save this report in a separate text file to be submitted electronically.
In this class, we will be using electronic project submission to make sure that all students hand their programming projects and labs on time, and to perform automatic analysis of all programs that are submitted. When you have completed the tasks above go to the class web site to "submit" your documentation, program, and testing files.
The dates on your electronic submission will be used to verify that you met the due date above. All late projects will receive reduced credit (50% off if less than 24 hours late, no credit if more than 24 hours late), so hand in your best effort on the due date.
You should also PRINT a copy of these files and hand them into your instructor in the department office. Include a title page which has your name and uaid, and attach your hand written design notes from above.