This document summarizes a research article that presents a novel robust reversible watermarking method for copyright protection of images. The proposed method, called wavelet-domain statistical quantity histogram shifting and clustering (WSQH-SC), aims to improve upon existing reversible watermarking methods by addressing issues with reversibility, robustness, and invisibility.
WSQH-SC consists of four main modules: 1) property inspired pixel adjustment to avoid pixel overflow/underflow during embedding, 2) construction of statistical quantity histograms in the wavelet domain for embedding, 3) an enhanced pixel-wise masking technique to optimize watermark strength based on human visual perception, and 4) watermark extraction based on k-means clustering. The authors
The document presents a novel framework called WSQH-SC for robust reversible watermarking. WSQH-SC improves on prior methods in three ways: 1) It uses property-inspired pixel adjustment to avoid pixel overflow/underflow during embedding. 2) It constructs a new watermark embedding procedure using histogram shifting and k-means clustering of mean wavelet coefficients, improving robustness and reducing complexity. 3) It designs enhanced pixel-wise masking to balance robustness and invisibility by adapting watermark strength based on just-noticeable-difference thresholds. Experimental results on natural, medical and SAR images show WSQH-SC outperforms other reversible watermarking methods.
Digital watermarking has been proposed as a solution to the problem of copyright protection of
multimedia documents in networked environments. There are two important issues that watermarking
algorithms need to address. First, watermarking schemes are required to provide trustworthy evidence for
protecting rightful ownership. Second, good watermarking schemes should satisfy the requirement of
robustness and resist distortions due to common image manipulations (such as filtering, compression,
etc.). In this paper, a watermarking algorithm is proposed based on the Discrete Wavelet Transform
(DWT), Fractional Fourier Transform (FrFT) and Singular value decomposition (SVD). Analysis and
experimental results show that the proposed watermarking method performs well in both security and
robustness.
A SEMI-BLIND WATERMARKING SCHEME FOR RGB IMAGE USING CURVELET TRANSFORMijfcstjournal
In this paper, a semi-blind watermarking technique of embedding the color watermark using curvelet coefficient in RGB cover image has been proposed. The technique used the concept of HVS that the human eyes are not much sensitive to blue color. So the blue color plane of the cover image is used as embedding domain. A bit planes method is also used, the most significant bit (MSB) plane of watermark image is used
as embedding information. Selected scale and orientation of the curvelet coefficients of the blue channel in the cover image has been used for embedding the watermark information. All other 0-7 bit planes are used as a key at the time of extraction. The results of the watermarking scheme have been analyzed by different quality assessment metric such as PSNR, Correlation Coefficient (CC) and Mean Structure Similarity Index Measure (MSSIM). The experimental results show that the proposed technique gives the good invisibility of watermark, quality of extracted watermark and robustness against different attacks.
Robust Watermarking in Mid-Frequency Band in Transform Domain using Different Transforms with Full, Row and Column Version and Varying Embedding Energy
Robust Watermarking Using Hybrid Transform of DCT, Haar and Walsh and SVDIJERD Editor
The document summarizes a research paper that proposes a novel approach for digital image watermarking using a hybrid transform and singular value decomposition (SVD). The hybrid transform is generated by taking the Kronecker product of existing orthogonal transforms like discrete cosine transform (DCT), Haar, and Walsh. The watermark is embedded by modifying the singular values of the host image after applying the hybrid transform and SVD. Experimental results show the proposed approach improves robustness against compression by 59%, noise addition by 70%, and resizing by 32-56% compared to other hybrid wavelet transform techniques. The performance is evaluated under various attacks like compression, cropping, noise addition, resizing, and histogram equalization.
A NOVEL APPROACH FOR IMAGE WATERMARKING USING DCT AND JND TECHNIQUESijiert bestjournal
Today�s world is digital world. Nowadays,in every field there is enormous use of digital contents. Information handled on internet and multimedia netw ork system is in digital form. The copying of digital content without quality loss is not so diff icult. Due to this,there are more chances of copyi ng of such digital information. So,there is great need o f prohibiting such illegal copyright of digital med ia. Digital watermarking is the powerful solution to ad dress this problem. Digital watermarking is the technology in which there is embedding of various t ypes of information in digital content which we have to protect from illegal copying. This embedded information to protect the data is embedded as watermark. This paper introduces two novel techniqu es for image watermarking such as DCT and JND. The DCT based approach adapted to embed waterm arks in DC,low,mid and high frequency components coefficient of DCT. The JND based approa ch gives robust and transparent scheme of watermarking that exploits the �human visual system s� sensitivity to local image characteristics obtained from the spatial domain,improving upon th e content based image watermarking scheme.
Non standard size image compression with reversible embedded waveletseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
MULTIUSER BER ANALYSIS OF CS-QCSK MODULATION SCHEME IN A CELLULAR SYSTEM ijwmn
In recent years, chaotic communication is a hot research topic and it suits better for the emerging wireless networks because of its excellent features. Different chaos based modulation schemes have evolved, of which the CS-DCSK modulation technique provides better BER performance and bandwidth
efficiency, due to its code domain approach. The QCSK modulation technique provides double benefit: higher data rate with similar BER performance and same bandwidth occupation as DCSK. By combining the advantage of code shifted differential chaos shift keying (CS-DCSK) and Quadrature chaos shift keying (QCSK) scheme, a novel modulation scheme called code shifted Quadrature chaos shift keying (CS-QCSK) is proposed and its suitability in a multiuser scenario is tested in this paper. The analytical expressions for the bit-error rate for Multi-user CS-QCSK scheme (MU-CS-QCSK) under Rayleigh
multipath fading channel is derived. The simulation result shows that, in multiuser scenario the proposed method outperforms classical chaotic modulation schemes in terms of bit error rate (BER).
The document presents a novel framework called WSQH-SC for robust reversible watermarking. WSQH-SC improves on prior methods in three ways: 1) It uses property-inspired pixel adjustment to avoid pixel overflow/underflow during embedding. 2) It constructs a new watermark embedding procedure using histogram shifting and k-means clustering of mean wavelet coefficients, improving robustness and reducing complexity. 3) It designs enhanced pixel-wise masking to balance robustness and invisibility by adapting watermark strength based on just-noticeable-difference thresholds. Experimental results on natural, medical and SAR images show WSQH-SC outperforms other reversible watermarking methods.
Digital watermarking has been proposed as a solution to the problem of copyright protection of
multimedia documents in networked environments. There are two important issues that watermarking
algorithms need to address. First, watermarking schemes are required to provide trustworthy evidence for
protecting rightful ownership. Second, good watermarking schemes should satisfy the requirement of
robustness and resist distortions due to common image manipulations (such as filtering, compression,
etc.). In this paper, a watermarking algorithm is proposed based on the Discrete Wavelet Transform
(DWT), Fractional Fourier Transform (FrFT) and Singular value decomposition (SVD). Analysis and
experimental results show that the proposed watermarking method performs well in both security and
robustness.
A SEMI-BLIND WATERMARKING SCHEME FOR RGB IMAGE USING CURVELET TRANSFORMijfcstjournal
In this paper, a semi-blind watermarking technique of embedding the color watermark using curvelet coefficient in RGB cover image has been proposed. The technique used the concept of HVS that the human eyes are not much sensitive to blue color. So the blue color plane of the cover image is used as embedding domain. A bit planes method is also used, the most significant bit (MSB) plane of watermark image is used
as embedding information. Selected scale and orientation of the curvelet coefficients of the blue channel in the cover image has been used for embedding the watermark information. All other 0-7 bit planes are used as a key at the time of extraction. The results of the watermarking scheme have been analyzed by different quality assessment metric such as PSNR, Correlation Coefficient (CC) and Mean Structure Similarity Index Measure (MSSIM). The experimental results show that the proposed technique gives the good invisibility of watermark, quality of extracted watermark and robustness against different attacks.
Robust Watermarking in Mid-Frequency Band in Transform Domain using Different Transforms with Full, Row and Column Version and Varying Embedding Energy
Robust Watermarking Using Hybrid Transform of DCT, Haar and Walsh and SVDIJERD Editor
The document summarizes a research paper that proposes a novel approach for digital image watermarking using a hybrid transform and singular value decomposition (SVD). The hybrid transform is generated by taking the Kronecker product of existing orthogonal transforms like discrete cosine transform (DCT), Haar, and Walsh. The watermark is embedded by modifying the singular values of the host image after applying the hybrid transform and SVD. Experimental results show the proposed approach improves robustness against compression by 59%, noise addition by 70%, and resizing by 32-56% compared to other hybrid wavelet transform techniques. The performance is evaluated under various attacks like compression, cropping, noise addition, resizing, and histogram equalization.
A NOVEL APPROACH FOR IMAGE WATERMARKING USING DCT AND JND TECHNIQUESijiert bestjournal
Today�s world is digital world. Nowadays,in every field there is enormous use of digital contents. Information handled on internet and multimedia netw ork system is in digital form. The copying of digital content without quality loss is not so diff icult. Due to this,there are more chances of copyi ng of such digital information. So,there is great need o f prohibiting such illegal copyright of digital med ia. Digital watermarking is the powerful solution to ad dress this problem. Digital watermarking is the technology in which there is embedding of various t ypes of information in digital content which we have to protect from illegal copying. This embedded information to protect the data is embedded as watermark. This paper introduces two novel techniqu es for image watermarking such as DCT and JND. The DCT based approach adapted to embed waterm arks in DC,low,mid and high frequency components coefficient of DCT. The JND based approa ch gives robust and transparent scheme of watermarking that exploits the �human visual system s� sensitivity to local image characteristics obtained from the spatial domain,improving upon th e content based image watermarking scheme.
Non standard size image compression with reversible embedded waveletseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
MULTIUSER BER ANALYSIS OF CS-QCSK MODULATION SCHEME IN A CELLULAR SYSTEM ijwmn
In recent years, chaotic communication is a hot research topic and it suits better for the emerging wireless networks because of its excellent features. Different chaos based modulation schemes have evolved, of which the CS-DCSK modulation technique provides better BER performance and bandwidth
efficiency, due to its code domain approach. The QCSK modulation technique provides double benefit: higher data rate with similar BER performance and same bandwidth occupation as DCSK. By combining the advantage of code shifted differential chaos shift keying (CS-DCSK) and Quadrature chaos shift keying (QCSK) scheme, a novel modulation scheme called code shifted Quadrature chaos shift keying (CS-QCSK) is proposed and its suitability in a multiuser scenario is tested in this paper. The analytical expressions for the bit-error rate for Multi-user CS-QCSK scheme (MU-CS-QCSK) under Rayleigh
multipath fading channel is derived. The simulation result shows that, in multiuser scenario the proposed method outperforms classical chaotic modulation schemes in terms of bit error rate (BER).
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.
33 8951 suseela g suseela paper8 (edit)new2IAESIJEECS
Modern manufacturing methods permit the study and prediction of surface roughness since the acquisition of signals and its processing is made instantaneously. With the availability of better computing facilities and newer algorithms in the machine learning domain, online surface roughness prediction will lead to the manufacture of intelligent machines that alert the operator when the process crosses the specified range of roughness. Prediction of surface roughness by multiple linear regression, regression tree and M5P tree methods using multivariable predictors and a single response dependent variable Ra (surface roughness) is attempted. Vibration signal from the boring operation has been acquired for the study that predicts the surface roughness on the inner face of the workpiece. A machine learning approach was used to extract the statistical features and analyzed by four different cases to achieve higher predictability, higher accuracy, low computing effort and reduction of the root mean square error. One case among them was carried out upon feature reduction using Principle Component Analysis (PCA) to examine the effect of feature reduction.
34 8951 suseela g suseela paper8 (edit)newIAESIJEECS
The document proposes a low memory and energy efficient image compression technique called Skipped Zonal based Binary DCT (SZBinDCT) for transmitting images over resource constrained visual sensor networks. SZBinDCT first removes alternating rows and columns of pixels to reduce redundancy. It then applies a low complexity Binary DCT transform to the remaining pixels. Only the top left zone of transformed coefficients containing most energy are considered. These coefficients are quantized and entropy encoded using Golomb Rice coding. Simulation results show the technique compresses images to 0.39 bpp with 27.34 dB PSNR while consuming only 11.352 microjoules of energy per 8x8 block, significantly less than other techniques. The low complexity compression allows extended
Corrosion Detection Using A.I : A Comparison of Standard Computer Vision Tech...csandit
In this paper we present a comparison between stand
ard computer vision techniques and Deep
Learning approach for automatic metal corrosion (ru
st) detection. For the classic approach, a
classification based on the number of pixels contai
ning specific red components has been
utilized. The code written in Python used OpenCV li
braries to compute and categorize the
images. For the Deep Learning approach, we chose Ca
ffe, a powerful framework developed at
“Berkeley Vision and Learning Center” (BVLC). The
test has been performed by classifying
images and calculating the total accuracy for the t
wo different approaches.
Hardware progress has enabled solutions which were historically computationally intractable. This is particularly true in video analysis. This technological advance has opened a new frontier of problems. Within this expanse, we have chosen the classic problem of depth inference from images. Specifically, given a sequence of images captured over time, we output depth maps corresponding one-to-one with the input sequence. As a spatiotemporal problem, we were motivated to model it with convolutions (spatial) andLSTMs (temporal). These are used in a U-Net encoder-decoder architecture. The results indicate some potential in such an approach, the process by which we came to this conclusion is detailed below
Hybrid Method For Image Watermarking Using 2 Level LWT-Walsh Transform-SVD in...rahulmonikasharma
Due to tremendous development in technology in recent time and availability of abundant tool, it is very easy for an unauthorized person to imitate crucial information which is present on internet. Therefore to shield valuable information present on internet there are various advanced techniques for example watermarking technique, cryptography technique, steganography and many more. With pace of time analog techniques replaced by digital techniques due to various advantages and in current scenario every country moving towards digitalization. Digital watermarking is a technique through which digital information is embedded into an image and secret digital data can be extracted at receiver side with authentication otherwise impossible to fetch. Spatial domain and frequency are the two techniques through which secret digital information can be embedded. In this paper two level lifting wavelet transform (LWT), Walsh Hadamard transform and singular value decomposition (SVD) technique has been proposed in YCbCr color space. First of all cover image and watermark image converted into YCbCr color space from RGB color space after that one of channel is selected for embedded purpose. Now perform first level LWT on the Y channel of cover and watermark image so that image split into four groups. Now apply second level LWT on any one of four bands. Further Walsh hadamard transform technique applied with singular value decomposition (SVD) technique to get enhanced output. In base paper DWT-DFT-SVD used but in this paper DWT-DFT replaced by LWT-WHT due to various advantages. One disadvantage of DWT is that the use of larger DWT basis functions or wavelet filters produces blurring and also ringing noise near edges in images. This disadvantage of DWT is overcome in LWT. Other advantages of LWT are that it significantly reduces the computation time and speed up the computation process. This method provides better results in terms of enhanced PSNR values and is able to withstand a variety of image processing attacks and besides this processing time also reduced.
Performance comparison of hybrid wavelet transforms formed using dct, walsh, ...ijcsit
1. The document discusses a proposed watermarking method using hybrid wavelet transforms and singular value decomposition (SVD).
2. Hybrid wavelet transforms are generated from combinations of discrete cosine transform (DCT), Walsh, Haar, and discrete Kekre transform (DKT). DCT is tested as both the global and local component of the hybrid transform.
3. SVD is applied to the watermark before embedding in the mid-frequency coefficients of the hybrid wavelet transformed host image.
4. The method is tested against various attacks including compression, cropping, noise addition, and resizing. Using DCT as the global component is found to be more robust, particularly against compression attacks.
SECURED COLOR IMAGE WATERMARKING TECHNIQUE IN DWT-DCT DOMAIN ijcseit
The multilayer secured DWT-DCT and YIQ color space based image watermarking technique with
robustness and better correlation is presented here. The security levels are increased by using multiple pn
sequences, Arnold scrambling, DWT domain, DCT domain and color space conversions. Peak signal to
noise ratio and Normalized correlations are used as measurement metrics. The 512x512 sized color images
with different histograms are used for testing and watermark of size 64x64 is embedded in HL region of
DWT and 4x4 DCT is used. ‘Haar’ wavelet is used for decomposition and direct flexing factor is used. We
got PSNR value is 63.9988 for flexing factor k=1 for Lena image and the maximum NC 0.9781 for flexing
factor k=4 in Q color space. The comparative performance in Y, I and Q color space is presented. The
technique is robust for different attacks like scaling, compression, rotation etc.
This document presents a new algorithm for progressive medical image coding using binary wavelet transforms (BWT). It divides grayscale medical images into binary bit-planes and applies a three-level BWT to each bit-plane. It then encodes each BWT bit-plane using quadtree-based partitioning to exploit the energy concentration in high-frequency subbands. Experiments on ultrasound, MRI and CT images show it provides significant improvements in bitrate for required quality compared to existing progressive image coding 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.
A Detailed Survey on VLSI Architectures for Lifting based DWT for efficient h...VLSICS Design
Evaluating the previous work is an important part of developing new hardware efficient methods for the implementation of DWT through Lifting schemes. The aim of this paper is to give a review of VLSI architectures for efficient hardware implementation of wavelet lifting schemes. The inherent in place computation of lifting scheme has many advantages over conventional convolution based DWT. The architectures are represented in terms of parallel filter, row column, folded, flipping and recursive structures. The methods for scanning of images are the line-based and the block-based and their characteristics for the given application are given. The various architectures are analyzed in terms of hardware and timing complexity involved with the given size of input image and required levels of decomposition. This study is useful for deriving an efficient method for improving the speed and hardware complexities of existing architectures and to design a new hardware implementation of multilevel DWT using lifting schemes.
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
AN EFFICIENT APPROACH TO DELAY ESTIMATION MODEL FOR VLSI INTERCONNECTBUKYABALAJI
Abstract: In recent days there is huge demand for high
speed VLSI networks. In order to judge the behavior of
on-chip interconnects the coupling capacitances and
interconnect delays plays a major role. As we switch to
lower technology there is on-chip inductance effect that
leads to interconnect delay. In this paper we try to apply
second order transfer function designed with finite
difference equation and Laplace transform at the source
and load termination ends. Analysis shows that current
mode signaling in VLSI interconnects provides times
better delay performance than voltage mode.
Capsulization of Existing Space Time TechniquesIJEEE
1) The document discusses space-time coding techniques used in wireless communication systems to improve reliability of data transmission using multiple transmit antennas.
2) It describes space-time block codes (STBC) such as Alamouti codes and orthogonal designs which transmit redundant copies of data across antennas without loss of data rate.
3) It also discusses space-time trellis codes (STTC) which provide coding gain but have higher complexity than STBCs.
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...ijgca
The ever-increasing status of the cloud computing h
ypothesis and the budding concept of federated clou
d
computing have enthused research efforts towards in
tellectual cloud service selection aimed at develop
ing
techniques for enabling the cloud users to gain max
imum benefit from cloud computing by selecting
services which provide optimal performance at lowes
t possible cost. Cloud computing is a novel paradig
m
for the provision of computing infrastructure, whic
h aims to shift the location of the computing
infrastructure to the network in order to reduce th
e maintenance costs of hardware and software resour
ces.
Cloud computing systems vitally provide access to l
arge pools of resources. Resources provided by clou
d
computing systems hide a great deal of services fro
m the user through virtualization. In this paper, t
he
cloud data center is modelled as
queuing system with a single task arrivals
and a task request buffer of infinite capacity.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A novel rrw framework to resist accidental attackseSAT Journals
Abstract Robust reversible watermarking (RRW) methods are popular in multimedia for protecting copyright, while preserving intactness of host images and providing robustness against unintentional attacks. Robust reversible watermarking (RRW) is used to protect the copyrights and providing robustness against unintentional attacks. The past histogram rotation-based methods suffer from extremely poor invisibility for watermarked images and limited robustness in extracting watermarks from the watermarked images destroyed by unintentional attacks. This paper proposes a wavelet-domain statistical quantity histogram shifting and clustering (WSQH-SC) method and Enhanced pixel-wise masking (EPWM). This method embeds a new watermark image and extraction procedures by histogram shifting and clustering, which are important for improving robustness and reducing run-time complexity. It is possible reversibility and invisibility. By using WSQH-SC methods reversibility, invisibility of watermarks can be achieved. The experimental results show the comprehensive performance in terms of reversibility, robustness, invisibility, capacity and run-time complexity widely applicable to different kinds of images. Keywords: — Integer wavelet transform, k-means clustering, masking, robust reversible watermarking (RRW)
Protection of Multispectral Images using Watermarking and EncryptionIRJET Journal
This document proposes a scheme that combines watermarking and encryption to protect multispectral images. It uses a wavelet-based algorithm for watermark embedding and extraction. For encryption, it uses a multiplicative-transposition cipher that multiplies rows and columns by secret keys and shifts rows and columns. Experimental results show the scheme provides invisibility of the watermark, robustness against attacks, a large data hiding capacity, and strong robustness against compression and noise.
A Wavelet Based Hybrid SVD Algorithm for Digital Image Watermarkingsipij
In this paper we propose a hybrid image watermarking algorithm which satisfies both imperceptibility and robustness requirements. Our proposed work provide an optimum solution by using singular values of Wavelet Transformation’s HL and LH sub bands to embed watermark. Further to increase and control the strength of the watermark, we use a scale factor. An optimal watermark embedding method is developed to achieve minimum watermarking distortion. A secret embedding key is designed to securely embed the fragile watermarks so that the new method is robust to counterfeiting, even when the malicious attackers are fully aware of the watermark embedding algorithm. Experimental results are provided in terms of peak signal to noise ratio (PSNR), normalized cross correlation (NCC) and gain factor to demonstrate the effectiveness of the proposed algorithm. Image operations such as JPEG compression from malicious image attacks and, thus, can be used for semi-fragile watermarking.
Blind Image Watermarking Based on Chaotic MapsITIIIndustries
Security of a watermark refers to its resistance to unauthorized detecting and decoding, while watermark robustness refers to the watermark’s resistance against common processing. Many watermarking schemes emphasize robustness more than security. However, a robust watermark is not enough to accomplish protection because the range of hostile attacks is not limited to common processing and distortions. In this paper, we give consideration to watermark security. To achieve this, we employ chaotic maps due to their extreme sensitivity to the initial values. If one fails to provide these values, the watermark will be wrongly extracted. While the chaotic maps provide perfect watermarking security, the proposed scheme is also intended to achieve robustness.
A Blind Multiple Watermarks based on Human Visual Characteristics IJECEIAES
This document summarizes a research paper that proposes a multiple watermark embedding scheme based on human visual characteristics. The scheme embeds two watermarks in the luminance and chrominance blue components of an image. It uses Arnold scrambling to increase security, and embeds watermarks in the singular value decomposition domain by modifying coefficients based on a threshold. The proposed scheme is evaluated based on imperceptibility using SSIM and robustness using normalized cross-correlation and bit error rate. Experimental results show the scheme provides improved invisibility and resistance to various attacks.
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.
33 8951 suseela g suseela paper8 (edit)new2IAESIJEECS
Modern manufacturing methods permit the study and prediction of surface roughness since the acquisition of signals and its processing is made instantaneously. With the availability of better computing facilities and newer algorithms in the machine learning domain, online surface roughness prediction will lead to the manufacture of intelligent machines that alert the operator when the process crosses the specified range of roughness. Prediction of surface roughness by multiple linear regression, regression tree and M5P tree methods using multivariable predictors and a single response dependent variable Ra (surface roughness) is attempted. Vibration signal from the boring operation has been acquired for the study that predicts the surface roughness on the inner face of the workpiece. A machine learning approach was used to extract the statistical features and analyzed by four different cases to achieve higher predictability, higher accuracy, low computing effort and reduction of the root mean square error. One case among them was carried out upon feature reduction using Principle Component Analysis (PCA) to examine the effect of feature reduction.
34 8951 suseela g suseela paper8 (edit)newIAESIJEECS
The document proposes a low memory and energy efficient image compression technique called Skipped Zonal based Binary DCT (SZBinDCT) for transmitting images over resource constrained visual sensor networks. SZBinDCT first removes alternating rows and columns of pixels to reduce redundancy. It then applies a low complexity Binary DCT transform to the remaining pixels. Only the top left zone of transformed coefficients containing most energy are considered. These coefficients are quantized and entropy encoded using Golomb Rice coding. Simulation results show the technique compresses images to 0.39 bpp with 27.34 dB PSNR while consuming only 11.352 microjoules of energy per 8x8 block, significantly less than other techniques. The low complexity compression allows extended
Corrosion Detection Using A.I : A Comparison of Standard Computer Vision Tech...csandit
In this paper we present a comparison between stand
ard computer vision techniques and Deep
Learning approach for automatic metal corrosion (ru
st) detection. For the classic approach, a
classification based on the number of pixels contai
ning specific red components has been
utilized. The code written in Python used OpenCV li
braries to compute and categorize the
images. For the Deep Learning approach, we chose Ca
ffe, a powerful framework developed at
“Berkeley Vision and Learning Center” (BVLC). The
test has been performed by classifying
images and calculating the total accuracy for the t
wo different approaches.
Hardware progress has enabled solutions which were historically computationally intractable. This is particularly true in video analysis. This technological advance has opened a new frontier of problems. Within this expanse, we have chosen the classic problem of depth inference from images. Specifically, given a sequence of images captured over time, we output depth maps corresponding one-to-one with the input sequence. As a spatiotemporal problem, we were motivated to model it with convolutions (spatial) andLSTMs (temporal). These are used in a U-Net encoder-decoder architecture. The results indicate some potential in such an approach, the process by which we came to this conclusion is detailed below
Hybrid Method For Image Watermarking Using 2 Level LWT-Walsh Transform-SVD in...rahulmonikasharma
Due to tremendous development in technology in recent time and availability of abundant tool, it is very easy for an unauthorized person to imitate crucial information which is present on internet. Therefore to shield valuable information present on internet there are various advanced techniques for example watermarking technique, cryptography technique, steganography and many more. With pace of time analog techniques replaced by digital techniques due to various advantages and in current scenario every country moving towards digitalization. Digital watermarking is a technique through which digital information is embedded into an image and secret digital data can be extracted at receiver side with authentication otherwise impossible to fetch. Spatial domain and frequency are the two techniques through which secret digital information can be embedded. In this paper two level lifting wavelet transform (LWT), Walsh Hadamard transform and singular value decomposition (SVD) technique has been proposed in YCbCr color space. First of all cover image and watermark image converted into YCbCr color space from RGB color space after that one of channel is selected for embedded purpose. Now perform first level LWT on the Y channel of cover and watermark image so that image split into four groups. Now apply second level LWT on any one of four bands. Further Walsh hadamard transform technique applied with singular value decomposition (SVD) technique to get enhanced output. In base paper DWT-DFT-SVD used but in this paper DWT-DFT replaced by LWT-WHT due to various advantages. One disadvantage of DWT is that the use of larger DWT basis functions or wavelet filters produces blurring and also ringing noise near edges in images. This disadvantage of DWT is overcome in LWT. Other advantages of LWT are that it significantly reduces the computation time and speed up the computation process. This method provides better results in terms of enhanced PSNR values and is able to withstand a variety of image processing attacks and besides this processing time also reduced.
Performance comparison of hybrid wavelet transforms formed using dct, walsh, ...ijcsit
1. The document discusses a proposed watermarking method using hybrid wavelet transforms and singular value decomposition (SVD).
2. Hybrid wavelet transforms are generated from combinations of discrete cosine transform (DCT), Walsh, Haar, and discrete Kekre transform (DKT). DCT is tested as both the global and local component of the hybrid transform.
3. SVD is applied to the watermark before embedding in the mid-frequency coefficients of the hybrid wavelet transformed host image.
4. The method is tested against various attacks including compression, cropping, noise addition, and resizing. Using DCT as the global component is found to be more robust, particularly against compression attacks.
SECURED COLOR IMAGE WATERMARKING TECHNIQUE IN DWT-DCT DOMAIN ijcseit
The multilayer secured DWT-DCT and YIQ color space based image watermarking technique with
robustness and better correlation is presented here. The security levels are increased by using multiple pn
sequences, Arnold scrambling, DWT domain, DCT domain and color space conversions. Peak signal to
noise ratio and Normalized correlations are used as measurement metrics. The 512x512 sized color images
with different histograms are used for testing and watermark of size 64x64 is embedded in HL region of
DWT and 4x4 DCT is used. ‘Haar’ wavelet is used for decomposition and direct flexing factor is used. We
got PSNR value is 63.9988 for flexing factor k=1 for Lena image and the maximum NC 0.9781 for flexing
factor k=4 in Q color space. The comparative performance in Y, I and Q color space is presented. The
technique is robust for different attacks like scaling, compression, rotation etc.
This document presents a new algorithm for progressive medical image coding using binary wavelet transforms (BWT). It divides grayscale medical images into binary bit-planes and applies a three-level BWT to each bit-plane. It then encodes each BWT bit-plane using quadtree-based partitioning to exploit the energy concentration in high-frequency subbands. Experiments on ultrasound, MRI and CT images show it provides significant improvements in bitrate for required quality compared to existing progressive image coding 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.
A Detailed Survey on VLSI Architectures for Lifting based DWT for efficient h...VLSICS Design
Evaluating the previous work is an important part of developing new hardware efficient methods for the implementation of DWT through Lifting schemes. The aim of this paper is to give a review of VLSI architectures for efficient hardware implementation of wavelet lifting schemes. The inherent in place computation of lifting scheme has many advantages over conventional convolution based DWT. The architectures are represented in terms of parallel filter, row column, folded, flipping and recursive structures. The methods for scanning of images are the line-based and the block-based and their characteristics for the given application are given. The various architectures are analyzed in terms of hardware and timing complexity involved with the given size of input image and required levels of decomposition. This study is useful for deriving an efficient method for improving the speed and hardware complexities of existing architectures and to design a new hardware implementation of multilevel DWT using lifting schemes.
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
AN EFFICIENT APPROACH TO DELAY ESTIMATION MODEL FOR VLSI INTERCONNECTBUKYABALAJI
Abstract: In recent days there is huge demand for high
speed VLSI networks. In order to judge the behavior of
on-chip interconnects the coupling capacitances and
interconnect delays plays a major role. As we switch to
lower technology there is on-chip inductance effect that
leads to interconnect delay. In this paper we try to apply
second order transfer function designed with finite
difference equation and Laplace transform at the source
and load termination ends. Analysis shows that current
mode signaling in VLSI interconnects provides times
better delay performance than voltage mode.
Capsulization of Existing Space Time TechniquesIJEEE
1) The document discusses space-time coding techniques used in wireless communication systems to improve reliability of data transmission using multiple transmit antennas.
2) It describes space-time block codes (STBC) such as Alamouti codes and orthogonal designs which transmit redundant copies of data across antennas without loss of data rate.
3) It also discusses space-time trellis codes (STTC) which provide coding gain but have higher complexity than STBCs.
PERFORMANCE FACTORS OF CLOUD COMPUTING DATA CENTERS USING [(M/G/1) : (∞/GDM O...ijgca
The ever-increasing status of the cloud computing h
ypothesis and the budding concept of federated clou
d
computing have enthused research efforts towards in
tellectual cloud service selection aimed at develop
ing
techniques for enabling the cloud users to gain max
imum benefit from cloud computing by selecting
services which provide optimal performance at lowes
t possible cost. Cloud computing is a novel paradig
m
for the provision of computing infrastructure, whic
h aims to shift the location of the computing
infrastructure to the network in order to reduce th
e maintenance costs of hardware and software resour
ces.
Cloud computing systems vitally provide access to l
arge pools of resources. Resources provided by clou
d
computing systems hide a great deal of services fro
m the user through virtualization. In this paper, t
he
cloud data center is modelled as
queuing system with a single task arrivals
and a task request buffer of infinite capacity.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A novel rrw framework to resist accidental attackseSAT Journals
Abstract Robust reversible watermarking (RRW) methods are popular in multimedia for protecting copyright, while preserving intactness of host images and providing robustness against unintentional attacks. Robust reversible watermarking (RRW) is used to protect the copyrights and providing robustness against unintentional attacks. The past histogram rotation-based methods suffer from extremely poor invisibility for watermarked images and limited robustness in extracting watermarks from the watermarked images destroyed by unintentional attacks. This paper proposes a wavelet-domain statistical quantity histogram shifting and clustering (WSQH-SC) method and Enhanced pixel-wise masking (EPWM). This method embeds a new watermark image and extraction procedures by histogram shifting and clustering, which are important for improving robustness and reducing run-time complexity. It is possible reversibility and invisibility. By using WSQH-SC methods reversibility, invisibility of watermarks can be achieved. The experimental results show the comprehensive performance in terms of reversibility, robustness, invisibility, capacity and run-time complexity widely applicable to different kinds of images. Keywords: — Integer wavelet transform, k-means clustering, masking, robust reversible watermarking (RRW)
Protection of Multispectral Images using Watermarking and EncryptionIRJET Journal
This document proposes a scheme that combines watermarking and encryption to protect multispectral images. It uses a wavelet-based algorithm for watermark embedding and extraction. For encryption, it uses a multiplicative-transposition cipher that multiplies rows and columns by secret keys and shifts rows and columns. Experimental results show the scheme provides invisibility of the watermark, robustness against attacks, a large data hiding capacity, and strong robustness against compression and noise.
A Wavelet Based Hybrid SVD Algorithm for Digital Image Watermarkingsipij
In this paper we propose a hybrid image watermarking algorithm which satisfies both imperceptibility and robustness requirements. Our proposed work provide an optimum solution by using singular values of Wavelet Transformation’s HL and LH sub bands to embed watermark. Further to increase and control the strength of the watermark, we use a scale factor. An optimal watermark embedding method is developed to achieve minimum watermarking distortion. A secret embedding key is designed to securely embed the fragile watermarks so that the new method is robust to counterfeiting, even when the malicious attackers are fully aware of the watermark embedding algorithm. Experimental results are provided in terms of peak signal to noise ratio (PSNR), normalized cross correlation (NCC) and gain factor to demonstrate the effectiveness of the proposed algorithm. Image operations such as JPEG compression from malicious image attacks and, thus, can be used for semi-fragile watermarking.
Blind Image Watermarking Based on Chaotic MapsITIIIndustries
Security of a watermark refers to its resistance to unauthorized detecting and decoding, while watermark robustness refers to the watermark’s resistance against common processing. Many watermarking schemes emphasize robustness more than security. However, a robust watermark is not enough to accomplish protection because the range of hostile attacks is not limited to common processing and distortions. In this paper, we give consideration to watermark security. To achieve this, we employ chaotic maps due to their extreme sensitivity to the initial values. If one fails to provide these values, the watermark will be wrongly extracted. While the chaotic maps provide perfect watermarking security, the proposed scheme is also intended to achieve robustness.
A Blind Multiple Watermarks based on Human Visual Characteristics IJECEIAES
This document summarizes a research paper that proposes a multiple watermark embedding scheme based on human visual characteristics. The scheme embeds two watermarks in the luminance and chrominance blue components of an image. It uses Arnold scrambling to increase security, and embeds watermarks in the singular value decomposition domain by modifying coefficients based on a threshold. The proposed scheme is evaluated based on imperceptibility using SSIM and robustness using normalized cross-correlation and bit error rate. Experimental results show the scheme provides improved invisibility and resistance to various attacks.
A CONTENT BASED WATERMARKING SCHEME USING RADIAL SYMMETRY TRANSFORM AND SINGU...cscpconf
The Watermarking techniques represent actually a very important issue in digital multimedia
content distribution. To protect digital multimedia content we embed an invisible watermark
into images which facilitate the detection of different manipulations, duplication, illegitimate
distributions of these images. In this paper we present an approach to embedding invisible
watermarks into color images using a robust transform of images that is the Radial symmetry
transform. The watermark is inserted in blocs of eight pixels large of the blue channel using the
Singular Value Decomposition (SVD) of these blocs and those of the radial symmetry transform.
The insertion in the blue channel is justified when we know that many works states that the
human visual system is less sensible to perturbation in the blue channel of the image. Results
obtained after tests show that the imperceptibility of the watermark using this approach is good
and its robustness face to different attacks leads to think that the proposed approach is a very
promising one.
A SEMI-BLIND WATERMARKING SCHEME FOR RGB IMAGE USING CURVELET TRANSFORMijfcstjournal
In this paper, a semi-blind watermarking technique of embedding the color watermark using curvelet
coefficient in RGB cover image has been proposed. The technique used the concept of HVS that the human
eyes are not much sensitive to blue color. So the blue color plane of the cover image is used as embedding
domain. A bit planes method is also used, the most significant bit (MSB) plane of watermark image is used
as embedding information. Selected scale and orientation of the curvelet coefficients of the blue channel in
the cover image has been used for embedding the watermark information. All other 0-7 bit planes are used
as a key at the time of extraction. The results of the watermarking scheme have been analyzed by different
quality assessment metric such as PSNR, Correlation Coefficient (CC) and Mean Structure Similarity Index
Measure (MSSIM). The experimental results show that the proposed technique gives the good invisibility of
watermark, quality of extracted watermark and robustness against different attacks.
IRJET- Human Fall Detection using Co-Saliency-Enhanced Deep Recurrent Convolu...IRJET Journal
This document summarizes a research paper that proposes a new method for detecting human falls in videos using deep learning. The method uses a recurrent convolutional neural network (RCN) that applies convolutional neural networks (CNNs) to video segments and connects them with long short-term memory (LSTM) to model temporal relationships. It also enhances video frames using co-saliency detection to highlight important human activity regions before feeding them to the RCN. The researchers tested the method on a dataset of 768 video clips from 4 activity classes and achieved 98.12% accuracy at detecting falls, demonstrating the effectiveness of the co-saliency-enhanced RCN approach.
SVD Based Robust Digital Watermarking For Still Images Using Wavelet Transform cscpconf
This paper aims at developing a hybrid image watermarking algorithm which satisfies both
imperceptibility and robustness requirements. In order to achieve our objectives we have used
singular values of Wavelet Transformation’s HL and LH sub bands to embed watermark.
Further to increase and control the strength of the watermark, we use a scale factor. An optimal
watermark embedding method is developed to achieve minimum watermarking distortion. A
secret embedding key is designed to securely embed the fragile watermarks so that the new
method is robust to counterfeiting, even when the malicious attackers are fully aware of the
watermark embedding algorithm. Experimental results are provided in terms of Peak signal to
noise ratio (PSNR), Normalized cross correlation (NCC) and gain factor to demonstrate the
effectiveness of the proposed algorithm. Image operations such as JPEG compression from
malicious image attacks and, thus, can be used for semi-fragile watermarking
Robust Watermarking Technique using 2D Logistic Map and Elliptic Curve Crypto...idescitation
Copyright protection is a vital issue in modern day’s data transmission over
internet. For copyright protection, watermarking technique is extensively used. In this
paper, we have proposed a robust watermarking scheme using 2D Logistic map and elliptic
curve cryptosystem (ECC) in the DWT domain. The combined encryption has been taken to
enhance the security of the watermark before the embedding phase. The PSNR value shows
the difference between original cover and embedded cover is minimal. Similarly, NC values
show the robustness and resistance capability of the proposed technique from the common
attacks such as scaling, Gaussian noise etc. Thus, this combined version of 2D Logistic map
and Elliptic curve cryptosystem can be used in case of higher security requirement of the
watermark signal.
The document describes a proposed hybrid digital image watermarking technique that uses discrete wavelet transform (DWT) and singular value decomposition (SVD). The technique works as follows:
1) The cover image is decomposed into subbands using one-level DWT. SVD is then applied to intermediate frequency subbands.
2) The watermark is divided into parts and embedded into the singular values of the subbands by modifying the singular values.
3) Experimental results show the technique achieves good imperceptibility and robustness against various attacks, outperforming other DWT-SVD based techniques. The technique requires less SVD computation than other methods.
IRJET- Security Efficiency of Transfering the Data for Wireless Sensor Ne...IRJET Journal
This document discusses security challenges in wireless sensor networks, specifically for wireless body area networks (WBANs). It proposes a new medium access control (MAC) protocol called SDMAC to detect and prevent selfish attacks in WBANs. The SDMAC protocol can identify rogue nodes and block abnormal activities to improve network performance. Simulation results using NS3 show that SDMAC performs better than existing protocols in terms of energy efficiency and throughput reduction.
Implementation of digital image watermarking techniques using dwt and dwt svd...eSAT Journals
computerized substance. Data took care of on web and mixed media system framework is in advanced structure. Computerized watermarking is only the innovation in which there is inserting of different data in advanced substance, which we need to shield from illicit replicating. Computerized picture watermarking is concealing data in any structure (content, picture, sound and video) in unique picture without corrupting its perceptual quality. On the off chance that of Discrete Wavelet Transform (DWT), deterioration of the first picture is completed to insert the watermark. Moreover, if there should arise an occurrence of cross breed system (DWT-SVD) firstly picture is decayed by and after that watermark is installed in solitary qualities acquired by application of Singular Value Decomposition (SVD). DWT and SVD are utilized in combination to enhance the nature of watermarking. We have the procedures which are looked at on the premise of Peak Signal to Noise Ratio (PSNR) esteem at various benefits of scaling component; high estimation of PSNR is coveted because it displays great intangibility of the strategy.
Implementation of digital image watermarking techniques using dwt and dwt svd...eSAT Journals
Abstract
These days, in every field there is gigantic utilization of computerized substance. Data took care of on web and mixed media system framework is in advanced structure. Computerized watermarking is only the innovation in which there is inserting of different data in advanced substance, which we need to shield from illicit replicating. Computerized picture watermarking is concealing data in any structure (content, picture, sound and video) in unique picture without corrupting its perceptual quality. On the off chance that of Discrete Wavelet Transform (DWT), deterioration of the first picture is completed to insert the watermark. Moreover, if there should arise an occurrence of cross breed system (DWT-SVD) firstly picture is decayed by and after that watermark is installed in solitary qualities acquired by application of Singular Value Decomposition (SVD). DWT and SVD are utilized in combination to enhance the nature of watermarking. We have the procedures which are looked at on the premise of Peak Signal to Noise Ratio (PSNR) esteem at various benefits of scaling component; high estimation of PSNR is coveted because it displays great intangibility of the strategy.
PREVENTING COPYRIGHTS INFRINGEMENT OF IMAGES BY WATERMARKING IN TRANSFORM DOM...ijistjournal
1) The document discusses a method for preventing copyright infringement of images using watermarking in the transform domain and a full counter propagation neural network.
2) It aims to encode the host image before watermark embedding to enhance security. The fast and effective full counter propagation neural network then helps successfully embed the watermark without deteriorating the image quality.
3) Previous techniques embedded watermarks directly in images, but the authors find neural network synapses provide a better way to reduce distortion and increase message capacity when embedding watermarks.
A BLIND ROBUST WATERMARKING SCHEME BASED ON SVD AND CIRCULANT MATRICEScsandit
Multimedia security has been the aim point of considerable research activity because of its wide
application area. The major technology to achieve copyright protection, content authentication,
access control and multimedia security is watermarking which is the process of embedding data
into a multimedia element such as image or audio, this embedded data can later be extracted
from, or detected in the embedded element for different purposes. In this work, a blind
watermarking algorithm based on SVD and circulant matrices has been presented. Every
circulant matrix is associated with a matrix for which the SVD decomposition coincides with the
spectral decomposition. This leads to improve the Chandra algorithm [1], our presentation will
include a discussion on the data hiding capacity, watermark transparency and robustness
against a wide range of common image processing attacks.
Improved Quality of Watermark Image by using Integrated SVD with Discrete Wav...IRJET Journal
This document proposes a new digital image watermarking technique that integrates discrete wavelet transform (DWT) with differential evolution based singular value decomposition (SVD) to improve imperceptibility and robustness. Existing watermarking methods are susceptible to multiple attacks on watermarked images. The proposed method applies DWT to decompose the image into sub-bands, then uses differential evolution optimized SVD to embed the watermark in singular values. Experimental results show the technique enhances visual quality and improves metrics like peak signal-to-noise ratio, structural similarity index, and root mean square error compared to existing approaches, indicating greater resistance to attacks on watermarked images.
Robust Watermarking through Dual Band IWT and Chinese Remainder TheoremjournalBEEI
CRT was a widely used algorithm in the development of watermarking methods. The algorithm produced good image quality but it had low robustness against compression and filtering. This paper proposed a new watermarking scheme through dual band IWT to improve the robustness and preserving the image quality. The high frequency sub band was used to index the embedding location on the low frequency sub band. In robustness test, the CRT method resulted average NC value of 0.7129, 0.4846, and 0.6768 while the proposed method had higher NC value of 0.7902, 0.7473, and 0.8163 in corresponding Gaussian filter, JPEG, and JPEG2000 compression test. Meanwhile the both CRT and proposed method had similar average SSIM value of 0.9979 and 0.9960 respectively in term of image quality. The result showed that the proposed method was able to improve the robustness and maintaining the image quality.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Nunit vs XUnit vs MSTest Differences Between These Unit Testing Frameworks.pdfflufftailshop
When it comes to unit testing in the .NET ecosystem, developers have a wide range of options available. Among the most popular choices are NUnit, XUnit, and MSTest. These unit testing frameworks provide essential tools and features to help ensure the quality and reliability of code. However, understanding the differences between these frameworks is crucial for selecting the most suitable one for your projects.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
Trusted Execution Environment for Decentralized Process MiningLucaBarbaro3
Presentation of the paper "Trusted Execution Environment for Decentralized Process Mining" given during the CAiSE 2024 Conference in Cyprus on June 7, 2024.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
Letter and Document Automation for Bonterra Impact Management (fka Social Sol...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on automated letter generation for Bonterra Impact Management using Google Workspace or Microsoft 365.
Interested in deploying letter generation automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
A Comprehensive Guide to DeFi Development Services in 2024Intelisync
DeFi represents a paradigm shift in the financial industry. Instead of relying on traditional, centralized institutions like banks, DeFi leverages blockchain technology to create a decentralized network of financial services. This means that financial transactions can occur directly between parties, without intermediaries, using smart contracts on platforms like Ethereum.
In 2024, we are witnessing an explosion of new DeFi projects and protocols, each pushing the boundaries of what’s possible in finance.
In summary, DeFi in 2024 is not just a trend; it’s a revolution that democratizes finance, enhances security and transparency, and fosters continuous innovation. As we proceed through this presentation, we'll explore the various components and services of DeFi in detail, shedding light on how they are transforming the financial landscape.
At Intelisync, we specialize in providing comprehensive DeFi development services tailored to meet the unique needs of our clients. From smart contract development to dApp creation and security audits, we ensure that your DeFi project is built with innovation, security, and scalability in mind. Trust Intelisync to guide you through the intricate landscape of decentralized finance and unlock the full potential of blockchain technology.
Ready to take your DeFi project to the next level? Partner with Intelisync for expert DeFi development services today!
Your One-Stop Shop for Python Success: Top 10 US Python Development Providersakankshawande
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
Ba36317323
1. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
RESEARCH ARTICLE
www.ijera.com
OPEN ACCESS
A Novel Lossless Robust Reversible Watermarking Method for
Copyright Protection of Images
Sidham Abhilash1, S M Shamseerdaula2
1
2
M.Tech (CSP), GPREC, Kurnool.
Asst Professor, GPREC, Kurnool.
Abstract
Robust reversible watermarking (RRW) methods are popular in multimedia for protecting copyright, while
preserving intactness of host images and providing robustness against unintentional attacks. However,
conventional RRW methods are not readily applicable in practice. That is mainly because: 1) they fail to offer
satisfactory reversibility on large-scale image datasets; 2) they have limited robustness in extracting watermarks
from the watermarked images destroyed by different unintentional attacks; and 3) some of them suffer from
extremely poor invisibility for watermarked images. There-fore, it is necessary to have a framework to address
these three problems, and further improve its performance. This paper presents a novel pragmatic framework,
wavelet-domain statistical quantity histogram shifting and clustering (WSQH-SC). Compared with conventional
methods, WSQH-SC ingeniously constructs new watermark embedding and extraction procedures by histogram
shifting and clustering, which are important for improving robustness and reducing run-time complexity.
Additionally, WSQH-SC includes the property-inspired pixel adjustment to effectively handle overflow and
underflow of pixels. This results in satisfactory reversibility and invisibility. Furthermore, to increase its
practical applicability, WSQH-SC designs an enhanced pixel-wise masking to balance robustness and
invisibility. We perform extensive experiments over natural, medical, and synthetic aperture radar images to
show the effectiveness of WSQH-SC by comparing with the histogram rotation-based and histogram
distribution constrained methods.
Index Terms— Integer wavelet transform, k-means clustering, masking, robust reversible watermarking
(RRW).
I.
INTRODUCTION
REVERSIBLE
WATERMARKING
(RW) methods are used to embed watermarks, e.g.,
secret information, into digital media while
preserving high intactness and good fidelity of host
media. It plays an important role in protecting
copyright and content of digital media for sensitive
applications, e.g., medical and military images.
Although researchers proposed some RW methods
for various media, e.g., images, audios, videos, And
3-D meshes; they assume the transmission channel is
lossless. The robust RW (RRW) is thus a challenging
task. For RRW, the essential objective is to
accomplish watermark embedding and extraction in
both lossless and lossy environment. As a result,
RRW is required to not only recover host images and
Watermarks without distortion for the lossless
channel, but also resist unintentional attacks and
extract as many watermarks as possible for the noised
channel. Recently, a dozen of RRW methods for
digital images have been proposed, which can be
classified into two groups: histogram rotation (HR)based methods and histogram distribution constrained
(HDC) methods.
The HR-based methods, accomplish robust
loss-less embedding by slightly rotating the cancroids
vectors of two random zones in the no overlapping
www.ijera.com
blocks. Due to the close correlation of neighboring
pixels, these methods were reported to be robust
against JPEG compression. However, they are
sensitive to “salt-and-pepper” noise, which leads to
poor visual quality of watermarked images, and
impedes lossless recovery of host images and
watermarks. To solve this problem, the HDC methods
have been developed in spatial-and wavelet-domains,
which divide image blocks into different types and
embed the modulated watermarks for each type based
on histogram distribution. Unfortunately, these
methods suffer from unstable reversibility and
robustness according to. In summary, the above
analysis shows that both kinds of RRW methods are
not readily applicable in practice. Therefore, a novel
pragmatic RRW framework with the following three
objectives is of great demand:
1) Reversibility, i.e., how to handle both overflow
and underflow of pixels;
2) Robustness, i.e., how to resist unintentional
attacks; and
3) Invisibility, i.e., how to make a trade-off between
robustness and invisibility.
In this paper, motivated by the excellent
spatial-frequency localization properties of wavelet
transform, we develop a novel RRW framework in
the wavelet domain. This framework uses the
317 | P a g e
2. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
statistical quantity histogram (SQH) as the embedding
carrier inspired by our previous work, the generalized
SQH (GSQH) driven method [14], and constructs
new watermark embedding and extraction processes
by histogram shifting and clustering. In this
framework, we carefully design the three key
components, which are the property inspired pixel
adjustment (PIPA), the SQH shifting and clustering,
and the enhanced pixel-wise masking (EPWM), to
effectively solve the aforementioned three problems.
In particular:
1) PIPA: To successfully avoid both overflow and
under-flow of pixels, we develop PIPA to
investigate the intrinsic relationship between
wavelet coefficient and pixel changes in order to
determine how to duly change wavelet
coefficients during the embedding process. By
taking the scale and region of wavelet coefficient
changes into account, PIPA preprocesses the host
images accordingly by adjusting the pixels
possible to overflow and underflow into a
reliable range before embedding. Finally, the
preprocessed host images are used to embed
watermarks.
2) SQH Shifting and Clustering: To better resist
unintentional attacks, we build SQH with
threshold constraint by deeply studying
characteristics of the wavelet coefficients, design
the watermark embedding process by bidirectionally shifting SQH, and adopt the kmeans clustering algorithm to recover
watermarks by creatively modeling the extraction
process as a classification problem. Besides from
superior robustness, this way simplifies
watermark embedding and extraction, and
reduces the run-time complexity of the proposed
frame-work.
3) EPWM: To effectively balance robustness and
invisibility, we consider the local sensitivity of
human visual system (HVS) in wavelet domain,
and design an EPWM to precisely evaluate the
just noticeable distortion (JND) thresholds of
wavelet coefficients, which thereafter are used to
adaptively optimize watermark strength. Because
the SQH shifting and clustering are employed for
watermark
embedding
and
extraction,
respectively, we term the proposed framework
the wavelet-domain SQH shifting and clustering
or WSQH-SC for short. WSQH-SC has the
following advantages: 1) it not only offers the
robust and lossless watermark embedding and
extraction processes by integrating SQH shifting
and clustering, but also duly introduces
perceptual characteristics of HVS to the RRW
field, forming a novel yet pragmatic RRW
framework; 2) it out performs the two
representative kinds of RRW methods in terms of
reversibility, robustness, invisibility, capacity,
and run-time complexity; 3) it is widely
applicable to different kinds of images; and 4) it
www.ijera.com
www.ijera.com
is readily applicable in practice with the help of
strong robustness and optimal performance tradeoff..The rest of this paper is organized as follows.
Section II briefs the related works for readers to
better understand the proposed framework. In
Section III, we detail the proposed framework
with four modules including PIPA, SQH
constructions, EPWM-based embedding, and
extraction based on k-means clustering. The
experimental results in Section IV and Section V
thoroughly demonstrate the effectiveness and
superiority of the proposed framework, and
Section VI concludes this paper.
II.
RELATED WORKS
In this section, we briefly introduce the
GSQH driven method and discuss its useful
inspirations to our novel framework. Thereafter, a
popular pixel-wise masking (PWM) model is
presented to lay the groundwork for the proposed
EPWM.
A. GSQH Driven Method:
The histogram plays an important role in
many practical models and applications, e.g.,
histogram of oriented gradient features, bag-of-words,
and digital watermarking. For RW methods, SQH has
recently received considerable attention due to
stability and simplicity, e.g., arithmetic average of
difference (AAD) histogram, difference histogram,
and prediction error histogram. In particular, we
proposed a GSQH driven method, which embeds and
extracts watermarks by SQH shifting. The following
is a brief review of this method.
Given a t-bit host image I with n∗ no
overlapping blocks, its SQH can be generated by
calculating the AAD of each block. For convenience,
we denote the SQH by a set of data pairs, i.e., X =
{(x1, n1) , . . . , (xi , n i ) , . . . , (x m∗ , nm∗ )}, where xi
represents the different values of the AAD, and ni is
the corresponding frequency of xi in SQH. Let xr and
xl be the two peak points of SQH, wherein
r
arg max ni , 1 i m∗
=
i
≤ ≤
(1)
and
arg max ni , 1
i m∗ , i _ r.
(2)
=
i
≤ ≤
=
Suppose xl ≤ xr , then the embedding is done
according to
sk − z − 1,
if sk < xl − z
l
w
sk =
sk − bk (z + 1) ,
0,
sk + bk (z + 1) ,
if xl − z ≤ sk ≤ xl
if xl < sk < xr
if xr ≤ sk ≤ xr + z
(3)
sk + z + 1,
if sk > xr + z
in which sk and skw are the AADs of the kth block in
the host and watermarked images, respectively, bk ∈
{0, 1} is the kth watermark bit, and z ≥ 0 is a scale
factor. Correspondingly, the watermarking extraction
318 | P a g e
3. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
is defined as
0,
1
if x
z
l−
r
bk =
sw
xl or xr sw
≤k ≤ w
≤ k ≤
r
≤
if xl − 2z − 1
1,
x
w
s
k
z
+
x
≤ l − z − 1 or
(4)
Where bkr is the kth extracted watermark bit. Finally,
the host image can be recovered without distortion
using the inverse operation of (3) when the
watermarked image is not degraded by unintentional
attacks. Extensive experimental results suggest that
the GSQH driven method has its pros and cons. On
one hand, it combines GSQH and histogram shifting
together to obtain good performance. On the other
hand, however, it has three shortcomings: 1) it uses
the AADs of all of the blocks, both reliable and
unreliable, to generate the SQH of the host image,
which increases complexity of watermark embedding;
2) it fails to consider the optimization of watermark
strength; and 3) it suffers from unstable robustness
against JPEG compression. By taking these pros and
cons into account, we therefore integrate PIPA, SQH
shifting, clustering, and EPWM into a novel RRW
framework, which effectively overcomes the above
shortcomings and makes our work intrinsically
different from existing RRW methods
xr + z + 1 ≤ sk
≤ xr + 2z + 1
B.PWM
The past years have witnessed the
significance of HVS in various applications and many
visual masking algorithms revealing the perceptual
characteristics of HVS have been applied to digital
watermarking. In particular a PWM algorithm
proposed by Bami et al. has received much publicity,
which computes the JND threshold of each
Here, _ (ρ, ω), _ (ρ, i, j ) and (ρ, i, j ) evaluate
resolution, brightness, and texture sensitivities,
respectively, defined by wavelet coefficient based on
resolution sensitivity, brightness sensitivity, and
texture sensitivity. Given the wavelet coefficient cρω
(i, j ) at (i, j ) in the sub-band cρω with resolution level
ρ ∈ {0, 1, 2, 3} and orientation ω ∈ {L L , L H, H L ,
H H}, the JND threshold is denoted by JNDρω (i, j ) =
_ (ρ, ω) _ (ρ, i, j ) (ρ, i, j )0.02 . (5)
√
if ω = H H
otherwise
2,
=
1,
if ρ = 0
0.32,
·0.16,
if ρ = 1 (6)
if ρ = 2
0.10,
_ (ρ, ω)
1.00,
if ρ = 3
and
_ (ρ, i, j )
1
=
+
1 − (ρ, i, j ) , if (ρ, i, j ) < 0.5
(ρ, i, j ) ,
otherwise
www.ijera.com
(7)
www.ijera.com
i
(ρ, i, 25
j ) = 6 c3L L 1 + 23 ρ
−
ckω+ρ
j
, 1 + 23 ρ
−
(8)
x + 2k , y + 2k
i
j
23−
23−
×Var c3L L 1 + x + ρ , 1 + y + ρ
x = 0,
1
y = 0,
1.
(9)
In summary, PWM estimates how HVS
perceives disturbances in images by considering the
resolution, brightness, and texture sensitivities.
However, it is not precise enough because the lowpass sub-band at the forth resolution level, i.e., c3L L ,
has less image content, which ends up with the
approximate estimation of texture and brightness. To
solve this problem, we design the EPWM to better
depict local sensitivity of HVS, which not only
improves texture and brightness sensitivities but also
optimizes the sensitivity weight. In the next section,
EPWM is used to adaptively adjust watermark
strength, which is helpful for increasing practical
applicability of the proposed framework.
III.
PROPOSED FRAMEWORK
In this section, we introduce a new RRW
framework, i.e., WSQH-SC, which accomplishes the
robust lossless embedding task by incorporating the
merits of SQH shifting, k-means clustering and
EPWM. WSQH-SC comprises two processes
watermark embedding and extraction. In view of their
similarity, Fig. 1 only shows the diagram of the
embedding process in which the three modules are
termed: 1) PIPA; 2) SQH construction; and 3)
EPWM-based embedding, and they are detailed in the
following three subsections. To be specific WSQHSC first investigates the wavelet sub-band properties
in depth and exploits PIPA to preprocess the host
image which is of great importance to avoid both
overflow and underflow of pixels during the
embedding process. Afterward the host image is
decomposed by the 5/3 integer wavelet transform
(IWT) and the blocks of interest in the sub-band c0H L
are selected to generate the SQH with the help of the
threshold constraint. Finally, watermarks can be
embedded into the selected blocks by histogram
shifting, wherein EPWM is designed to adaptively
control watermark strength. After the IWT
reconstruction, the watermarked image is obtained
319 | P a g e
4. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
A. PIPA
In RRW, how to handle both overflow and
underflow of pixels is important for reversibility.
Xuan et al. proposed a pixel adjustment strategy to
tackle this problem. Unfortunately, it cannot be
directly applied to wavelet domain because the
adjustment scale related to wavelet transform is
unknown. As a consequence, we develop PIPA to
handle this problem. Firstly, PIPA deeply exploits the
intrinsic relationship between wavelet coefficient and
www.ijera.com
pixel changes. Secondly, by taking the scale and
region of wavelet coefficient changes into
consideration, PIPA determines the adjustment scale
and employs the pixel adjustment strategy to
preprocess the host images. To better present the
technical details of PIPA, Table III gives the 5/3 filter
coefficients. Based on this, we investigate the effects
of changing wavelet coefficients on pixels from two
aspects.
Fig. 1. Embedding process of the proposed wavelet-domain SQH shifting and clustering framework. (a) PIPA. (b)
SQH construction. (c) EPWM based embedding.
For convenience, we denote the wavelet
coefficient c0ω (i, j )
in the sub-band c0ω as ciω, j , wherein 1 ≤ i ≤ M, 1 ≤ j
≤ N, and M × N is the size of c0ω .
1) Single Sub-Band and Single Wavelet
Coefficient:
Given the watermark strength λ, we consider
the changes of pixels when an arbitrary wavelet
coefficient in c0ω is changed. In particular, if ciω, j ←
ciω, j + λ, the corresponding changes of pixels in terms
of scale and region are shown in Table III, wherein
the affected region is represented by the location of
the center, v L = [1, 2, 1] and v H = [1, 2, −6, 2, 1].
From Table III, we can derive three
properties: 1) intra-band correlation, i.e., the pixel
regions affected by the neigh-boring wavelet
coefficients in a sub-band are overlapped;
2)
inter-band correlation:, i.e., the regions
affected by the wavelet coefficients in different subbands are also overlapped; and 3) bi-directional
change, i.e., the grayscale values of pixels affected by
the wavelet coefficients in the c0H L , c0L H , and c0H H
sub-bands are both increased and decreased. Based on
this,
www.ijera.com
Fig.2. Example of the effects of changing wavelet
coefficients on pixels based on multiple sub-bands
and multiple wavelet coefficients.
1) Multiple Sub-Bands and Multiple Wavelet
Coefficients:
Considering an arbitrary block with the top left corner
at ( p, q) in c0ω , 1 ≤ p < M, 1 ≤ q < N, we investigate
the changes of wavelet coefficients and pixels in two
special cases, as shown in Table IV. Here, v F = [0, 0,
1, 0, 1, 0, . . . , 1, 0, 0]2×h−1, vG = [1, 2, . . . , 2, 1]2×w−3
and the affected region of pixels is Denoted by the
location of its top left corner. To further illus-trade
such effects, Fig. 2 shows an example in which the
block size is 3 × 3, and the wavelet coefficients of
320 | P a g e
5. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
two neighboring blocks in c0L L and c0L H are changed
simultaneously.
With Table IV and Fig. 2, we can deduce
that: 1) the affected pixel regions are no overlapped
when the wavelet coefficients of neighboring blocks
are changed at the same time and 2) the pixel changes
are mono directional and the maximum change scale
equals λ. In this case, we can easily Determine the
adjustment scale and use the pixel adjustment strategy
to preprocess host images. In particular, given a t-bit
host image I with the size of 2M × 2N, the pixel
adjustment is performed by
B.SQH Construction
In this subsection, we consider the SQH
construction task with a threshold constraint. Inspired
by characteristics of the wavelet coefficients, we
focus on the mean of wavelet coefficients (MWC)
histogram by taking the following two properties into
account : 1) it is designed in high pass sub band of
wavelets decomposition to which HVS is less
sensitive, leading to high invisibility of watermarked
images and 2) it has almost a zero mean and
Laplacian like distribution based on the experimental
study of wavelet high pass is stable for different
images. In particular, an MWC histogram is generated
based on the following procedure.
Consider a given host image I, we first
decompose I using 5/3 IWT to obtain the sub band
then divide into n non overlapping blocks. Let S =
[S1,….Sk,…..Sn] be the MWC’s in the sub band,
then the MWC of the kth blocks, Sk is defined as
To consider the MWC histogram our
concern is the possibility of utilizing the blocks of
interest in a sub band which will be helpful of
simplifying the embedding process . In view of the
histogram distribution of MWC, only the peak and its
neighbor in the histogram are mostly useful for the
embedding task . Therefore, a threshold constraint is
applied to the block to retain those of interest ,each of
which satisfies the following condition
where d (·) computes the Euclidean distance
of two elements x ∈ {xl , xr } represents the
aforementioned two peak points and δ is a predefined
constant for threshold control. When δ ≥ max {d (xl ,
min (S)) , d (xr , max (S))}, all of the blocks will be
retained for embedding, which is a special case of this
constraint. Moreover, with the help of the threshold
constraint the capacity can be controlled flexibly.
C. EPWM-Based Embedding:
It has been well acknowledged that a balance
between invisibility and robustness is important for
robust watermarking methods. Although many efforts
have been made to design lossless embedding models,
little progress has been made in this trade-off.
Therefore, we develop EPWM to tackle this problem
by utilizing the JND thresholds of wavelet coefficients
to optimize watermark strength. In view of the
disadvantages of PWM discussed in Section II,
www.ijera.com
www.ijera.com
EPWM focuses on improving the local sensitivity of
images to noise by mainly estimating brightness and
texture sensitivities in a more precise way
Motivated by the benefits of luminance
masking [34], we first redefine the brightness
sensitivity in by calculating the luminance masking of
the low-pass sub-band at resolution level ρ, denoted
as
D. Extraction:
If watermarked images are transmitted
through an ideal channel, we can directly adopt the
inverse operation of (19) to recover host images and
watermarks. However, in the real environment,
degradation may be imposed on watermarked images
due to unintentional attacks, e.g., lossy compression
and random noise. Therefore, it is essential to find an
effective watermark extraction algorithm so that it can
resist unintentional attacks in the lossy environment.
Based on the aforementioned embedding model in
the MWC histogram of watermarked images are
divided into three parts shown in Fig. 3, in which the
center part corresponds to watermark bit “0” and
others to bit “1.” To extract the embedded
watermarks, the key issue is to partition these parts
dynamically. In the lossy environment, this is very
difficult because the histogram distribution of MWC
is destroyed by unintentional attacks, as reported in
[14]. In this paper, by investigating the effects of
unintentional attacks on histogram we treat the
partition as a clustering problem with a certain
number of clusters and adopt k-means clustering
algorithm to tackle this problem for simplicity Similar
to the embedding process, we first decompose the
watermarked image with 5/3 IWT and construct the
MWC histogram by calculating the MWCs of blocks
of interest in the sub-band cH L . Let Sw = S1w...…Smw
the obtained MWCs, F =f1, . . . , fμ be the cluster
centers, and g= g1, . . . , gμ be the set of clusters, be the
set of clusters of clusters. The above classification
process is summarized in Table V. Particularly; the
initial cluster centers are given by considering the
features of the embedding process. e.g. F = {τ
min(Sw) , 0, Rmax(Sw)} for μ = 3, to improve the
efficiency of classification. Based on the results of
classification, the embedded watermarks can be
extracted by
IV.
IV. Result
The watermarking performed with the RRW
method is more robust than the bit-plane slicing, as it
withstands nearly all attacks. Cropping was the most
detrimental to the extracted watermark, while image
enhancement (Unsharp filter) provided the best
extracted watermark. Bit-plane slicing was extremely
vulnerable to any sort of smoothing or averaging
filters, as the watermark failed to be appropriately
discernable after these attacks in all cases. Bit-plane
slicing responded the best to scalar changes and
performed acceptably when attacked with cropping.
321 | P a g e
6. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
While not as robust as the RRW watermarking
method, bit-plane slicing performs acceptably as a
fragile watermark as long as smoothing or averaging
is not involved. It does allow one to discern how
much an image has been tampered with to some
V.
CONCLUSION
In this paper, we have developed a novel yet
pragmatic framework for RRW. It includes carefully
designed PIPA, SQH shifting and clustering, and
EPWM, each of which handles a specific problem in
RRW. PIPA preprocesses host images by adjusting
the pixels into a reliable range for satis-factory
reversibility. SQH shifting and clustering constructs
new watermark embedding and extraction processes
for good robustness and low run-time complexity.
EPWM precisely estimates the local sensitivity of
www.ijera.com
www.ijera.com
degree, but only in approximately half of the attacks.
Table1. Results of various morphological attacks on
the images in Figure . Images that was watermarked
and attacked. Experimental results of the RRW
method can be seen in the Figure .
HVS and adaptively optimizes the watermark strength
for a trade-off between robustness and invisibility. In
contrast to representative methods, thorough
experimental results on natural, medical and SAR
images demonstrate that the proposed framework: 1)
obtains comprehensive performance in terms of
reversibility, robustness, invisibility, capacity and
run-time complexity; 2) is widely applicable to
different kinds of images; and 3) is readily applicable
in practice. In future, we will combine the proposed
framework with the local feature to further improve
322 | P a g e
7. Sidham Abhilash et al Int. Journal of Engineering Research and Application
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.317-323
robustness. In addition, it is valuable to integrate the
merits of sparse representation and probabilistic
graphical model [50] into the designing of image
watermarking.
[15]
REFERENCE
[1]
J. Fridrich, M. Goljan, and R. Du, “Lossless
data embedding-new paradigm in digital
watermarking,” EURASIP
[2]
J. Appl. Signal Process., vol. 2002, no. 1, pp.
185–196, Jan. 2002.
[3]
Z. Zhao, N. Yu, and X. Li, “A novel video
watermarking scheme in compression
domain based on fast motion estimation,” in
Proc. Int. Conf. Commun. Technol., vol. 2.
2003, pp. 1878–1882.
[4]
X. Li, “Watermarking in secure image
retrieval,” Pattern Recog. Lett., vol. 24, no.
14, pp. 2431–2434, Oct. 2003.
[5]
M. Celik, G. Sharma, A. Tekalp, and E.
Saber, “Lossless generalized-LSB data
embedding,” IEEE Trans. Image Process.,
vol. 14, no. 2, pp. 253–266, Feb. 2005.
[6]
J. Tian, “Reversible watermarking using a
difference expansion,” IEEE Trans. Circuits
Syst. Video Technol., vol. 13, no. 8, pp.
890–896, Aug. 2003.
[7]
M. Van der Veen, F. Bruekers, A. Van
Leest, and S. Cavin, “High capacity
reversible watermarking for audio,” Proc.
SPIE, vol. 5020, no. 1, pp. 1–11, Jan. 2003.
[8]
R. Du and J. Fridrich, “Lossless
authentication of MPEG-2 video,” in
[9]
Proc. IEEE Int. Conf. Image Process., vol. 2.
Dec. 2002, pp. 893–896.
[10] J. Dittmann and O. Benedens, “Invertible
authentication for 3-D-meshes,” Proc. SPIE,
vol. 5020, no. 653, pp. 653–664, Jan. 2003.
[11] L. An, X. Gao, C. Deng, and F. Ji, “Robust
lossless data hiding: Analysis and
evaluation,” in Proc. Int. Conf. High
Perform. Comput. Simul., 2010, pp. 512–
516.
[12] C. De Vleeschouwer, J. Delaigle, and B.
Macq, “Circular interpretation of histogram
for reversible watermarking,” in Proc. IEEE
Workshop Multimedia Signal Process.,
2001, pp. 345–350.
[13] C. De Vleeschouwer, J. Delaigle, and B.
Macq, “Circular interpretation of bijective
transformations in lossless watermarking for
media asset management,” IEEE Trans.
Multimedia, vol. 5, no. 1, pp. 97–105, Mar.
2003.
[14] Z. Ni, Y. Shi, N. Ansari, W. Su, Q. Sun, and
X. Lin, “Robust lossless image data hiding
designed
for
semi-fragile
image
authentication,” IEEE Trans. Circuits Syst.
Video Technol., vol. 18, no. 4, pp. 497–509,
Apr. 2008.
[16]
www.ijera.com
[17]
[18]
[19]
[20]
[21]
www.ijera.com
D. Zou, Y. Shi, Z. Ni, and W. Su, “A semifragile lossless digital watermarking scheme
based on integer wavelet transform,” IEEE
Trans. Circuits Syst. Video Technol., vol.
16, no. 10, pp. 1294–1300, Oct. 2006.
X. Gao, L. An, Y. Yuan, D. Tao, and X. Li,
“Lossless data embedding using generalized
statistical quantity histogram,” IEEE Trans.
Circuits Syst. Video Technol., vol. 21, no. 8,
pp. 1061–1070, Aug. 2011.
N. Dalal and B. Triggs, “Histograms of
oriented gradients for human detection,” in
Proc. IEEE Conf. Comput. Vision Pattern
Recog., vol. 1. 2005, pp. 886–893.
L. Fei-Fei and P. Perona, “A Bayesian
hierarchical model for learning natural scene
categories,” in Proc. IEEE Conf. Comput.
Vision Pattern Recog., vol. 2. Jun. 2005, pp.
524–531.
S. Zhang, Q. Tian, G. Hua, Q. Huang, and S.
Li, “Descriptive visual words and visual
phrases for image applications,” in Proc.
ACM Int. Conf. Multimedia, 2009, pp. 75–
84.
C. Deng, X. Gao, X. Li, and D. Tao, “Local
histogram based geometric invariant image
watermarking,” Signal Process., vol. 90, no.
12, pp. 3256–3264, Dec. 2010.
C. Deng, X. Gao, H. Peng, L. An, and F. Ji,
“Histogram modification based robust image
watermarking
323 | P a g e