1. Introduction

Steganography is a Greek word which means “Protected Writing”. It is an art and science of secret communication. It is the process during which secret information is embedded inside a carrier object (e.g. image, text, audio, and video) such that it cannot be detected by human visual system (HVS) [1-4]. The purpose of steganography is to hide secret data into a host media, protecting it from unauthorized persons. The main goals of steganography include high payload, improved robustness, and better imperceptibility. Payload shows the amount of data to be embedded in the cover image which is calculated in bits per pixel (bpp) such that the greater the bpp, the high the payload is and vice versa. Robustness shows the level of difficulty faced by attackers during extraction of secret data which protects it from grabbers' attacks. Imperceptibility means undetectability which is measured using different image quality assessment metrics (IQAMs) such as peak signal-to-noise ratio (PSNR)[5] and structural similarity index metric (SSIM)[6]. For instance, small obvious distortion between host and stego images results in higher PSNR score and hence represents high quality of stego images and vice versa[7].

Requirements of steganography include a carrier object (cover/host media), secret data, embedding algorithm, and sometimes a stego key and encryption algorithm to increase the security levels[1]. Applications of steganography involve the exchange of top secret information between government departments and defence organizations, medical imaging security, online banking security, smart identity card security, online voting security, and tamper proofing. In negative sense, it can be used for sending viruses and Trojan horses and provides a better method to be used by terrorists and criminals for their confidential communication as well[3, 8].

The steganographic techniques are categorized into two categories: (a). Spatial domain techniques directly modify the grey-levels of cover image for hiding secret data. These techniques possess high payload and result in high quality stego images. However, these techniques are not enough robust against image processing operations (cropping, scaling, rotations, and noise attacks) and statistical attacks (RS-analysis, chi-square attack) [9]. Spatial domain techniques include least significant bit (LSB) substitution method[10], pixel indicator technique (PIT)[11], edges based embedding (EBE) techniques [7], and pixel value differencing (PVD) techniques[12, 13]. (b). Transform domain techniques alter the image pixels via different transforms such as DWT[14], DFT[15], integer contour transform[16], and DCT[17] in order to hide secret information. These techniques are mostly used in watermarking systems and applications due to its better robustness against statistical steganalysis. On the other hand, these approaches have lower payload and result in stego images of low quality as compared to spatial domain approaches[3].

In this paper, we propose an efficient image steganographic approach based on GLM and MLE. Image has been used as a host object due to its low communication cost and availability of large number of redundant bits. The main contributions of this paper are: (i).Both the secret data and stego key is encrypted using MLEA which adds multiple security levels to the proposed method. (ii). The proposed method is evaluated quantitatively by six different IQAMs including PSNR, SSIM, mean absolute error (MAE), mean consequential error (MCE), root mean-square-error (RMSE), and normalized mean error (NME). (iii).To deceive the attacker, image is transposed prior to embedding secret information. (iv). Qualitatively, this new approach is evaluated by both naked eye analysis and histogram changeability analysis using HVS. (v).The proposed scheme is experimentally tested by three different types of viewpoints: Embedding secret data of same size in different standard color images of same resolution, hiding cipher of different sizes in same images of same dimensions, and embedding cipher of equal sizes in same images of variable resolutions. Furthermore, the proposed method is compared with five classical and state-of-the-art methods.

The rest of the paper is structured as follows. Section 2 presents an overview of classical and latest steganographic approaches whose limitations led us towards current proposed work. In section 3, we present our proposed algorithm along with mathematical and graphical modelling. Section 4 presents experimental results and critical discussion and finally the work is concluded in section 5.

2. Related Work

The first attempt of steganography was taken by Greeks with the famous story of shaved head. Since that time, different methods have been used for information hiding such as tablets with wax, carrier pigeons, microdots, invisible inks, semagrams, and open codes[2, 3, 18, 19]. In this modern era, the most simple and classical method to hide secret data in an image is to replace the LSB of carrier image pixels with secret data. Suppose A is a cover 8-bit image with n pixels such that A=A0A1…An-1 where Ai is a pixel of A for i=0, 1, 2….n-1. Assume S is a secret message such that S=S0, S1….Sn-1 with Si a k-bit string of message S for i=0, 1….n-1. To hide a secret bit Si in the host image pixel Ai, the pixel Ai is divided into two parts; LSBi and MSBi such that Ai=MSBi || LSBi and LSBi is replaced by Si for i=0, 1….n-1. The stego image generated by this simple LSB method is B with pixels B=B0, B1….Bn-1 such that Bi is a pixel of B with i=0, 1….n-1. Payload capacity can be increased if more than 1 LSBs are used for message embedding but it brings noticeable changes in the stego image. This means that there is a trade-off between payload and visual quality of stego images.

F.A Jassim [20] proposed a secure method whose fundamental idea is based on the fact that adjacent pixels in images are strongly correlated with each other. In FMM scheme, the image is divided into a number of blocks, each of which contains k×k pixels where k shows the window size and each pixel represents a number in the range 0-255 divisible by 5 for 8-bit images. The proposed ST-FMM method is better in robustness and achieves good quality of stego images. However, there is a trade-off between the payload and window size such that increasing the window size decreases the payload and vice versa.

Bailey and Curran [21] proposed stego color cycle (SCC) method for color images that hides data in different channels of the cover image in a cyclic manner. i.e., the first secret bit is hidden in pixel1's red channel, the second secret bit is hidden in the green channel of pixel2 and the third secret bit is hidden in the blue channel of pixel3, and so on. The major limitation in SCC method is that the secret information is embedded in cover image pixels in a fixed cyclic and systematic way. So an attacker can easily discover this technique if secret information from a few pixels is successfully extracted.

Karim et.al [22] presented a new approach to enhance the security of existing LSB substitution method by adding one extra barrier of secret key. In the said method, secret key and red channel are used as an indicator while green and blue channels are data channels. On the basis of secret key bits and red channel LSBs, the secret data bits are embedded either in green channel or in blue channel. If either the bit of red channel LSB or secret key bit is 1, then the LSB of green channel is replaced with secret message bit, otherwise LSB of blue channel is replaced with secret bit. Although, this approach possesses the same payload as LSB based approaches but it increases the security by making use of secret key. An intruder cannot easily extract the secret information without the correct secret key.

Gutub proposed a high payload pixel indicator technique (PIT)[11] in which one channel is used as an indicator and the other two channels are data channels. The proposed method embeds the secret data in one or both of the data channels in a predefined cyclic manner. The experimental results show the high payload capacity and better imperceptibility of the proposed algorithm and also avoid the key exchange overhead. The major weak point of this method is that the payload capacity is totally dependent on host image and indicator bits which can results in low payload. Similarly this method hides fixed number of bits in each pixel which can bring more changes in the cover image if we embed more number of secret bits in each pixel. The major limitation in the proposed methods discussed so far is that the secret information can be extracted easily if an attacker finds out the algorithm being used for message hiding because secret data is in plain text form and not encrypted. Moreover, these methods result in stego images of low quality which can be detected using HVS.

In this paper, we propose a new method to handle these limitations by using GLM and MLE. The secret information is encrypted using MLEA before mapping it to the pixels of host image so that if an attacker finds out the algorithm being used, still the actual secret contents cannot be retrieved. A malicious user has to crack down the following barriers in order to retrieve the original secret data: (i).The color steganographic algorithm being used for data hiding. (ii).The secret key being used in encryption. (iii).The MLEA via which data is encrypted before embedding. (iv). Have the idea that image has been transposed before message hiding.

3. The Proposed Image Steganographic Algorithm

This section demonstrates the proposed algorithm, its embedding and extraction processes, and MLEA. The proposed steganographic scheme consists of three phases: encryption, data mapping and, extraction phase as shown in Fig. 1. These three phases are integrated with each other in order to develop an advanced steganographic system, having multiple security levels.

Fig. 1.Detailed pictorial representation of the proposed scheme

3.1 Mathematical Modeling of Proposed Scheme

Suppose M denotes the secret message that is to be embedded into the carrier image (C). T shows the transposed image, K is secret key and S is the stego image. Three functions named as α, β, and γ are used in the whole process of embedding as shown in equations 1-3.

The first function α takes C as an input and returns T which is the transposed image. M' is the resultant encrypted message returned by second function β after applying MLEA on message M using secret key K. Finally, the third function γ generates the stego image S after hiding the encrypted message M' in the transposed image T using the proposed steganographic scheme.

The recipient has to apply the reverse operations in order to extract the original hidden information. The following three functions are used for extracting the actual message as described in equations 4-6.

In extraction process, function α−1 applies transposition on stego image S and returns T which is the resultant transposed image. Using eq. 5, the encrypted secret message M' is extracted from the image T by applying the extraction algorithm. At the end, original message M is achieved by using eq. 6 when encrypted message M' is decrypted by function β−1 using secret key K.

3.2 Encryption Phase

The encryption phase encrypts the secret information using MLEA, increasing the security and robustness of the proposed method which is its main motivational factor. The MLEA consists of the following three different operations.

The end result of this phase is encrypted secret data in bits form. The main steps of encryption phase are flowcharted in Fig. 2.

Fig. 2.Flowchart for multi-level encryption algorithm

To illustrate the MLEA, we present a simple example. Consider the secret message M=“A” with bits stream S= [01000001] and secret key with bit stream K= [01010010]. Apply the bitxor operations i.e. ES=bitxor (01000001, 11111111) = 10111110 and EK=bitxor (01010010, 11111111) = 10101101. Applying the bits shuffling algorithm on ES and EK we get SS=shufflebits (ES) = shufflebits (10111110) = 01111101 and SK=shufflebits (EK) = shufflebits (10101101) = 01011110. Finally we apply the secret key based encryption on shuffled bit stream (SS) using shuffled key bit stream (SK). It works as follows: If a bit in the key stream is 1, then we perform bitxor (shuffled message bit, logical 1) otherwise leave the message bit unchanged. As a result of this procedure, the final bits we get are: S' = 00100011 which is far most different than the original bits i.e. S=01000001.

In order to decrypt this message (S' = 00100011), we have to apply the reverse operations. i.e., the secret key (K=01010010) is first encrypted using the above procedure and we get EK= 01011110. Now apply the reverse of secret key based encryption by the same way as discussed above. i.e., if secret key bit is 1, then apply bitxor (bit of S', logical 1) otherwise leave it unchanged. So the intermediate result we get is DS' = 01111101. After applying the inverse of bits shuffling algorithm we get SS' = 10111110 and finally bitxor operation is applied i.e., DM = bitxor (SS', logical 1's) = bitxor (10111110, 11111111) = 01000001 which is the binary equivalent of secret character “A”.

3.3 Data Mapping Phase

This phase maps the encrypted data into the carrier image pixels. Before data mapping, the carrier image is transposed, data is encrypted via MLEA, and then a 1-1 mapping between secret data bits and image pixels is maintained. The end result is a stego image of higher quality, containing secret information which is the main reason of its usage. This phase is illustrated by flowchart in Fig. 3.

Fig. 3.Flowchart for embedding algorithm

For example, I represent an image containing eight pixels P= [P1, P2, P3… P8] with values P= [90, 36, 18, 27, 10, 25, 40, 63] and the secret message is (S=01000001). We embed the encrypted message (S' = 00100011) of encryption phase in these pixels. Since the first bit of S' is 0, so all the pixels are converted to even numbers by adding 1 to those pixels which are not even and we get the pixel values [90, 36, 18, 28, 10, 26, 40, 64]. After applying the flowchart operations on the resultant pixels, we get P'= [P1', P2', P3'… P8'] = [90, 36, 19, 28, 10, 26, 41 and 63]. The pixels shown in bold face are changed as a result of embedding which means approximately half of the pixels change only.

3.4 Extraction Phase

The extraction phase extracts the embedded secret bits from the stego image that is being sent by sender. The extracted bits are decrypted by applying the reverse operations of MLEA and then converted into its original form. By this way, the original secret message is achieved based on which we can take further necessary actions. The major steps of this phase are depicted by flowchart in Fig. 4.

Fig. 4.Flowchart for extraction algorithm

For illustration of extraction process consider the pixels above P'= [P1', P2', P3'… P8'] = [90, 36, 19, 28, 10, 26, 41 and 63]. In extraction process, we divide each pixel of blue channel into two parts i.e. LSBi and MSBi. we then store these LSBs into an array and get the encrypted secret bits i.e. LSB(P1')=LSB(90)=0, LSB(P2')=LSB(36)=0, LSB(P3')=LSB(19)=1, LSB(P4')=LSB(28)=0, LSB(P5')=LSB(10)=0, LSB(P6')=LSB(26)=0, LSB(P7')=LSB(41)=1, LSB(P8')=LSB(63)=1. By combining these LSBs, we get the bits stream E=00100011 which is same as S'=00100011 (Given in data mapping phase’s example). The bits stream (E) is then decrypted using the reverse operations of MLEA and original secret message is achieved.

4. Experimental Results and Analysis

The proposed technique, classical LSB technique, five modulus method (FMM) [20], stego color cycle (SCC) technique [21], pixel indicator technique (PIT) [11], and Karim's technique [22] are simulated using MATLAB R2014a. A number of different experiments were conducted in order to fully assess the effectiveness of the proposed scheme. The following sub-sections present a complete detailed study of experimental results and critical discussion.

4.1 Dataset

This sub-section describes the dataset of images that was used for experimental purposes. A dataset of 50 standard color images taken from database “The USC-SIPI Image Database Volume 3: Miscellaneous“ and internet was used for comparative analysis of proposed method with other state-of-the-art methods. The dataset contains different edgy and smooth standard color images of different dimensions (128×128, 256×256, 512×512 and 1024×1024) including Lena, mandrill (baboon), peppers, trees, and house.

4.2 Quantitative Evaluation

This sub-section demonstrates the complete procedure of quantitative analysis that is used in this paper. All the mentioned techniques are coded using MATLAB R2014a and are tested by three different viewpoints: Using viewpoint1, a text file of 8KB is embedded in different edgy and smooth color images having dimension 256×256 pixels. This process is applied on 50 images and its average PSNR value is calculated. The second viewpoint is about encoding text files of different sizes in the same images of uniform dimension (256×256). This type of experiment is applied on four standard color images. In viewpoint3, four color images with different resolutions (128×128, 256×256, 512×512 and 1024×1024) were used. The size of cipher in this type of experiment is same as viewpoint1 i.e. 8KB. The detailed experimental results of these three viewpoints and their datasets are shown in sub-section 4.2.2.

4.3 Image Quality Assessment Metrics

In this sub-section, we highlight different IQAMs that were used for comparison of existing five prominent data hiding schemes with the proposed scheme. Full-reference image-quality assessment method has been used in this paper in which the original cover images and distorted images are completely available to be compared with one another. Full-reference IQAMs include PSNR, SSIM, and MAE which are discussed one by one below and performance of all mentioned techniques is evaluated with them.

A. PSNR and MSE

PSNR is the ratio between the modified image and original cover image. It is used for calculating the observable deformation that occurs in stego images after intentionally embedding secret data. The PSNR is calculated in terms of decibels (dB). The higher the value of PSNR, the more the stego image is correlated with original cover image and vice versa[5]. Stego images with PSNR less than 30dB represent low quality. PSNR must strive for 40dB or higher values in order to fulfil the favourable demands of modern steganographic systems [23].

The mean-square-error (MSE) calculates the error between cover image and distorted stego image. When C(x, y) = S(x, y), then MSE=0 and PSNR= ∞ i.e. both the images are identical[23]. The PSNR and MSE are calculated by equation (7) and equation (8).

Note that M and N show image dimensions, x and y are loop counters, C is cover image, S is stego image, and Cmax is the maximum pixel intensity among both images.

B. Structural Similarity Index Metric (SSIM)

The full-reference IQAM (SSIM) is used to determine the quality of a stego image (Y) w.r.t original image (X). It was proposed by Wang [6]. It is calculated by taking the product of its three main components (luminance, contrast, and structural component) raised by an exponent, when required. Its value will be 1.0 if both the cover and stego images are indistinguishable. Generally, the SSIM between two images X and Y is defined as follows in (9):

Herein, α, β, and γ are parameters that represent the comparative consequence of its three components. By setting α= β = γ = 1, we get the SSIM index as mentioned in (10).

Herein, μx, μy, σx, σy, and σxy are termed as local statistical parameters. C1, C2, and C3 are small constants that handle the division by zero exception[24].

C. Mean Absolute Error (MAE) and Mean Consequential Error (MCE)

MAE is the average of the absolute value of each individual error that exists between the original and distorted image. This is the more preferable method to use when the amount by which numerical predictions are in error, is too much important[24]. MAE and MCE are calculated by equation 11 and equation 12.

D. Root Mean Square Error (RMSE)

RMSE is the square root of the average of the square of all errors that occurs between original and modified image[25]. Its usage is very common because it provides a better generic objective analysis error metric used in numerical predictions. RMSE amplifies and rigorously punishes large amount of errors as compared to MAE[24]. RMSE is calculated by equation (13).

4.3.1 Quantitative Results and Discussion

In this sub-section, we present the comparison of the proposed method with other five existing methods including classical LSB method, FMM[20], SCC[21], PIT[11], and Karim's method[22]. A few sample images from the datasets used for quantitative experiments are shown in Fig. 5-7. The incurred results of all mentioned algorithms based on PSNR, SSIM, NME, MCE, RMSE, and MAE from three different viewpoints are listed in Table 1-9 respectively.

Fig. 5.Viewpoint1 dataset: cover images; (a) Lena (b) Baboon (c) F16jet (d) Peppers; Stego images; (e) Lena (f) Baboon (g) F16jet (h) Peppers

Fig. 6.Dataset of stego images for viewpoint2; (a), (b), (c), (d); Baboon images with 2KB, 4KB, 6KB, and 8KB of hidden text respectively. (e), (f), (g), (h); Lena images. (i), (j), (k), (l); Building images (m), (n), (o), (p); House images with 2KB, 4KB, 6KB, and 8KB of hidden text respectively

Fig. 7.Images dataset for viewpoint3 containing stego images of different dimensions with their corresponding PSNR values. Row1: Lena images; Row2: pepper images; Row3: house images; Row4: building images

Table 1.Viewpoint1 Results; Comparison of the proposed method with existing five methods based on PSNR (dB) by hiding same amount of cipher (8KB) in different images of same resolution (256×256 pixels)

Table 2.Viewpoint1 Results; Comparison of the proposed method with other five methods based on SSIM

Table 3.Viewpoint1 Results; Comparison of the proposed method with other five methods based on RMSE

Table 4.Viewpoint1 Results; Comparison of the proposed method with other five methods based on MAE

Table 5.Viewpoint1 Results; Comparison of the proposed method with other five methods based on NME

Table 6.Viewpoint1 Results; Comparison of the proposed method with existing five methods based on MCE

Table 7.Viewpoint2 results; Comparison of the proposed scheme with other 5 algorithms based on PSNR

Table 8.Viewpoint2 results; Comparison of the proposed scheme with other five algorithms based on SSIM

Table 9.Viewpoint3 results; comparison of the proposed method with other five methods based on PSNR

Tables 1-6 show the experimental results of the proposed scheme and other five schemes based on PSNR, SSIM, RMSE, MAE, NME, and MCE respectively for viewpoint1. According to viewpoint1, equal size of text (8KB) is encoded in different diverse images of same resolution (256×256). The anticipated scheme clearly dominates the existing five schemes by attaining highest values of all mentioned metrics. The last line of Table 1-6 shows the average value of PSNR, SSIM, RMSE, MAE, NME, and MCE respectively computed over fifty images (50). The average results demonstrated at the last row of Table 1-6 clearly shows the excellence of the proposed scheme as compared to other five mentioned approaches.

The experimental results of all mentioned algorithms including the proposed approach using viewpoint2 are listed in Table 7 and Table 8. In this type of experiment, four well-known standard color images of dimension (256×256) are selected and different size of text is embedded inside it using all specified methods. These four images are chosen for this type of analysis because every new algorithm has to be evaluated by images of different natures (edgy and smooth). For example, the four images contain the smooth image (Lena) and an edgy image (Baboon). The average values of PSNR and SSIM shown in bold face in Table 7 and Table 8 respectively are larger than existing approaches. This distinction illustrates that the proposed approach out-performs in terms of PSNR and SSIM as compared to other five data hiding approaches in viewpoint2.

Table 9 illustrates the experimental results of all mentioned approaches using viewpoint3. In this type of experiment, a text file of 8KB is embedded in four selected color images of different resolutions (128×128, 256×256, 512×512 and 1024×1024 pixels). The incurred results are tabulated in Table 9. By analysing the results in Table 9, it can be confirmed that the proposed scheme provide promising results in terms of PSNR in contrast to several existing classical and prominent (five) schemes.

4.4 Qualitative Analysis

In this sub-section, we briefly illustrate the qualitative analysis that has been used in this paper. The visual quality of stego images produced by the proposed method and other mentioned state-of-the-art methods are evaluated based on HVS and histogram changeability. A sample of cover and stego images taken from the dataset and their histograms are shown in Fig. 8. All these images contain 8KB text except the image with label (a). Using naked eye analysis of stego images, it can be confirmed that there is noticeable distortion in the stego images generated by existing methods except FMM (slightly distorted) and the proposed scheme. The distortion can be noted by comparing the black areas (black writing and black dress of man) of cover and stego images in Fig. 8. On the other hand, the stego image with label (m) generated by our proposed algorithm is almost same to the given cover image with label (a) and there is no obvious distortion between these two images. Furthermore, the histogram of stego image for our proposed scheme and cover image is almost same while the histograms of stego images generated by other methods are slightly modified. These points clearly show the excellence of the proposed method in contrast to existing five prominent methods.

Fig. 8.Qualitative analysis of all discussed schemes using HVS based on quality of stego images with dimension (256×256) and their histograms

4.5 Performance Evaluation

The performance of any newly designed method is evaluated using three metrics named as payload, imperceptibility, and robustness[7]. An algorithm is considered to be best if it has high payload, better imperceptibility and robustness. But there is always a trade-off between these three factors. Bit per pixel (bpp) is used to indicate the payload of a given method which is 1bpp for all mentioned algorithms except FMM and PIT. FMM is window size dependent algorithm which can lead towards lower payload even less than 1bpp and hence cannot be used in payload-demanding security applications. PIT method has high payload capacity among other competing methods but it is time consuming and cannot be used in real-time security applications, requiring fast processing. SCC disperses the secret data in red, green, and blue channels to improve security but still data can be easily extracted if some pixels are compromised as the data hiding pattern is fixed and data is in plain form. Karim's technique makes use of secret key during embedding process, increasing the security as compared to PIT, FMM, LSB, and SCC but compromising the key will enable the attacker to extract the actual data as data is not encrypted.

The robustness of all mentioned schemes including the proposed scheme is evaluated based on a dataset of 50 standard color images. A color secret image of dimension (64×64 pixels) is embedded in different cover images of dimension (512×512 pixels) and the resultant stego images are attacked based on salt & pepper noise with noise density D=0.05. The embedded secret image is then extracted from the noisy stego images and its quality is evaluated using PSNR. This process is repeated for 50 images using the proposed method and other five state-of-the-art methods. The incurred results for robustness evaluation are listed in Table 10.

Table 10.Robustness evaluation using PSNR based on “salt & pepper” noise with noise density (D=0.05)

Table 10 shows the quality of secret image extracted from noisy stego images based on PSNR. The PSNR score of classic LSB method is higher than all mentioned methods but it has the lowest security. The proposed scheme clearly dominates the other competing methods and provides good results in terms of robustness and imperceptibility. The proposed technique increases the robustness by encrypting the secret key as well as secret data using MLE which consist of BITXOR operation, bits shuffling procedure and secret key-based encryption. Furthermore, the usage of transposition adds an additional level of security and can deceive the attacker. These steps create multiple barriers in the way of an attacker and hence increase the robustness of proposed scheme which can be confirmed from Table 10. In addition to this, the proposed method results in stego images whose quality is much more better than the existing five methods and hence cannot be easily detected using HVS. These properties conclude that the proposed technique out-performs the existing methods in terms of robustness, security and imperceptibility.

4.6 Advantages and limitations of the proposed method

The proposed scheme provides a robust, efficient and time saving way to hide secret information inside the cover image. The main advantages of the proposed scheme are improved quality of stego images, high imperceptibility, cost-effectiveness, and enhanced robustness. Moreover, the utilization of MLE and image transposition add multiple security levels to the said technique. The major shortcoming of this method is its vulnerability to different attacks (cropping, scaling and noise attacks) which exist in all spatial domain techniques including the existing five schemes. Since spatial domain is used in the proposed approach, the hidden data cannot be fully recovered if image is compressed, scaled or attacked with noises as discussed in section 4.4.

5. Conclusion and Future Directions

A new faster and efficient color image steganographic method has been proposed to map secret data to the grey-levels of the carrier image using MLE and GLM without causing any noticeable distortion with high imperceptibility and security. An acceptable average PSNR score above 50dB is achieved using the proposed method which shows the high quality of stego images. The payload capacity of all mentioned algorithms is same i.e. 1bpp (bits per pixel) except FMM and PIT. The capacity of FMM is dependent on the window size but its running time is near to our proposed scheme. The PIT method is the most time consuming algorithm however it has payload capacity much more than existing five methods. By experimental results, we conclude that our proposed scheme provide better security, imperceptibility and robustness and require short processing time as compared to existing five schemes.

In future work, the authors plan to increase the payload of the proposed scheme by taking into consideration the relationship between nearby pixels i.e. edge and smooth area's pixels. In addition, MLEA will be further improved to make it more secure.