Recently, digital communication has become a critical necessity and so the Internet has become the most used medium and most efficient for digital communication. At the same time, data transmitted through the Internet are becoming more vulnerable. Therefore, the issue of maintaining secrecy of data is very important, especially if the data is personal or confidential. Steganography has provided a reliable method for solving such problems. Steganography is an effective technique in secret communication in digital worlds where data sharing and transfer is increasing through the Internet, emails and other ways. The main challenges of steganography methods are the undetectability and the imperceptibility of confidential data. This paper presents a steganography method in frequency domain. Haar Wavelet Transform is applied for decomposition of gray level cover image into four sub-bands. The secret image is hidden in the high frequency HH sub-band after applying the histogram modification followed by scrambling process. A Histogram modification is adopted, to scale the secret image to normalize its values, that manipulates the secret image from bright image to dark. Thus the secret image becomes invisible so it can be hidden in the high frequency sub-band. Scrambling the positions can be for rows then columns, which will give strong security of the hiding process. The experimental results demonstrate the proposed method has achieved superior performance in terms of quantifiable measurement (PSNR and correlation) and in terms of visual quality. The proposed method propositions good imperceptible results and good response for against the various image attacks.
An image retrieval system is a computer system for browsing, looking and recovering pictures from a huge database of advanced pictures. The objective of Content-Based Image Retrieval (CBIR) methods is essentially to extract, from large (image) databases, a specified number of images similar in visual and semantic content to a so-called query image. The researchers were developing a new mechanism to retrieval systems which is mainly based on two procedures. The first procedure relies on extract the statistical feature of both original, traditional image by using the histogram and statistical characteristics (mean, standard deviation). The second procedure relies on the T-
... Show MoreIn this paper, we introduce a new complex integral transform namely ”Complex Sadik Transform”. The
properties of this transformation are investigated. This complex integral transformation is used to reduce
the core problem to a simple algebraic equation. The answer to this primary problem can than be obtained
by solving this algebraic equation and applying the inverse of complex Sadik transformation. Finally,
the complex Sadik integral transformation is applied and used to find the solution of linear higher order
ordinary differential equations. As well as, we present and discuss, some important real life problems
such as: pharmacokinetics problem ,nuclear physics problem and Beams Probem
The digital image with the wavelet tools is increasing nowadays with MATLAB library, by using this method based on invariant moments which are a set of seven moments can be derived from the second and third moments , which can be calculated after converting the image from colored map to gray scale , rescale the image to (512 * 512 ) pixel , dividing the image in to four equal pieces (256 * 256 ) for each piece , then for gray scale image ( 512 * 512 ) and the four pieces (256 * 256 ) calculate wavelet with moment and invariant moment, then store the result with the author ,owner for this image to build data base for the original image to decide the authority of these images by u
... Show MoreThe basic solution to overcome difficult issues related to huge size of digital images is to recruited image compression techniques to reduce images size for efficient storage and fast transmission. In this paper, a new scheme of pixel base technique is proposed for grayscale image compression that implicitly utilize hybrid techniques of spatial modelling base technique of minimum residual along with transformed technique of Discrete Wavelet Transform (DWT) that also impels mixed between lossless and lossy techniques to ensure highly performance in terms of compression ratio and quality. The proposed technique has been applied on a set of standard test images and the results obtained are significantly encourage compared with Joint P
... Show MoreImage compression is a serious issue in computer storage and transmission, that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless com
... Show MoreImage compression plays an important role in reducing the size and storage of data while increasing the speed of its transmission through the Internet significantly. Image compression is an important research topic for several decades and recently, with the great successes achieved by deep learning in many areas of image processing, especially image compression, and its use is increasing Gradually in the field of image compression. The deep learning neural network has also achieved great success in the field of processing and compressing various images of different sizes. In this paper, we present a structure for image compression based on the use of a Convolutional AutoEncoder (CAE) for deep learning, inspired by the diversity of human eye
... Show MoreIn this paper, we have employed a computation of three technique to reduce the computational complexity and bit rate for compressed image. These techniques are bit plane coding based on two absolute values, vector quantization VQ technique using Cache codebook and Weber's low condition. The experimental results show that the proposed techniques achieve reduce the storage size of bit plane and low computational complexity.