A Compression Algorithm of Hyperspectral Image Based on the Eight-Fork Tree Division and Three-Dimensional Fractal Coding

In order to achieve a high compression ratio on hyperspectrum image, in this paper, an algorithm about 3-D fractal coding is proposed. This algorithm is based on fractal theory and eight fork tree division. We expand the eight kinds of fractal transform to nineteen in the 3-D space, which improves the matching accuracy, and accelerate the encoding process by using the eight-fork tree division and the cube block classification. A simulation was done on MATLAB 7.1, the experimental results demonstrate this algorithm has some practical sense.