Lossless Compression Methods for Multispectral Images: Development and Comparisons


Autoria(s): Kubasova, Olga
Data(s)

23/01/2008

23/01/2008

2003

Resumo

Main purpose of this thesis is to introduce a new lossless compression algorithm for multispectral images. Proposed algorithm is based on reducing the band ordering problem to the problem of finding a minimum spanning tree in a weighted directed graph, where set of the graph vertices corresponds to multispectral image bands and the arcs’ weights have been computed using a newly invented adaptive linear prediction model. The adaptive prediction model is an extended unification of 2–and 4–neighbour pixel context linear prediction schemes. The algorithm provides individual prediction of each image band using the optimal prediction scheme, defined by the adaptive prediction model and the optimal predicting band suggested by minimum spanning tree. Its efficiency has been compared with respect to the best lossless compression algorithms for multispectral images. Three recently invented algorithms have been considered. Numerical results produced by these algorithms allow concluding that adaptive prediction based algorithm is the best one for lossless compression of multispectral images. Real multispectral data captured from an airplane have been used for the testing.

Identificador

http://www.doria.fi/handle/10024/34936

Idioma(s)

en

Palavras-Chave #Lossless image compression #multispectral and hyperspectral images #linear prediction #optimal band ordering
Tipo

Master's thesis