Color image steganography in YCbCr space

Steganography is a best method for in secret communicating information during the transference of data. Images are an appropriate method that used in steganography can be used to protection the simple bits and pieces. Several systems, this one as color scale images steganography and grayscale images steganography, are used on color and store data in different techniques. These color images can have very big amounts of secret data, by using three main color modules. The different color modules, such as HSV-(hue, saturation, and value), RGB-(red, green, and blue), YCbCr-(luminance and chrominance), YUV, YIQ, etc. This paper uses unusual module to hide data: an adaptive procedure that can increase security ranks when hiding a top secret binary image in a RGB color image, which we implement the steganography in the YCbCr module space. We performed Exclusive-OR (XOR) procedures between the binary image and the RGB color image in the YCBCR module space. The converted byte stored in the 8-bit LSB is not the actual bytes; relatively, it is obtained by translation to another module space and applies the XOR procedure. This technique is practical to different groups of images. Moreover, we see that the adaptive technique ensures good results as the peak signal to noise ratio (PSNR) and stands for mean square error (MSE) are good. When the technique is compared with our previous works and other existing techniques, it is shown to be the best in both error and message capability. This technique is easy to model and simple to use and provides perfect security with unauthorized.

ON A FUNCTION MODULE WITH APPROXIMATE HYPERPLANE SERIES PROPERTY

We present a sufficient and necessary condition for a function module space $X$ to have the approximate hyperplane series property (AHSP). As a consequence, we have that the space ${\mathcal{C}}_{0}(L,E)$ of bounded and continuous $E$-valued mappings defined on the locally compact Hausdorff space $L$ has AHSP if and only if $E$ has AHSP.

ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS

In [16], the author introduced a new pseudo-metric on the space Matm×s(Zq) which is the module space of all m × s matrices with entries from the finite ring Zq generalizing the classical Lee metric (see [17]) and the array RT- metric (see [19]) and named this pseudo-metric as the Generalized-Lee-RT-Pseudo-Metric (or the GLRTP-Metric). In this paper, we obtain some lower bounds for two dimensional array codes correcting burst errors (see [10]) with weight constraints under the GLRTP-metric.