Abstract:
An image file contains a large amount of data. Image
compression changes a large image file into a much smaller file.
Smaller files require less memory to store, less computer network
bandwidth to transfer on the Internet, less time for a computer to
process. Image compression becomes important and necessary due
to limited computer network bandwidth, computer processor
speed and computer storage size. In this paper, we represent an
image on our recently created image structure, called Spiral
Architecture. We propose algorithms for image compression based
on important features of Spiral Architecture: locality and
uniformity. Locality is a consequence of a special scheme for
numbering image pixels which guarantees physical proximity of
the pixels with neighbouring addresses. Uniformity refers to
uniformly separating image into similar sub-images.
