| dc.description.abstract | Three main problems related to image steganography still remain: the
imperceptibility of the stego image, the mmimum capacity of the hidden dqta, and the
robustsness of the stego image against o number of image processing such as
compression, noise, and contrast. To increase the mmimum capacity of the hidden
data,while lreeping the imperceptibility and the robustness of the stego image, this
research has therefore tried to investigate RGB (Red Green Blue) cover images with
threshold values of 0.3 and 0.5. This research has also tried to hide data iniside one,
two, or three components of colors (red, green, blue). The data has been hidden
within the area of approximation coefficients (LL) obtained from the Integer Wavelet
Transform @fD mechanism. The hiding process of data has been accomplished
through replacing the bit of image with the bit of data in the complexity areo, also
lonwn as noise-like area Such area can be located using the Bit-Plane Complexity
Segmentation (BPCS) method. The research has found out that when the
steganograplry uses a threshold value of 0.5 and the RGB image has a number of
noise-lilre areas, it can in crease the maximum capacity of the hidden data, while
holding the imperceptibility of the image. At the same time it can increase the
robustness of the stego image against above mentioned image processing. In
addttion, this research reveals that to increase the imperceptibility of the stego
image, the data does not need to be hidden in oll noise-like aress. It means that the
data can be distributed in three components or two components color. | en_US |
