Eman Abdelfattah

A Robust and Secure Video Steganography Method in DWT-DCT Domains Based on Multiple Object Tracking and ECC

Over the past few decades, the art of secretly embedding and communicating digital data has gained enormous attention because of the technological development in both digital contents and communication. The imperceptibility, hiding capacity, and robustness against attacks are three main requirements that any video steganography method should take into consideration. In this paper, a robust and secure video steganographic algorithm in discrete wavelet transform (DWT) and discrete cosine transform (DCT) domains based on the multiple object tracking (MOT) algorithm and error correcting codes is proposed. The secret message is preprocessed by applying both Hamming and Bose, Chaudhuri, and Hocquenghem codes for encoding the secret data. First, motion-based MOT algorithm is implemented on host videos to distinguish the regions of interest in the moving objects. Then, the data hiding process is performed by concealing the secret message into the DWT and DCT coefficients of all motion regions in the video depending on foreground masks. Our experimental results illustrate that the suggested algorithm not only improves the embedding capacity and imperceptibility but also enhances its security and robustness by encoding the secret message and withstanding against various attacks.

A genetic algorithm for register allocation

In this paper we introduce a new genetic algorithm for register allocation. A merge operator is used to generate new individual solutions. The number of steps required to examine all pairs in the population matrix to generate n/sup 2/ (n is the population matrix size). Generating an offspring from the parents needs m steps (m number of nodes). The total number of steps required by the algorithm is n/sup 2/m, that is the genetic algorithm has a linear time complexity in terms of number of nodes. The experimental results show optimal solutions in many of the graphs used for testing.

Video steganography techniques: Taxonomy, challenges, and future directions

Nowadays, video steganography has become important in many security applications. The performance of any steganographic method ultimately relies on the imperceptibility, hiding capacity, and robustness. In the past decade, many video steganography methods have been proposed; however, the literature lacks of sufficient survey articles that discuss all techniques. This paper presents a comprehensive study and analysis of numerous cutting edge video steganography methods and their performance evaluations from literature. Both compressed and raw video steganographic methods are surveyed. In the compressed domain, video steganographic techniques are categorized according to the video compression stages as venues for data hiding such as intra frame prediction, inter frame prediction, motion vectors, transformed and quantized coefficients, and entropy coding. On the other hand, raw video steganographic methods are classified into spatial and transform domains. This survey suggests current research directions and recommendations to improve on existing video steganographic techniques.

Quantum sort algorithm based on entanglement qubits {00, 11}

Quantum algorithms have gained a lot of consideration especially for the need of searching unsorted database in a faster way rather than using the classical search mechanisms. This paper introduces a new quantum sort algorithm by employing the quantum features to expedite the searching process in conventional environments. The proposed efficient sorting algorithm emphasizes entanglement qubits property to sort N positive integers.

Quantum min / max algorithms based on qubits {00, 11}

Quantum algorithms have gained a lot of consideration especially for the need to find out the extreme values like minimum or maximum. This paper introduces novel quantum algorithms to figure out the minimum and the maximum numbers among a set of positive integer numbers by employing some of the quantum features such as superposition, entanglement, and probability. The proposed algorithms utilize qubits properties to accelerate the searching process.

Improved monostatic pulse radar design using ultra wide band for range estimation

A mono static pulse radar is a type of radar in which its transmitter and receiver are collocated. It uses the same antenna to transmit and receive echo signals. This paper focusses on the design of monostatic pulse radar using Ultra Wide band. In this design, we use the transmitter which sends a pulse that hits the target and the receiver receives the echo signal where it can estimate the targets range. A monostatic radar can track a target from 3 to 5 km without any false alarm. The challenge in this paper is to increase the detection range from 4 km to 8 km and enhance the probability of detection using 10 GHz frequency band. It operates in the range of Ultra-Wide Band (UWB) Spectrum of 10 GHz frequency. Also, it is required to minimize the probability of false alarm which is to be in the order of 10−6. The design is simulated using the MATLAB tool. The simulation results show that the range estimation is increased by at least 200 % maintaining a constant probability of false alarm.