James A. Storer – författare

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 and pure pixel classification. Chapter 6 deals with near lossless compression while. Chapter 7 considers lossy techniques constrained by almost perfect classification. Chapters 8 through 12 address lossy compression of hyperspectral imagery, where there is a tradeoff between compression achieved and the quality of the decompressed image. Chapter 13 examines artifacts that can arise from lossy compression.

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 and pure pixel classification. Chapter 6 deals with near lossless compression while. Chapter 7 considers lossy techniques constrained by almost perfect classification. Chapters 8 through 12 address lossy compression of hyperspectral imagery, where there is a tradeoff between compression achieved and the quality of the decompressed image. Chapter 13 examines artifacts that can arise from lossy compression.

This work presents recent research on the compression of images and text. Part 1 presents the (lossy) image compression techniques of vector quantization, iterated transforms (fractal compression), and techniques that employ optical hardware. Part 2 presents the (lossless) text compression techniques of arithmetic coding, context modelling and dictionary methods (LZ) methods; this part of the book also addresses practical massively parallel architectures for text compression. Part 3 presents theoretical work in coding theory that has applications to both text and image compression. The book ends with an extensive bibliography of data compression papers and books which can serve as a valuable aid to researchers in the field.

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 and pure pixel classification. Chapter 6 deals with near lossless compression while. Chapter 7 considers lossy techniques constrained by almost perfect classification. Chapters 8 through 12 address lossy compression of hyperspectral imagery, where there is a tradeoff between compression achieved and the quality of the decompressed image. Chapter 13 examines artifacts that can arise from lossy compression.

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 capacity of a storage device can be effectively increased with data compression software or hardware that compresses a body of data on its way to the storage device and decompress it when it is retrieved. Communications: The bandwidth of a digital communication link can be effectively increased by compressing data at the sending end and decom­ pressing data at the receiving end. Here it can be crucial that compression and decompression can be performed in real time.