An effective image compression technique based on burrows wheeler transform with set partitioning in hierarchical trees

Abstract

In this article, the efficient image compression which consists of Burrows–Wheeler transform (BWT) with set partitioning in hierarchical trees (SPIHT). The main phases of the proposed system are: partitioning, compression of non‐ROI areas, Fusion and compression of ROI areas. To enhance the propose of the proposed methodology, the morphological functions are updated by dividing two types of images with the consideration of dilation and erosion control. After that, the convolution and correlation in the deformation provide good accuracy of the segmentation at the fastest speed. In this proposed methodology, SPIHT encryption is a lossy compression technique aimed at understanding the non‐ROI area, while the BWT is a lossless compression technique performed to achieve a summary of the ROI area. Finally, separating these two parts of the image merges the image and reconstructs it to the desired quality. The test sends a variety of images and analyzes the performance of the proposed system using compression ratio and PSNR measurements.

Adaptive two-step method for providing the desired visual quality for SPIHT

“…The use of different modifications is analyzed by many researchers. In particular, the use of different wavelets is studied in [28], the authors of [29] consider the use of Burrows-Wheeler transform within the SPIHT framework in attempts to improve general performance of the SPIHT coder.…”