الفهرس 
AcknowledgementOnly 14 pages are availabe for public view
 |  | from | 160 |  |  |
| | | from | 160 | | |
Abstract
One of the major problems in handling digital satellite images is the requirement of large mass storage. Also, during processing, the memory space for representing the image should be minimized. One of the solutions to this problem is compressing the digital image by removing the redundancy or using a hierarchical data structure that exploit the correlation between the pixels.
The objective of this work is to receive the satel1ite images and store them on the computer such that it takes less space than that required by the matrix dump representation.
Some of the data compression techniques that remove the redundancies in the image and exploit the correlation between the image pixels are surveyed. The data compression techniques are divided into two categories; noiseless and noisy. In the noiseless techniques a typical copy of the image can be reconstructed from the coded one. On the other hand, the noisy techniques ignore some of the image detaiIs, i.e. orginal data can be reproduced only within a certain margin of accuracy. Other techniques that uses the tree data structure to represent the image are presented. The quadtree representation of the colored image is considered.