A robust reversible data hiding scheme for color image using reed-solomon code

Abstract

This article encompasses an effective scheme regarding reversible data hiding methodology that is achieved as an objective when Reed-Solomon (RS) codes are employed on a color image. Insertion of two additional pixels is done within the block of 5 pixels through linear interpolation with a view to carry the remainder of encoding polynomial e(x) when divided by generating polynomial ψ(x). The task of data embedding is done within the additional two pixels after the aforesaid color image is partitioned into R, G, B components. The secret data bits are positioned through error creation adjusting with the last three bits(LSB) of each pixel of the block to ensure almost exact quality of the image. The said hidden data can be extricated successfully by the intended receiver without any distortion whereas reconstruction of original cover image can be done. Indeed, better results in terms of quality is experienced after having compared the proposed methodology with similar schemes in vogue. Finally some standard steganographic analysis is employed to test the robustness of the obtained stego image. The intended outcome brought into limelight some remarkable sublime characteristics in the field of image authentication, tamper detection and digital forgery detection without which the technological life is stunted. Innumerable government and private sector facet including health care, commercial security, defence, intellectual property rights gets immensely benefited from this scheme.