An Algorithm to Reduce Compression Ratio in Multimedia Applications

In recent years, it has been evident that internet is the most effective means of transmitting information in the form of documents, photographs, or videos around the world. The purpose of an image compression method is to encode a picture with fewer bits while retaining the decompressed image’s visual quality. During transmission, this massive data necessitates a lot of channel space. In order to overcome this problem, an effective visual compression approach is required to resize this large amount of data. This work is based on lossy image compression and is offered for static color images. The quantization procedure determines the compressed data quality characteristics. The images are converted from RGB to International Commission on Illumination CIE La^*b^*; and YCbCr color spaces before being used. In the transform domain, the color planes are encoded using the proposed quantization matrix. To improve the efficiency and quality of the compressed image, the standard quantization matrix is updated with the respective image block. We used seven discrete orthogonal transforms, including five variations of the Complex Hadamard Transform, Discrete Fourier Transform and Discrete Cosine Transform, as well as thresholding, quantization, de-quantization and inverse discrete orthogonal transforms with CIE La^*b^*; and YCbCr to RGB conversion. Peak to signal noise ratio, signal to noise ratio, picture similarity index and compression ratio are all used to assess the quality of compressed images. With the relevant transforms, the image size and bits per pixel are also explored. Using the (n, n) block of transform, adaptive scanning is used to acquire the best feasible compression ratio. Because of these characteristics, multimedia systems and services have a wide range of possible applications.