Data Compression, winter 14/15
Project is written in pairs.
In this year we focus on compressing vector graphics in SVG format.
Basic codes:
1. Huffman code
2. block prefix code
3. finite memory code
4. finite state code
5. arithmetic code
6. Lempel - Ziv code
The task is to implement some modification of the given algorithm, which could be particularily efficient for the benchmark files (all from wikipedia).
Try to exploit the structure of an SVG file. Additionally, test your algorithm on different SVG files.
Deadlines:
16.10.2014 Groups and topics
06.11.2014 Functional Documentation
09.01.2015 Application
09.01.2015 Tests report
03.02.2015 Final Presentation
03.02.2015 Final Presentation
Marks:
25% Functional Documentation
50% Application and tests
25% Final Presentation
Late submissions: -10% of total grade for every started week after the deadline
Functional documentation:
- description of the problem
- description of the algorithm
- example of the algorithm execution
- theoretical analysis of the algorithm
- proposed modifications (designed for SVG files)
- references
Application:
- implemented algorithm with modifications
- simple GUI
- manual
- sample data
- listed changes between the functional documentation and the application, along with the reasons
Tests report:
- results on the sample data
- compression / decompression time (depending on the size of the input file and maybe some other things)
- compression ratio
- influence of your modification on the results (it's best to compare the results obtained with and without those modifications)
- possible direction of future development
Presentation (about 15 minutes):
- description of the algorithm, some example
- description of your modifications dedicated to SVG files
- problem you encountered in implementation and how you solved them
- results you obtained (compression ratio, computation time)
- some ideas for further improvements