z-logo
open-access-imgOpen Access
Performance Analysis of Image Processing in Hexagonal Grid Based on Image Compression, Denoising and Steganography
Author(s) -
Jeevan K. M,
Pankaj Kumar,
Anne Gowda A B,
S. Krishnakumar
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1006.1291s619
Subject(s) - hexagonal tiling , artificial intelligence , thresholding , grid , peak signal to noise ratio , image processing , image compression , wavelet , computer science , computer vision , pattern recognition (psychology) , hexagonal crystal system , wavelet transform , noise reduction , mathematics , algorithm , image (mathematics) , geometry , crystallography , chemistry
This paper gives a summary of different works we had performed in hexagonal grid for the performance analysis of image processing in hexagonal grid. Processing based on hexagonal grid is a new approach in image processing because of its various advantages. This paper covers image compression and image denoising in hexagonal grid. Image compression using wavelet transform is performed in hexagonal grid. The performance of compression in hexagonal grid and conventional rectangular grid are analyzed in terms of Mean Square Error (MSE) and Peak Signal to Noise Ratio (PSNR). It is observed that better PSNR is obtained in the case of hexagonal grid. Wavelet thresholding based method is done for image denoising in hexagonal grid. The thresholding method is named as ‘Jeevkrish’ method, which is the modification of NeighShrinkthresholding method. The performance is analyzed using MSE, PSNR and Structural Similarity (SSIM) Index. An algorithm (‘JK’ algorithm) for generating a pseudo hexagonal structure image and a method for image hiding using the pseudo hexagonal image as the cover image are also discussed in this paper

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here