Paper Info
Title
A Unified Framework for Image Set Compression
Abstract
While the compression of individual images have been studied extensively, there have been fewer studies on the problem of compressing image sets. A number of schemes have been proposed to compress an image set by taking advantage of the inter-image redundancy be- tween pairs of images. In this paper, we present a uni- fied graph-theoretic framework that includes all such previous schemes. A minimum spanning tree gives the optimal compression method for lossless compression. We also show that while this framework does not nec- essarily give the optimal compression scheme for lossy compression, we can provide performance guarantees relative to the optimal scheme. Our experiments show that the new minimum spanning tree method performs better than the previous schemes, especially when the image sets are not well suited for any of the previously proposed schemes.
Year
Venue
Keywords
2006
IPCV
minimum spanning tree,lossless compression,lossy compression
Field
DocType
Citations 
Compression (physics),Data compression ratio,Lossy compression,Algorithm,Theoretical computer science,Redundancy (engineering),Data compression,Mathematics,Image compression,Minimum spanning tree,Lossless compression
Conference
11
PageRank 
References 
Authors
0.86
7
4
Name
Order
Citations
PageRank
Barry Gergel1252.84
Howard Cheng213718.85
Clinton Nielsen3292.45
Xiaobo Li450237.50