You are here
Permutation-based data compression
- Date Issued:
- 2011
- Summary:
- The use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it improves on them for the majority of the videos that we analyzed. Our algorithm could be used in situations where there is a need for lossless compression and the video sequences are part of a single scene, e.g., medical videos, where loss of information could be risky or expensive. Some results on permutations, which may be of independent interest, arose in developing this algorithm. We report on these as well.
Title: | Permutation-based data compression. |
![]() ![]() |
---|---|---|
Name(s): |
Mihnea, Amalya Charles E. Schmidt College of Science Department of Mathematical Sciences |
|
Type of Resource: | text | |
Genre: | Electronic Thesis Or Dissertation | |
Date Issued: | 2011 | |
Publisher: | Florida Atlantic University | |
Physical Form: | electronic | |
Extent: | viii, 77 p. : ill. (some col.) | |
Language(s): | English | |
Summary: | The use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it improves on them for the majority of the videos that we analyzed. Our algorithm could be used in situations where there is a need for lossless compression and the video sequences are part of a single scene, e.g., medical videos, where loss of information could be risky or expensive. Some results on permutations, which may be of independent interest, arose in developing this algorithm. We report on these as well. | |
Identifier: | 775662451 (oclc), 3333054 (digitool), FADT3333054 (IID), fau:3797 (fedora) | |
Note(s): |
by Amalya Mihnea. Thesis (Ph.D.)--Florida Atlantic University, 2011. Includes bibliography. Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web. |
|
Subject(s): |
Data compression (Telecommunication) Combinatorics Network architecture and design Computer network architectures Mathematical optimization |
|
Persistent Link to This Record: | http://purl.flvc.org/FAU/3333054 | |
Use and Reproduction: | http://rightsstatements.org/vocab/InC/1.0/ | |
Host Institution: | FAU |