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.
With time progress importance of hiding information become more and more and all steganography applications is like computer games between hiding and extracting data, or like thieves and police men always thieve hides from police men in different ways to keep him out of prison. The sender always hides information in new way in order not to be understood by the attackers and only the authorized receiver can open the hiding message. This paper explores our proposed random method in detail, how chooses locations of pixel in randomly , how to choose a random bit to hide information in the chosen pixel, how it different from other approaches, how applying information hiding criteria on the proposed project, and attempts to test out in code, and
... Show MoreIn this work, watershed transform method was implemented to detect and extract tumors and abnormalities in MRI brain skull stripped images. An adaptive technique has been proposed to improve the performance of this method.Watershed transform algorithm based on clustering techniques: K-Means and FCM were implemented to reduce the oversegmentation problem. The K-Means and FCM clustered images were utilized as input images to the watershed algorithm as well as of the original image. The relative surface area of the extracted tumor region was calculated for each application. The results showed that watershed trnsform algorithm succeedeed to detect and extract the brain tumor regions very well according to the consult of a specialist doctor a
... Show MoreGray-Scale Image Brightness/Contrast Enhancement with Multi-Model
Histogram linear Contrast Stretching (MMHLCS) method
The need for a flexible and cost effective biometric security system is the inspired of this paper. Face recognition is a good contactless biometric and it is suitable and applicable for Wireless Sensor Network (WSN). Image processing and image communication is a challenges task in WSN due to the heavy processing and communication that reduce the life time of the network. This paper proposed a face recognition algorithm on WSN depending on the principles of the unique algorithm that hold the capacity of the network to the sink node and compress the communication data to 89.5%. An efficient hybrid method is introduced based upon the advantage of Zak transform to offprint the farthest different features of the face and Eigen face method to
... Show MoreIn this research work, a modified DCT descriptor are presented to mosaics the satellite images based on Abdul Kareem [1] similarity criterion are presented, new method which is proposed to speed up the mosaics process is presented. The results of applying the modified DCT descriptor are compared with the mosaics method using RMSE similarity criterion which prove that the modified DCT descriptor to be fast and accurate mosaics method.
Storing and transferring the images data are raised in recent years due to requisiteness of transmission bandwidth for considerable storage capacity. Data compression method is proposed and applied in an attempt to convert data files into smaller files. The proposed and applied method is based on the Wavelet Difference Reduction (WDR) as considered the most efficient image coding method in recent years. Compression are done for three different Wavelet based Image techniques using WDR process. These techniques are implemented with different types of wavelet codecs. These are Daub2+2,2 Integer Wavelet transform, Daub5/3 integer to integer wavelet transform, and Daub9/7 Wavelet transform with level four. The used mu
... Show MoreVarious document types play an influential role in a lot of our lives activities today; hence preserving their integrity is an important matter. Such documents have various forms, including texts, videos, sounds, and images. The latter types' authentication will be our concern here in this paper. Images can be handled spatially by doing the proper modification directly on their pixel values or spectrally through conducting some adjustments to some of the addressed coefficients. Due to spectral (frequency) domain flexibility in handling data, the domain coefficients are utilized for the watermark embedding purpose. The integer wavelet transform (IWT), which is a wavelet transform based on the lifting scheme,
... Show MoreIn this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform
The messages are ancient method to exchange information between peoples. It had many ways to send it with some security.
Encryption and steganography was oldest ways to message security, but there are still many problems in key generation, key distribution, suitable cover image and others. In this paper we present proposed algorithm to exchange security message without any encryption, or image as cover to hidden. Our proposed algorithm depends on two copies of the same collection images set (CIS), one in sender side and other in receiver side which always exchange message between them.
To send any message text the sender converts message to ASCII c
... Show MoreRecently, the internet has made the users able to transmit the digital media in the easiest manner. In spite of this facility of the internet, this may lead to several threats that are concerned with confidentiality of transferred media contents such as media authentication and integrity verification. For these reasons, data hiding methods and cryptography are used to protect the contents of digital media. In this paper, an enhanced method of image steganography combined with visual cryptography has been proposed. A secret logo (binary image) of size (128x128) is encrypted by applying (2 out 2 share) visual cryptography on it to generate two secret share. During the embedding process, a cover red, green, and blue (RGB) image of size (512
... Show More