Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007
Automatic compression for image sets using a graph theoretical framework
Abstract
dc:description.abstractA new automatic compression scheme that adapts to any image set is presented in this thesis. The proposed scheme requires no a priori knowledge on the properties of the image set. This scheme is obtained using a unified graph-theoretical framework that allows for compression strategies to be compared both theoretically and experimentally. This strategy achieves optimal lossless compression by computing a minimum spanning tree of a graph constructed from the image set. For lossy compression, this scheme is near-optimal and a performance guarantee relative to the optimal one is provided. Experimental results demonstrate that this compression strategy compares favorably to the previously proposed strategies, with improvements up to 7% in the case of lossless compression and 72% in the case of lossy compression. This thesis also shows that the choice of underlying compression algorithm is important for compressing image sets using the proposed scheme.
Degree
thesis:*- Level thesis:degree_level
- Masters
- Grantor dc:publisher
- Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007
- Year dc:date.issued
- 2007
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Gergel, Barry
- University of Lethbridge. Faculty of Arts and Science
- Advisor dc:contributor.supervisor
-
- Cheng, Howard
Subjects
dc:subject × 3Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10133/538