Data Compression Algorithm for Audio and Image using Feature Extraction

Sheraj, Mohammad; Chopra, Ashish

doi:10.1109/icccsp49186.2020.9315248

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An applied image data compression algorithm [17] should preserve most of the data's features and while working in a lossy environment, it should maximize the benefit and have less algorithmic complexity. The general nature of these methods [18,19,20] usually starts with an initial set of variables until the absolute minimum or maximum of the objective function is obtained. Face images are among the most popular and widely used images.…”

Section: Introductionmentioning

confidence: 99%

WITHDRAWN: A new method of facial image compression based on meta-heuristic algorithms with variable bit budget allocation

khodadadi

Ardeshir

Grailu

2022

Preprint

View full text Add to dashboard Cite

One of the important research areas in imaging is the formation of images, which plays an important role in many different applications, including surveillance, control, and security affairs. On the other hand, high spatial resolution is one of the most important factors for increasing image quality, but it increases the amount of storage memory. Based on this, it is expected that the processing methods will be concentrated in this area. In face recognition systems, one of the existing challenges is maintaining the image recognition rate. These images in the recognition system may affect the efficiency of the system, and as a result, it may be inferred that the percentage of recognition is found. Proposing a method that at least does not reduce detection rates would be very desirable. This article investigates how to compress facial images with high spatial resolution using innovative algorithms to reduce or even increase their accuracy as much as possible. In this article, meta-heuristic algorithms (genetics and gray wolf) are used in a way that they are responsible for identifying the important and similar areas of matching macroblocks in the whole image segmentation. So how arranging the length of the bit string of each block is appropriate to achieve the target estimation to achieve the highest recognition accuracy value, PSNR value, and SSIM value of the image set? In the simulation and evaluation section, the facial images of the CIE and FEI databases have been examined as a selective study, and the recognition efficiency of the images for the conditions without/with compression and the common SPIHT and JPEG coding methods and compared with the proposed method. The simulation results show the significant impact of the proposed methods using meta-heuristic algorithms in increasing the quality of PSNR and SSIM in contrast to the recognition efficiency. According to the proposed method, the larger the value of dividing the blocks, the better the average PSNR and SSIM, assuming the highest recognition accuracy can be reached in both meta-heuristic algorithms. In general, depending on the type of application of the problem, there is a compromise to achieve the highest average PSNR or SSIM, using a genetic algorithm or gray wolf. The gray wolf algorithm, however, reaches its optimal answer much faster than the genetic algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

WITHDRAWN: A new method of facial image compression based on meta-heuristic algorithms with variable bit budget allocation

khodadadi

Ardeshir

Grailu

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…The optimal vector proposed by the algorithm (genetics/gray wolf) for allocating the bit budget of each image block is determined when the efficiency and accuracy of the recognition of the test images are at their peak. Face recognition is based on the following recognition accuracy criteria (17):…”

Section: Accuracy Measurementmentioning

confidence: 99%

“…While working in a lossy environment, an image data compression algorithm [16] should preserve most of the data's features and be less complex in algorithmic terms. The general nature of these methods [17][18][19] usually begins with a set of variables and continues until the objective function reaches a minimum or maximum value. The image of a face is one of the most popular and widely used images.…”

Section: Introductionmentioning

confidence: 99%

Compressing Face Images Using Genetic and Gray Wolf Meta-heuristic Algorithms Based on Variable Bit Allocation

khodadadi

Ardeshir

Grailu

2023

IJE

View full text Add to dashboard Cite

In image processing, compression plays an important role in monitoring, controlling, and securing the process. The spatial resolution is one of the most effective factors in improving the quality of an image; but, it increases the amount of storage memory required. Based on meta-heuristic algorithms, this article presents a compression model for face images with block division and variable bit allocation. Wavelet transform is used to reduce the dimensions of high spatial resolution face images. In order to identify important and similar areas of identical macroblocks, genetic algorithms and gray wolves are used. A bit rate allocation is calculated for each block to achieve the best recognition accuracy, average PSNR, and SSIM. The CIE and FEI databases have been used as case studies. The proposed method has been tested and compared with the accuracy of image recognition under uncompressed conditions and using the common SPIHT and JPEG coding methods. Recognition accuracy increased from 0.18% for 16×16 blocks to 1.97% for 32×32 blocks. Additionally, the gray wolf algorithm is much faster than the genetic algorithm in reaching the optimal answer. Depending on the application type of the problem, the genetic algorithm or the gray wolf may be preferred to achieve the maximum average PSNR or SSIM. At the bit rate of 0.9, the maximum average PSNR for the gray wolf algorithm is 34.92 and the maximum average SSIM for the genetic algorithm is 0.936. Simulation results indicate that the mentioned algorithms increase PSNR and SSIM by stabilizing or increasing recognition accuracy.

show abstract

Compression of face images using meta-heuristic algorithms based on curvelet transform with variable bit allocation

Khodadadi,

Ardeshir,

Grailu

2023

Multimedia Systems

View full text Add to dashboard Cite

Data Compression Algorithm for Audio and Image using Feature Extraction

Cited by 5 publications

References 8 publications

WITHDRAWN: A new method of facial image compression based on meta-heuristic algorithms with variable bit budget allocation

WITHDRAWN: A new method of facial image compression based on meta-heuristic algorithms with variable bit budget allocation

Compressing Face Images Using Genetic and Gray Wolf Meta-heuristic Algorithms Based on Variable Bit Allocation

Compression of face images using meta-heuristic algorithms based on curvelet transform with variable bit allocation

Contact Info

Product

Resources

About