Steganographic techniques with varying degrees of embedding capacity, perceptual transparency, and security are presented. These techniques have been developed to protect privileged or confidential information restricted to public access and to replace cryptography methods. In this study, three embedding algorithms, namely, least significant bit insertion, bit-plane complexity segmentation, and enhanced version of pixel value difference (EPVD) were implemented and analyzed in terms of the main steganography issues (payload, invisibility, and security) using a different proper performance metrics. This study was motivated by the minimal research focus accorded to hiding data in compression domain for the class of video-based embedding methods. Therefore, analyzing steganographic algorithms is generally based on hiding information in the quantized AC-Coefficients of the frames during the MPEG-2 compression process. Simulation results reveal that EPVD provides better embedded payload and acceptable visual quality, but lower PSNR value.

Most data-hiding techniques have already been investigated in detail as regards image files in both

the spatial and frequency domains. However, they are currently the subject of several investigations in

the video domain. In recent years, among many proposed steganographic methods in the spatial

domain, pixel-value differencing (PVD) provides both high embedding capacity and viable

imperceptibility for images compared with other techniques, such as least significant bit (LSB) method.

It utilizes the remainder of two consecutive pixels in embedding secret data, and the number of

embedded bits is based on the amount of difference. The large amount of difference indicates that more

secret bits can be embedded. However, based on extensive experiments, using such technique to embed

secret data in the frequency domain creates a massive negative effect on hosted data, even resulting in

low embedding capacity, which will lead to undesired distortion in the host file. In this paper, some

modifications to the PVD method are proposed that make it capable of embedding secret information

in macro-blocks of both I-frames and P-frames for MPEG-2 video during compression. The

modifications applied to PVD reduce the distortion drift caused by reversible data hiding within

selected macro-block coefficients. Furthermore, this research devises an adaptive method that can

achieve a more secure scheme for embedding data based on encrypting the host macro-block

coefficients before the hiding process using a secret encrypted key. Based on the simulation results

obtained in this proposed approach, the proposed scheme successfully improves the perceived quality

and achieves much better security compared with PVD-based method while still retaining the

advantage of hiding a large amount of information.

The aim was to build an educational website to teach preschoolers aged 2-5 years old some skills; related to reading, writing and pronouncing alphabet, numbers, animal names, shapes and other common words. Also, assist parents and teachers by providing digital game-based learning environment to “edutainment” the children. The study illustrated the usability and usefulness of this educational game-based website and provided future insights for researchers and developers to take into account in future work.

one of the challenges recently occurred in the concept of hiding data is the

robustness of hiding data in the way that is difficult to access or detect. Most of the steganography

schemes are based commonly on embed data within images or video frames on their original form

(uncompressed domain).

This paper presents a new methodology for data hiding in MPEG-2 video standard. Data will be

embedding during the compression stage of the AVI-MPEG2 encoding. The BPCS algorithm has

been modified and used in all our experiments for embed data, and the DES (Data Encryption

Standard) algorithm has been used to encrypt data before hiding. It only embeds encrypted data

bits in the quantized AC coefficients (low-frequency AC coefficients) of Y components (Luminance)

for the I-Frame. The obtained results demonstrate that the proposed method has the considerable

advantage over previous steganography schemes with a good PSNR values for the embedded

With the development of the internet and multimedia technology digital video encryption has attracted a great deal of

research interest in the recent few years in applications. In this paper, we propose a method to encrypt video data. The proposed

algorithm is based on the MPEG video coding standard. It selectively encrypts some DCT coefficients in the I frame, B frame and P

frame in MPEG video compression by using chaotic systems. The key in this paper is chaotic sequence based on logistic mapping. It

can produce the pseudo-random sequences with good randomness. The experimental results based on chaotic maps prove the

effectiveness of the proposed method, showing advantages of large key space and high-level security. The proposed algorithm was

measured through a series of tests and achieved good results. The results indicate that the algorithm can be implemented for video

encryption efficiently and it provides considerable levels of security

Digital video steganography has attracted a great deal of research interest in the recent few years in applications. In this paper, we propose a method to embed and encrypt messages into video sequences by using steganography technique Based on the H.264 video coding standard. The system implemented in this work provides robust H.264 video compression constant, without significantly affecting the overall bit rate and quality of the video stream. The results indicate that the algorithm can be implemented steganography fast and efficiently and effect vision and peak signal to noise ratio (PSNR) of video sequences are almost unaffected after decoding.

Steganography is the idea of embedding a secret data in different media and has become an important regulation of methods of data integration. Although the still images are generally applied in the past, is very popular in recent years for the video. The techniques of video data hiding in recent year’s emphasis on the features generated by the video compression standard, a safer method for steganography uses MPEG-4/H.264 Bit Plane Complexity Segmentation (BPCS) algorithm is proposed in this approach. The reason for choosing such a video coverage is the enormous amount of data that can be hidden in each frame of MPEG-4 video. In other words, MPEG-4 has three types of images: I-frame, B, and P frames. Unlike other techniques used to hide data, such as the LSB algorithm, PBCS can achieve better results in both mathematics expression and human vision. In this paper, data is embedded in the videos of the I-frame until the BPCS can reach high levels of integration with low distortion based on the theory that regions of low noise-levels as in a picture can be replaced by noise without a significant loss of image quality. This approach invents data hidden in high-security environments. Experimental results show the success of hidden data in the selected and extracted data from the sequence of frames and also indicate the effectiveness of the implementation plan of steganography compressed video with high security features.

Information Communication Technologies (ICTs) provide an opportunity to meet the growing needs of rural areas. Many of the key features of ICT can be used to provide information and the requirements of people in rural areas. The digital divide considered is an important problem that countries face and it is much more complex than simply building out telecommunication networks and infrastructure. The divide is the result of a wide range of social factors, including but not limited to economy factors, education, literacy. Telecommunication infrastructure alone will not guarantee that users will be able to access and take advantage of services on the network. The paper begins with an introduction to the digital divide, and thus to highlight several successful initiatives provided by educational institutions and governmental organizations in Libya in the adoption of ICT. Finally, the paper provides some of the solutions proposed to reduce this divide.

The use of computers for handling image data in the healthcare is growing The amount of data produced by modem image generating techniques, such as Computed Tomography (CT) and Magnetic Resonance (MR), is vast. The amount of data might be a problem from a storage point of view or when the data is sent over a network. To overcome these problems data compression techniques adapted to these applications are needed Many classes of images contain some spatial regions which are more important than other regions. Compression methods which are capable of achieving higher reconstruction quality of important parts of the image have been implemented For medical images, only a small portion of the image might be diagnostically useful but the cost of wrong interpretation is high. Algorithms which deliver lossless compression within the regions of interest (ROJ), and lossy compression elsewhere in the image, might be the key to providing efficient and accurate image coding to the medical community. In this thesis both of compression techniques (lossy and lossless) of medical images using the JPEG algorithm (DCT), will be discussed.