# Manta Ray Foraging Optimization with Vector Quantization Based Microarray Image Compression Technique

Authors: Nora A. Alkhaldi; Rawabi Abdulaziz Abdullah Alsedais; Hanan T. Halawani; Sayed M. Abdelkhalek Aboutaleb
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

DNA microarray technologies enable the analysis of the expression of numerous genes in an individual experiment and become an important approach in the field of medicine and biology for investing genetic function, regulation, and interaction. Microarray images can be investigated well for obtaining the contained genetic data. But is it undesirable to retain the genetic data and avoid the microarray images? Due to considerable attention to DNA microarray and several experiments being performed under distinct conditions, a massive quantity of data gets produced over the globe. In order to store and share the microarray images, effective storage and communication models are needed in a natural way. Vector quantization (VQ) is a commonly utilized tool for compressing images, which mainly aims to produce effective codebooks comprising a collection of codewords. Therefore, this paper presents a manta ray foraging optimization (MRFO) with Linde–Buzo–Gray (LBG) based microarray image compression (MRFOLBG-MIC) technique. The LBG model is commonly utilized to design local optimal codebooks to compress images. The construction of codebooks can be defined as a nondeterministic polynomial time (NP) hard problem and can be resolved by the MRFO algorithm. The codebooks produced from LBG-VQ are optimized using the MRFO algorithm to attain optimum optimal codebooks. When the codebooks are produced by the MRFOLBG-MIC algorithm, Deflate model can be applied to compress the index tables. The design of the MRFO algorithm with LBG and Deflate based index table compression demonstrate the novelty of the work. For demonstrating the enhanced compression efficacy of the MRFOLBG-MIC model, a wide-ranging experimental validation process is performed using a benchmark dataset. The experimental outcomes inferred that the MRFOLBG-MIC model accomplished superior outcomes over the other existing models.


---

## Body

## 1. Introduction

Microarray analysis is a mechanism that permits the evaluation and categorization of genes in the fastest means. Currently, a microarray is considered the foremost tool for gene-related investigation [1]. The microarray technique is utilized for monitoring a huge amount of tissue array images in a simultaneous way. All microarray experiment generates many larger-sized images that become difficult to share or store [2]. Such an enormous number of microarray images implies new challenges for bandwidth resources and memory space. Lacking high speed Internet connection, it is hard or not possible to distribute microarray images from some other parts of the world [3]. Various researches were carried out for handling the memory of a huge number of microarray image datasets effectively. The image compression method is one of the means for handling such a greater amount of images. Generally, the main motive of the image compression technique is sending an image with fewer bits [4, 5].Image compression has three elements, namely, realization of unwanted data in image, transformation method, and suitable coding method [6]. The most significant image compression standard is JPEG and its quantization is classified into two kinds such as vector quantization (VQ) and scalar quantization (SQ). It is an inconvertible compression technique and is widely utilized in the compressing of images, which includes some loss of information [7]. The main motive of VQ is producing an optimum codeword (CW) which comprises a collection of CWs, where else an input image vector is allotted on the basis of minimal Euclidean distance. The familiar VQ method is Linde–Buzo–Gray (LBG) model. LBG technique provides flexibility, simplicity, and adaptability. Moreover, the technique relies on lower Euclidean distance amongst respective CWs and image vectors. It could produce local optimal solutions and in other words, it had failed in presenting the best global solutions. The final solution of the LBG algorithm depends on an arbitrarily-created codebook at the early stages.The VQ method was utilized for few more years. Historically, VQ was detached into 3 stages: vector decoding, vector encoding, and codebook generation. The generation of the codebook is the most significant function, which determines the efficiency of VQ [8]. The motive of codebook generation is identifying code vector (codebook) for provided sets of training vectors by reducing the average pairwise distance among the training vectors and their respective CWs. The vector encrypting operation of VQ methods comprises the partition of the image into more input vectors (or blocks), and then a comparison is made to the CWs of the codebook with a view to identifying the nearest CW for every input vector [9]. The VQ encodes each and every input vector towards an index of the codebook. Generally, the codebook size is comparatively very small with actual image data sets, and thus the intention of image compression is attained. In the decoding process, the connected subimages are accurately recovered by the encoded codebook. When each and every subimage is entirely recreated, the decoding is finished. The codebook model of the VQ algorithm was done by most of the researchers [10].Codebook training can be treated as a challenging process in VQ due to the fact that the codebook significantly influences image compression quality. The importance of codebook training process has received significant attention among research communities to design evolutionary optimization algorithms such as monarch butterfly optimization (MBO) [11], slime mould algorithm (SMA) [12], moth search algorithm (MSA) [13], hunger games search (HGS) [14], Runge Kutta method (RUN) [15], colony predation algorithm (CPA) [16], weIghted meaN oF vectOrs (INFO) [17], mayfly optimization [18], Harris hawks optimization (HHO) [19], and Manta ray foraging optimization [20]. In this study, the MRFO algorithm is used over other metaheuristics due to its simplicity, easy to implement, highly versatile, few adjustable parameters, and flexibility.This paper presents a manta ray foraging optimization (MRFO) with Linde–Buzo–Gray (LBG) based microarray image compression (MRFOLBG-MIC) technique. Primarily, the LBG model is commonly utilized to design local optimal codebooks to compress images. By the use of VQ, the local codebooks are produced to reduce the mean square error (MSE) and increase the peak signal to noise ratio (PSNR). The codebooks produced from LBG-VQ are optimized using the MRFO algorithm to attain optimum optimal codebooks. Therefore, the output image received is reconstructed with the enhanced codebooks obtained by the proposed model for microarray image compression. This optimal compression algorithm produces efficient codebooks by generating visually better-quality images. When the codebooks are produced by the MRFOLBG-MIC algorithm, Deflate model can be applied to compress the index tables. For ensuring the improved compression efficacy of the MRFOLBG-MIC model, a wide-ranging experimental validation process is performed using a benchmark dataset.


## 2. Related Works

The authors in [21] implemented a novel technique taking benefit of the potential simplicity of the run length technique for contributing a volumetric RLE method for binary medicinal information from the 3-D procedure. The presented volumetric-RLE (VRLE) technique varies in the 2-D RLE method employing correlations of intraslice only that is utilized to compressing binary medicinal information employing voxel-correlation of interslice. Geetha et al. [22] presented a VQ codebook construction technique named as L2-LBG approach employing the Lempel–Ziv–Markov chain algorithm (LZMA) and Lion optimization algorithm (LOA). If the LOA created the codebook, LZMA was executed for compressing the index table and higher the compression performance of LOA. Kumar et al. [23] execute the LBG with BAT optimized technique that creates a suitable codebook. An optimized technique was utilized not only for the codebook proposal along with for the codebook size chosen.In [24], the application of bat optimized technique in medicinal image compression was identified. The bat optimized technique was utilized here to optimal codebook design from Vector Quantization (VQ) technique. The efficiency of the BAT-VQ compression model has been related to the recent approaches. Kumari et al. [25] presented the flower pollination algorithm (FPA) based vector quantization to optimum image compression with optimum reconstructed image quality. The performances of the presented approach were estimated by utilizing mean square error (MSE), fitness function (FF), and peak signal to noise ratio (PSNR). In [26], the whale optimization algorithm (WOA) was utilized for determining an optimum codebook from image compression. In WOA, there are distinct searching approaches, and it is an ideal technique to find an optimum codebook from image compression. Execution of the presented technique to compression on many typical images illustrates that the presented approach compresses images with suitable quality.Othman et al. [27] examined a novel effectual lossy image compression approach dependent upon the polynomial curve fitting approximation approach that signifies several pixels of the image with less amount of polynomial coefficients. The projected approach begins with changing the image to a 1D signal and it separates this 1D signal into segments of variable length. Afterward, the polynomial curve fitting was executed for these segments for constructing the coefficient matrix. In [28–31], ML techniques are trained for relating the clinical image content to its compression ratio. When trained, the optimal DCT compression ratio of X-ray images was selected on offering an image to networks. The experimental outcomes demonstrated that the radial basis function neural network (RBFNN) learning technique is effectually utilized for classifying the optimal compression ratio to the X-ray image but maintained superior image quality.


## 3. The Proposed Model

In this work, a new MRFOLBF-MIC model is presented to compress microarray images for effective storage and transmission. The LBG model is commonly utilized to design local optimal codebooks to compress images. The construction of codebooks can be defined as a nondeterministic polynomial time (NP) hard problem and can be resolved by the MRFO algorithm. When the codebooks are produced by the MRFOLBG-MIC algorithm, Deflate model can be applied to compress the index tables.


### 3.1. Overview of VQ

VQ is resolved as a block coding method deployed to compressed images with loss data. In VQ, the codebook structure is a vital procedure [32]. Assuming Y=yij represents the raw image size of M×M pixels that are separated into discrete block sizes of n×n pixels. Specifically, an input vector X=xi,i=1,2,…,Nb comprises a group of Nb=N/n×N/n and L represents n×n. An input vector xi,xi∈ℜL is L dimension Euclidean spaces. The codebook C has L dimensionality codewords, in which C=c1,c2,…,cNc, cj∈ℜL,∀j=1,2,…,Nc. Each input vector has represented by a row vector xi=xi1,xi2,…,xiL and the jth codeword of the codebook was implied as cj=cj1,cj2,…,cjL. An optimized C by means of MSE that enhances the minimized distortion function D. Commonly, the lesser value of D represented optimum C.(1)DC=1Nb∑j=1Nc∑i=1Nbμij⋅xi−cj2.Subject to the constraint provided in the following equations:.(2)∑j=1Ncμij=1,∀i∈1,2,…,Nb,(3)μij=1ifxiisinthejthcluster,0.And,Lk≤Cjk≤Uk,k=1,2,…,L, where Lk implies the lesser kth component from trained is a vector and Uk demonstrates the superior kth component from the input vector. The xi−ci illustrates Euclidean distance among the vector x and CW c.


### 3.2. Process Involved in LBQ

The LBG is demonstrated as a scalar quantization approach founded by Lloyd in the year 1957 and it can be generalized to VQ from the year 1980. It uses 2 existing states for input vectors for determining the codebook. Assumexi,i=1,2,…,Nb refers to the input vector, distance function d, and initial codewords cj0,j=1,2,…Nc in Figure 1 demonstrates the steps in LBG. The LBG technique frequently employed 2 states for achieving optimally codebook dependent upon the provided methods [32]:(i)
Split the input vector into distinct groups utilizing minimal distance rules. The resultant block was stored inNb×Nc binary indicator matrix U in which the components are demonstrated as follows:(4)μij=1,ifdxi,cjk=minpdxi,cpk,0,otherwise.(ii)
Distinguish the centroid of each portion. The preceding codewords are exchanged by some accessible centroids.(5)cjk+1=∑i=1Nbμij⋅xi∑i=1Nbμij.(iii)
Go to step 1 if there are still no alterations incj happening.Figure 1
Steps in LBG.


### 3.3. Codebook Construction Using MRFO Algorithm

In this work, the construction of codebooks can be defined as an NP hard problem and can be resolved by the MRFO algorithm. MRFO has been evolved by 3 foraging natures, namely, cyclone, somersault, and chain foraging. The arithmetical methods are defined in the following [33].


### 3.4. Chain Foraging

In MRFO, MR has the capacity to observe the position of plankton and move towards them. Once the position of plankton is high, it is taken as an optimal one. Even though the best solution is dark room, MRFO considers the optimum solution as plankton with higher MR would reach the best food source. An individual without first moving towards food is not operated; however, it has emerged from them. Hence, an individual is upgraded by an optimal solution that is identified in front of it. The mathematical method of chain foraging is expressed as follows:(6)xidt+1=xidt+r⋅xbestdt−xidt+α⋅xbestdt−xidti=1,xidt+r⋅xi−1dt−xidt+α⋅xbestdt−xidti=2,…,N,α=2⋅r⋅logr.Here,r indicates an arbitrary number within 0,1a symbolizes a weight coefficient, xidt represents the location of i th individual at time t in dth dimension, and xbestdt refers to the plankton with higher concentration. The position upgrade of ith individual can be represented by the location xi−1t of the i−1th individual along with location xbestt of the food.


### 3.5. Cyclone Foraging

Once a group of MR finds dense plankton in marine water, it increases the long foraging chain and moves to the food in a spiral path. Like spiral foraging principles that are recognized in WOA. In the cyclone foraging technique of MR, spiral motion for MR swim in front of it. Also, follow a point in front of it and move toward food in a spiral manner. It can be arithmetically expressed as follows:(7)Xjt+1=Xbest+r⋅Xi−1t−Xit+ebw⋅cos2πw⋅Xbest−Xit,Yit+1=Ybest+r⋅Yi−1t−Yit+ebw⋅sin2πw⋅Ybest−Yit.Here,w denotes an arbitrary value within 0,1,Xbest and Ybest represent the food with the highest concentration. The motion behaviour is transmitted to n‐D space. The numerical approach to cyclone foraging is illustrated by the following equation:(8)xidt+1=xbestd+r⋅xbestdt−xidt+β⋅xbestdt−xidti=1,xbestd+r⋅xi−1dt−xidt+β⋅xbestdt−xidti=2,…,N,β=2er1T−t+1/T⋅sin2πr1,where β denotes the weight coefficient, T characterizes a large amount of iterations, and r1 indicates rand value within 0,1.The individual implements an exploration in terms of food as the position; thus the cyclone foraging has the best exploitations for a region with an optimum solution. As well, it is implied for improving the search procedures. It highly concentrates on searching technique and activates MRFO to obtain the extreme global search is represented as follows:(9)xrandd=Lbd+r⋅Ubd−Lbd,xidt+1=xrandd+r⋅xrandd−xidt+β⋅xrandd−xidti=1,xrandd+r⋅xi−ldt−xidt+β⋅xrandd−xidti=2,…,N.Nowxrandd indicates the arbitrary position that is produced from searching space, Lbd and Ubd denotes lower and upper bounds. Figure 2 illustrates the flowchart of the MRFO technique.Figure 2
Flowchart of MRFO.


### 3.6. Somersault Foraging

In this process, the position of food is specified as an important factor. Consequently, it upgrades the locations around an optimum location. It can be arithmetically expressed as follows:(10)xidt+1=xidt+S⋅r2⋅xbestd−r3⋅xidt,i=1,…,N.NowS signifies the somersault factor that chooses somersault rank, and S=2,r2, and r3 indicate arbitrary value within [0, 1]. It is possible for a person to swim towards the position for seeking an application situated among symmetrical and existing locations. The distance amongst a better and individual location is minimized, and the perturbation of the existing position is reduced. The individual can be explored by the best solution in a searching space. The pseudocode of the MRFO algorithm is given in Algorithm 1.Algorithm 1: Pseudocode of MRFO Algorithm.
Parameter initialization: population sizeN, maximum iterations TWhile termination condition is not fulfilled doFori = 1 to N doIf rand <0.5 thenIft/Tmax thenxrand=xl+rand⋅xu−xl,xit+1=xrand+r⋅xrand−xit+β⋅xrand−xiti=1,xrand+r⋅xi−1t−xit+β⋅xrand−xiti=2,…,N.Elsexit+1=xbest+r⋅xbest−xit+β⋅xbest−xiti=1,xbest+r⋅xi−1t−xit+β⋅xbest−xiti=2,…,N.End ifElsexit+1=xi+r⋅xbest−xit+β⋅xbest−xiti=1,xi+r⋅xi−1t−xit+β⋅xbest−xiti=2,…,N.End ifDetermine fitness of every individualfxit+1 If fxit+1<fxbestThenxbest=xit+1//somersault foragingFori = 1 to N doxit+1=xit+S⋅r2⋅xbest−r3⋅xit.Determine fitness of all individualsfxit+1 If fxit+1<fxbestThenxbest=xit+1End forEnd whileDisplay optimum solution attained so farxbestAn input image can be separated into a nonoverlapping block that endures quantization by the LBG method. The codebook that is utilized utilizing the LBG method was trained with the MRFO technique that is for satisfying requires of global convergence and declaring global convergence. The index numbers are sent on the broadcast medium and recreated at target utilizing the decoded. The transformed index and equivalent codewords were set correctly for the drive of creating decompressed image size nearly equivalent to providing an input image.Step 1.
Initialized Parameters: at this point, the codebook created utilizing the LBG method was stated that the primary solution whereas residual solutions were established in an arbitrary approach. The reached solution signifies the codebook of Nc codewords.Step 2.
Choosing the Current Optimum Solution: the fitness of all solutions are procedure and select the superior fitness place as the better outcome.Step 3.
Creating New Solution: the place of manta rays is upgraded by utilizing the prey place. If the arbitrarily produced number (K) is superior to ∼a, afterward exchange the bad places with the recently identified position and keep an optimally place unchanged.Step 4.
Rank the solution in the application of fitness function (FF) and select an optimal solution.Step 5.
End Condition: by Following the steps 2 and 3 still obtaining the termination criteria.


### 3.7. Codebook Compression Process

Once the codebooks are created by the MRFOLBG-MIC algorithm, Deflate model can be used to compress the index tables. It comprises a sequence of blocks indicating succeeding blocks of input data. Every individual block can be coded by the integration of the LZ77 model and Huffman coding. The first LZ77 model identifies recurrent substrings and substitutes them with backward reference. It utilizes a reference to a duplicated string that exists in the identical or earlier blocks up to 32K input bytes back. It is utilized in gzip, an extended version of LZ77. It mainly determines the repeated strings in the input data. The next existence of the string can be substituted via a pointer to the earlier string in the form of pair.


## 3.1. Overview of VQ

VQ is resolved as a block coding method deployed to compressed images with loss data. In VQ, the codebook structure is a vital procedure [32]. Assuming Y=yij represents the raw image size of M×M pixels that are separated into discrete block sizes of n×n pixels. Specifically, an input vector X=xi,i=1,2,…,Nb comprises a group of Nb=N/n×N/n and L represents n×n. An input vector xi,xi∈ℜL is L dimension Euclidean spaces. The codebook C has L dimensionality codewords, in which C=c1,c2,…,cNc, cj∈ℜL,∀j=1,2,…,Nc. Each input vector has represented by a row vector xi=xi1,xi2,…,xiL and the jth codeword of the codebook was implied as cj=cj1,cj2,…,cjL. An optimized C by means of MSE that enhances the minimized distortion function D. Commonly, the lesser value of D represented optimum C.(1)DC=1Nb∑j=1Nc∑i=1Nbμij⋅xi−cj2.Subject to the constraint provided in the following equations:.(2)∑j=1Ncμij=1,∀i∈1,2,…,Nb,(3)μij=1ifxiisinthejthcluster,0.And,Lk≤Cjk≤Uk,k=1,2,…,L, where Lk implies the lesser kth component from trained is a vector and Uk demonstrates the superior kth component from the input vector. The xi−ci illustrates Euclidean distance among the vector x and CW c.


## 3.2. Process Involved in LBQ

The LBG is demonstrated as a scalar quantization approach founded by Lloyd in the year 1957 and it can be generalized to VQ from the year 1980. It uses 2 existing states for input vectors for determining the codebook. Assumexi,i=1,2,…,Nb refers to the input vector, distance function d, and initial codewords cj0,j=1,2,…Nc in Figure 1 demonstrates the steps in LBG. The LBG technique frequently employed 2 states for achieving optimally codebook dependent upon the provided methods [32]:(i)
Split the input vector into distinct groups utilizing minimal distance rules. The resultant block was stored inNb×Nc binary indicator matrix U in which the components are demonstrated as follows:(4)μij=1,ifdxi,cjk=minpdxi,cpk,0,otherwise.(ii)
Distinguish the centroid of each portion. The preceding codewords are exchanged by some accessible centroids.(5)cjk+1=∑i=1Nbμij⋅xi∑i=1Nbμij.(iii)
Go to step 1 if there are still no alterations incj happening.Figure 1
Steps in LBG.


## 3.3. Codebook Construction Using MRFO Algorithm

In this work, the construction of codebooks can be defined as an NP hard problem and can be resolved by the MRFO algorithm. MRFO has been evolved by 3 foraging natures, namely, cyclone, somersault, and chain foraging. The arithmetical methods are defined in the following [33].


## 3.4. Chain Foraging

In MRFO, MR has the capacity to observe the position of plankton and move towards them. Once the position of plankton is high, it is taken as an optimal one. Even though the best solution is dark room, MRFO considers the optimum solution as plankton with higher MR would reach the best food source. An individual without first moving towards food is not operated; however, it has emerged from them. Hence, an individual is upgraded by an optimal solution that is identified in front of it. The mathematical method of chain foraging is expressed as follows:(6)xidt+1=xidt+r⋅xbestdt−xidt+α⋅xbestdt−xidti=1,xidt+r⋅xi−1dt−xidt+α⋅xbestdt−xidti=2,…,N,α=2⋅r⋅logr.Here,r indicates an arbitrary number within 0,1a symbolizes a weight coefficient, xidt represents the location of i th individual at time t in dth dimension, and xbestdt refers to the plankton with higher concentration. The position upgrade of ith individual can be represented by the location xi−1t of the i−1th individual along with location xbestt of the food.


## 3.5. Cyclone Foraging

Once a group of MR finds dense plankton in marine water, it increases the long foraging chain and moves to the food in a spiral path. Like spiral foraging principles that are recognized in WOA. In the cyclone foraging technique of MR, spiral motion for MR swim in front of it. Also, follow a point in front of it and move toward food in a spiral manner. It can be arithmetically expressed as follows:(7)Xjt+1=Xbest+r⋅Xi−1t−Xit+ebw⋅cos2πw⋅Xbest−Xit,Yit+1=Ybest+r⋅Yi−1t−Yit+ebw⋅sin2πw⋅Ybest−Yit.Here,w denotes an arbitrary value within 0,1,Xbest and Ybest represent the food with the highest concentration. The motion behaviour is transmitted to n‐D space. The numerical approach to cyclone foraging is illustrated by the following equation:(8)xidt+1=xbestd+r⋅xbestdt−xidt+β⋅xbestdt−xidti=1,xbestd+r⋅xi−1dt−xidt+β⋅xbestdt−xidti=2,…,N,β=2er1T−t+1/T⋅sin2πr1,where β denotes the weight coefficient, T characterizes a large amount of iterations, and r1 indicates rand value within 0,1.The individual implements an exploration in terms of food as the position; thus the cyclone foraging has the best exploitations for a region with an optimum solution. As well, it is implied for improving the search procedures. It highly concentrates on searching technique and activates MRFO to obtain the extreme global search is represented as follows:(9)xrandd=Lbd+r⋅Ubd−Lbd,xidt+1=xrandd+r⋅xrandd−xidt+β⋅xrandd−xidti=1,xrandd+r⋅xi−ldt−xidt+β⋅xrandd−xidti=2,…,N.Nowxrandd indicates the arbitrary position that is produced from searching space, Lbd and Ubd denotes lower and upper bounds. Figure 2 illustrates the flowchart of the MRFO technique.Figure 2
Flowchart of MRFO.


## 3.6. Somersault Foraging

In this process, the position of food is specified as an important factor. Consequently, it upgrades the locations around an optimum location. It can be arithmetically expressed as follows:(10)xidt+1=xidt+S⋅r2⋅xbestd−r3⋅xidt,i=1,…,N.NowS signifies the somersault factor that chooses somersault rank, and S=2,r2, and r3 indicate arbitrary value within [0, 1]. It is possible for a person to swim towards the position for seeking an application situated among symmetrical and existing locations. The distance amongst a better and individual location is minimized, and the perturbation of the existing position is reduced. The individual can be explored by the best solution in a searching space. The pseudocode of the MRFO algorithm is given in Algorithm 1.Algorithm 1: Pseudocode of MRFO Algorithm.
Parameter initialization: population sizeN, maximum iterations TWhile termination condition is not fulfilled doFori = 1 to N doIf rand <0.5 thenIft/Tmax thenxrand=xl+rand⋅xu−xl,xit+1=xrand+r⋅xrand−xit+β⋅xrand−xiti=1,xrand+r⋅xi−1t−xit+β⋅xrand−xiti=2,…,N.Elsexit+1=xbest+r⋅xbest−xit+β⋅xbest−xiti=1,xbest+r⋅xi−1t−xit+β⋅xbest−xiti=2,…,N.End ifElsexit+1=xi+r⋅xbest−xit+β⋅xbest−xiti=1,xi+r⋅xi−1t−xit+β⋅xbest−xiti=2,…,N.End ifDetermine fitness of every individualfxit+1 If fxit+1<fxbestThenxbest=xit+1//somersault foragingFori = 1 to N doxit+1=xit+S⋅r2⋅xbest−r3⋅xit.Determine fitness of all individualsfxit+1 If fxit+1<fxbestThenxbest=xit+1End forEnd whileDisplay optimum solution attained so farxbestAn input image can be separated into a nonoverlapping block that endures quantization by the LBG method. The codebook that is utilized utilizing the LBG method was trained with the MRFO technique that is for satisfying requires of global convergence and declaring global convergence. The index numbers are sent on the broadcast medium and recreated at target utilizing the decoded. The transformed index and equivalent codewords were set correctly for the drive of creating decompressed image size nearly equivalent to providing an input image.Step 1.
Initialized Parameters: at this point, the codebook created utilizing the LBG method was stated that the primary solution whereas residual solutions were established in an arbitrary approach. The reached solution signifies the codebook of Nc codewords.Step 2.
Choosing the Current Optimum Solution: the fitness of all solutions are procedure and select the superior fitness place as the better outcome.Step 3.
Creating New Solution: the place of manta rays is upgraded by utilizing the prey place. If the arbitrarily produced number (K) is superior to ∼a, afterward exchange the bad places with the recently identified position and keep an optimally place unchanged.Step 4.
Rank the solution in the application of fitness function (FF) and select an optimal solution.Step 5.
End Condition: by Following the steps 2 and 3 still obtaining the termination criteria.


## 3.7. Codebook Compression Process

Once the codebooks are created by the MRFOLBG-MIC algorithm, Deflate model can be used to compress the index tables. It comprises a sequence of blocks indicating succeeding blocks of input data. Every individual block can be coded by the integration of the LZ77 model and Huffman coding. The first LZ77 model identifies recurrent substrings and substitutes them with backward reference. It utilizes a reference to a duplicated string that exists in the identical or earlier blocks up to 32K input bytes back. It is utilized in gzip, an extended version of LZ77. It mainly determines the repeated strings in the input data. The next existence of the string can be substituted via a pointer to the earlier string in the form of pair.


## 4. Performance Validation

In this section, a detailed microarray image compression technique is provided. The proposed model is simulated using the MATLAB tool on a PC MSI Z370 A- Pro, i5-8600k, GeForce 1050Ti 4 GB, 16 GB RAM, 250 GB SSD, and 1 TB HDD. The parameter setting is given as follows: batch size: 500, number of epochs: 15, learning rate: 0.05, dropout rate: 0.25, and activation function: rectified linear unit (ReLU). The results are tested for five distinct images gathered from various sources. Figure3 illustrates some original and reconstructed images.Figure 3
Original images (first and third row) (second and fourth row).Table1 provides an overall PSNR examination of the MRFOLBG-MIC model under five test images and distinct bit rates (BRs) [34].Table 1
Overall PSNR analysis of the MRFOLBG-MIC technique under five test images and distinct BRs.
Test imagesMethodsPSNR (dB)0.18750.2500.31250.37500.43750.5000.56250.6250Image 1MRFOLBG-MIC26.0526.7128.3728.9831.3532.3532.7934.53OLBG-LZMA24.7925.6527.1527.9829.6230.5931.5033.21CSA-LBG23.5924.0925.3627.0328.4628.7930.2532.18FFA-LBG21.8323.1723.8425.5827.5927.3228.7431.03HBMO-LBG21.0221.7022.3823.9826.4826.1827.5729.81QPSO-LBG20.1320.4921.4222.3225.5524.6626.2428.61PSO-LBG19.1919.2520.4620.8524.5223.0624.6527.40Image 2MRFOLBG-MIC23.3323.9525.4627.4528.4830.1631.2632.93OLBG-LZMA21.6922.9224.2825.9127.3728.4130.0131.77CSA-LBG20.2321.1922.9024.8025.8827.5728.8530.59FFA-LBG19.1920.3021.1723.9624.7626.0327.6128.93HBMO-LBG17.7018.8519.9623.1123.8625.1026.7627.20QPSO-LBG16.4017.2418.3421.4422.8924.0525.7925.94PSO-LBG14.8815.9717.4120.6022.0723.0424.7324.22Image 3MRFOLBG-MIC25.8227.4028.1229.5430.3232.0133.4035.15OLBG-LZMA24.7125.6326.4828.1329.0830.7332.0033.66CSA-LBG23.4723.9424.9726.8427.3829.4031.1031.94FFA-LBG22.6623.0623.9725.2026.2327.8630.0630.28HBMO-LBG20.8821.7422.5424.0225.0626.5828.5428.99QPSO-LBG19.3120.2421.4123.0424.2425.7627.4427.73PSO-LBG18.0518.9819.8121.5022.7424.8326.6426.00Image 4MRFOLBG-MIC25.4926.9828.4630.0031.4432.3833.0734.25OLBG-LZMA24.0325.6227.1928.6029.6930.9532.0832.98CSA-LBG22.4524.7025.8927.0628.5229.6430.4331.78FFA-LBG21.2223.1724.4726.0527.1128.3629.0030.09HBMO-LBG20.2221.9622.9624.3626.2426.8627.5528.45QPSO-LBG19.1220.6521.4923.2624.4825.7626.3126.99PSO-LBG17.5619.0419.7522.0423.4324.3624.6025.64Image 5MRFOLBG-MIC24.8127.6829.2230.5631.7532.2232.9334.71OLBG-LZMA23.7726.0727.3627.9329.0930.7531.6133.15CSA-LBG22.2124.9826.2427.1628.4529.6129.9031.66FFA-LBG21.4123.2424.8226.2326.9228.3229.7930.15HBMO-LBG19.5622.2723.5824.3427.0426.4926.9328.42QPSO-LBG18.9420.6621.0823.0824.2426.3126.2327.49PSO-LBG16.8718.8319.5921.6324.0324.9523.9526.06Image 6MRFOLBG-MIC26.4028.7129.7531.8233.3333.1234.2735.51OLBG-LZMA25.0827.2828.1728.6530.4132.1933.1034.72CSA-LBG23.1625.8027.3428.4229.4930.3731.4332.86FFA-LBG22.0724.5926.2126.7328.3328.9930.3931.39HBMOLBG20.3323.0924.3025.8327.8527.9427.8928.97QPSO-LBG20.0322.2022.3524.1325.0526.9927.1828.94PSO-LBG17.9320.1321.1723.0425.3325.5525.5326.90Figure4 demonstrates a brief comparative PSNR inspection of the MRFOLBG-MIC model under distinct BRs on image 1. The figure reported that the MRFOLBG-MIC model has offered improved PSNR values under all BRs. For instance, with a BR of 0.1875, the MRFOLBG-MIC method has offered a superior PSNR of 26.05 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have reached minimum PSNR of 24.79 dB, 23.59 dB, 21.83 dB, 21.02 dB, 20.13 dB, and 19.19 dB, respectively. Moreover, with a BR of 0.6250, the MRFOLBG-MIC technique has offered a higher PSNR of 34.53 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have reached lesser PSNR of 33.21 dB, 32.18 dB, 31.03 dB, 29.81 dB, 28.61 dB, and 27.40 dB correspondingly.Figure 4
PSNR analysis of MRFOLBG-MIC technique under image 1.Figure5 depicts a brief comparative PSNR analysis of the MRFOLBG-MIC model under distinct BRs in image 2. The figure reported that the MRFOLBG-MIC model has offered improved PSNR values under all BRs. For instance, with a BR of 0.1875, the MRFOLBG-MIC system has obtainable enhanced PSNR of 23.33 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG methods have obtained minimal PSNR of 21.69 dB, 20.23 dB, 19.19 dB, 17.70 dB, 16.40 dB, and 14.88 dB correspondingly. In addition, with a BR of 0.6250, the MRFOLBG-MIC method has accessible superior PSNR of 32.93 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG systems have achieved reduced PSNR of 31.77 dB, 30.59 dB, 28.93 dB, 27.20 dB, 25.94 dB, and 24.22 dB correspondingly.Figure 5
PSNR analysis of MRFOLBG-MIC technique under image 2.Figure6 showcases a brief comparative PSNR analysis of the MRFOLBG-MIC algorithm under distinct BRs on image 3. The figure exposed that the MRFOLBG-MIC model has offered improved PSNR values under all BRs. For instance, with a BR of 0.1875, the MRFOLBG-MIC model has presented a higher PSNR of 25.82 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have attained minimal PSNR of 24.71 dB, 23.47 dB, 22.66 dB, 20.88 dB, 19.31 dB, and 18.02 dB correspondingly. Furthermore, with a BR of 0.6250, the MRFOLBG-MIC method has offered a higher PSNR of 35.15 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have reached decreased PSNR of 33.66 dB, 31.94 dB, 30.28 dB, 28.99 dB, 27.73 dB, and 26.00 dB correspondingly.Figure 6
PSNR analysis of MRFOLBG-MIC technique under image 3.Figure7 portrays a brief comparative PSNR inspection of the MRFOLBG-MIC approach under distinct BRs in image 4. The figure outperformed that the MRFOLBG-MIC model has offered improved PSNR values under all BRs. For instance, with a BR of 0.1875, the MRFOLBG-MIC system has offered a superior PSNR of 25.49 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG methods have attained reduced PSNR of 24.03 dB, 22.45 dB, 21.22 dB, 20.22 dB, 19.12 dB, and 17.56 dB correspondingly. Eventually, with a BR of 0.6250, the MRFOLBG-MIC approach has offered a higher PSNR of 34.25 dB, whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have gained minimal PSNR of 32.98 dB, 31.78 dB, 30.09 dB, 28.45 dB, 26.99 dB, and 25.64 dB, respectively.Figure 7
PSNR analysis of MRFOLBG-MIC technique under image 4.Figure8 exhibits a brief comparative PSNR analysis of the MRFOLBG-MIC method under distinct BRs on image 5. The figure reported that the MRFOLBG-MIC model has offered enhanced PSNR values under all BRs. For instance, with a BR of 0.1875, the MRFOLBG-MIC model has offered a higher PSNR of 24.81 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have attained decreased PSNR of 23.77 dB, 22.21 dB, 21.41 dB, 19.56 dB, 18.94 dB, and 16.87 dB, respectively. Followed by, with a BR of 0.6250, the MRFOLBG-MIC methodology has offered a higher PSNR of 34.71 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have reached decreased PSNR of 33.15 dB, 31.66 dB, 30.15 dB, 28.42 dB, 27.49 dB, and 26.06 dB correspondingly.Figure 8
PSNR analysis of MRFOLBG-MIC technique under image 5.Figure9 demonstrates a brief comparative PSNR inspection of the MRFOLBG-MIC technique under distinct BRs on image 6. The figure outperformed that the MRFOLBG-MIC model has offered improved PSNR values under all BRs. For instance, with a BR of 0.1875, the MRFOLBG-MIC method has offered a higher PSNR of 26.40 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have attained reduced PSNR of 25.08 dB, 23.16 dB, 22.07 dB, 20.33 dB, 20.03 dB, and 17.93 dB correspondingly. In addition, with a BR of 0.6250, the MRFOLBG-MIC model has offered a higher PSNR of 35.51 dB whereas the OLBGLZMA, CSALBG, FFA-LBG, HBMOLBG, QPSOLBG, and PSOLBG models have attained minimal PSNR of 34.72 dB, 32.86 dB, 31.39 dB, 28.97 dB, 28.94 dB, and 26.90 dB correspondingly.Figure 9
PSNR analysis of MRFOLBG-MIC technique under image 6.In order to further ensure the improvements of the MRFOLBG-MIC technique, an average PSNR analysis is made in Table2 and Figure 10. The results pointed out that the MRFOLBG-MIC model has resulted in increased values of average PSNR. For example with image 1, the MRFOLBG-MIC model has resulted in an increased average PSNR of 30.14 dB whereas the OLBGLZMA, CSALBG, FFALBG, HBMOLBG, QPSOLBG, and PSOLBG models have reached reduced average PSNR of 28.81 dB, 27.47 dB, 26.14 dB, 24.89 dB, 23.68 dB, and 22.42 dB, respectively. In addition, with image 6, the MRFOLBG-MIC model has resulted in an enhanced average PSNR of 31.61 dB whereas the OLBGLZMA, CSALBG, FFALBG, HBMOLBG, QPSOLBG, and PSOLBG techniques have reached lower average PSNR of 29.95 dB, 28.61 dB, 27.34 dB, 25.78 dB, 24.61 dB, and 23.20 dB correspondingly.Table 2
Average PSNR analysis of MRFOLBG-MIC technique with existing approaches under various images.
MethodsImage 1Image 2Image 3Image 4Image 5Image 6MRFOLBG-MIC30.1427.8830.2230.2630.4931.61OLBG-LZMA28.8126.5528.8028.8928.7229.95CSA-LBG27.4725.2527.3827.5627.5328.61FFA-LBG26.1423.9926.1726.1826.3627.34HBMOLBG24.8922.8224.7924.8324.8325.78QPSO-LBG23.6821.5123.6523.5123.5024.61PSO-LBG22.4220.3722.3222.0521.9923.20Figure 10
Average PSNR analysis of MRFOLBG-MIC technique with existing approaches.Finally, a comprehensive computation time (CT) inspection of the MRFOLBG-MIC model with other models is offered in Table3 and Figure 11. From the figure, it is highlighted that the MRFOLBG-MIC model has resulted in reduced CT over the other models. For instance, with image 1, the MRFOLBG-MIC model has reached the least CT of 0.262s whereas the OLBGLZMA, CSALBG, FFALBG, HBMOLBG, QPSOLBG, and PSOLBG models have provided increased CT of 0.683s, 0.991s, 0.873s, 0.898s, 0.273s, and 0.263s, respectively. Also, with image 6, the MRFOLBG-MIC model has reached the least CT of 0.366s whereas the OLBGLZMA, CSALBG, FFALBG, HBMOLBG, QPSOLBG, and PSOLBG techniques have provided increased CT of 0.468s, 1.665s, 0.552s, 0.723s, 0.282s, and 0.362s correspondingly.Table 3
Average CT analysis of MRFOLBG-MIC technique with existing approaches under various images.
Average Computation Time (sec)MethodsImage1Image2Image3Image4Image5Image6AverageMRFOLBG-MIC0.2620.3180.2660.2810.3280.3660.304OLBG-LZMA0.6830.5480.4250.5880.5520.4680.544CSA-LBG0.9911.4311.0681.6751.6831.6651.419FFA-LBG0.8730.7070.6670.6470.6460.5520.682HBMO-LBG0.8980.7190.6940.6650.7810.7230.747QPSO-LBG0.2730.3370.3440.2700.2500.2820.293PSO-LBG0.2630.3410.2630.2690.3100.3620.301Figure 11
Average CT analysis of MRFOLBG-MIC technique existing methods.These results reported that the MRFOLBG-MIC model has shown effective compression efficiency over the other methods. The results indicated that the MRFOLBG-MIC model has accomplished enhanced performance due to the advantages of the MRFO algorithm.


## 5. Conclusion

In this study, a new MRFOLBF-MIC model has been presented to compress microarray images for effective storage and transmission. The LBG model is commonly utilized to design local optimal codebooks to compress images. The construction of codebooks can be defined as an NP hard problem and can be resolved by the MRFO algorithm. When the codebooks are produced by the MRFOLBG-MIC algorithm, Deflate model can be applied to compress the index tables, showing the novelty of the work. With a view to demonstrate the improved compression efficacy of the MRFOLBG-MIC model, a wide-ranging experimental validation process is performed using a benchmark dataset. The experimental outcomes inferred that the MRFOLBG-MIC model accomplished superior outcomes over the other existing models with an average PSNR of 31.61 dB and average CT of 0.262s. In future, compression then encryption schemes can be designed to securely transmit the microarray images in the real time environment. Besides, compression then encryption schemes can be designed to securely transmit the medial images.



---

*Source: 7140552-2022-05-25.xml*