Adaptive hyperspectral data compression

Image analysis – Image compression or coding – Adaptive coding

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06804400

ABSTRACT:

FIELD OF THE INVENTION
The present invention relates to the field of data compression, and more particularly to a method and system for adaptively compressing and decompressing hyperspectral image and other data.
BACKGROUND OF THE INVENTION
It has recently become possible to commercially obtain satellite and aerial images of terrain of interest from a number of sources. For example, certain large farms currently use satellite images provided by Landsat, the system of land-observing satellites operated by the federal government. Landsat satellites orbit the earth at approximately 900 km., and provide images in which each pixel represents a square area of between 1 m
2
and 1 E6 m
2
(a pixel area of 100 m
2
is common for systems designed for land-use purposes). Visible, near-infrared, shortwave infrared, thermal infrared sensors deployed on such satellites can detect, among other things, the spectral reflectance, temperature, and other physical characteristics of specified terrestrial areas.
The sensors used in generating the images used for many commercial purposes are typically characterized as either “multispectral” or “hyperspectral”. Multispectral sensors collect images of a terrain or landscape and provide a handful of wide spectral bands of imagery. These bands encompass the visible, short wave infrared, and, in some cases, thermal infrared portion of the electromagnetic spectrum. Similarly, hyperspectral sensors typically provide hundreds of narrow spectral bands of hyperspectral imagery spanning the visible, near-infrared, and shortwave infrared portion of the electromagnetic spectrum. Such sensors can produce enormous amounts of information needing to be transmitted on a limited bandwidth cross-link or down-link channel. For example, the Earth Observing System (“EOS”), which is currently scheduled to begin operation by 2001, will carry a high resolution hyperspectral imager (the “Hyperion”) capable of resolving 220 spectral bands. The Hyperion is expected to produce a maximum output data rate of at least several hundred Mbit/s.
Such high data rates not only increase the complexity of required communications infrastructure, but may also strain the capacity of ground data storage and processing facilities. It will of course be appreciated that data compression of some type would at least partially alleviate these difficulties.
Many image compression algorithms have been designed and implemented over the years in order to address the storage and transmission needs of monochromatic and multispectral imaging sensors. Most of these algorithms have focused on the spatial character of the imagery and limitations in the human visual system. Hyperspectral imagery shares certain characteristics with monochromatic and multispectral imagery, but also possesses certain other characteristics providing additional opportunities for compression of the constituent spectral data. For example, it is well recognized that hyperspectral imagery typically exhibits high levels of spectral correlation. Like other imagery, hyperspectral imagery also exhibits some level of spatial correlation, but such correlation is often less than that inherent in other types of images. The data redundancy resulting from spectral and spatial correlation has been exploited by certain algorithms to provide relatively high compression ratios with insubstantial loss of information content. Such algorithms have been based upon vector quantization, use of the discrete cosine transform followed by trellis coded modulation, spectral re-ordering and linear prediction, and spectral signature matching.
However, existing data compression algorithms may fail to consider all parameters of an image potentially relevant to optimizing compression ratios. For example, such algorithms are not known to utilize image noise statistics for the purpose of ensuring that any compression loss be related substantially to image noise rather than to scene information.
SUMMARY OF THE INVENTION
In summary, the present invention pertains to a method of compressing spectral data corresponding to an image comprising a plurality of pixels. The method includes the step of creating a set of potential endmembers. A first plurality of the potential endmembers are identified as a first set of endmembers based upon their respective correlations with a first spectral signature of a first of the plurality of pixels. The first pixel is then represented as a combination of the first set of endmembers. Processing of the image preferably continues by identifying a second plurality of the potential endmembers as a second set of endmembers based upon their respective correlations with a second spectral signature of a second of the plurality of pixels. The second pixel is then represented as a combination of the second set of endmembers.
In another aspect, the present invention relates to a compression system for compressing spectral data corresponding to an image comprising a plurality of pixels. The compression system includes a database including a set of potential endmembers. An adaptive linear unmixing module operates to identify a first plurality of the potential endmembers as a first set of endmembers based upon correlation of the first plurality of potential endmembers with a first spectral signature of a first of the plurality of pixels. The compression system further includes an encoder for representing the first pixel as a combination of the first set of endmembers.
The present invention also pertains to a method for reconstructing an image comprising a plurality of pixels from a compressed data stream. In an initial step of this method a set of endmembers are extracted from the data stream. Information identifying a first plurality of the endmembers corresponding to a first pixel of said plurality of pixels is also extracted from the data stream. A first plurality of endmember coefficients, each of such endmember coefficients corresponding to one of the first plurality of endmembers, is also extracted from the data stream. Each of the first plurality of endmembers is multiplied by a corresponding one of the first plurality of endmember coefficients to produce a first plurality of intermediate products. The method further includes the step of combining the first plurality of intermediate products.


REFERENCES:
patent: 5513128 (1996-04-01), Rao
patent: 5832182 (1998-11-01), Zhang et al.
patent: 6008492 (1999-12-01), Slater et al.
patent: 6038344 (2000-03-01), Palmadesso et al.
patent: 6075891 (2000-06-01), Burman
patent: 6079665 (2000-06-01), Nella et al.
patent: 6167156 (2000-12-01), Antoniades et al.
patent: 6169817 (2001-01-01), Parker et al.
patent: 6208752 (2001-03-01), Palmadesso et al.
patent: 6535647 (2003-03-01), Abousleman
Abousleman, “Coding of hyperspectral imagery using adaptive classification and trellis-coded quantization,”Society of Photo-Optical Instrumentation Engineers,vol. 3017, pp. 203-213, (1997).
Blake et al., “A Phenomenology-Based Approach to the Automated Recognition of Materials in HYDICE Imagery,”1998 IEEE International Geoscience and Remote Sensing Symposium Proceedings,vol., 2, pp. 1004-1006, (1998).
Canta et al., “Kronecker-Product Gain-Shape Vector Quantization for Multispectral and Hyperspectral Image Coding,”IEEE Transactions on Image Processing,vol. 7, No. 5, pp. 668-678, May (1998).
Greenman et al., “Down on the Farm, Up on Technology,”New York Times on the Web,web address: http://www.nytimes.com/library/tech/00/07/circuites/articles/13farm.html, Jul. 13, (2000).
Image Resolution Assessment and Reporting Standards (IRARS) Committee, “Multispectral Imagery Interpretability Rating; Reference Guide,” web address: http://www.fas.org/irp/imint
iirs_ms/msiirs.htm, Feb. (1995).
Memon, “A Bounded Distortion Compression Scheme for Hyper-spectral Image Data, ”1996 International Geoscience and Remote Sensing Symposium,vol. 2, pp. 1039-1041, (1996).
Reitz et al., “Hyperspectral compression using spectral signature matching with error encoding,”Society of Photo-Optical Instrumentation Engineers,vol. 2821, pp. 64-73, (1996).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Adaptive hyperspectral data compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Adaptive hyperspectral data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive hyperspectral data compression will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3268003

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.