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

Author:

khodadadi Reza1,Ardeshir Gholamreza1,Grailu Hadi2

Affiliation:

1. Babol Noshirvani University of Technology

2. Shahrood University of Technology

Abstract

Abstract 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.

Publisher

Research Square Platform LLC

Reference61 articles.

1. Chien-Hsiung Lin, Kuo-Liang Chung, and Jian-Ping Fang; “Adjusted 4:2:2 Chroma Subsampling Strategy for Compressing Mosaic Videos with Arbitrary RGB Color Filter Arrays in HEVC”, APSIPA. 2014.

2. High bandwidth data and image transmission using a scalable link model with integrated real-time data compression”;Rand B;Advances in Electrical Engineering, Electronics and Energy,2021

3. “A New Method of Image Steganography Using 7th Bit of a Pixel as Indicator by Introducing the Successive Temporary Pixel in the Gray Scale Image”;Joshi Kamaldeep;Journal of Computer Networks and Communications,2018

4. Joint image compression and encryption using a novel column-wise scanning and optimization algorithm”, ScienceDirect;Pratibha Chaudharya Ritu;Procedia Computer Science,2020

5. Lakshmi Praba.V, Anitha.S; “Removing Coding and Inter Pixel Redundancy in High Intensity Part of Image”, Journal of Emerging Technologies and Innovative Research (JETIR), February 2019, Volume 6, Issue 2.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3