This document discusses a proposed method for document image authentication using harmonic secret sharing and permutation. The method generates shares from a document image using Shamir's secret sharing scheme and embeds the shares in the alpha channel plane of a PNG image. During authentication, the shares extracted from the alpha channel are used to verify blocks of the document image. If a block is tampered, the method can repair it using reverse Shamir on collected shares from untampered blocks. The method aims to authenticate documents, verify owners, detect and correct errors, and localize alterations with secret sharing and permutation for security.
IRJET- Encryption and Authentication of Image by using Data HidingIRJET Journal
The document discusses a proposed system for encrypting and authenticating images using data hiding. At the sender side, a palette image is encrypted using an encryption key. Data is then hidden in the encrypted image using a data hiding key. At the receiver side, the image is decrypted and the original image can be reconstructed after extracting the hidden data. The system aims to securely transfer images from sender to receiver while protecting the owner's privacy and allowing accurate recovery of the original image content. Several existing reversible data hiding and encrypted image techniques are reviewed and the proposed system is described as providing satisfactory data hiding capacity while maintaining high image quality after decryption.
In this paper steganography is used to hide the data inside the images. Steganography is the science that involves
communicating secret data in an appropriate multimedia carrier, e.g., image, audio, and video files. The main goal of
steganography is to ensure that the transmitted message is completely masked, thereby ensuring that the message is accessible
only to the intended receiver and not to any intruders or unauthorized parties. This work focuses on the image steganography with
an image compression using least significant bit with Discrete Wavelet Transform (DWT) on FPGA Spartan III Evaluation
Development Kit (EDK). Current trends support digital image files as the cover file to hide another digital file with secret
message or data. At receiver side, using Inverse Discrete Wavelet transform, both original image as well as hidden data can be
successfully extracted.
Cecimg an ste cryptographic approach for data security in imageijctet
The document presents a new algorithm called CECIMG (Canny edge encryption image steganography) for securing data in images. It combines Blowfish encryption with embedding encrypted data in the edge pixels of an image detected using Canny edge detection. The algorithm is implemented in Java and experiments show it provides better security and higher PSNR values than existing LSB steganography techniques. It securely stores encrypted data in images in a series of steps and allows retrieval of the original data. The algorithm aims to maximize security compared to traditional approaches.
A robust combination of dwt and chaotic function for image watermarkingijctet
This document summarizes a research paper on a robust image watermarking technique that combines discrete wavelet transform (DWT) and a chaotic function. The proposed method embeds a watermark into selected blocks of the low-frequency DWT subband of an image. It calculates the Euclidean distance between blocks of the watermark and image to select the most similar block for embedding. Experimental results on standard test images show the proposed method achieves better performance than previous methods in terms of PSNR and structural similarity under compression attacks. The extraction accuracy remains high even with noise attacks, though it degrades more under filtering attacks.
A digital watermarking scheme based on integer wavelet transform and histogram techniques is
proposed in this paper. Lifting scheme based integer wavelet transform is used to provide ease of
transformation of compressed data and to increase the data embedding capacity. Also histogram technique
which is one of the reversible data hiding is used to embed the secret data into original image and retrieve the
original data back after extraction. The AES encryption is used to encrypt the embedded image to provide
authentication. This algorithm is developed using verilog code and implemented on FPGA Artix 7 board in
order to increase throughput, reduce area and power consumption.
BLIND EXTRACTION OF DIGITAL WATERMARKING ALGORITHM FOR COLOR IMAGESijma
Digital watermark technology hides copyright information in digital images, effectively protecting the
copyright of digital images. At present, the color image digital watermarking algorithm still has defects
such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the
above problems, this paper studies the digital watermarking method based on discrete wavelet transform
and discrete cosine transform. Then this paper proposes a color image blind digital watermarking
algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y
component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and
perform the discrete cosine transform. finally, use the embedding method to convert the watermark
information after the Arnold transform embedded in the block. The experimental results show that the
PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being
attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm
has good robustness and can achieve watermarking blind extraction.
This document discusses a proposed method for document image authentication using harmonic secret sharing and permutation. The method generates shares from a document image using Shamir's secret sharing scheme and embeds the shares in the alpha channel plane of a PNG image. During authentication, the shares extracted from the alpha channel are used to verify blocks of the document image. If a block is tampered, the method can repair it using reverse Shamir on collected shares from untampered blocks. The method aims to authenticate documents, verify owners, detect and correct errors, and localize alterations with secret sharing and permutation for security.
IRJET- Encryption and Authentication of Image by using Data HidingIRJET Journal
The document discusses a proposed system for encrypting and authenticating images using data hiding. At the sender side, a palette image is encrypted using an encryption key. Data is then hidden in the encrypted image using a data hiding key. At the receiver side, the image is decrypted and the original image can be reconstructed after extracting the hidden data. The system aims to securely transfer images from sender to receiver while protecting the owner's privacy and allowing accurate recovery of the original image content. Several existing reversible data hiding and encrypted image techniques are reviewed and the proposed system is described as providing satisfactory data hiding capacity while maintaining high image quality after decryption.
In this paper steganography is used to hide the data inside the images. Steganography is the science that involves
communicating secret data in an appropriate multimedia carrier, e.g., image, audio, and video files. The main goal of
steganography is to ensure that the transmitted message is completely masked, thereby ensuring that the message is accessible
only to the intended receiver and not to any intruders or unauthorized parties. This work focuses on the image steganography with
an image compression using least significant bit with Discrete Wavelet Transform (DWT) on FPGA Spartan III Evaluation
Development Kit (EDK). Current trends support digital image files as the cover file to hide another digital file with secret
message or data. At receiver side, using Inverse Discrete Wavelet transform, both original image as well as hidden data can be
successfully extracted.
Cecimg an ste cryptographic approach for data security in imageijctet
The document presents a new algorithm called CECIMG (Canny edge encryption image steganography) for securing data in images. It combines Blowfish encryption with embedding encrypted data in the edge pixels of an image detected using Canny edge detection. The algorithm is implemented in Java and experiments show it provides better security and higher PSNR values than existing LSB steganography techniques. It securely stores encrypted data in images in a series of steps and allows retrieval of the original data. The algorithm aims to maximize security compared to traditional approaches.
A robust combination of dwt and chaotic function for image watermarkingijctet
This document summarizes a research paper on a robust image watermarking technique that combines discrete wavelet transform (DWT) and a chaotic function. The proposed method embeds a watermark into selected blocks of the low-frequency DWT subband of an image. It calculates the Euclidean distance between blocks of the watermark and image to select the most similar block for embedding. Experimental results on standard test images show the proposed method achieves better performance than previous methods in terms of PSNR and structural similarity under compression attacks. The extraction accuracy remains high even with noise attacks, though it degrades more under filtering attacks.
A digital watermarking scheme based on integer wavelet transform and histogram techniques is
proposed in this paper. Lifting scheme based integer wavelet transform is used to provide ease of
transformation of compressed data and to increase the data embedding capacity. Also histogram technique
which is one of the reversible data hiding is used to embed the secret data into original image and retrieve the
original data back after extraction. The AES encryption is used to encrypt the embedded image to provide
authentication. This algorithm is developed using verilog code and implemented on FPGA Artix 7 board in
order to increase throughput, reduce area and power consumption.
BLIND EXTRACTION OF DIGITAL WATERMARKING ALGORITHM FOR COLOR IMAGESijma
Digital watermark technology hides copyright information in digital images, effectively protecting the
copyright of digital images. At present, the color image digital watermarking algorithm still has defects
such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the
above problems, this paper studies the digital watermarking method based on discrete wavelet transform
and discrete cosine transform. Then this paper proposes a color image blind digital watermarking
algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y
component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and
perform the discrete cosine transform. finally, use the embedding method to convert the watermark
information after the Arnold transform embedded in the block. The experimental results show that the
PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being
attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm
has good robustness and can achieve watermarking blind extraction.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
A Secure Color Image Steganography in Transform Domain ijcisjournal
Steganography is the art and science of covert communication. The secret information can be concealed in content such as image, audio, or video. This paper provides a novel image steganography technique to hide both image and key in color cover image using Discrete Wavelet Transform (DWT) and Integer Wavelet Transform (IWT). There is no visual difference between the stego image and the cover image. The extracted image is also similar to the secret image. This is proved by the high PSNR (Peak Signal to Noise Ratio), value for both stego and extracted secret image. The results are compared with the results of similar techniques and it is found that the proposed technique is simple and gives better PSNR values than others.
IRJET-Comparative Analysis of DCT and DWT based novel methods for WatermarkingIRJET Journal
This document presents a comparative analysis of DCT and DWT based watermarking techniques. It proposes algorithms for embedding and extracting watermarks in the DCT and DWT domains. The DWT method embeds the watermark in the low-low frequency region and is shown to be more robust to attacks like noise addition and region tampering compared to the DCT method. Results demonstrate that DWT provides better imperceptibility and fidelity than DCT, especially at lower embedding strengths. However, robustness decreases with lower strengths. An embedding strength of 10 is identified as a good balance for all parameters. In conclusion, DWT is found to be a better technique than DCT for digital image watermarking applications.
Significant Data Hiding through Discrete Wavelet Transformation ApproachEswar Publications
The methods of communication of invisible information have become need in the today’s digital era. The network connectivity and high speed devices made easy passing massive data instantly. As boom of the huge data transmission has taken place due to easy use of the technology, the protection of the data has become prime issue. Steganography hides messages inside some other digital media. Cryptography, on the other hand obscures the content of the message. We proposed a novel integration of an incorporating text and image steganography to find a solution for improve security and protect data. The proposed methods shows a high level of efficiency and robustness by combining text and image which involves the scheme of discrete wavelet transformation combining text and image by secretly embeds encrypted secrete message text data (cipher text) or text image in the content of a digital image. A comparative study of the different techniques has been illustrated by computing Mean square error (MSE) and Peak Signal to Noise Ratio (PSNR).
Region Based Undectable Multiple Image WatermarkingShalu Singh
The document proposes a region-based multiple image watermarking technique. It divides an image into two regions - Region A and Region B. A watermark is inserted into Region A using LSB insertion and into Region B by applying DWT, DFT, and inserting two watermarks into frequency coefficients. The watermarks can be extracted from the two regions using the reverse process. The technique aims to make watermarks more secure and undetectable by inserting them into different image regions and domains.
A Robust Image Watermarking Technique using Luminance Based Area Selection an...IRJET Journal
This summarizes a document describing a robust image watermarking technique using luminance-based area selection and block pixel value differencing (PVD). It embeds watermarks in selected blocks of an image based on the difference between pixel values. Blocks are selected based on their log-average luminance being close to the overall image luminance. Within blocks, pixel pairs with the highest differences are used to embed bits by modifying the difference values. The technique aims to improve embedding capacity and imperceptibility while maintaining image quality as measured by PSNR and MSE metrics. It shows robustness against various attacks.
A Novel Technique for Image Steganography Based on DWT and Huffman EncodingCSCJournals
This document presents a novel image steganography technique based on discrete wavelet transform (DWT) and Huffman encoding. The technique embeds a secret image into a cover image in the frequency domain after applying DWT. It first Huffman encodes the secret image, then embeds the encoded bits in the high frequency DWT coefficients of the cover image. Experimental results show the technique achieves a high embedding capacity while maintaining a good peak signal-to-noise ratio between the cover and stego images, providing both invisibility and security as the secret image cannot be extracted without the Huffman table. Compared to an existing DWT-based method, the proposed technique provides better image quality for the same embedding capacity.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IRJET-Security Based Data Transfer and Privacy Storage through Watermark Dete...IRJET Journal
Gowtham.T ,Pradeep Kumar.G " Security Based Data Transfer and Privacy Storage through Watermark Detection ", International Research Journal of Engineering and Technology (IRJET), Volume2,issue-01 April 2015.e-ISSN:2395-0056, p-ISSN:2395-0072. www.irjet.net .published by Fast Track Publications
Abstract
Digital watermarking has been proposed as a technology to ensure copyright protection by embedding an imperceptible, yet detectable signal in visual multimedia content such as images or video. In every field key aspect is the security Privacy is a critical issue when the data owners outsource data storage or processing to a third party computing service. Several attempts has been made for increasing the security related works and avoidance of data loss. Existing system had attain its solution up to its level where it can be further able to attain the parameter refinement. In this paper improvising factor been made on the successive compressive sensing reconstruction part and Peak Signal-to-Noise Ratio (PSNR).Another consideration factor is to increase (CS) rate through de-emphasize the effect of predictive variables that become uncorrelated with the measurement data which eliminates the need of (CS) reconstruction.
DIGITAL IMAGE WATERMARKING OF COMPRESSED IMAGE USING JPEG 2000 AND ENCRYPTION...ijiert bestjournal
The necessity for copyright protection,ownership v erification,and other issues for digital data are getting more and more value these days. For the rap id revolution in digital multimedia and the ease of creating similar and unauthorized data,the digital data can be copied or manipulated or distributed. So it is necessary to watermark the media content for tamper proofing or quality assessment or copy control. In this paper we propose a JPEG2000 compre ssion. The compression standard is chosen such that it provides higher compression ratio and the c ompressed byte stream are randomized by the encryption algorithm. In our paper watermarking was done in the compressed � encrypted domain. We use different watermarking techniques for this. Att empting to watermark such a randomized bit stream can cause a dramatic degradation of the media quali ty. Thus it is necessary to choose an encryption scheme that is both secure and will allow watermark ing in a predictable manner in the compressed encrypted domain. The projected method is a robust watermarking algorithm to watermark JPEG2000 compressed and encrypted images (grayscale) of size 512�512. The encryption algorithm in this paper uses stream cipher. While the estimated technique e mbeds watermark in the compressed-encrypted domain,and the extraction of watermark can be done in the encrypted domain. The proposed algorithm also conserves the confidentiality of data as the e mbedding process can be done on encrypted data.
Colored Image Watermarking Technique Based on HVS using HSV Color ModelIDES Editor
The Human Visual System is found to be less
sensitive to the highly textured area of the image. Moreover,
in all colours the blue is least sensitive to the HVS (Human
Visual System). While working on colored images when using
the mathematical and biological models of HVS, the preferred
colour model must be HSV (Hue, Saturation and Value) colour
model rather than RGB colour model because it most closely
defines how the image is interpreted by HVS. The high visual
transparency in the technique is achieved by making use of
highly textured block in luminance channel for watermark
insertion. Moreover, the choice of selecting appropriate area
for watermark insertion is also influenced by making use of
‘Hue’ property of the image in the chrominance channel to
enhance the visual transparency even more. Watermark is
made highly robust against different types of attacks by
performing the watermark insertion in transformed domain
and making use of the transformation functions such as DWT,
DCT and SVD. The results demonstrated the robustness of
the technique against various types of attacks and comparison
through aforesaid results the technique is proven to be more
robust against previous techniques making use of HSI colour
model.
A Hybrid Approach for Ensuring Security in Data Communication cscpconf
For a very long time, various forms of steganographic and cryptographic techniques have been used to ensure security in data communication. Whereas steganography is the art of hiding the fact that any communication is taking place, cryptography on the other hand ensures data security by changing the very form of the data being communicated by using a symmetric or an asymmetric key. But, both the methods are susceptible to being weakened by a challenger. In
steganography, there is always a possibility of detection of the presence of a message by the opponent and most of the cryptographic techniques are vulnerable to disclosure of the key. This paper proposes a hybrid approach where in image steganography and cryptography are combined to protect the sensitive data thereby ensuring improved security in data
communication. To find the impact of the same, a simulator was designed in MATLAB and corresponding time complexities were recorded. The simulation results depict that this hybrid
technique although increases the time complexity but ensures an enhanced security in data communication.
A DWT, DCT AND SVD BASED WATERMARKING TECHNIQUE TO PROTECT THE IMAGE PIRACYijmpict
With the rapid development of information technology and multimedia, the use of digital data is increasing
day by day. So it becomes very essential to protect multimedia information from piracy and also it is
challenging. A great deal of Copyright owners is worried about protecting any kind of illegal repetition of
their information. Hence, facing all these kinds of problems development of the techniques is very
important. Digital watermarking considered as a solution to prevent the multimedia data.
In this paper, an idea of watermarking is proposed and implemented. In proposed watermarking method,
the original image is rearranged using zigzag sequence and DWT is applied on rearranged image. Then
DCT and SVD are applied on all high bands LH, HL and HH. Watermark is then embedded by modifying
the singular values of these bands. Extraction of watermark is performed by the inversion of watermark
embedding process. For choosing of these three bands it gives facility of mid-band and pure high band that
ensures good imperceptibility and more robustness against different kinds of attacks.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Nowadays, digital watermarking has many
applications such as broadcast monitoring, owner identification,
proof of ownership, transaction tracking. Embedding a hidden
stream of bits in a file is called Digital Watermarking. This paper
introduces a LSB information hiding algorithm which can lift the
wavelet transform image. LSB based Steganography embeds the
hiding text message in least significant bit of the pixels. The
proposed method has good invisibility, robustness for a lot of
hidden attacks. As we think about the capacity lead us to think
about improved approach which can be achieved through
hardware implementation system by using Field Programmable
Gate Array (FPGA). In this paper hardware implementation of
digital watermarking system is proposed. MATLAB is used to
convert images into pixel-format files and to observe simulation
results. To implement this paper XPS & VB are needed. In XPS,
first select hardware & software components then by adding
source and header files & converting into bit streams and
download into FPGA, to obtain Stego image.
A novel hash based least significant bit (2 3-3) image steganography in spati...ijsptm
The document presents a novel hash-based 2-3-3 least significant bit (LSB) image steganography technique for embedding secret images in the spatial domain of color cover images. The technique embeds 8 bits of secret image data at a time in the LSBs of color image pixels in a 2-3-3 pattern across the red, green, and blue channels. Experimental results show the proposed 2-3-3 technique improves mean squared error and peak signal-to-noise ratio values compared to the base 3-3-2 LSB insertion technique. The proposed technique provides better imperceptibility of the stego image and higher embedding capacity than previous hash-based LSB methods.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
DIGITAL WATERMARKING TECHNIQUE BASED ON MULTI-RESOLUTION CURVELET TRANSFORMijfcstjournal
In this paper an efficient & robust non-blind watermarking technique based on multi-resolution geometric analysis named curvelet transform is proposed. Curvelet transform represent edges along curve much more efficiently than the wavelet transform and other traditional transforms. The proposed algorithm of embedding watermark in different scales in curvelet domain is implemented and the results are compared
using proper metric. The visual quality of watermarked image, efficiency of data hiding and the quality of extracted watermark of curvelet domain embedding techniques with wavelet Domain at different number of decomposition levels are compared. Experimental results show that embedding in curvelet domain yields best visual quality in watermarked image, the quality of extracted watermark, robustness of the watermark and the data hiding efficiency.
Digital Watermarking Technique Based on Multi-Resolution Curvelet Transform ijfcstjournal
In this paper an efficient & robust non-blind watermarking technique based on multi-resolution geometric
analysis named curvelet transform is proposed. Curvelet transform represent edges along curve much more
efficiently than the wavelet transform and other traditional transforms. The proposed algorithm of
embedding watermark in different scales in curvelet domain is implemented and the results are compared
using proper metric. The visual quality of watermarked image, efficiency of data hiding and the quality of
extracted watermark of curvelet domain embedding techniques with wavelet Domain at different number of
decomposition levels are compared. Experimental results show that embedding in curvelet domain yields
best visual quality in watermarked image, the quality of extracted watermark, robustness of the watermark
and the data hiding efficiency.
Comparative Analysis of DCT and DWT based novel methods for WatermarkingIRJET Journal
This document presents a comparative analysis of DCT and DWT based digital watermarking techniques. It proposes algorithms for embedding and extracting watermarks in the DCT and DWT domains. The DWT technique is shown to be better for watermarking as it is more suited to the human visual system. The analysis finds that DWT provides better imperceptibility and fidelity than DCT, especially at lower embedding factors. However, robustness decreases with lower embedding factors. An optimal embedding factor of 10 is identified as providing a good balance between all evaluation parameters for the watermarking techniques. In conclusion, DWT is determined to be a better overall technique compared to DCT for digital image watermarking applications.
Abstract: The increasing amount of applications using digital multimedia technologies has accentuated the need to provide copyright protection to multimedia data. This paper reviews one of the data hiding techniques - digital image watermarking. Through this paper we will explore some basic concepts of digital image watermarking techniques.Two different methods of digital image watermarking namely spatial domain watermarking and transform domain watermarking are briefly discussed in this paper. Furthermore, two different algorithms for a digital image watermarking have also been discussed. Also the comparision between the different algorithms,tests performed for the robustness and the applications of the digital image watermarking have also been discussed.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
A Secure Color Image Steganography in Transform Domain ijcisjournal
Steganography is the art and science of covert communication. The secret information can be concealed in content such as image, audio, or video. This paper provides a novel image steganography technique to hide both image and key in color cover image using Discrete Wavelet Transform (DWT) and Integer Wavelet Transform (IWT). There is no visual difference between the stego image and the cover image. The extracted image is also similar to the secret image. This is proved by the high PSNR (Peak Signal to Noise Ratio), value for both stego and extracted secret image. The results are compared with the results of similar techniques and it is found that the proposed technique is simple and gives better PSNR values than others.
IRJET-Comparative Analysis of DCT and DWT based novel methods for WatermarkingIRJET Journal
This document presents a comparative analysis of DCT and DWT based watermarking techniques. It proposes algorithms for embedding and extracting watermarks in the DCT and DWT domains. The DWT method embeds the watermark in the low-low frequency region and is shown to be more robust to attacks like noise addition and region tampering compared to the DCT method. Results demonstrate that DWT provides better imperceptibility and fidelity than DCT, especially at lower embedding strengths. However, robustness decreases with lower strengths. An embedding strength of 10 is identified as a good balance for all parameters. In conclusion, DWT is found to be a better technique than DCT for digital image watermarking applications.
Significant Data Hiding through Discrete Wavelet Transformation ApproachEswar Publications
The methods of communication of invisible information have become need in the today’s digital era. The network connectivity and high speed devices made easy passing massive data instantly. As boom of the huge data transmission has taken place due to easy use of the technology, the protection of the data has become prime issue. Steganography hides messages inside some other digital media. Cryptography, on the other hand obscures the content of the message. We proposed a novel integration of an incorporating text and image steganography to find a solution for improve security and protect data. The proposed methods shows a high level of efficiency and robustness by combining text and image which involves the scheme of discrete wavelet transformation combining text and image by secretly embeds encrypted secrete message text data (cipher text) or text image in the content of a digital image. A comparative study of the different techniques has been illustrated by computing Mean square error (MSE) and Peak Signal to Noise Ratio (PSNR).
Region Based Undectable Multiple Image WatermarkingShalu Singh
The document proposes a region-based multiple image watermarking technique. It divides an image into two regions - Region A and Region B. A watermark is inserted into Region A using LSB insertion and into Region B by applying DWT, DFT, and inserting two watermarks into frequency coefficients. The watermarks can be extracted from the two regions using the reverse process. The technique aims to make watermarks more secure and undetectable by inserting them into different image regions and domains.
A Robust Image Watermarking Technique using Luminance Based Area Selection an...IRJET Journal
This summarizes a document describing a robust image watermarking technique using luminance-based area selection and block pixel value differencing (PVD). It embeds watermarks in selected blocks of an image based on the difference between pixel values. Blocks are selected based on their log-average luminance being close to the overall image luminance. Within blocks, pixel pairs with the highest differences are used to embed bits by modifying the difference values. The technique aims to improve embedding capacity and imperceptibility while maintaining image quality as measured by PSNR and MSE metrics. It shows robustness against various attacks.
A Novel Technique for Image Steganography Based on DWT and Huffman EncodingCSCJournals
This document presents a novel image steganography technique based on discrete wavelet transform (DWT) and Huffman encoding. The technique embeds a secret image into a cover image in the frequency domain after applying DWT. It first Huffman encodes the secret image, then embeds the encoded bits in the high frequency DWT coefficients of the cover image. Experimental results show the technique achieves a high embedding capacity while maintaining a good peak signal-to-noise ratio between the cover and stego images, providing both invisibility and security as the secret image cannot be extracted without the Huffman table. Compared to an existing DWT-based method, the proposed technique provides better image quality for the same embedding capacity.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IRJET-Security Based Data Transfer and Privacy Storage through Watermark Dete...IRJET Journal
Gowtham.T ,Pradeep Kumar.G " Security Based Data Transfer and Privacy Storage through Watermark Detection ", International Research Journal of Engineering and Technology (IRJET), Volume2,issue-01 April 2015.e-ISSN:2395-0056, p-ISSN:2395-0072. www.irjet.net .published by Fast Track Publications
Abstract
Digital watermarking has been proposed as a technology to ensure copyright protection by embedding an imperceptible, yet detectable signal in visual multimedia content such as images or video. In every field key aspect is the security Privacy is a critical issue when the data owners outsource data storage or processing to a third party computing service. Several attempts has been made for increasing the security related works and avoidance of data loss. Existing system had attain its solution up to its level where it can be further able to attain the parameter refinement. In this paper improvising factor been made on the successive compressive sensing reconstruction part and Peak Signal-to-Noise Ratio (PSNR).Another consideration factor is to increase (CS) rate through de-emphasize the effect of predictive variables that become uncorrelated with the measurement data which eliminates the need of (CS) reconstruction.
DIGITAL IMAGE WATERMARKING OF COMPRESSED IMAGE USING JPEG 2000 AND ENCRYPTION...ijiert bestjournal
The necessity for copyright protection,ownership v erification,and other issues for digital data are getting more and more value these days. For the rap id revolution in digital multimedia and the ease of creating similar and unauthorized data,the digital data can be copied or manipulated or distributed. So it is necessary to watermark the media content for tamper proofing or quality assessment or copy control. In this paper we propose a JPEG2000 compre ssion. The compression standard is chosen such that it provides higher compression ratio and the c ompressed byte stream are randomized by the encryption algorithm. In our paper watermarking was done in the compressed � encrypted domain. We use different watermarking techniques for this. Att empting to watermark such a randomized bit stream can cause a dramatic degradation of the media quali ty. Thus it is necessary to choose an encryption scheme that is both secure and will allow watermark ing in a predictable manner in the compressed encrypted domain. The projected method is a robust watermarking algorithm to watermark JPEG2000 compressed and encrypted images (grayscale) of size 512�512. The encryption algorithm in this paper uses stream cipher. While the estimated technique e mbeds watermark in the compressed-encrypted domain,and the extraction of watermark can be done in the encrypted domain. The proposed algorithm also conserves the confidentiality of data as the e mbedding process can be done on encrypted data.
Colored Image Watermarking Technique Based on HVS using HSV Color ModelIDES Editor
The Human Visual System is found to be less
sensitive to the highly textured area of the image. Moreover,
in all colours the blue is least sensitive to the HVS (Human
Visual System). While working on colored images when using
the mathematical and biological models of HVS, the preferred
colour model must be HSV (Hue, Saturation and Value) colour
model rather than RGB colour model because it most closely
defines how the image is interpreted by HVS. The high visual
transparency in the technique is achieved by making use of
highly textured block in luminance channel for watermark
insertion. Moreover, the choice of selecting appropriate area
for watermark insertion is also influenced by making use of
‘Hue’ property of the image in the chrominance channel to
enhance the visual transparency even more. Watermark is
made highly robust against different types of attacks by
performing the watermark insertion in transformed domain
and making use of the transformation functions such as DWT,
DCT and SVD. The results demonstrated the robustness of
the technique against various types of attacks and comparison
through aforesaid results the technique is proven to be more
robust against previous techniques making use of HSI colour
model.
A Hybrid Approach for Ensuring Security in Data Communication cscpconf
For a very long time, various forms of steganographic and cryptographic techniques have been used to ensure security in data communication. Whereas steganography is the art of hiding the fact that any communication is taking place, cryptography on the other hand ensures data security by changing the very form of the data being communicated by using a symmetric or an asymmetric key. But, both the methods are susceptible to being weakened by a challenger. In
steganography, there is always a possibility of detection of the presence of a message by the opponent and most of the cryptographic techniques are vulnerable to disclosure of the key. This paper proposes a hybrid approach where in image steganography and cryptography are combined to protect the sensitive data thereby ensuring improved security in data
communication. To find the impact of the same, a simulator was designed in MATLAB and corresponding time complexities were recorded. The simulation results depict that this hybrid
technique although increases the time complexity but ensures an enhanced security in data communication.
A DWT, DCT AND SVD BASED WATERMARKING TECHNIQUE TO PROTECT THE IMAGE PIRACYijmpict
With the rapid development of information technology and multimedia, the use of digital data is increasing
day by day. So it becomes very essential to protect multimedia information from piracy and also it is
challenging. A great deal of Copyright owners is worried about protecting any kind of illegal repetition of
their information. Hence, facing all these kinds of problems development of the techniques is very
important. Digital watermarking considered as a solution to prevent the multimedia data.
In this paper, an idea of watermarking is proposed and implemented. In proposed watermarking method,
the original image is rearranged using zigzag sequence and DWT is applied on rearranged image. Then
DCT and SVD are applied on all high bands LH, HL and HH. Watermark is then embedded by modifying
the singular values of these bands. Extraction of watermark is performed by the inversion of watermark
embedding process. For choosing of these three bands it gives facility of mid-band and pure high band that
ensures good imperceptibility and more robustness against different kinds of attacks.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Nowadays, digital watermarking has many
applications such as broadcast monitoring, owner identification,
proof of ownership, transaction tracking. Embedding a hidden
stream of bits in a file is called Digital Watermarking. This paper
introduces a LSB information hiding algorithm which can lift the
wavelet transform image. LSB based Steganography embeds the
hiding text message in least significant bit of the pixels. The
proposed method has good invisibility, robustness for a lot of
hidden attacks. As we think about the capacity lead us to think
about improved approach which can be achieved through
hardware implementation system by using Field Programmable
Gate Array (FPGA). In this paper hardware implementation of
digital watermarking system is proposed. MATLAB is used to
convert images into pixel-format files and to observe simulation
results. To implement this paper XPS & VB are needed. In XPS,
first select hardware & software components then by adding
source and header files & converting into bit streams and
download into FPGA, to obtain Stego image.
A novel hash based least significant bit (2 3-3) image steganography in spati...ijsptm
The document presents a novel hash-based 2-3-3 least significant bit (LSB) image steganography technique for embedding secret images in the spatial domain of color cover images. The technique embeds 8 bits of secret image data at a time in the LSBs of color image pixels in a 2-3-3 pattern across the red, green, and blue channels. Experimental results show the proposed 2-3-3 technique improves mean squared error and peak signal-to-noise ratio values compared to the base 3-3-2 LSB insertion technique. The proposed technique provides better imperceptibility of the stego image and higher embedding capacity than previous hash-based LSB methods.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
DIGITAL WATERMARKING TECHNIQUE BASED ON MULTI-RESOLUTION CURVELET TRANSFORMijfcstjournal
In this paper an efficient & robust non-blind watermarking technique based on multi-resolution geometric analysis named curvelet transform is proposed. Curvelet transform represent edges along curve much more efficiently than the wavelet transform and other traditional transforms. The proposed algorithm of embedding watermark in different scales in curvelet domain is implemented and the results are compared
using proper metric. The visual quality of watermarked image, efficiency of data hiding and the quality of extracted watermark of curvelet domain embedding techniques with wavelet Domain at different number of decomposition levels are compared. Experimental results show that embedding in curvelet domain yields best visual quality in watermarked image, the quality of extracted watermark, robustness of the watermark and the data hiding efficiency.
Digital Watermarking Technique Based on Multi-Resolution Curvelet Transform ijfcstjournal
In this paper an efficient & robust non-blind watermarking technique based on multi-resolution geometric
analysis named curvelet transform is proposed. Curvelet transform represent edges along curve much more
efficiently than the wavelet transform and other traditional transforms. The proposed algorithm of
embedding watermark in different scales in curvelet domain is implemented and the results are compared
using proper metric. The visual quality of watermarked image, efficiency of data hiding and the quality of
extracted watermark of curvelet domain embedding techniques with wavelet Domain at different number of
decomposition levels are compared. Experimental results show that embedding in curvelet domain yields
best visual quality in watermarked image, the quality of extracted watermark, robustness of the watermark
and the data hiding efficiency.
Comparative Analysis of DCT and DWT based novel methods for WatermarkingIRJET Journal
This document presents a comparative analysis of DCT and DWT based digital watermarking techniques. It proposes algorithms for embedding and extracting watermarks in the DCT and DWT domains. The DWT technique is shown to be better for watermarking as it is more suited to the human visual system. The analysis finds that DWT provides better imperceptibility and fidelity than DCT, especially at lower embedding factors. However, robustness decreases with lower embedding factors. An optimal embedding factor of 10 is identified as providing a good balance between all evaluation parameters for the watermarking techniques. In conclusion, DWT is determined to be a better overall technique compared to DCT for digital image watermarking applications.
Abstract: The increasing amount of applications using digital multimedia technologies has accentuated the need to provide copyright protection to multimedia data. This paper reviews one of the data hiding techniques - digital image watermarking. Through this paper we will explore some basic concepts of digital image watermarking techniques.Two different methods of digital image watermarking namely spatial domain watermarking and transform domain watermarking are briefly discussed in this paper. Furthermore, two different algorithms for a digital image watermarking have also been discussed. Also the comparision between the different algorithms,tests performed for the robustness and the applications of the digital image watermarking have also been discussed.
This document summarizes a research paper on lossless reversible visible watermarking. It begins with an abstract that describes digital watermarking techniques and introduces a new approach for lossless reversible visible watermarking with robust security. It then provides a literature review of previous lossless invisible and visible watermarking techniques. The proposed technique aims to allow legitimate users to remove embedded watermarks and perfectly recover the original image content. Finally, it outlines the system architecture and provides a mathematical model for the watermark generation, embedding, and extraction processes.
This document summarizes a research paper on lossless reversible visible watermarking. It begins with an abstract that describes digital watermarking techniques and introduces a new approach for lossless reversible visible watermarking with robust security. It then provides a literature review of previous lossless invisible and visible watermarking techniques. The proposed technique aims to allow legitimate users to remove embedded watermarks and perfectly recover the original image content. Finally, it outlines the system architecture and provides a mathematical model for the watermark generation, embedding, and extraction processes.
Commutative approach for securing digital mediaijctet
This document summarizes a paper on digital image watermarking techniques. It discusses how digital watermarking can be used to embed hidden information in multimedia data like images, audio, and video to identify ownership and protect against illegal copying. It describes different watermarking techniques including the discrete cosine transform (DCT) and discrete wavelet transform (DWT). The paper analyzes the DCT and DWT techniques, evaluating them using peak signal-to-noise ratio at different threshold values. It finds that the DWT technique provides better image quality than DCT. The document also discusses applications of digital watermarking like ownership assertion, fingerprinting, copy prevention and control, fraud detection, and ID card security.
A Hybrid Model of Watermarking Scheme for Color Image Authentication Using Di...iosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
1) The document proposes a hybrid digital watermarking scheme that uses both discrete wavelet transform (DWT) and singular value decomposition (SVD) for color image authentication.
2) In the proposed scheme, the watermark is embedded in the singular values of the DWT sub-bands of the cover image, rather than directly on the wavelet coefficients. This reduces computational expense compared to other DWT-SVD methods.
3) Experimental results on test images show that the hybrid DWT-SVD scheme provides better imperceptibility and robustness against various attacks compared to using DWT or SVD alone. The recovered watermarks had high quality even after the watermarked images were distorted.
This document summarizes a student project on reversible data hiding techniques. The project compares different reversible watermarking methods and proposes a new technique that embeds a secret bitstream into a color image using bisection and square root interpolation. Experimental results showed the embedded and extracted bitstreams had a correlation of 1, indicating no data loss. Future work could improve the algorithm security by using multiple color planes and transformations for watermarking.
This document presents an algorithm for imperceptibly embedding a DNA-encoded watermark into a color image for authentication purposes. It applies a multi-resolution discrete wavelet transform to decompose the image. The watermark, encoded into DNA nucleotides, is then embedded into the third-level wavelet coefficients through a quantization process. Specifically, the watermark nucleotides are complemented and used to quantize coefficients in the middle frequency band, modifying the coefficients. The watermarked image is reconstructed through inverse wavelet transform. Extraction reverses these steps to recover the watermark without the original image. The algorithm aims to balance imperceptibility and robustness through this wavelet-based, blind watermarking scheme.
Lsb Based Digital Image Watermarking For Gray Scale ImageIOSR Journals
The document describes a technique for watermarking grayscale images using the least significant bit (LSB) method. It begins with an abstract that introduces digital watermarking and LSB watermarking. It then provides more details on the LSB algorithm and how it embeds a watermark by replacing the LSB of selected image pixels. The paper tests the technique on various images, embedding the watermark in different bit positions. It calculates the mean squared error and peak signal-to-noise ratio for the watermarked images. Finally, it applies different noise attacks to the watermarked images and measures the effect on quality.
A New Wavelet based Digital Watermarking Method for Authenticated Mobile SignalsCSCJournals
The mobile network security is becoming more important as the number of data being exchanged on the internet increases. The growing possibilities of modern mobile computing environment are potentially more vulnerable to attacks. As a result, confidentiality and data integrity becomes one of the most important problems facing Mobile IP (MIP). To address these issues, the present paper proposes a new Wavelet based watermarking scheme that hides the mobile signals and messages in the transmission. The proposed method uses the successive even and odd values of a neighborhood to insert the authenticated signals or digital watermark (DW). That is the digital watermark information is not inserted in the adjacent column and row position of a neighborhood. The proposed method resolves the ambiguity between successive even odd gray values using LSB method. This makes the present method as more simple but difficult to break, which is an essential parameter for any mobile signals and messages. To test the efficacy of the proposed DW method, various statistical measures are evaluated, which indicates high robustness, imperceptibility, un-ambiguity, confidentiality and integrity of the present method.
International journal of signal and image processing issues vol 2015 - no 1...sophiabelthome
This document discusses a method for embedding a binary watermark image into a digital video using a hybrid of three transforms: discrete cosine transform (DCT), discrete wavelet transform (DWT), and singular value decomposition (SVD). The method first applies DCT to frames of the video, then applies three-level DWT to the transformed frames. SVD is then applied to both the transformed video frames and the watermark image. The watermark is embedded by modifying coefficients of the video based on the SVD results. PSNR, MSE, and correlation are used to evaluate the quality and robustness of the watermarked video.
This document proposes a new digital watermarking technique that utilizes Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT), Singular Value Decomposition (SVD), and Arnold Transform. It embeds a watermark image into the high frequency subbands of a cover image after applying DWT and SVD. During extraction, the receiver applies the same transforms to extract the watermark. The technique aims to provide improved robustness against various attacks like noise, compression, filtering etc. compared to existing techniques that use these transforms individually or in pairs. The document analyzes the proposed technique's performance based on the extracted watermark's peak signal-to-noise ratio after subjecting the watermarked image to different attacks.
This document proposes a new digital watermarking technique that uses a combination of Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT), Singular Value Decomposition (SVD), and Arnold Transform. It embeds a watermark into the high frequency DWT subbands of an image by modifying the SVD singular values. During extraction, the receiver applies DWT, SVD, and Arnold Transform in reverse order to recover the watermark. The technique aims to provide improved robustness against various attacks like noise, compression, and image processing operations. The document evaluates the proposed technique on standard test images and finds it achieves good imperceptibility and resistance to cropping, rotation, noise, filtering, compression, and
Comparison of SVD & Pseudo Random Sequence based methods of Image Watermarkingijsrd.com
Due to the extensive use of digital media applications, multimedia security and copyright protection has gained tremendous importance. Digital watermarking is a technology used for the copyright protection of digital applications. Image watermarking is used to hide the special information into the image and to later detect and extract that special information. Watermarking can be implemented both in spatial and frequency domain. In this paper frequency domain techniques were experimented. The methods compared in this paper are image watermarking using singular value decomposition (SVD) based and image watermarking using discrete wavelet transform (DWT) and Pseudo random sequence. Our experiments show that former technique have low peak signal to noise ratio (PSNR) value and also requires cover data at the detection where as in the later case we don’t require cover data and PSNR value is good.
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETpaperpublications3
Abstract: The Security is the most important aspect of Database, for maintain the integrity and as well as security of the system image watermarking is technique proposed at the year of 1996, in this paper we also implement image watermarking using 2-D biorthogonal Wavelt. The importance of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is also being discussed in this paper. Then we apply watermarking embedding algorithm to keep the balance between watermarks’ imperceptibility and its robustness while the data is being sent on the communication channel.Keywords: Discrete Wavelet Transform (DWT), Gray Scale, Peak Signal to Noise Ratio (PSNR).
Title: Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Author: Abhinav Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
BLIND EXTRACTION OF DIGITAL WATERMARKING ALGORITHM FOR COLOR IMAGESijma
Digital watermark technology hides copyright information in digital images, effectively protecting the
copyright of digital images. At present, the color image digital watermarking algorithm still has defects
such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the
above problems, this paper studies the digital watermarking method based on discrete wavelet transform
and discrete cosine transform. Then this paper proposes a color image blind digital watermarking
algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y
component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and
perform the discrete cosine transform. finally, use the embedding method to convert the watermark
information after the Arnold transform embedded in the block. The experimental results show that the
PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being
attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm
has good robustness and can achieve watermarking blind extraction.
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
Women with polycystic ovary syndrome (PCOS) have elevated levels of hormones like luteinizing hormone and testosterone, as well as higher levels of insulin and insulin resistance compared to healthy women. They also have increased levels of inflammatory markers like C-reactive protein, interleukin-6, and leptin. This study found these abnormalities in the hormones and inflammatory cytokines of women with PCOS ages 23-40, indicating that hormone imbalances associated with insulin resistance and elevated inflammatory markers may worsen infertility in women with PCOS.
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
This document presents a framework for evaluating the usability of B2C e-commerce websites. It involves user testing methods like usability testing and interviews to identify usability problems in areas like navigation, design, purchasing processes, and customer service. The framework specifies goals for the evaluation, determines which website aspects to evaluate, and identifies target users. It then describes collecting data through user testing and analyzing the results to identify usability problems and suggest improvements.
A universal model for managing the marketing executives in nigerian banksAlexander Decker
This document discusses a study that aimed to synthesize motivation theories into a universal model for managing marketing executives in Nigerian banks. The study was guided by Maslow and McGregor's theories. A sample of 303 marketing executives was used. The results showed that managers will be most effective at motivating marketing executives if they consider individual needs and create challenging but attainable goals. The emerged model suggests managers should provide job satisfaction by tailoring assignments to abilities and monitoring performance with feedback. This addresses confusion faced by Nigerian bank managers in determining effective motivation strategies.
A unique common fixed point theorems in generalized dAlexander Decker
This document presents definitions and properties related to generalized D*-metric spaces and establishes some common fixed point theorems for contractive type mappings in these spaces. It begins by introducing D*-metric spaces and generalized D*-metric spaces, defines concepts like convergence and Cauchy sequences. It presents lemmas showing the uniqueness of limits in these spaces and the equivalence of different definitions of convergence. The goal of the paper is then stated as obtaining a unique common fixed point theorem for generalized D*-metric spaces.
A trends of salmonella and antibiotic resistanceAlexander Decker
This document provides a review of trends in Salmonella and antibiotic resistance. It begins with an introduction to Salmonella as a facultative anaerobe that causes nontyphoidal salmonellosis. The emergence of antimicrobial-resistant Salmonella is then discussed. The document proceeds to cover the historical perspective and classification of Salmonella, definitions of antimicrobials and antibiotic resistance, and mechanisms of antibiotic resistance in Salmonella including modification or destruction of antimicrobial agents, efflux pumps, modification of antibiotic targets, and decreased membrane permeability. Specific resistance mechanisms are discussed for several classes of antimicrobials.
A transformational generative approach towards understanding al-istifhamAlexander Decker
This document discusses a transformational-generative approach to understanding Al-Istifham, which refers to interrogative sentences in Arabic. It begins with an introduction to the origin and development of Arabic grammar. The paper then explains the theoretical framework of transformational-generative grammar that is used. Basic linguistic concepts and terms related to Arabic grammar are defined. The document analyzes how interrogative sentences in Arabic can be derived and transformed via tools from transformational-generative grammar, categorizing Al-Istifham into linguistic and literary questions.
A time series analysis of the determinants of savings in namibiaAlexander Decker
This document summarizes a study on the determinants of savings in Namibia from 1991 to 2012. It reviews previous literature on savings determinants in developing countries. The study uses time series analysis including unit root tests, cointegration, and error correction models to analyze the relationship between savings and variables like income, inflation, population growth, deposit rates, and financial deepening in Namibia. The results found inflation and income have a positive impact on savings, while population growth negatively impacts savings. Deposit rates and financial deepening were found to have no significant impact. The study reinforces previous work and emphasizes the importance of improving income levels to achieve higher savings rates in Namibia.
A therapy for physical and mental fitness of school childrenAlexander Decker
This document summarizes a study on the importance of exercise in maintaining physical and mental fitness for school children. It discusses how physical and mental fitness are developed through participation in regular physical exercises and cannot be achieved solely through classroom learning. The document outlines different types and components of fitness and argues that developing fitness should be a key objective of education systems. It recommends that schools ensure pupils engage in graded physical activities and exercises to support their overall development.
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
This document summarizes a study examining efficiency in managing marketing executives in Nigerian banks. The study was examined through the lenses of Kaizen theory (continuous improvement) and efficiency theory. A survey of 303 marketing executives from Nigerian banks found that management plays a key role in identifying and implementing efficiency improvements. The document recommends adopting a "3H grand strategy" to improve the heads, hearts, and hands of management and marketing executives by enhancing their knowledge, attitudes, and tools.
This document discusses evaluating the link budget for effective 900MHz GSM communication. It describes the basic parameters needed for a high-level link budget calculation, including transmitter power, antenna gains, path loss, and propagation models. Common propagation models for 900MHz that are described include Okumura model for urban areas and Hata model for urban, suburban, and open areas. Rain attenuation is also incorporated using the updated ITU model to improve communication during rainfall.
A synthetic review of contraceptive supplies in punjabAlexander Decker
This document discusses contraceptive use in Punjab, Pakistan. It begins by providing background on the benefits of family planning and contraceptive use for maternal and child health. It then analyzes contraceptive commodity data from Punjab, finding that use is still low despite efforts to improve access. The document concludes by emphasizing the need for strategies to bridge gaps and meet the unmet need for effective and affordable contraceptive methods and supplies in Punjab in order to improve health outcomes.
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
1) The document discusses synthesizing Taylor's scientific management approach and Fayol's process management approach to identify an effective way to manage marketing executives in Nigerian banks.
2) It reviews Taylor's emphasis on efficiency and breaking tasks into small parts, and Fayol's focus on developing general management principles.
3) The study administered a survey to 303 marketing executives in Nigerian banks to test if combining elements of Taylor and Fayol's approaches would help manage their performance through clear roles, accountability, and motivation. Statistical analysis supported combining the two approaches.
A survey paper on sequence pattern mining with incrementalAlexander Decker
This document summarizes four algorithms for sequential pattern mining: GSP, ISM, FreeSpan, and PrefixSpan. GSP is an Apriori-based algorithm that incorporates time constraints. ISM extends SPADE to incrementally update patterns after database changes. FreeSpan uses frequent items to recursively project databases and grow subsequences. PrefixSpan also uses projection but claims to not require candidate generation. It recursively projects databases based on short prefix patterns. The document concludes by stating the goal was to find an efficient scheme for extracting sequential patterns from transactional datasets.
A survey on live virtual machine migrations and its techniquesAlexander Decker
This document summarizes several techniques for live virtual machine migration in cloud computing. It discusses works that have proposed affinity-aware migration models to improve resource utilization, energy efficient migration approaches using storage migration and live VM migration, and a dynamic consolidation technique using migration control to avoid unnecessary migrations. The document also summarizes works that have designed methods to minimize migration downtime and network traffic, proposed a resource reservation framework for efficient migration of multiple VMs, and addressed real-time issues in live migration. Finally, it provides a table summarizing the techniques, tools used, and potential future work or gaps identified for each discussed work.
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
This document discusses data mining of big data using Hadoop and MongoDB. It provides an overview of Hadoop and MongoDB and their uses in big data analysis. Specifically, it proposes using Hadoop for distributed processing and MongoDB for data storage and input. The document reviews several related works that discuss big data analysis using these tools, as well as their capabilities for scalable data storage and mining. It aims to improve computational time and fault tolerance for big data analysis by mining data stored in Hadoop using MongoDB and MapReduce.
1. The document discusses several challenges for integrating media with cloud computing including media content convergence, scalability and expandability, finding appropriate applications, and reliability.
2. Media content convergence challenges include dealing with the heterogeneity of media types, services, networks, devices, and quality of service requirements as well as integrating technologies used by media providers and consumers.
3. Scalability and expandability challenges involve adapting to the increasing volume of media content and being able to support new media formats and outlets over time.
This document surveys trust architectures that leverage provenance in wireless sensor networks. It begins with background on provenance, which refers to the documented history or derivation of data. Provenance can be used to assess trust by providing metadata about how data was processed. The document then discusses challenges for using provenance to establish trust in wireless sensor networks, which have constraints on energy and computation. Finally, it provides background on trust, which is the subjective probability that a node will behave dependably. Trust architectures need to be lightweight to account for the constraints of wireless sensor networks.
This document discusses private equity investments in Kenya. It provides background on private equity and discusses trends in various regions. The objectives of the study discussed are to establish the extent of private equity adoption in Kenya, identify common forms of private equity utilized, and determine typical exit strategies. Private equity can involve venture capital, leveraged buyouts, or mezzanine financing. Exits allow recycling of capital into new opportunities. The document provides context on private equity globally and in developing markets like Africa to frame the goals of the study.
This document discusses a study that analyzes the financial health of the Indian logistics industry from 2005-2012 using Altman's Z-score model. The study finds that the average Z-score for selected logistics firms was in the healthy to very healthy range during the study period. The average Z-score increased from 2006 to 2010 when the Indian economy was hit by the global recession, indicating the overall performance of the Indian logistics industry was good. The document reviews previous literature on measuring financial performance and distress using ratios and Z-scores, and outlines the objectives and methodology used in the current study.
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Infrastructure Challenges in Scaling RAG with Custom AI modelsZilliz
Building Retrieval-Augmented Generation (RAG) systems with open-source and custom AI models is a complex task. This talk explores the challenges in productionizing RAG systems, including retrieval performance, response synthesis, and evaluation. We’ll discuss how to leverage open-source models like text embeddings, language models, and custom fine-tuned models to enhance RAG performance. Additionally, we’ll cover how BentoML can help orchestrate and scale these AI components efficiently, ensuring seamless deployment and management of RAG systems in the cloud.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Best 20 SEO Techniques To Improve Website Visibility In SERP
3 rupali kasar_final paper--23-34
1. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
Data Hiding in Binary Images Using Orthogonal Embedding - A High
Capacity Approach
Bharti Gawali1,
Dr.Babasaheb Ambedkar Marathwada University,
Aurangabad, India
E-mail: bharti_rokade@yahoo.co.in
Rupali Kasar2,
Dr.Babasaheb Ambedkar Marathwada University,
Aurangabad, India
E-mail: rupalikasar1@gmail.com
Abstract
The growth of high speed computer networks and the Internet, in particular, has increased the ease of Information
Communication. In comparison with Analog media, Digital media offers several distinct advantages such as high quality, easy
editing, high fidelity copying, compression etc. But this type advancement in the field of data communication in other sense
has hiked the fear of getting the data snooped at the time of sending it from the sender to the receiver. Information Security is
becoming an inseparable part of Data Communication. In order to address this Information Security, Digital Watermarking
plays an important role. Watermarking Techniques are used to hide a small amount of data in such a way that no one apart
from the sender and intended recipient even realizes there is a hidden message. This paper proposed a high capacity data hiding
approach for binary images in morphological transform domain for authentication purpose so that the image will look
unchanged to human visual systems.
Keywords: Data hiding, digital watermarking, authentication, security, authentication, binary image.
I. Introduction
Digital watermarking is the process of embedding information into a digital signal. The signal may be audio, pictures or video.
If the signal is copied, then the information is also carried in the copy [1].A significant number of data hiding techniques have
been reported in recent years in order to create robust digital watermarks. Among all the existing techniques for digital color
and gray scale images, not all of them can be directly applied to binary text images. Digital watermarking techniques have been
proposed for ownership protection, copy control, fingerprinting, annotation and authentication of digital media [2]. Recently
authentication of digital documents has found wide applications in handwritten signatures, digital books, business documents,
personal documents, maps, engineering drawings, and so on [3]–[4]. Most data-hiding techniques for binary images have
focused on spatial domains, for example, choosing data-hiding locations by employing pairs of contour edge patterns [5], edge
pixels and defining visual quality-preserving rules [6], [7]. However, the capacities of the existing algorithms are not large
enough, especially for small images.
23
2. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
Figure.1.Illustration of changes in coefficient due to flipping pixels [(a)and(b)]and the “edge shifting ”phenomenon [(c) and (d)].
A watermarking scheme is usually consist of three distinct steps,
Embedding,
Attack and
Detection.
Authentication process ensures that the given set of data comes from a legitimate sender and content integrity is preserved [8].
Watermarking can be further classified into hard authentication and soft authentication [9]. Hard authentication is the
validation of content that does not allow any modifications. That means a single bit change in the test image will trigger an
alarm that indicates the content is unauthentic. “Hard” image authentication is highly sensitive and dependent on the exact
value of image pixels, whereas “Soft” image authentication is sensitive just to content modification and serious image quality
tampering.
On the other hand, editing an image becomes easier with the powerful image editing tools and digital cameras. Authentication
to detect tampering and forgery is thus of primary concern. This work focuses on hard authenticator watermark-based
authentication. The problem of data hiding for binary images in morphological transform domain is concentrated. The
morphological binary wave transform [10] can be used to track the transitions in binary images by utilizing the detail
coefficients as a location map to determine the data hiding locations. Embedding data using real-valued coefficient requires
more memory space. The Morphological binary wavelet transform [10] can be used to track the transitions in binary images by
using the detail coefficients. This coefficient is used as a location map to determine data hiding locations but the problem lies
with the fact that once a pixel is flipped ,the horizontal, vertical and diagonal detail coefficients also changes. The major
advantages of the proposed scheme lie in its larger capacity compared with previous schemes, better visual quality (e.g.,
compared with [5]–[9]) and lower computational complexity. In addition, unlike [4], our present scheme does not suffer the
capacity decrease and computational load increase in order to incorporate the cryptographic signature for authentication.
The paper is divided into seven sections. Section I, deals with the introduction of digital watermarking. Section II, provides a
brief review on existing 1-D morphological binary wavelet transform, our proposed extension to 2-D morphological binary
wavelet transform is presented in Section III, Section IV describes the Orthogonal Embedding method, Experimental results
and data hiding effects are presented In Section V and VI ,Section VII concludes the paper.
II. 1-D Morphological Binary Wavelet Transform
An interlaced transform is used to identify the embeddable locations due to the fact that some transition information is lost
during the computation of a single transform and there is a need to keep track of transitions between two and three pixels for
binary images data hiding. Here an image based on 2x2 pixel blocks is processed and two different processing cases are
combined that the flippability conditions of one are not affected by flipping the candidates of another for data embedding are
called “Orthogonal Embedding”. This addresses the problem of the capacity decrease due to the un-embeddability of the block
boundaries. As a result, significant gains in capacity can be achieved, which also improves the efficiency of utilizing the
flippable pixels. “Exclusive OR (XOR)” operation addresses the quantization error occurred in a DCT-based approach. The
major advantages of the proposed scheme lie in its larger capacity (e.g., compared with [5], [11], [12]), better visual quality
(e.g., compared with [5]–[7]) and lower computational complexity (e.g., compared with [5], [4]). In addition, unlike [7], our
present scheme does not suffer the capacity decrease and computational load increase in order to incorporate the cryptographic
signature for authentication.
This section, reviews with signal analysis and synthesis and 1-D signal decomposition similar to [14].
Based on this, decomposition scheme to 2-D signal is extended in this paper and subsequently proposed an interlaced transform
for the data-hiding application.
Consider a family of signal space V������ and detail space W������ at level ������. The 1-D wavelet decomposition scheme comprises of one
signal analysis operator ψ������ + and one detail analysis operator ϖ ������+. In addition, it also consists of one signal synthesis operator ψ������
⎯and one detail synthesis operator ϖ ⎯.Here “+” indicates that the corresponding operator maps a signal to a higher level,
������
24
3. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
towards the direction of reducing the information. Whereas “_”indicates that the operator maps a signal to a lower level,
towards the direction of restoring the information. The signal analysis operator ψ������ + maps a signal, S������ ∈ V������
from level ������ to ������+1 for the scaled signal S������+1 = ψ������ + (S������), S������+1 ∈ V������ +1 The detail analysis operator ϖ ������+ V������ ⟶ W������+1 maps a
signal from level ������ to ������+1 for the detail signal d������+1 = ϖ ������+ (S������), d������+1∈ w������+1 On the other hand, the signal synthesis operator
ψ������ - : V������+1 ⟶ V������ maps a signal from level ������+1 to back to level ������ to obtain an approximation of S������ , to S������ = ψ ������-(S������+1 ) The detail
synthesis operator ϖ ������⁻ (d������+1)maps a detail signal back to level ������ so as to obtain the detail signal e������ = ϖ������ -( d������+1) The signal at level
������ is reconstructed by
S������ = ψ������ – (S������+1 ) + ϖ ������ – (d������+1 ) (1)
Perfect reconstruction of the original signal is possible if the operators satisfy
ψ������ – ψ������ + = ϖ ������ - ϖ ������+ = I (2)
ψ������ –ϖ ������ + = ϖ ������ - ψ������ + = 0 (3)
ψ������ – ψ������ + + ϖ ������ - ϖ ������+= I (4)
Where “I” and “0” represent the identity and zero operators, respectively. Note that that {ψ������–,ψ������+,ϖ������-,ϖ������+} is a set of
biorthogonal filter operators if the conditions in (2)–(4) are satisfied. For the morphological analysis and synthesis scheme the
bi-orthogonality is formulated in the operator terms. Let “ ” denote the “Exclusive OR (XOR)” operation. The signals at
level ������+1 by applying the analysis operators for a 1-D signal are given by
s(i) = ψ+(s)(i) = s(2i+1) (5)
d(i) = ϖ+ (s)(i) = s(2i) s(2i+1) (6)
s(i) & d(i) are the coarse and detail signals obtained at level ������+1,respectively. i denotes the index of the signal at level ������+1 and
i = 0,1,2,…..,N-1 for a 1-D signal of size N . The detail signal d(i) contains 1’s at each transition from 0 to 1 or vice versa in
signal. The synthesis operators are given by
ψ –(s) s(2i+1) = ψ –(s)(2i) = s(i) (7)
ϖ –(s) s(2i+1) = 0 and ϖ –(s) (2i) = d(i) (8)
The signal at level ������ is reconstructed by
s(2i) =ψ –(s)(2i) ϖ –(s) (2i) = s(i) d(i) (9)
– –
s(2i+1) =ψ (s)(2i+1) ϖ (s)(2i+1)= s(i) (10)
III. Interlaced Morphological Binary Wavelet Transform
The 1-D wavelet decomposition scheme [14] is extended to a 2-D signal by defining a non-separable 2-D transform. Let i and j
represent the indices of the signal at level l +1, where i=0,1,2,…M-1 and j = 0,1,2,…N-1 for a 2-D coarse signal of size M x
N .Designation of the samples in a 2 x 2 block is shown in Fig. 2.where s (2i,2j) denotes the signal (“0” or “1”) located at row
and column at level .To define a 2-D transform, one sample in a 2 x2 block is sub-sampled as the coarse signal.
25
4. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
Figure 2. Designation of the samples in a 2 x 2 block
The horizontal, vertical and diagonal detail signals are derived from the differencebetween the sub-sampled sample and its
vertical, horizontal and diagonal (including diagonal and anti-diagonal) neighbors. The resultant transformed signal remains
binary while the coarse and detail signals will each be 1/4 the size of the original signal. Let the operators for the coarse signal,
horizontal, vertical, and diagonal detail signals be, ψee, ϖh ee , ϖvee and ϖdee, respectively, where the superscript “ ee ” denotes
“even-even”. The obtained transform is named the even-even transform since it is operated on a 2 x 2 block starting from the
even-even coordinates. The coarse signal, vertical, horizontal and diagonal detail signals at level l +1 are obtained by applying
the analysis operators to obtain.
See(i,j) = ψee+ (S) (i,j) = S (2i+1,2j+1) (11)
vee(i,j)=ϖhee+ (S) (i,j) = S (2i+1,2j) S(2i+1,2j+1) (12)
hee(i ,j ) = ϖ ee+ (S) (i, j) = S (2i,2j+1) S(2i+1,2j+1) (13)
dee(i ,j )= ϖd ee+ (S) (i, j) = S (2i,2j) S(2i+1,2j) S(2i ,2j+1)
S (2i+1,2j+1) (14)
Where See(i,j) ∈ V������+1 and { vee(i,j), hee(i ,j ) , dee(i ,j )} ∈ W������+1. the synthesis operators of a 2-D wavelet transform are given
by
ee ee
ee
ee
ee
Finally, the signal at level l+1 can be reconstructed by
S(2i,2j)= ee (s)(2i,2j) ϖ������ ee-(S) (2i,2j)
=See(i,j) vee(i,j) hee(i,j) dee(i,j) (16)
S(2i,2j+1)= ee (s)(2i,2j+1) ϖh ee-(S) (2i,2j+1)
= See(i,j) hee(i ,j) (17)
S(2i+1,2j)= ee (s)(2i+1,2j) ϖv ee-(S) (2i+1,2j)
= See(i,j) vee(i ,j) (18)
26
5. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
S(2i+1,2j+1)= ee (s)(2i+1,2j+1) ϖ ee-(S) (2i+1,2j+1)
= See(i,j) (19)
Since the coarse signals obtained from (11) are at the odd-odd locations, the transitions from odd-odd to other coordinates in
the 2 x 2 block are assessed from the detail signals obtained by (12)–(14). To obtain the transition from odd-even, even-odd
and even-even coordinates complementary wavelet transforms operating on the 2 x 2 blocks is designed which start from the
even-odd, odd-even and odd-odd coordinates of the signal. Based on the absolute coordinates in the top left position shown in
Figure.3. Each 2 x 2 block in a 2-D image is classified as an even-even block (EEB),or an even -odd block (EOB), or an odd-
even block (OEB), or an odd-odd block (OOB), which is given by
Figure 3. Four different 2 x 2 blocks in 3 x 3 blocks of binary image.
Bp(i,j)∈ EEBs for (mod(x,2)=0)^ (mod(y,2)=0)
EOBs for (mod(x,2)=0)^ (mod(y,2)=1)
OEBs for (mod(x,2)=1)^ (mod(y,2)=0)
OOBs for (mod(x,2)=0)^ (mod(y,2)=1) (20)
Where (x,y) denotes xth row and yth column of an image ,(i ,j) denotes the index of the current 2x2 block mod() denotes
a modulo operation and “ ^ “ represents logical “AND”operation. Hence, three additional transforms, i.e., even-odd, odd-even
and odd-odd, can be defined. These transforms, together with the even-even transform, are collectively called interlaced
morphological binary wavelet transform (IMBWT).The operators for the even-odd transforms are , the signals obtained by
applying the analysis operators for the even-odd transform are given by
27
6. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
Figure. 4. Main processing block and its subsidiary block
Seo(i,j) = ψeo+ (S) (i,j) = S (2i+1,2j+2) (21)
veo(i,j) = ϖv eo+ (S) (i,j) = S (2i+1,2j+1) S(2i+1,2j+2) (22)
heo(i,j) = ϖh eo+ (S) (i, j) = S (2i,2j+2) S(2i+1,2j+2) (23)
deo(i ,j ) = ϖd eo+ (S) (i, j) = S (2i,2j+1) S(2i+1,2j+1)
S(2i ,2j+2) S (2i+1,2j+2) (24)
The odd-even and odd-odd transforms can be defined in the same way. For simplicity, we use, sk ,vk ,hk , and dk ,
k ∈ {ee,eo,oe,oo} to represent the signals obtained from different transforms. There are four single processing cases (SPCs):
even-even, even-odd, odd-even and odd-odd that are determinant on the main processing blocks to be EEBs, EOBs, OEBs and
OOBs. Consider the even-even processing case where the main processing blocks are EEBs and EOBs, OEBs and OOBs which
are interlaced with the EEBs are shown as the subsidiary blocks in Fig. 4. In Applying the IMBWT for data hiding in binary
images, the processing of images is always based on 2 x 2 blocks (i.e., main processing blocks). However, the flippability of a
coarse signal is determined by considering 3 x 3 blocks, which consist of both the main processing blocks and the subsidiary
blocks.
III.I Single Processing
As flipping an edge pixel in binary images is equivalent to shifting the edge location horizontally one pixel and vertically one
pixel. A horizontal edge exists if there is a transition between two neighboring pixels vertically and a vertical edge exists if
there is a transition between two neighboring pixels horizontally. To define the flippability condition for a coarse signal, we
actually consider the 3 x 3 block in such a way that the shifted edges can be tracked for the convenience of blind watermark
extraction. The flippability condition (or cross condition) for a SPC is defined as follows: a coarse signal (in a main processing
block) is flippable if both horizontal and vertical edges exist. Specifically, consider the even-even processing case, a horizontal
edge exists if either hee or hoe equals to 1 and a
vertical edge exists if either or equals to 1. The flippability condition f ee(i,j) is given by
f ee(i,j)= (vee(i,j) veo(i,j))) ^ (hee(i ,j ) heo(i ,j)) (25)
f ee(i,j)=1. (26)
Let us now consider a 3 x 3 block of an input image s. The number of transitions from the current candidate pixel (the center
pixel) to its 4-neighbors in the horizontal and vertical directions is represented by Nh and Nv, respectively, which are calculated
from the center pixel to its 4-neighbors. Assume the center pixel S (2i+1, 2j+1) is [see Fig. 3(a)], and Nh and Nv are given by
28
7. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
Nh = ∑ s(2i+1,2j+k) s(2i+1,2j+1+k) (27)
Nv = ∑ s(2i+k,2j+1) s(2i+1+k,2j+1) (28)
By satisfying the cross condition that fee(i,j)=1 and Nv do not change when the center pixel is flipped. Hence, the 4-
connectivity from the center pixel to its 4-neighbors is preserved. Further, the center pixel has a white 4-neighbor pixel in both
horizontal and vertical directions. Similarly, the flippability conditions for the odd-odd, even-odd, and odd-even processing
cases is calculated. In summary, the flippability conditions help identify all the candidate pixels for which the pixels directly
above and below the candidate pixel have different colors (“0” and “1”) and the pixels immediately to the left and right of the
candidate pixel have different colors. In addition, in applying these flippability conditions for data hiding, we require that the
two chosen candidate pixels should not be 4-adjacent, i.e., horizontally or vertically adjacent to each other to avoid poor visual
quality. It can be seen that the flippability of the center pixel in each 3 x 3 block is independent of the center pixel value.
IV. High Capacity data Hiding Using Orthogonal Embedding
The process of orthogonal embedding consists of following processes.
IV.I Authentication Watermark Generation, Embedding and Verification
Firstly it is necessary to apply the flippability.
IV.I.I Flippability decision
In applying the IMBWT for data hiding in binary images, the processing of images is always based on 2X2 blocks (i.e., main
processing blocks). The flippability conditions of a coarse signal, is determined by considering 3X3 blocks, which consist of
both the main processing blocks and the subsidiary blocks
IV.I.II Embeddability
In order to generate the hard authenticator watermark, the key issue is how to locate the “embeddable” pixels given the
watermarked image. The “embeddability” of a block depends on the “flippability” of the determined pixels in the block.
IV.I.III Watermark embedding
The watermark embedding process is summarized as follows.
1) Partition the image into equal size square blocks; note that the block size does not need to be square.
2) Determine the flippability of the determined pixels based on the “Flippability Criterion”.
3) Once a pixel is identified as “flippable”, the block is marked as “embeddable”. The current “flippable” pixel is
Identified as the “embeddable” pixel, i.e. “embeddable” location of the block.
4) Proceed to the next block.
5) Repeat steps 2 to 4 until all the blocks are processed.
6) Embed the watermark in the “embeddable” blocks by flipping the “embeddable” pixels.
IV.I.IV Authentication process
29
8. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
To address the security concerns, method proposes to generate the Authenticator watermark in fig. by encrypting the XORed
value of the replicated hash value of the binary images and the payload watermark.
IV.I.V Verification process
Extract the watermark based on flippability & embeddable pixel criterion. Thus the tampering can be detected.
The proposal of processing an image in 2X 2 blocks not only prevents the computational load from getting high for blockbased
approach with large block size but also improves the efficiency of utilization of flippable pixels., the flippability conditions
help identify all the candidate pixels for which the pixels directly above and below the candidate pixel have different colors
(“0” and “1”) and the pixels immediately to the left and right of the candidate pixel have different colors. In addition, in
applying these flippability conditions for data hiding, we require that the two chosen candidate pixels should not be 4-adjacent,
i.e., horizontally or vertically adjacent to each other to avoid poor visual quality. It can be seen that the flippability of the center
pixel in each 3X3 block is independent of the center pixel value.
IV.II Double Processing
The capacity of the proposed scheme is determined by the number of pixels that satisfy the flippability condition. This capacity
can be increased significantly by combining the two single processing cases, namely, Double Processing Case (DPC). Based on
the observations of (27) and (28), the flippability condition of the even-even processing case (i.e. fee(i,j)) is not affected by
flipping the candidates in the odd-odd processing case (e.g., S (2i, 2j) and vice versa, as illustrated in Fig. 5. This
“nonintersection” property of the two processing cases renders the processing of the even-even and odd-odd cases can be done
together. The same applies to the even-odd and odd-even processing cases. For convenience, we call the two combined
processing cases as a “Pair Case”.
Figure.5. Designated 2 x 2 blocks.
As evidenced from the increase in the number of candidate pixels, i.e., from [1/4 x M x N] to [1/2 x M x N] for an image of
size, the capacity can be approximately doubled by combining the two processing cases. This idea is motivated by the
quantization index modulation based data-hiding method [18]. The even-even and odd-odd processing cases can be viewed as
two orthogonal sets of embedders indexed at the 2 x 2 blocks starting from even-even and odd-odd coordinates, denoted as Qee
and Qoo , respectively.
In this paper, the embedders are an ensemble of the embedding functions of a “Pair Case”, e.g., the embedding functions of
even-even and odd-odd cases.
30
9. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
In this approach. We define a designated 2 x 2 block Db(i,j) as the 2 x 2 block that contains the two candidate pixels for a pair
case, which is shown in Fig. 6. The designated 2 x2 block can be chosen from one of the two processing blocks of a pair case,
but only one candidate pixel is chosen to hide data in each. Db(i,j) Hence, the maximum capacity Cc is upper bounded by Cc <=
[1/4 x M x N] To achieve higher security, the choice of an Embedder Qk in each Db(i,j) using DPC can depend on a random
key s where s ∈ {0,1}.. For example, for the mth Db(i,j) block, we choose ee when s (m)=1 and choose oo when s
(m)=0.. By choosing ee. we check fee(i,j) first, mark the current candidate pixel as embeddable if fee(i,j) =1 and proceed to
the next Db(i,j). Otherwise foo(i,j),will be checked (i.e., when fee(i,j) ≠ 1). Similarly, foo(i,j) is checked first by choosing oo..
From the above discussion, it is noticed that there may be two candidate pixels being flipped in some 2 x 2 blocks (not Db(i,j)),
e.g., the OOBs in Fig.6.
V. Experimental Results
To show the capacity increase by employing DPC compared with that of SPC, 100 images of a variety of sizes were used.
These images are of different types (e.g., cartoons, sketch, drawing, handwritten and text in different languages) and various
dimensions (e.g., 132x132, 128 x 128,232x202, 720x756, and 450x524). The Capacities of the watermarked image, which is
defined in Table 1. The increase in capacity represented in percentage from SPC to DPC.
The capacity mainly depends on the contents of the images, which varies for different types of images. The richer the contents
of the images (more edges exist), the larger the capacity. For images of same size and similar contents, in general, text or
cartoon images which consist of rich corners and thin strokes may easily cause larger distortion. This is due to the facts that
few good patterns exist in corners and thin strokes, hence flipping pixels can be easily noticed. Following figures indicates the
data hiding effects.
Authentication Results
Fig.6. (a) Original Image Of Size
132x132.Max. Data Hiding Capacity for SPC=104,DPC=256, (b)Watermarked image with 80 bits embedded
by employing SPC
31
10. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
(c)Difference Image with SPC flipped pixels (d)Watermarked image with 40 bits
embedded by employing DPC
(e)Difference Image with DPC flipped pixels
VI. Conclusion
This paper, present a high-capacity approach for data-hiding scheme for binary images based on the interlaced morphological
binary wavelet transforms. The relationship between the coefficients obtained from different transforms is utilized to identify
the suitable locations for watermark embedding such that blind watermark extraction can be achieved. Two processing cases
that are not intersected with each other are employed for orthogonal embedding in such a way that not only can the capacity be
significantly increased, but the visual distortion can also be minimized. Comparative results show that the present scheme is
quite superior in being able to attain larger capacity while maintaining acceptable visual distortion and low computational cost.
References
[1] I. J. Cox, M. L. Miller, and J. A. Bloom, San Mateo, CA: Morgan Kaufmann,( 2001),
Digital Watermarking.
32
11. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
[2] B. Furht and D. Kirovski, B. Furht and D. Kirovski, Eds. Boca Raton, FL: CRC(2005),
Multimedia Security Handbook.
[3] Y. Liu, J. Mant, E. Wong, and S. H. Low (1999), “Marking and detection of text
documents using transform-domain techniques,” in Proc. SPIE, San Jose, CA, vol. 3657,
pp. 317–328.
[4] Q. Mei, E. K. Wong, and N. Memon (2001), “Data hiding in binary text document,”
in Proc. SPIE, vol. 4314, pp. 369–375.
[5] Y. C. Tseng and H.-K. Pan, “Data hiding in 2-color images (Jul. 2002),” IEEE
Trans. Comput., vol. 51, no. 7, pp. 873–878,.
[6] H. Lu, A. C. Kot, and Y. Q. Shi (Feb. 2004), “Distance-reciprocal distortion measure
for binary document images,” IEEE Signal Process. Lett. vol. 11,no. 2, pp. 228–231.
[7] H. Yang and A. C. Kot (Apr. 2007), “Pattern-based date hiding for binary images
authentication by connectivity-preserving,” IEEE Trans. Multimedia, vol. 9, no. 3,
pp. 475–486.
[8] B. B. Zhu, M. D. Swanson, and A. H. Tewfik(Mar.2004) , “When seeing isn’t believing,”
IEEE Signal Process. Mag, pp. 40–49.
[9] H. Lu, X. Shi, Y. Q. Shi, A. C. Kot, and L. Chen (2002), “Watermark embedding in
DC components of DCT for binary images,” in Proc. IEEE Workshop on Multimedia
Signal Processing, Dec. 9–11, pp. 300–303.
[10] H. J. A. M. Heijmans and J. Goutsias (Nov. 2000), “Nonlinear multiresolution signal
decomposition schemes-part I: Morphological wavelets,” IEEE Trans. Image Process.,
vol. 9, no. 11, pp. 1897–1913.
[11] M. Wu and B. Liu (Aug. 2004), “Data hiding in binary images for authentication
and annotation,” IEEE Trans. Multimedia, vol. 6, no. 4, pp. 528–538.
.
[12] H. Y. Kim and R. L. de Queiroz (2004) , “Alteration-locating authentication
watermarking for binary images,” in Proc. Int. Workshop Digital
Watermarking, pp. 125–136.
[13] H. J. A. M. Heijmans and J. Goutsias (Nov. 2000), “Nonlinear multiresolution signal
decomposition schemes-part II: Morphological wavelets,” IEEE Trans.
Image Process., vol. 9, no. 11, pp. 1897–1913.
[14] “Digital Watermarking” available at
http://en.wikipedia.org/wiki/Digital_watermarking
[15] “Fundamentals of Wavelets” available at
http://documents.wolfram.com/applications/wavelet/index2.html
33
12. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.3
VII. Observation Table I
Comparison of data hiding Capacities for SPC and DPC
Image SPC DPC Increase in
capacity Capacity Capacity
Embed data in (In characters)
characters
Lily.bmp 13 32 19
Text.bmp 0 15 15
Drawing.bmp 3 9 6
Tiger.bmp 159 351 192
Sparkle.bmp 2 9 7
Sketch.bmp 13 30 17
Letter.bmp 4 8 4
Graphics.bmp 6 15 9
Nano.bmp 90 191 101
Hill.bmp 56 150 94
Rangoli.bmp 17 43 26
Cartoon.bmp 189 429 240
Figure.7. Graph- Capacity Increase Using SPC and DPC
The above fig.7 shows the graph of image index versus Data hiding capacities. It consists of 5 different class images.
Observations shows that capacity has increased significantly using DPC versus SPC, e.g., increase from approximately 56% to
69% for the sample five test images.
34