Two Stages of Algebraic Matrix Decomposition in Optimal Image Steganographic Approach

With the evolution of social networks, the necessitate of providing information security methods becomes increasingly significant. Therefore, these methods should be studied and analyzed for presenting more secure and appropriate techniques. Since the images represent the most common and widely utilized visual formats, an optimized approach of image steganography based on algebraic matrix decomposition has been proposed in this paper. In particular, matrix decomposition methods represent a significant tool for increasing the security of the whole blent of digital steganographic approaches. In this paper, two stages of the Hessenberg matrix decomposition are implemented on the original image using modulo operation to show the impact of the matrix decomposition in the steganographic process. Additionally, a Chameleon Swarm optimization (CSO) algorithm is utilized to appoint the optimal positions in the embedding stage. The obtained results have been evaluated to show the difference between the utilization of decomposition or not.