Module Search

COMP3687: Data Compression

Please ensure you check the module availability box for each module outline, as not all modules will run in each academic year. Each module description relates to the year indicated in the module availability box, and this may change from year to year, due to, for example: changing staff expertise, disciplinary developments, the requirements of external bodies and partners, and student feedback. Current modules are subject to change in light of the ongoing disruption caused by Covid-19.

Type	Open
Level	3
Credits	10
Availability	Available in 2023/24
Module Cap	None.
Location	Durham
Department	Computer Science

Prerequisites

(COMP1021 Mathematics for Computer Science OR MATH1561 Single Mathematics A OR MATH1071 Linear Algebra I) AND COMP1051 Computational Thinking

Corequisites

None

Excluded Combinations of Modules

None

Aims

To understand:
the main techniques for lossless and lossy date compression;
the efficiency criteria for data compression.

Content

Huffman coding
Arithmetic coding
Lempel-Ziv and application to ZIP or PNG
Context-based compression
Transform domain compression with application to JPEG
Wavelet-based compression with application to JPEG2000
Video compression and MPEG
Audio compression and MP3

Learning Outcomes

Subject-specific Knowledge:

On completion of the module, students will be able to demonstrate:
an understanding of the key features of popular lossless compression techniques for text;
an understanding of the key features of popular lossy compression techniques for images, video, and audio;
an understanding of the performance criteria for lossless and lossy compression.

Subject-specific Skills:

On completion of the module, students will be able to demonstrate:
an ability to assess and design compression techniques for diverse kinds of data;
an ability to implement the key tools used in data compression.

Key Skills:

On completion of the module, students will be able to demonstrate:
an ability to design encoding and decoding algorithms for diverse kinds of data;
an ability to identify and assess the quality of heuristics for different algorithms.

Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

Lectures enable the students to learn new material.
The examination assesses the knowledge and understanding of the material covered in the lectures.

Teaching Methods and Learning Hours

Activity	Number	Frequency	Duration	Total
Lectures	20	2 per week	1 hour	20
Preparation and reading				80
Total				100

Summative Assessment

Component: Examination		Component Weighting: 100%
Element	Length / Duration	Element Weighting	Resit Opportunity
Examination	2 hours	100	No

Formative Assessment

Example formative exercises are given during the course.

More information

If you have a question about Durham's modular degree programmes, please visit our FAQ webpages, Help page or our glossary of terms. If you have a question about modular programmes that is not covered by the FAQ, or a query about the on-line Undergraduate Module Handbook, please contact us.

Prospective Students: If you have a query about a specific module or degree programme, please Ask Us.

Current Students: Please contact your department.