The biggest challenge in image set compression is how to efficiently remove the set
redundancy among images as well as the redundancy inside a single image. Different from …

A hierarchical lossy image set compression algorithm (HMSTa) has recently been proposed
for lossy compression of image sets. It was shown that this algorithm performs well when an …

In this paper we examine the problem of bit in lossy image set compression. Instead of
treating each image independently, image set compression algorithms examine the …

In this paper we present a new prediction technique to compress a pair of satellite images
that have significant overlap in the underlying spatial areas. When this prediction technique …

Large sets of similar images are produced in many applications. To store these images more
efficiently, redundancy among similar images need to be exploited. A number of methods …

The automatic compression strategy proposed by Gergel et al. is a near-optimal lossy
compression scheme for a given collection of images whose interimage relationships are …

Many image datasets are available on the Internet, contributing to the development of
computer vision. While huge datasets are useful for research, they are time-consuming to …

A number of image set compression algorithms have been proposed in the literature. A key
component of these algorithms is a numeric measure used to quantify how similar two …

A number of minimum spanning tree algorithms have been proposed for lossy compression
of image sets. In these algorithms, a complete graph is constructed from the entire image set …

An automatic compression strategy proposed by Gergel et al. is a near-optimal lossy
compression scheme for a given collection of similar images whose inter-image …