In order to decrease the communication bandwidth and save the transmitting power in the wireless endoscopy capsule, this paper presents a new near-lossless image compression algorithm based on the Bayer format image suitable for hardware design. This algorithm can provide low average compression rate (2.12 bits/pixel) with high image quality (larger than 53.11 dB) for endoscopic images. Especia...

In this paper genetic based test data compression is targeted for improving the compression ratio and for reducing the computation time. The genetic algorithm is based on extended pattern run-length coding. The test set contains a large number of X value that can be effectively exploited to improve the test data compression. In this coding method, a reference pattern is set and its compatibilit...

In this paper a hybrid technique of Genetic Algorithm and Simulated Annealing (HGASA) is applied for Fractal Image Compression (FIC). With the help of this hybrid evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. The concept of Simulated Annealing (SA) is incorporated into Genetic Algorithm (GA) in order to avoid pre-mature c...

This paper presents a robust watermarking algorithm applied to 3D compressed polygonal meshes. Copyright protection of 3D models becomes very important for many applications using public networks. As some recent compression techniques allow very high compression rates, it is of interest to verify that watermarking techniques support this kind of attack. In this paper we present the complete sch...

The demand for images in medical field has increased drastically over the years. The need for reducing the storage space has resulted in image compression. This paper presents a dual transform for medical image compression algorithm. The experimental results determines how the compression ratio (CR), peak signal to noise ratio (PSNR) and SNR (signal to noise ratio) of different compression algo...

In this lecture, we will study a simple model for data compression. The compression algorithms will be constrained to be “lossless” meaning that there should be a corresponding decoding algorithm that recovers the original data exactly. We will study the limits of such compression, which ties to the notion of entropy. We will also study a simple algorithm for compression when the input text arr...

Compression is useful because it helps us to reduce the resources use, such as data storage capacity or transference capacity. Compression methods have a many types. In this survey explain a different simple efficient data compression algorithm which suited to be used on available many commercial nodes of a wireless sensor network, where energy, memory and computational resources are limited. S...

In this paper we study the compression techniques for electrocardiogram (ECG) signals based on Block Sorting Techniques. We introduce a new and faster block transformation than the Burrows and Wheeler Transformation (BWT), and later compare them for ECG data compression. We show that our algorithm yields better compression gain than the Burrows and Wheeler’s algorithm (BWA), Gzip and the Shorte...