Deep Multispectral Image ProcessingMultispectral imaging entails acquiring several images of the same scene using different spectral bands. For instance, a digital colour camera detects three separate images for the red, green and blue components of light. Collecting several spectral bands generally provides more information than would be obtained from a single monochrome image.
This idea has been applied in the field of remote sensing for nearly 20 years. LANDSAT satellites are capable of acquiring 57 spectral bands spanning visible and non-visible wavelengths such as infra- red. The full set can be processed to identify different kinds of land use automatically. We describe this as shallow multispectral image processing because the number of spectral bands is small compared to the number of spatial sample points in any direction. Our reseach concerns deep multispectral image data, where the number of spectral bands is comparible to the number of spatial sample points in any direction. Certain kinds of advanced scientific instrument, such as analytical electron, X-ray and ion microscopes, are theoretically capable of acquiring hundreds or even thousands of spectral bands for a single scene. For instance, we have recently upgraded the multispectral analytical electron microscope (MULSAM) at the University of York to permit as many as 8192 energy analysed electron (Auger) images plus 1024 energy analysed X-ray images to be collected simultaneously. Processing and interpreting this kind of data is not straightforward. Existing multispectral image processing techniques are not easy to extend to such large data sets.
The Bradford Graphics and Image Processing Group is investigating new ways to visualize, analyse and compress deep multispectral image data. Although the project has been running for only one year, significant progress has been made on all three fronts.
Conventional compression algorithms are very ineffective for this kind of data because of the large amount of noise present. A new hybrid lossless compression technique that can handle noisy data has been developed. It involves a spectral decorrelation stage followed by optimal variable bit length (Huffman) coding. Unlike conventional Huffman coding, no assignment table need be passed. Instead the code assignments are reconstructed using a statistical model derived from a small sample of the data.. This makes it possible to encode large integer data values, such as 32-bit integers, without needing to record the code assigned to each. Highly efficient compression methods suitable for archiving are also being investigated. One promising approach is to use the Karhunen Loeve transform to eliminate redundancy in the spectral domain in conjunction with an efficient spatial method, such as wavelet compression. Early results suggest compression ratios of up to 500:1 could be achieved.
Dr. Peter Kenny
Computing Department
University of Bradford
Bradford, West Yorkshire
BD7 1DP
Email: p.g.kenny@comp.brad.ac.uk
Phone: 01274 383928
Fax: 01274 383920