Hyperspectral Data Compression provides a survey of recent results in the field of compression of remote sensed 3D data, with a particular interest in hyperspectral imagery. Chapter 1 addresses compression architecture, and reviews and compares compression methods. Chapters 2 through 4 focus on lossless compression (where the decompressed image must be bit for bit identical to the original). Chapter 5, contributed by the editors, describes a lossless algorithm based on vector quantization with extensions to near lossless and possibly lossy compression for efficient browning...

James A. Storer Computer Science Dept. Brandeis University Waltham, MA 02254 Data compression is the process of encoding a body of data to reduce stor age requirements. With Lossless compression, data can be decompressed to be identical to the original, whereas with lossy compression, decompressed data may be an acceptable approximation (according to some fidelity criterion) to the original. For example, with digitized video, it may only be necessary that the decompressed video look as good as the original to the human eye. The two primary functions of data compression are: Storage: The...

Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation.

Key features:

* Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a...

Hyperspectral Data Compression provides a survey of recent results in the field of compression of remote sensed 3D data, with a particular interest in hyperspectral imagery. Chapter 1 addresses compression architecture, and reviews and compares compression methods. Chapters 2 through 4 focus on lossless compression (where the decompressed image must be bit for bit identical to the original). Chapter 5, contributed by the editors, describes a lossless algorithm based on vector quantization with extensions to near lossless and possibly lossy compression for efficient browning...

James A. Storer Computer Science Dept. Brandeis University Waltham, MA 02254 Data compression is the process of encoding a body of data to reduce stor- age requirements. With Lossless compression, data can be decompressed to be identical to the original, whereas with lossy compression, decompressed data may be an acceptable approximation (according to some fidelity criterion) to the original. For example, with digitized video, it may only be necessary that the decompressed video look as good as the original to the human eye. The two primary functions of data compression are: Storage: The...