Ankur Goyal

Work place: Department of Computer Engineering, AIT, Chandigarh University, Mohali, Punjab, India



Research Interests: Data Structures and Algorithms, Image Processing, Image Manipulation, Image Compression, Computational Science and Engineering


Dr. Ankur Goyal is working as Associate Professor at Chandigarh University, Mohali, Punjab. His professional activities have been focused in Blockchain Technologies, Data Science and Image Processing.

Author Articles
Image Watermarking in Frequency Domain using Hu's Invariant Moments and Firefly Algorithm

By Sachin Sharma Shikha Choudhary Vijay Kumar Sharma Ankur Goyal Meena Malik Balihar

DOI:, Pub. Date: 8 Apr. 2022

Preventing the digital content from being copied, manipulated and illegal ownership claims is one of the biggest challenges that appeared with the widespread usage of computing facilities. Watermarking is one way to tag a digital document with a watermark, perceptible or imperceptible, so as to later prove the ownership or authenticity of the document, in case the need arises. Robust and Fragile watermarking is used in case of proving ownership and authenticity, respectively. This paper proposes a watermarking approach based on Discrete Wavelet Transform (DWT), Hessenberg Decomposition (HD) and Singular Value Decomposition (SVD) approach, augmented with Firefly Algorithm (FA). To make the approach blind, the proposed technique uses Hu’s invariant moments which are invariant against rotation, scaling and translation (RST) attack over the image. In the resulting watermarked image, the watermark is imperceptible, which make it suitable for a large class of watermarking applications. In the proposed approach, a given colour image is subjected to 2 Level DWT for decomposing into sub-bands, namely LL, LH, HL and HH bands. These coefficients of HH band are fed as input for HD. The output is operated for SVD for obtain U, S and V matrices. The Hu’s invariant moments are scaled and mapped to binary string using logarithm scaling. The binary matrix, corresponding to binary watermark, is XoRed with the invariant moments, in a repeated manner, to obtain a new binary matrix, of the same dimension as count of 2X2 partitions of S. The watermark is embedded by changing the orthogonal V matrices. The magnitude of the change is computed with Firefly algorithm considering the robustness and imperceptibility as the trade-off parameters. The firefly algorithm is one of the nature inspired optimization algorithm. The proposed watermarking approach is capable of withstanding JPEG compression attack, filtering attacks and noise. PSNR and SSIM are used as the quality metric for accessing the watermarked image quality. It turns out that the proposed watermarking technique gives a considerable improvement over robustness and imperceptibility as compared to the benchmark approaches. The performance of the proposed approach as compared to the benchmark approach, increases in linear manner with the dimension of the image under consideration, reaching from 1 percent to 4 percent for image dimensions ranging from 400X400 to 1200X1200 pixels.

[...] Read more.
Information Hiding Using Least Significant Bit Steganography and Cryptography

By Shailender Gupta Ankur Goyal Bharat Bhushan

DOI:, Pub. Date: 8 Jun. 2012

Steganalysis is the art of detecting the message's existence and blockading the covert communication. Various steganography techniques have been proposed in literature. The Least Significant Bit (LSB) steganography is one such technique in which least significant bit of the image is replaced with data bit. As this method is vulnerable to steganalysis so as to make it more secure we encrypt the raw data before embedding it in the image. Though the encryption process increases the time complexity, but at the same time provides higher security also. This paper uses two popular techniques Rivest, Shamir, Adleman (RSA) algorithm and Diffie Hellman algorithm to encrypt the data. The result shows that the use of encryption in Steganalysis does not affect the time complexity if Diffie Hellman algorithm is used in stead of RSA algorithm.

[...] Read more.
Other Articles