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.
Determining the Efficient Subband Coefficients of Biorthogonal Wavelet for Gr...CSCJournals
In this paper, we propose an invisible blind watermarking scheme for the gray-level images. The cover image is decomposed using the Discrete Wavelet Transform with Biorthogonal wavelet filters and the watermark is embedded into significant coefficients of the transformation. The Biorthogonal wavelet is used because it has the property of perfect reconstruction and smoothness. The proposed scheme embeds a monochrome watermark into a gray-level image. In the embedding process, we use a localized decomposition, means that the second level decomposition is performed on the detail sub-band resulting from the first level decomposition. The image is decomposed into first level and for second level decomposition we consider Horizontal, vertical and diagonal subband separately. From this second level decomposition we take the respective Horizontal, vertical and diagonal coefficients for embedding the watermark. The robustness of the scheme is tested by considering the different types of image processing attacks like blurring, cropping, sharpening, Gaussian filtering and salt and pepper noise effect. The experimental result shows that the embedding watermark into diagonal subband coefficients is robust against different types of attacks.
nternational Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
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.
A New Technique to Digital Image Watermarking Using DWT for Real Time Applica...IJERA Editor
Digital watermarking is an essential technique to add hidden copyright notices or secret messages to digital audio, image, or image forms. In this paper we introduce a new approach for digital image watermarking for real time applications. We have successfully implemented the digital watermarking technique on digital images based on 2-level Discrete Wavelet Transform and compared the performance of the proposed method with Level-1 and Level-2 and Level-3 Discrete Wavelet Transform using the parameter peak signal to noise ratio. To make the watermark robust and to preserve visual significant information a 2-Level Discrete wavelet transform used as transformation domain for both secret image and original image. The watermark is embedded in the original image using Alpha blending technique and implemented using Matlab Simulink.
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.
This paper presents a rotation scale invariant digital
color image watermarking technique using Scale Invariant
Feature Transform (SIFT) which is invariant to geometric
transformation. The image descriptors extracted using SIFT
transform of original image and watermarked image are used
for estimating the scaling factor and angle of rotation of
attacked image. Using estimated factors attacked image is
then restored to its original size for synchronization purpose.
As a result of synchronization, watermark detection is done
correctly. In proposed approach the offline signature, which is
a biometric characteristics of owner is embedded in second
level detailed coefficients of discrete wavelet transform of
cover image. The simulation results show that the algorithm
is robust against signal processing and geometric attack.
DIRECTIONAL BASED WATERMARKING SCHEME USING A NOVEL DATA EMBEDDING APPROACH acijjournal
Image watermarking has come to wide use in the recent past. It is by the authentication problems and limitation means that the setting accuracy of the image watermarking operation is minimized. Different types of integration schemes have been proposed in the past to improve efficiency and makes the
embedding resistant against various attacks .Although transformation, spatial domain approaches have been developed PSNR improvements in image artifacts due to the fringes are still to be observed. To improvise the embedding, image artifacts in this paper a forward – based image embedding scheme is proposed.
Determining the Efficient Subband Coefficients of Biorthogonal Wavelet for Gr...CSCJournals
In this paper, we propose an invisible blind watermarking scheme for the gray-level images. The cover image is decomposed using the Discrete Wavelet Transform with Biorthogonal wavelet filters and the watermark is embedded into significant coefficients of the transformation. The Biorthogonal wavelet is used because it has the property of perfect reconstruction and smoothness. The proposed scheme embeds a monochrome watermark into a gray-level image. In the embedding process, we use a localized decomposition, means that the second level decomposition is performed on the detail sub-band resulting from the first level decomposition. The image is decomposed into first level and for second level decomposition we consider Horizontal, vertical and diagonal subband separately. From this second level decomposition we take the respective Horizontal, vertical and diagonal coefficients for embedding the watermark. The robustness of the scheme is tested by considering the different types of image processing attacks like blurring, cropping, sharpening, Gaussian filtering and salt and pepper noise effect. The experimental result shows that the embedding watermark into diagonal subband coefficients is robust against different types of attacks.
nternational Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
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.
A New Technique to Digital Image Watermarking Using DWT for Real Time Applica...IJERA Editor
Digital watermarking is an essential technique to add hidden copyright notices or secret messages to digital audio, image, or image forms. In this paper we introduce a new approach for digital image watermarking for real time applications. We have successfully implemented the digital watermarking technique on digital images based on 2-level Discrete Wavelet Transform and compared the performance of the proposed method with Level-1 and Level-2 and Level-3 Discrete Wavelet Transform using the parameter peak signal to noise ratio. To make the watermark robust and to preserve visual significant information a 2-Level Discrete wavelet transform used as transformation domain for both secret image and original image. The watermark is embedded in the original image using Alpha blending technique and implemented using Matlab Simulink.
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.
This paper presents a rotation scale invariant digital
color image watermarking technique using Scale Invariant
Feature Transform (SIFT) which is invariant to geometric
transformation. The image descriptors extracted using SIFT
transform of original image and watermarked image are used
for estimating the scaling factor and angle of rotation of
attacked image. Using estimated factors attacked image is
then restored to its original size for synchronization purpose.
As a result of synchronization, watermark detection is done
correctly. In proposed approach the offline signature, which is
a biometric characteristics of owner is embedded in second
level detailed coefficients of discrete wavelet transform of
cover image. The simulation results show that the algorithm
is robust against signal processing and geometric attack.
DIRECTIONAL BASED WATERMARKING SCHEME USING A NOVEL DATA EMBEDDING APPROACH acijjournal
Image watermarking has come to wide use in the recent past. It is by the authentication problems and limitation means that the setting accuracy of the image watermarking operation is minimized. Different types of integration schemes have been proposed in the past to improve efficiency and makes the
embedding resistant against various attacks .Although transformation, spatial domain approaches have been developed PSNR improvements in image artifacts due to the fringes are still to be observed. To improvise the embedding, image artifacts in this paper a forward – based image embedding scheme is proposed.
PREVENTING COPYRIGHTS INFRINGEMENT OF IMAGES BY WATERMARKING IN TRANSFORM DOM...ijistjournal
Images are undoubtedly the most efficacious and easiest means of communicating an idea. They are surely an indispensable part of human life .The trend of sharing images of various kinds for example typical technical figures, modern exceptional masterpiece from an artist, photos from the recent picnic to hill station etc, on the internet is spreading like a viral. There is a mandatory requirement for checking the privacy and security of our personal digital images before making them public via the internet. There is always a threat of our original images being illegally reproduced or distributed elsewhere. To prevent the misuse and protect the copyrights, an efficient solution has been given that can withstand many attacks. This paper aims at encoding of the host image prior to watermark embedding for enhancing the security. The fast and effective full counter propagation neural network helps in the successful watermark embedding without deteriorating the image perception. Earlier techniques embedded the watermark in the image itself but is has been observed that synapses of neural network provide a better platform for reducing the distortion and increasing the message capacity.
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.
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.
DIGITAL WATERMARKING TECHNIQUE BASED ON MULTI-RESOLUTION CURVELET TRANSFORMijfcstjournal
In this paper an efficient & robust non-blind watermarking technique based on multi-resolution geometric analysis named curvelet transform is proposed. Curvelet transform represent edges along curve much more efficiently than the wavelet transform and other traditional transforms. The proposed algorithm of embedding watermark in different scales in curvelet domain is implemented and the results are compared
using proper metric. The visual quality of watermarked image, efficiency of data hiding and the quality of extracted watermark of curvelet domain embedding techniques with wavelet Domain at different number of decomposition levels are compared. Experimental results show that embedding in curvelet domain yields best visual quality in watermarked image, the quality of extracted watermark, robustness of the watermark and the data hiding efficiency.
Image Interpolation Techniques in Digital Image Processing: An OverviewIJERA Editor
In current digital era the image interpolation techniques based on multi-resolution technique are being discovered and developed. These techniques are gaining importance due to their application in variety if field (medical, geographical, space information) where fine and minor details are important. This paper presents an overview of different interpolation techniques, (nearest neighbor, Bilinear, Bicubic, B-spline, Lanczos, Discrete wavelet transform (DWT) and Kriging). Our results show bicubic interpolations gives better results than nearest neighbor and bilinear, whereas DWT and Kriging give finer details.
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
Single Image Super-Resolution Using Analytical Solution for L2-L2 Algorithmijtsrd
This paper addresses a unified work for achieving single image super-resolution, which consists of improving a high resolution from blurred, decimated and noisy version. Single image super-resolution is also known as image enhancement or image scaling up. In this paper mainly four steps are used for enhancement of single image resolution: input image, low sampling the image, an analytical solution and L2 regularization. This proposes to deal with the decimation and blurring operators by their particular properties in the frequency domain, which leads to a fast super-resolution approach. And an analytical solution obtained and implemented for the L2-regularization i.e. L2-L2 optimized algorithm. This aims to reduce the computational cost of the existing methods by the proposed method. Simulation results taken on different images and different priors with an advance machine learning technique and conducted results compared with the existing method. Varsha Patil | Meharunnisa SP"Single Image Super-Resolution Using Analytical Solution for L2-L2 Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-4 , June 2018, URL: http://www.ijtsrd.com/papers/ijtsrd15635.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/15635/single-image-super-resolution-using-analytical-solution-for-l2-l2-algorithm/varsha-patil
Robust Digital Image-Adaptive Watermarking Using BSS BasedCSCJournals
In a digital watermarking scheme, it is not convenient to carry the original image all the time in order to detect the owner's signature from the watermarked image. Moreover, for those applications that require different watermark for different copies, it is preferred to utilize some kind of watermark-independent algorithm for extraction process i.e. dewatermarking. Watermark embedding is performed in the blue channel, as it is less sensitive to human visual system .This paper proposes a new color image watermarking method ,which adopts Blind Source Separation (BSS) technique for watermark extraction. Single level Discrete Wavelet Transform(DWT) is used for embedding . The novelty of our scheme lies in determining the mixing matrix for BSS model during embedding. The determination of mixing matrix using Quasi-Newton’s (BFGS) technique is based on texture analysis which uses energy as metric. This makes our method image adaptive to embed the watermark into original image so as not to bring about a perceptible change in the marked image. BSS based on Joint diagonalization of the time delayed covariance matrices algorithm is used for the extraction of watermark. The proposed method, undergoing different experiments, has shown its robustness against many attacks including rotation ,low pass filtering, salt n pepper noise addition and compression. The robustness evaluation is also carried out with respect to the spatial domain embedding.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Dynamic Texture Coding using Modified Haar Wavelet with CUDAIJERA Editor
Texture is an image having repetition of patterns. There are two types, static and dynamic texture. Static texture is an image having repetitions of patterns in the spatial domain. Dynamic texture is number of frames having repetitions in spatial and temporal domain. This paper introduces a novel method for dynamic texture coding to achieve higher compression ratio of dynamic texture using 2D-modified Haar wavelet transform. The dynamic texture video contains high redundant parts in spatial and temporal domain. Redundant parts can be removed to achieve high compression ratios with better visual quality. The modified Haar wavelet is used to exploit spatial and temporal correlations amongst the pixels. The YCbCr color model is used to exploit chromatic components as HVS is less sensitive to chrominance. To decrease the time complexity of algorithm parallel programming is done using CUDA (Compute Unified Device Architecture). GPU contains the number of cores as compared to CPU, which is utilized to reduce the time complexity of algorithms.
BLIND EXTRACTION OF DIGITAL WATERMARKING ALGORITHM FOR COLOR IMAGESijma
Digital watermark technology hides copyright information in digital images, effectively protecting the
copyright of digital images. At present, the color image digital watermarking algorithm still has defects
such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the
above problems, this paper studies the digital watermarking method based on discrete wavelet transform
and discrete cosine transform. Then this paper proposes a color image blind digital watermarking
algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y
component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and
perform the discrete cosine transform. finally, use the embedding method to convert the watermark
information after the Arnold transform embedded in the block. The experimental results show that the
PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being
attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm
has good robustness and can achieve watermarking blind extraction.
A Novel Approaches For Chromatic Squander Less Visceral Coding Techniques Usi...IJERA Editor
Recent advances in video capturing and display technologies, along with the exponentially increasing demand of
video services, challenge the video coding research community to design new algorithms able to significantly
improve the compression performance of the current H.264/AVC standard. This target is currently gaining
evidence with the standardization activities in the High Efficiency Video Coding (HEVC) project. The distortion
models used in HEVC are mean squared error (MSE) and sum of absolute difference (SAD). However, they are
widely criticized for not correlating well with perceptual image quality. The structural similarity (SSIM) index
has been found to be a good indicator of perceived image quality. Meanwhile, it is computationally simple
compared with other state-of-the-art perceptual quality measures and has a number of desirable mathematical
properties for optimization tasks. We propose a perceptual video coding method to improve upon the current
HEVC based on an SSIM-inspired divisive normalization scheme as an attempt to transform the DCT domain
frame prediction residuals to a perceptually uniform space before encoding.
Based on the residual divisive normalization process, we define a distortion model for mode selection and show
that such a divisive normalization strategy largely simplifies the subsequent perceptual rate-distortion
optimization procedure. We further adjust the divisive normalization factors based on local content of the video
frame. Experiments show that the scheme can achieve significant gain in terms of rate-SSIM performance and
better visual quality when compared with HEVC
Chit Zone believes in lending money more as a service than as a commercial venture. While the lending rates are flying sky high, you can avail loan here for as low as 8%, which is an all time market low, particularly in today’s costly scenario.
At Chit Zone, you are treated more as a human being than as a borrower, which establishes a strong relationship based on faith and good will. The commercial aspect of funds takes a backseat when it comes to servicing your needs in terms of lending the required money
PREVENTING COPYRIGHTS INFRINGEMENT OF IMAGES BY WATERMARKING IN TRANSFORM DOM...ijistjournal
Images are undoubtedly the most efficacious and easiest means of communicating an idea. They are surely an indispensable part of human life .The trend of sharing images of various kinds for example typical technical figures, modern exceptional masterpiece from an artist, photos from the recent picnic to hill station etc, on the internet is spreading like a viral. There is a mandatory requirement for checking the privacy and security of our personal digital images before making them public via the internet. There is always a threat of our original images being illegally reproduced or distributed elsewhere. To prevent the misuse and protect the copyrights, an efficient solution has been given that can withstand many attacks. This paper aims at encoding of the host image prior to watermark embedding for enhancing the security. The fast and effective full counter propagation neural network helps in the successful watermark embedding without deteriorating the image perception. Earlier techniques embedded the watermark in the image itself but is has been observed that synapses of neural network provide a better platform for reducing the distortion and increasing the message capacity.
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.
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.
DIGITAL WATERMARKING TECHNIQUE BASED ON MULTI-RESOLUTION CURVELET TRANSFORMijfcstjournal
In this paper an efficient & robust non-blind watermarking technique based on multi-resolution geometric analysis named curvelet transform is proposed. Curvelet transform represent edges along curve much more efficiently than the wavelet transform and other traditional transforms. The proposed algorithm of embedding watermark in different scales in curvelet domain is implemented and the results are compared
using proper metric. The visual quality of watermarked image, efficiency of data hiding and the quality of extracted watermark of curvelet domain embedding techniques with wavelet Domain at different number of decomposition levels are compared. Experimental results show that embedding in curvelet domain yields best visual quality in watermarked image, the quality of extracted watermark, robustness of the watermark and the data hiding efficiency.
Image Interpolation Techniques in Digital Image Processing: An OverviewIJERA Editor
In current digital era the image interpolation techniques based on multi-resolution technique are being discovered and developed. These techniques are gaining importance due to their application in variety if field (medical, geographical, space information) where fine and minor details are important. This paper presents an overview of different interpolation techniques, (nearest neighbor, Bilinear, Bicubic, B-spline, Lanczos, Discrete wavelet transform (DWT) and Kriging). Our results show bicubic interpolations gives better results than nearest neighbor and bilinear, whereas DWT and Kriging give finer details.
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
Single Image Super-Resolution Using Analytical Solution for L2-L2 Algorithmijtsrd
This paper addresses a unified work for achieving single image super-resolution, which consists of improving a high resolution from blurred, decimated and noisy version. Single image super-resolution is also known as image enhancement or image scaling up. In this paper mainly four steps are used for enhancement of single image resolution: input image, low sampling the image, an analytical solution and L2 regularization. This proposes to deal with the decimation and blurring operators by their particular properties in the frequency domain, which leads to a fast super-resolution approach. And an analytical solution obtained and implemented for the L2-regularization i.e. L2-L2 optimized algorithm. This aims to reduce the computational cost of the existing methods by the proposed method. Simulation results taken on different images and different priors with an advance machine learning technique and conducted results compared with the existing method. Varsha Patil | Meharunnisa SP"Single Image Super-Resolution Using Analytical Solution for L2-L2 Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-4 , June 2018, URL: http://www.ijtsrd.com/papers/ijtsrd15635.pdf http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/15635/single-image-super-resolution-using-analytical-solution-for-l2-l2-algorithm/varsha-patil
Robust Digital Image-Adaptive Watermarking Using BSS BasedCSCJournals
In a digital watermarking scheme, it is not convenient to carry the original image all the time in order to detect the owner's signature from the watermarked image. Moreover, for those applications that require different watermark for different copies, it is preferred to utilize some kind of watermark-independent algorithm for extraction process i.e. dewatermarking. Watermark embedding is performed in the blue channel, as it is less sensitive to human visual system .This paper proposes a new color image watermarking method ,which adopts Blind Source Separation (BSS) technique for watermark extraction. Single level Discrete Wavelet Transform(DWT) is used for embedding . The novelty of our scheme lies in determining the mixing matrix for BSS model during embedding. The determination of mixing matrix using Quasi-Newton’s (BFGS) technique is based on texture analysis which uses energy as metric. This makes our method image adaptive to embed the watermark into original image so as not to bring about a perceptible change in the marked image. BSS based on Joint diagonalization of the time delayed covariance matrices algorithm is used for the extraction of watermark. The proposed method, undergoing different experiments, has shown its robustness against many attacks including rotation ,low pass filtering, salt n pepper noise addition and compression. The robustness evaluation is also carried out with respect to the spatial domain embedding.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Dynamic Texture Coding using Modified Haar Wavelet with CUDAIJERA Editor
Texture is an image having repetition of patterns. There are two types, static and dynamic texture. Static texture is an image having repetitions of patterns in the spatial domain. Dynamic texture is number of frames having repetitions in spatial and temporal domain. This paper introduces a novel method for dynamic texture coding to achieve higher compression ratio of dynamic texture using 2D-modified Haar wavelet transform. The dynamic texture video contains high redundant parts in spatial and temporal domain. Redundant parts can be removed to achieve high compression ratios with better visual quality. The modified Haar wavelet is used to exploit spatial and temporal correlations amongst the pixels. The YCbCr color model is used to exploit chromatic components as HVS is less sensitive to chrominance. To decrease the time complexity of algorithm parallel programming is done using CUDA (Compute Unified Device Architecture). GPU contains the number of cores as compared to CPU, which is utilized to reduce the time complexity of algorithms.
BLIND EXTRACTION OF DIGITAL WATERMARKING ALGORITHM FOR COLOR IMAGESijma
Digital watermark technology hides copyright information in digital images, effectively protecting the
copyright of digital images. At present, the color image digital watermarking algorithm still has defects
such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the
above problems, this paper studies the digital watermarking method based on discrete wavelet transform
and discrete cosine transform. Then this paper proposes a color image blind digital watermarking
algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y
component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and
perform the discrete cosine transform. finally, use the embedding method to convert the watermark
information after the Arnold transform embedded in the block. The experimental results show that the
PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being
attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm
has good robustness and can achieve watermarking blind extraction.
A Novel Approaches For Chromatic Squander Less Visceral Coding Techniques Usi...IJERA Editor
Recent advances in video capturing and display technologies, along with the exponentially increasing demand of
video services, challenge the video coding research community to design new algorithms able to significantly
improve the compression performance of the current H.264/AVC standard. This target is currently gaining
evidence with the standardization activities in the High Efficiency Video Coding (HEVC) project. The distortion
models used in HEVC are mean squared error (MSE) and sum of absolute difference (SAD). However, they are
widely criticized for not correlating well with perceptual image quality. The structural similarity (SSIM) index
has been found to be a good indicator of perceived image quality. Meanwhile, it is computationally simple
compared with other state-of-the-art perceptual quality measures and has a number of desirable mathematical
properties for optimization tasks. We propose a perceptual video coding method to improve upon the current
HEVC based on an SSIM-inspired divisive normalization scheme as an attempt to transform the DCT domain
frame prediction residuals to a perceptually uniform space before encoding.
Based on the residual divisive normalization process, we define a distortion model for mode selection and show
that such a divisive normalization strategy largely simplifies the subsequent perceptual rate-distortion
optimization procedure. We further adjust the divisive normalization factors based on local content of the video
frame. Experiments show that the scheme can achieve significant gain in terms of rate-SSIM performance and
better visual quality when compared with HEVC
Chit Zone believes in lending money more as a service than as a commercial venture. While the lending rates are flying sky high, you can avail loan here for as low as 8%, which is an all time market low, particularly in today’s costly scenario.
At Chit Zone, you are treated more as a human being than as a borrower, which establishes a strong relationship based on faith and good will. The commercial aspect of funds takes a backseat when it comes to servicing your needs in terms of lending the required money
Atelier : soins sans consentement, contrainte et droits des patients au regar...Réseau Pro Santé
Revue SPH n°12 - Décembre 2016
OBJECTIFS DE L’ATELIER SYNDICAL
- Mise en perspective SSC en France avec les règlementations européennes.
- Evaluer la situation actuelle de la France.
» Recenser les pratiques actuelles.
» Articuler avec la législation sur l’isolement et la contention.
- Proposer des pistes de travail.
- Rédiger la motion syndicale.
PREMIÈRE PARTIE - LE CONTEXTE EUROPÉEN
Diversité des législations européennes
- Tous les pays européens n’ont pas une législation.
- Pour ceux qui ont une législation :
» Concerne l’ensemble des personnes ne pouvant consentir (quel que soit le diagnostic) : Directives anticipées de l’Espagne.
» Personnes vulnérables, mineurs, sous tutelle (Espagne).
» Spécifique aux troubles mentaux.
Législations « psychiatriques »
- 12 pays dont la France et la Belgique ont une législation spécifique/ troubles mentaux.
- 3 pays n’ont pas de législation spécifique/TM (Espagne, Italie et Grèce).
- Possibilité de coexistence droit commun et droit pénal ou post-pénal (Italie, Royaume-Uni, Belgique).
- Totalité Etats européens : pouvoir judiciaire légitime pour décider SSC (France exception avant 2011).Critères SSC
- Dangerosité uniquement.
- Besoin de soins uniquement. W Dangerosité et besoins de soins.
- Précision diagnostique pour certains pays : psychose, démence, déficience mentale (Allemagne, Danemark, Irlande).
- Préciser absence d’alternative (Belgique).
- Préciser le protocole de soins ou de mesures « coercitives » ou d’une OS à domicile.(...)
http://www.reseauprosante.fr/
Color Image Watermarking using Cycle Spinning based Sharp Frequency Localized...CSCJournals
This paper describes a new approach for color image watermarking using Cycle Spinning based Sharp Frequency Localized Contourlet Transform and Principal Component Analysis. The approach starts with decomposition of images into various subbands using Contourlet Transform(CT) successively for all the color spaces of both host and watermark images. Then principal components of middle band(x bands) are considered for inserting operation. The ordinary contourlet transform suffers from lack of frequency localization. The localization being the most important criterion for watermarking, the conventional CT is not very suitable for watermarking. This problem of CT is over come by Sharp Frequency Localized Contourlet, but this lacks of translation invariance. Hence the cycle spinning based sharp frequency localized contourlet chosen for watermarking. Embedding at middle level sub bands(x band) preserves the curve nature of edges in the host image hence less disturbance is observed when host and watermark images are compared. This result in very good Peak Signal to Noise Ratio (PSNR) instead of directly adding of mid frequency components of watermark and host images the principal components are only added. Likewise the amount of payload to be added is reduced hence host images get very less distortion. Usage of principal components also helps in fruitful extraction of watermark information from host image hence gives good correlation between input watermark and extracted one. This technique has shown a very high robustness under various intentional and non intentional attacks.
BLIND EXTRACTION OF DIGITAL WATERMARKING ALGORITHM FOR COLOR IMAGESijma
Digital watermark technology hides copyright information in digital images, effectively protecting the
copyright of digital images. At present, the color image digital watermarking algorithm still has defects
such as the inability to balance robustness, invisibility and the weak anti-attack ability. Aiming at the
above problems, this paper studies the digital watermarking method based on discrete wavelet transform
and discrete cosine transform. Then this paper proposes a color image blind digital watermarking
algorithm based on QR code. First, convert the color image from RGB space to YCbCr space, extract the Y
component and perform the second-level discrete wavelet transform. secondly, block the LL2 subband and
perform the discrete cosine transform. finally, use the embedding method to convert the watermark
information after the Arnold transform embedded in the block. The experimental results show that the
PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being
attacked, its PSNR and NC values are respectively 30dB and 0.95 or more, which proves that the algorithm
has good robustness and can achieve watermarking blind extraction.
Performance comparison of hybrid wavelet transforms formed using dct, walsh, ...ijcsit
In this paper a watermarking method using hybrid wavelet transform and SVD is proposed. Hybrid wavelet transform generated from two different orthogonal transforms is applied on host and SVD is applied to watermark. The transforms used for hybrid wavelet transform generation are DCT, Walsh, Haar and DKT. First component transform used in generation of hybrid wavelet transform corresponds to global properties and second component transform corresponds to local properties of an image to which
transform are applied. Aim of proposed watermarking method is to study effect of selecting DCT as
global/local component transform on robustness. After testing the proposed method against various
attacks, using DCT as global component is observed to be robust against compression, resizing using
transforms, resizing using grid based interpolation and noise addition attacks. DCT when used as local
component is observed to be robust against cropping. It also shows robustness against resizing using
transforms, resizing using grid based interpolation and noise addition 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.
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.
Robust content based watermarking algorithm using singular value decompositio...sipij
Nowadays, image content is frequently subject to different malicious manipulations. To protect images
from this illegal manipulations computer science community have recourse to watermarking techniques. To
protect digital multimedia content we need just to embed an invisible watermark into images which
facilitate the detection of different manipulations, duplication, illegitimate distributions of these images. In
this work a robust watermarking technique is presented that embedding invisible watermarks into colour
images the singular value decomposition bloc by bloc of a robust transform of images that is the Radial
symmetry transform. Each bit of the watermark is inserted in a bloc of eight pixels large of the blue
channel a high singular value of the corresponding bloc into the radial symmetry map. We justified the
insertion in the blue channel by our feeble sensibility to perturbations in this colour channel of images. We
present also results obtained with different tests. We had tested the imperceptibility of the mark using this
approach and also its robustness face to several attacks.
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
ROBUST IMAGE WATERMARKING METHOD USING WAVELET TRANSFORMsipij
In this paper a robust watermarking method operating in the wavelet domain for grayscale digital imagesis developed. The method first acomputes the differences between the watermark and the HH1 sub-band ofthe cover image values and then embed these differences in one of the frequency sub-bands. The resultsshow that embedding the watermark in the LH1 sub-band gave the best results. The results were evaluatedusing the RMSE and the PSNR of both the original and the watermarked image. Although the watermarkwas recovered perfectly in the ideal case, the addition of Gaussian noise, or compression of the imageusing JPEG with quality less than 100 destroys the embedded watermark. Different experiments werecarried out to test the performance of the proposed method and good results were obtained.
A Comparative Study of Wavelet and Curvelet Transform for Image DenoisingIOSR Journals
Abstract : This paper describes a comparison of the discriminating power of the various multiresolution based thresholding techniques i.e., Wavelet, curve let for image denoising.Curvelet transform offer exact reconstruction, stability against perturbation, ease of implementation and low computational complexity. We propose to employ curve let for facial feature extraction and perform a thorough comparison against wavelet transform; especially, the orientation of curve let is analysed. Experiments show that for expression changes, the small scale coefficients of curve let transform are robust, though the large scale coefficients of both transform are likely influenced. The reason behind the advantages of curvelet lies in its abilities of sparse representation that are critical for compression, estimation of images which are denoised and its inverse problems, thus the experiments and theoretical analysis coincide . Keywords: Curvelet transform, Face recognition, Feature extraction, Sparse representation Thresholding rules,Wavelet transform..
here it introduces an efficient multi-resolution watermarking methodology for copyright protection of digital images. By adapting the watermark signal to the wavelet coefficients, the proposed method is highly image adaptive and the watermark signal can be strengthen in the most significant parts of the image. As this property also increases the watermark visibility, usage of the human visual system is incorporated to prevent perceptual visibility of embedded watermark signal. Experimental results show that the proposed system preserves the image quality and is vulnerable against most common image processing distortions. Furthermore, the hierarchical nature of wavelet transform allows for detection of watermark at various resolutions, resulting in reduction of the computational load needed for watermark detection based on the noise level. The performance of the proposed system is shown to be superior to that of other available schemes reported in the literature.
Multiple Binary Images Watermarking in Spatial and Frequency Domainssipij
Editing, reproduction and distribution of the digital multimedia are becoming extremely easier and faster with the existence of the internet and the availability of pervasive and powerful multimedia tools. Digital watermarking has emerged as a possible method to tackle these issues. This paper proposes a scheme using which more data can be inserted into an image in different domains using different techniques. This increases the embedding capacity. Using the proposed scheme 24 binary images can be embedded in the DCT domain and 12 binary images can be embedded in the spatial domain using LSB substitution technique in a single RGB image. The proposed scheme also provides an extra level of security to the watermark image by scrambling the image before embedding it into the host image. Experimental results show that the proposed watermarking method results in almost invisible difference between the watermarked image and the original image and is also robust against various image processing attacks.
A Novel Algorithm for Watermarking and Image Encryption cscpconf
Digital watermarking is a method of copyright protection of audio, images, video and text. We
propose a new robust watermarking technique based on contourlet transform and singular value
decomposition. The paper also proposes a novel encryption algorithm to store a signed double
matrix as an RGB image. The entropy of the watermarked image and correlation coefficient of
extracted watermark image is very close to ideal values, proving the correctness of proposed
algorithm. Also experimental results show resiliency of the scheme against large blurring attack
like mean and gaussian filtering, linear filtering (high pass and low pass filtering) , non-linear
filtering (median filtering), addition of a constant offset to the pixel values and local exchange of pixels .Thus proving the security, effectiveness and robustness of the proposed watermarking algorithm.
A systematic image compression in the combination of linear vector quantisati...eSAT 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
High Speed and Area Efficient 2D DWT Processor Based Image Compressionsipij
This paper presents a high speed and area efficient DWT processor based design for Image Compression applications. In this proposed design, pipelined partially serial architecture has been used to enhance the speed along with optimal utilization and resources available on target FPGA. The proposed model has been designed and simulated using Simulink and System Generator blocks, synthesized with Xilinx Synthesis tool (XST) and implemented on Spartan 2 and 3 based XC2S100-5tq144 and XC3S500E-4fg320 target device. The results show that proposed design can operate at maximum frequency 231 MHz in case of Spartan 3 by consuming power of 117mW at 28 degree/c junction temperature. The result comparison has shown an improvement of 15% in speed.
Abstract: The increasing amount of applications using digital multimedia technologies has accentuated the need to provide copyright protection to multimedia data. This paper reviews one of the data hiding techniques - digital image watermarking. Through this paper we will explore some basic concepts of digital image watermarking techniques.Two different methods of digital image watermarking namely spatial domain watermarking and transform domain watermarking are briefly discussed in this paper. Furthermore, two different algorithms for a digital image watermarking have also been discussed. Also the comparision between the different algorithms,tests performed for the robustness and the applications of the digital image watermarking have also been discussed.
CT-SVD and Arnold Transform for Secure Color Image WatermarkingAM Publications,India
Watermarking is used for protecting copyright of digital images. In this paper, we propose a novel technique for watermarking using Contourlet Transform (CT) and Singular Value Decomposition (SVD). CT ensures imperceptibility of the watermark and SVD ensures its robustness against attacks. Arnold transform is used for scrambling watermark pixels to ensure watermark security. Watermark extraction is semi-blind, which avoids the need for original image for extraction. Both watermark and cover image are color images. Performance of the system is judged by using PSNR and Correlation Coefficient (CC) values. System shows good robustness against noise, JPEG compression, filtering and cropping
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
This investigation delves into incorporating a hybridized memetic strategy within the framework of English
composition pedagogy, leveraging Internet Plus resources. The study aims to provide an in-depth analysis
of how this method influences students’ writing competence, their perceptions of writing, and their
enthusiasm for English acquisition. Employing an explanatory research design that combines qualitative
and quantitative methods, the study collects data through surveys, interviews, and observations of students’
writing performance before and after the intervention. Findings demonstrate a beneficial impact of
integrating the memetic approach alongside Internet Plus tools on the writing aptitude of English as a
Foreign Language (EFL) learners. Students reported increased engagement with writing, attributing it to
the use of Internet plus tools. They also expressed that the memetic approach facilitated a deeper
understanding of cultural and social contexts in writing. Furthermore, the findings highlight a significant
improvement in students’ writing skills following the intervention. This study provides significant insights
into the practical implementation of the memetic approach within English writing education, highlighting
the beneficial contribution of Internet Plus tools in enriching students' learning journeys.
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
Messages routing over a network is one of the most fundamental concept in communication which requires
simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it
refers to the addition of a timing constraint in which messages should be received within a specified time
delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of
the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present
these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of
routing real-time messages on networks. We study whether it is possible to have an optimal on-line
algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message
routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual
examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s
“makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning
Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the
effectiveness of the KLA approach compared to the traditional teaching method.
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESijfcstjournal
Software architecture is the structural solution that achieves the overall technical and operational
requirements for software developments. Software engineers applied software architectures for their
software system developments; however, they worry the basic benchmarks in order to select software
architecture styles, possible components, integration methods (connectors) and the exact application of
each style.
The objective of this research work was a comparative analysis of software architecture styles by its
weakness and benefits in order to select by the programmer during their design time. Finally, in this study,
the researcher has been identified architectural styles, weakness, and Strength and application areas with
its component, connector and Interface for the selected architectural styles.
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...ijfcstjournal
A design of a sales system for professional services requires a comprehensive understanding of the
dynamics of sale cycles and how key knowledge for completing sales is managed. This research describes
a design model of a business development (sales) system for professional service firms based on the Saudi
Arabian commercial market, which takes into account the new advances in technology while preserving
unique or cultural practices that are an important part of the Saudi Arabian commercial market. The
design model has combined a number of key technologies, such as cloud computing and mobility, as an
integral part of the proposed system. An adaptive development process has also been used in implementing
the proposed design model.
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...ijfcstjournal
Frank t-norms are parametric family of continuous Archimedean t-norms whose members are also strict
functions. Very often, this family of t-norms is also called the family of fundamental t-norms because of the
role it plays in several applications. In this paper, optimization of a linear objective function with fuzzy
relational inequality constraints is investigated. The feasible region is formed as the intersection of two
inequality fuzzy systems defined by frank family of t-norms is considered as fuzzy composition. First, the
resolution of the feasible solutions set is studied where the two fuzzy inequality systems are defined with
max-Frank composition. Second, some related basic and theoretical properties are derived. Then, a
necessary and sufficient condition and three other necessary conditions are presented to conceptualize the
feasibility of the problem. Subsequently, it is shown that a lower bound is always attainable for the optimal
objective value. Also, it is proved that the optimal solution of the problem is always resulted from the
unique maximum solution and a minimal solution of the feasible region. Finally, an algorithm is presented
to solve the problem and an example is described to illustrate the algorithm. Additionally, a method is
proposed to generate random feasible max-Frank fuzzy relational inequalities. By this method, we can
easily generate a feasible test problem and employ our algorithm to it.
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
Underwater detector network is one amongst the foremost difficult and fascinating analysis arenas that
open the door of pleasing plenty of researchers during this field of study. In several under water based
sensor applications, nodes are square measured and through this the energy is affected. Thus, the mobility
of each sensor nodes are measured through the water atmosphere from the water flow for sensor based
protocol formations. Researchers have developed many routing protocols. However, those lost their charm
with the time. This can be the demand of the age to supply associate degree upon energy-efficient and
ascendable strong routing protocol for under water actuator networks. During this work, the authors tend
to propose a customary routing protocol named level primarily based routing protocol (LBRP), reaching to
offer strong, ascendable and energy economical routing. LBRP conjointly guarantees the most effective use
of total energy consumption and ensures packet transmission which redirects as an additional reliability in
compare to different routing protocols. In this work, the authors have used the level of forwarding node,
residual energy and distance from the forwarding node to the causing node as a proof in multicasting
technique comparisons. Throughout this work, the authors have got a recognition result concerning about
86.35% on the average in node multicasting performances. Simulation has been experienced each in a
wheezy and quiet atmosphere which represents the endorsement of higher performance for the planned
protocol.
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...ijfcstjournal
This research paper examined and re-evaluates the technological innovation, theory, structural dynamics
and evolution of Pill Camera(Capsule Endoscopy) technology in redirecting the response manner of small
bowel (intestine) examination in human. The Pill Camera (Endoscopy Capsule) is made up of sealed
biocompatible material to withstand acid, enzymes and other antibody chemicals in the stomach is a
technology that helps the medical practitioners especially the general physicians and the
gastroenterologists to examine and re-examine the intestine for possible bleeding or infection. Before the
advent of the Pill camera (Endoscopy Capsule) the colonoscopy was the local method used but research
showed that some parts (bowel) of the intestine can’t be reach by mere traditional method hence the need
for Pill Camera. Countless number of deaths from stomach disease such as polyps, inflammatory bowel
(Crohn”s diseases), Cancers, Ulcer, anaemia and tumours of small intestines which ordinary would have
been detected by sophisticated technology like Pill Camera has become norm in the developing nations.
Nevertheless, not only will this paper examine and re-evaluate the Pill Camera Innovation, theory,
Structural dynamics and evolution it unravelled and aimed to create awareness for both medical
practitioners and the public.
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGijfcstjournal
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding
obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike
most path finding algorithms which require destination co-ordinates to compute path, the proposed
algorithm comprises of a new method which finds path using backtracking without requiring destination
co-ordinates. Moreover, in existing path finding algorithm, the number of iterations required to find path is
large. Hence, to overcome this, an algorithm is proposed which reduces number of iterations required to
traverse the path. The proposed algorithm is hybrid of backtracking and a new technique(modified 8-
neighbor approach). The proposed algorithm can become essential part in location based, network, gaming
applications. grid traversal, navigation, gaming applications, mobile robot and Artificial Intelligence.
EAGRO CROP MARKETING FOR FARMING COMMUNITYijfcstjournal
The Major Occupation in India is the Agriculture; the people involved in the Agriculture belong to the poor
class and category. The people of the farming community are unaware of the new techniques and Agromachines, which would direct the world to greater heights in the field of agriculture. Though the farmers
work hard, they are cheated by agents in today’s market. This serves as a opportunity to solve
all the problems that farmers face in the current world. The eAgro crop marketing will serve as a better
way for the farmers to sell their products within the country with some mediocre knowledge about using
the website. This would provide information to the farmers about current market rate of agro-products,
their sale history and profits earned in a sale. This site will also help the farmers to know about the market
information and to view agricultural schemes of the Government provided to farmers.
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSijfcstjournal
It is well known that the tenacity is a proper measure for studying vulnerability and reliability in graphs.
Here, a modified edge-tenacity of a graph is introduced based on the classical definition of tenacity.
Properties and bounds for this measure are introduced; meanwhile edge-tenacity is calculated for cycle
graphs and also for complete graphs.
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMijfcstjournal
This Paper provides a brief description of the Genetic Algorithm (GA), the Simulated Annealing (SA)
Algorithm, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and attempts to
explain the way as how the Proposed Genetic Algorithm (GA), the Proposed Simulated Annealing (SA)
Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm can be
employed in finding the best solution of N Queens Problem and also, makes a comparison between these
four algorithms. It is entirely a review based work. The four algorithms were written as well as
implemented. From the Results, it was found that, the Proposed Genetic Algorithm (GA) performed better
than the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and
the Brute Force (BF) Search Algorithm and it also provided better fitness value (solution) than the
Proposed Simulated Annealing Algorithm (SA) using GA, the Backtracking (BT) Algorithm and the Brute
Force (BF) Search Algorithm, for different N values. Also, it was noticed that, the Proposed GA took more
time to provide result than the Proposed SA using GA.
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSijfcstjournal
In recent years, the complex event processing technology has been used to process the VANET’s temporal
and spatial event streams. However, we usually cannot get the accurate data because the device sensing
accuracy limitations of the system. We only can get the uncertain data from the complex and limited
environment of the VANET. Because the VANET’s event streams are consist of the uncertain data, so they
are also uncertain. How effective to express and process these uncertain event streams has become the core
issue for the VANET system. To solve this problem, we propose a novel complex event query language
PSTeCEQL (probabilistic spatio-temporal constraint event query language). Firstly, we give the definition
of the possible world model of VANET’s uncertain event streams. Secondly, we propose an event query
language PSTeCEQL and give the syntax and the operational semantics of the language. Finally, we
illustrate the validity of the PSTeCEQL by an example.
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...ijfcstjournal
Now a day enormous amount of data is getting explored through Internet of Things (IoT) as technologies
are advancing and people uses these technologies in day to day activities, this data is termed as Big Data
having its characteristics and challenges. Frequent Itemset Mining algorithms are aimed to disclose
frequent itemsets from transactional database but as the dataset size increases, it cannot be handled by
traditional frequent itemset mining. MapReduce programming model solves the problem of large datasets
but it has large communication cost which reduces execution efficiency. This proposed new pre-processed
k-means technique applied on BigFIM algorithm. ClustBigFIM uses hybrid approach, clustering using kmeans algorithm to generate Clusters from huge datasets and Apriori and Eclat to mine frequent itemsets
from generated clusters using MapReduce programming model. Results shown that execution efficiency of
ClustBigFIM algorithm is increased by applying k-means clustering algorithm before BigFIM algorithm as
one of the pre-processing technique.
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGijfcstjournal
Software testing is a testing which conducted a test to provide information to client about the quality of the
product under test. Software testing can also provide an objective, independent view of the software to
allow the business to appreciate and understand the risks of software implementation. In this paper we
focused on two main software testing –mutation testing and mutation testing. Mutation testing is a
procedural testing method, i.e. we use the structure of the code to guide the test program, A mutation is a
little change in a program. Such changes are applied to model low level defects that obtain in the process
of coding systems. Ideally mutations should model low-level defect creation. Mutation testing is a process
of testing in which code is modified then mutated code is tested against test suites. The mutations used in
source code are planned to include in common programming errors. A good unit test typically detects the
program mutations and fails automatically. Mutation testing is used on many different platforms, including
Java, C++, C# and Ruby. Regression testing is a type of software testing that seeks to uncover
new software bugs, or regressions, in existing functional and non-functional areas of a system after
changes such as enhancements, patches or configuration changes, have been made to them. When defects
are found during testing, the defect got fixed and that part of the software started working as needed. But
there may be a case that the defects that fixed have introduced or uncovered a different defect in the
software. The way to detect these unexpected bugs and to fix them used regression testing. The main focus
of regression testing is to verify that changes in the software or program have not made any adverse side
effects and that the software still meets its need. Regression tests are done when there are any changes
made on software, because of modified functions.
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...ijfcstjournal
Advances in micro fabrication and communication techniques have led to unimaginable proliferation of
WSN applications. Research is focussed on reduction of setup operational energy costs. Bulk of operational
energy costs are linked to communication activities of WSN. Any progress towards energy efficiency has a
potential of huge savings globally. Therefore, every energy efficient step is an endeavour to cut costs and
‘Go Green’. In this paper, we have proposed a framework to reduce communication workload through: Innetwork compression and multiple query synthesis at the base-station and modification of query syntax
through introduction of Static Variables. These approaches are general approaches which can be used in
any WSN irrespective of application.
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHijfcstjournal
Accurate and realistic estimation is always considered to be a great challenge in software industry.
Software Cost Estimation (SCE) is the standard application used to manage software projects. Determining
the amount of estimation in the initial stages of the project depends on planning other activities of the
project. In fact, the estimation is confronted with a number of uncertainties and barriers’, yet assessing the
previous projects is essential to solve this problem. Several models have been developed for the analysis of
software projects. But the classical reference method is the COCOMO model, there are other methods
which are also applied such as Function Point (FP), Line of Code(LOC); meanwhile, the expert`s opinions
matter in this regard. In recent years, the growth and the combination of meta-heuristic algorithms with
high accuracy have brought about a great achievement in software engineering. Meta-heuristic algorithms
which can analyze data from multiple dimensions and identify the optimum solution between them are
analytical tools for the analysis of data. In this paper, we have used the Harmony Search (HS)algorithm for
SCE. The proposed model which is a collection of 60 standard projects from Dataset NASA60 has been
assessed.The experimental results show that HS algorithm is a good way for determining the weight
similarity measures factors of software effort, and reducing the error of MRE.
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSijfcstjournal
Mining biological data is an emergent area at the intersection between bioinformatics and data mining
(DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining
(DDM) systems to address scalable mining over large scale distributed data. The nature of associations
between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to
develop new models and exploit and analyze the available distributed biological data sources. In this study,
we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative
Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such
globally strong association rules enhance understanding of protein composition and are desirable for
synthesis of artificial proteins. A real protein data bank is used to validate the system.
International Journal on Foundations of Computer Science & Technology (IJFCST)ijfcstjournal
International Journal on Foundations of Computer Science & Technology (IJFCST) is a Bi-monthly peer-reviewed and refereed open access journal that publishes articles which contribute new results in all areas of the Foundations of Computer Science & Technology. Over the last decade, there has been an explosion in the field of computer science to solve various problems from mathematics to engineering. This journal aims to provide a platform for exchanging ideas in new emerging trends that needs more focus and exposure and will attempt to publish proposals that strengthen our goals. Topics of interest include, but are not limited to the following:
Because the technology is used largely in the last decades; cybercrimes have become a significant
international issue as a result of the huge damage that it causes to the business and even to the ordinary
users of technology. The main aims of this paper is to shed light on digital crimes and gives overview about
what a person who is related to computer science has to know about this new type of crimes. The paper has
three sections: Introduction to Digital Crime which gives fundamental information about digital crimes,
Digital Crime Investigation which presents different investigation models and the third section is about
Cybercrime Law.
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...ijfcstjournal
In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a
random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex
networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if
chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly
chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the
maximal clique size per node by varying the probability of link rewiring and the degree per node (number
of links incident on a node) in the initial regular network. For a given probability of rewiring and initial
number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson
distribution. We also observe the maximal clique size per node in the small-world network to be very close
to that of the average value and close to that of the maximal clique size in a regular network. There is no
appreciable decrease in the maximal clique size per node when the network transforms from a regular
network to a small-world network. On the other hand, when the network transforms from a small-world
network to a random network, the average maximal clique size value decreases significantly
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...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 the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
A SEMI-BLIND WATERMARKING SCHEME FOR RGB IMAGE USING CURVELET TRANSFORM
1. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
DOI:10.5121/ijfcst.2017.7101 1
A SEMI-BLIND WATERMARKING SCHEME
FOR RGB IMAGE USING CURVELET
TRANSFORM
Ranjeeta Kaushik1
, Sanjay Sharma2
and L. R. Raheja3
1
Department of Computer Science and Engineering, Thapar University, Patiala, Punjab,
India
2Department of Electronics and Communication Engineering, Thapar University, Patiala,
Punjab
3
Department of Navel Engineering,IIT, Kharagpur, India.
ABSTRACT
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.
KEYWORDS
Digital Watermarking, Curvelet Transform, Bit Plane, MSSIM
1. INTRODUCTION
The internet is being used by numbers of user and this number increasing day by day. Due to the
internet and the advantage of digital, Information material (multimedia data) is being distributed
without loss of quality. So it’s very difficult to protect the interest of an author or to preserve the
copyright. The most effective solution to the unauthorized distribution problem is watermarking.
Watermarking is a technique of embedding author information into the original work.
Watermarking has following requirements.
1. Watermark should not be perceptual visible
2. Watermark should be difficult to remove or impossible for modify.
3. Watermark should be robust against the image distortions caused by attackers
There are two domains for embedding the watermark one is spatial domain and other is transform
domain. In the first method of embedding, the watermark is by directly changing the original
2. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
2
pixel intensity of the cover image. The disadvantage of spatial techniques is that it does not give
the good robustness against the image processing attacks [1-2]. The second one is transformed
domain, in which watermark is embedded by changing the frequencies of the cover image. The
later one gives the good robustness. Embedding in transformations domain are common, some
famous transform of watermarking are Fourier transform [3], Discrete Cosine Transform (DCT)
[4-8]; Digital Wavelet Transform (DCT) [9-13], Ridgelet Transform (RT) [14] and much more.
Cox et al. [2] renowned that watermark to be robust against the image processing operations, it
must be located in perceptually important regions of the image. Watermarking is based on
samples and embedded into largest DCT coefficients. R. Dugad [10] &Peining Tao [11] proposed
watermarking using wavelet transformation which provides the multi-resolution representation of
the image. J.-J. Lee [12] proposed a dual-tree implementation for complex wavelet transform
(DT-CWT), which attains good directional selectivity and approximate shift invariance.
2. LITERATURE REVIEW
In literature, many authors embedded the watermark in the wavelet domain. Though wavelet
transform has been explored broadly in image processing, due to the problem of representing line
singularity, it fails to represent edges and curves [16-18]. The wavelet transform is not suitable
for describing anisotropic elements. It includes only two directional elements it means transform
is independent of scale. The disadvantage is overcome by the ridgelet transform. The basic idea
of the ridgelet transform [14] is to plot a line singularity in the 2-D domain into a point by means
of a radon transform. There is also some watermarking based on the ridgelet transform. But
ridgelet transform cannot well represent curve edges. So Curvelet transform is developed, it is a
multiscale pyramid with many directions and positions at each fine scale and has needle-shaped
elements at the fine scales [15-16].
Researchers have changed their focus to the curvelet transform [18] for its properties such as it
provide sparse representations of objects along a curve and it is anisotropic with strong direction.
Thai Hien et al. [19] embedded the watermark in the curvelet transform which contains as much
edge information as possible. It has good invisibility but poor robustness. The method of Thai
Hien et al. [20] embedded a watermark in curvelet coefficients which are selected by a threshold.
This method has good invisibility and robustness. Shi et al. [21] proposed a semi-fragile
watermarking algorithm by embedding the watermark in the supreme module of curvelet
coefficient. This technique gives good robustness against compression operation.Among these
techniques, those require the original cover image, key and bits of watermark for watermark
extraction are called non-blind watermarking techniques [4]. Robustness of non-blind technique is
good under image processing attacks. But it is not appropriate for watermark detection in DVD
player because the original data is not accessible. Those need the secret key but not require
original cover image at the time of extraction is called a blind watermarking technique. This
technique is suitable for all types of application, but the blind watermarking is usually less robust
compared with the non-blind watermarking scheme. Those require the key and the watermark bit
sequence is called semi-blind watermarking technique. Semi-blind watermarking techniques give
the yield good robust against attacks and suitable for most of the application. In this paper, we
discuss the semi-blind technique of watermarking.Literature also gives some semi-blind
technique Lin et al. [22] proposed a semi-blind watermarking scheme using the Discrete Fourier
Transform (DFT). Solachidis et al [23] use circular symmetric in DFT domain. Licks et al. [24]
proposed a circular symmetric watermarking in which watermark is extracted by an exhaustive
search. Stankovic et al. [25] embed the watermark by mean of a 2D radon –Wigner distribution.
3. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
3
There is not so much literature found on color watermarking in curvelet domain. Some of the
author takes the colored image as the cover image in best of author knowledge no one tried to
embed the color watermark in the color cover image using curvelet transform. In this paper, we
tried to embed an RGB watermark image into curvelet coefficients of RGB cover image. Here
author used a bit plane method to split watermark image. The Most significant bit is used an
embedding information and other lower bit planes used as the key. To evaluate the invisibility
and the robustness of proposed method PSNR, Normalized Correlation (NC) and MSSIM metrics
are used.
3. CURVELET TRANSFORM
This block ridgelet-based transform is called as curvelet transform. It was first proposed by
Candes and Donoho [15]. Actually the ridgelet transform is the fundamental for the curvelet
transform. The ridgelet transform is optimal at representing straight-line singularities.
Unfortunately, worldwide straight-line singularities are rarely used in many applications [31].
To analyze local line or curve singularities, the natural idea is to consider a partition of the image,
and then to apply the ridgelet transform to the obtained sub-images. So the block based ridgelet
transform is named as curvelet transform[31-32].
Let µ be the triple in the function plane. Where j=0,1…. is a scale parameter, l= 0,1,2…..
an orientation parameter and is the translation parameter pairs. A
curvelet coefficient is simply the inner product between an element and curvelet
given by
Where is the rotation by radian, J= (j,l) is the index of wedge for all k with it and is a
polar wedge window of radial dilation and angular transformation[17]. Define coarse scale
curvelet as
Similar to other multi-scale pyramids, curvelet transform images into several frequency scales.
An important factor in curvelet domain is not the “Approximation Rate”. If having an object in
the domain , how fast can approximate it using the certain system of function?
4. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
4
Eq. (iv), Eq. (v) and Eq. (vi) gives the approximate rate of Fourier Transform, wavelet transform
and curvelet transform respectively. Conceptually the curvelet transform is a multiscalepyramid
with many directions and positions at each fine scale and needle-shaped elements at fine scales
[30]. Based on the curvelet transform, it is possible to embed watermarks onto more significant
components and spread the amendments to more space locations.
4. PROPOSED WATERMARK EMBEDDING TECHNIQUE
Here we proposed a technique of embedding the color watermark in an RGB image. To embed
the watermark, the original cover image is being divided into color planes. The cover image has
three color planes red, green and blue. The embedding has following steps
4.1 Embedding algorithm
a) Watermark image is also colored so firstly separates there color planes Br, Bg and Bb red
plane, green plane and blue plane of the watermarked image respectively. Now obtain bit
planes of each color plane. {Br1, Br2….Br8}, {Bg1, Bg2…Bg8} and {Bb1, Bb2…Bb8} are the set
of bit planes of red, green and blue color planes respectively. Br1.Bg1 and Bb1 is the least
significant bit of red, green and blue color. Br8, Bg8 and Bb8 are most significant bit plane
of red, green and blue color used as the watermark (to be embedded) and remaining other
{Br1, Br2….Br7}, {Bg1, Bg2…Bg7} and {Bb1, Bb2…Bb7} are used as a key at the time of
extraction.
b) The frequency spectrum is independent of transmission medium. Absorption spectrum
gives the idea about the spectral sensitivity of 3 cones. This shows that the eyes are not
much sensitive to blue color. The processed watermark has been embedded into the blue
color plane of frequency domain of the cover image. The semi blind method of
embedding watermark in curvelet domain is given below
c) Read the original cover image C and decomposed cover image C into RGB color planes.
Let Cr, Cg and Cb represent the red, green and blue color plane of the original cover image
respectively.
d) Perform a curvelet transform on the blue color plane (Cb) with a j number of
decomposition level and l number of scales. In this paper 4 decomposition level and 3
scales are used. The resultant curvelet coefficients being stored in multidimensional array
Clet
e) Select the orientation and scale for embedding the watermark. Let selected scale j and
orientation k1, k2 and k3 for embedding the bit planes Br8, Bg8 and Bb8 respectively. Stored
the selected oriented and scale coefficients
f) Set α i.e the key of embedding.
g) For each coefficients of selected orientation and scale modified by
If
• Else
5. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
5
• Else
Else
h) Apply inverse curvelet transform with the same scale on to the modified coefficients to
change the resulted image from frequency domain to time domain. Add this modified
blue color plane to red and green plane, means to convert resulting image into an RGB
watermarked image
4.2 Extraction Algorithm
Read watermarked image and obtains its color plane Wr, Wg and Wb are the color planes of red,
green and blue color respectively. Apply selected scale and perform curvelet transform on blue
color plane (Wb) of watermarked image. Stored the curvelet coefficient let Ex
a) Apply selected scale and orientation where watermark had been embedded. Let selected
scale j and orientation k1, k2,k3 for red, green and blue bit planes
b)
c) For each coefficient of ESr, ESg, ESb
d) Extract each bit planes of watermark
a.
b.
c.
e) From the 6th
step we find the most significant bit planes now we used stored watermark
bit plane to extract the color watermark. For each color plane and for each bit.
Extr=EWr *2^7+ Br7*2^6+ Br6*2^5+ Br5*2^4+Br4*2^3+Br3*2^2+Br2*2^1+Br1*2^0;
Extg=EWg*2^7+ Bg7*2^6+ Bg6*2^5+ Bg5*2^4+Bg4*2^3+Bg3*2^2+Bg2*2^1+Bg1*2^0;
Extb=EWb*2^7+ Bb7*2^6+ Bb6*2^5+ Bb5*2^4+Bb4*2^3+Bb3*2^2+Bb2*2^1+Bb1*2^0;
f) Extr, Extg and Extb are the color planes of red, green and blue color plane of extracted
watermark image. Combine these color planes and get the RGB extracted watermark.
5. QUALITY ASSESSMENT METRICS
Embedding the watermark in the cover image may degrade visual quality of the image. Quality
assessment metrics are based on well mathematical models that can predict visual quality by
comparing a watermarked image against a cover image. Following are the various metrics used
for the measurement of visual quality comparison.
5.1 Peak Signal to Noise Ratio (PSNR)
The most common evaluation method is to compute the peak signal-to-noise ratio (PSNR)
between the host and watermarked signals. PSNR is defined as follows:
6. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
6
More PSNR means better image quality. Where MSE (Mean Square Error) is define as
2
Where Im = Original image, Iw= watermarked image
5.2 Correlation Coefficient (CC)
Correlation Coefficient is the well knows measure for comparing the visual quality of two
images. The metric of CC defined as follows.
,
where , are the pixel intensities of cover and watermarked image respectively with m*n
size.
Although CC and PSNR is convenient to calculate and also has clear physical meaning but still it
does not correlate strongly enough with the visual quality of the image for most applications
[26].The scope of perceptual quality is widened in the Mean Structure Similarity Index Measure
(MSSIM) [27-29].
5.3 Mean Structure Similarity Index Measure (MSSIM)
MSSIM is the combination of three perceptual properties namely Luminance, Contrast and
structure at every point of the two images being compared. For the purpose of calculation of
MSSIM the image to be compared are broken in to number of windows of G*G, further the two
images must be of the same size [27]. If x and y are two images, M is the number of G*G
windows and N is the number of pixels in each window then MSSIM is define in the following
steps.
SSIM = ,
where ,
,
, In paper [28] k1= 0.01, k2=0.03 has been proposed
L= Dynamic range of the pixel values (255 for 8 bit gray scale image)
MSSIM (Mean SSIM) =
6. EXPERIMENTAL RESULTS AND DISCUSSION
To test the algorithm colored “lana.jpg” image used a cover image and a colored “thaper.jpg”
image used a watermark image. Fig. 1 and Fig.2 show the “lana.jpg” and “thaper.jpg” image
7. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
7
respectively. Fig. 3 shows the resulting watermarked image. Algorithm has been tested against all
the requirement parameter such as invisibility, effectiveness, and robustness. Here we compared
the quality of watermarked image and extracted watermark by the above-defined quality
assessment metrics such as PSNR, CC, and MSSIM. To show that the algorithm gives the good
robustness, the different image processing operations are being applied to the watermarked image.
The quality of extracted watermark from the distorted image have been analyzed by the quality
assessment metrics.
6.1 Invisibility
Embedding extra information in the original signal will cause degradation and perceptual
distortion. [4]. the most common evaluation method is to compute the peak signal-to-noise ratio
(PSNR) between the cover image and watermarked image. In this paper to test the invisibility of
the algorithm the quality of watermarked image and cover image are compared with the help of
quality assessment metrics. Fig 1.3 shows the watermarked image.The quality of watermarked
image has been analyzed by PSNR, CC and MSSIM metrics on each plane. Table 1.1 shows the
values of quality assessment metrics. In Table 1.1 Red_CC, Gr_CC, Blue_CC, Red_MSSIM,
Gr_MSSIM and Blue_MSSIM represent the correlation coefficients (CC) and MSSIM of the red,
green and blue color respectively. It may be observed that the PSNR is 44.97 confirming a high
invisibility of the watermark. Besides, the correlation coefficient, MSSIM is 0.99 for image
confirming almost no difference between the cover and watermarked image. This clearly shows
that the watermark is perfectly invisible.
Table 1.1 Invisibility Test
Image Name PSNR Red_CC Gr_CC Blue_CC Red_MSSIM Gr_MSSIM Blue_MSSIM
Watermarked 44.974 0.9996 0.9996 0.9991 0.9941 0.9950 0.9943
Table 1.2 Effectiveness Test
Extracted
watermark
Image
PSNR Red_C
C
Gr_CC Blue_CC Red_MSSIM Gr_MSSIM Blue_MSSIM
Fig. 4 38.5623 1 1 1 0.9761 0.9981 0.9953
Fig. 4 Extracted watermarkFig. 3 Watermarked ImageFig. 2 thapar.jpg
Fig. 1 lana.jpg
8. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
8
6.2 Extraction
Effectiveness refers to whether it is possible to detect a watermark immediately following the
embedding process. To test the effectiveness of the algorithm the same but in the reverse scheme
is used to extract the watermark from the watermarked image. There is no need of cover image
while extracting the watermark because the above discuss algorithm gives the semi-blind
extraction. Fig. 4 shows the extracted watermark image. The extracted watermark is compared
with the original watermark. Table 1.2 shows the extracted watermark and the quality of extracted
watermark is being analyzed by quality assessment metrics. The PSNR of extracted watermark is
38.5623, CC is one in all planes and MSSIM is also quite good. Table 1.2 verifies that the visual
quality of extracted watermark is very good and highly matched with original one.
6.3 Robustness Test
Robustness refers to the ability of the detector to detect the watermark after signal distortion, such
as format conversion, the introduction of transmission channel noise and distortion due to channel
gains. In order to test the robustness of the technique, one requires adding some sort of noise into
the watermarked image and then extracting the watermark. Besides, robustness is also tested by
applying various image processing operations such as filtering, rotation, cropping, adding sparsity
and shearing on the watermarked image and then extracts the watermark. Thereafter, the
extracted watermark is compared by original watermark image by applying the quality assessment
metrics. Fig. 5 to Fig. 11 show the quality of extracted watermarks from the distorted
watermarked images. Table 1.3 shows the results of extracted watermark under various attacks.
Robustness has been testing under approximately all the image processing attacks.
Fig. 5 Extracted watermark
from Gaussian Noised
watermarked image
Fig. 6 Extracted watermark
from Pepper salt noised
watermarked image
Fig. 7 Extracted watermark from
900
rotated watermarked image
Fig.8 Extracted watermark from un-
sharp filtered watermarked image
Fig. 10 Extracted watermark after projective
shearing operation on watermarked image
Fig. 11 Extracted watermark after sparsity
(128*256) on watermarked image
Fig. 9 Extracted watermark from
128*128 cropped watermarked image
9. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
9
6.3.1. Anti- Noise
Test the robustness against noise operation. Authors add two types of noise one is Gaussian noise
with 0.1 variance and other is pepper salt noise with noise density 0.01 on watermarked image
then tried to extract the watermark from noised watermarked image. Fig. 5 and Fig. 6 show the
visual quality of Extracted watermark from Gaussian Noised watermarked image and pepper salt
noised watermarked image respectively. The results are presented in Table 1.3 with two types of
noise namely pepper salt and Gaussian. The similarity measure MSSIM and CC confirm the
presence of watermark to the extent of more than 70 % similarity on red and green color planes.
The red color planes are more sensitive to human eyes.The CC and MSSIM of red color planes of
extracted watermark are 0.9. This shows that the technique is robust enough against noise
addition.
Table 1.3 Robustness test against Noise
Attacks PSNR Red_CC Gr_CC Blue_C
C
Red_MSSIM Gr_MSSIM Blue_MSSIM
Gaussian
Noise
19.631 0.9596 0.8979 0.7136 0.8998 0.7916 0.6555
Pepper
Salt Noise
18.953 0.9496 0.8579 0.7086 0.8783 0.7716 0.5955
6.3.2. Anti-Rotation
Rotation is very important to image processing operation, but most of the authors do not test the
robustness of their techniques against the rotation. Here we test the robustness against rotation
operation the watermarked image is rotated by 90 degrees and the watermark is extracted. Fig. 7
shows the visual quality of the Extracted watermark from 900 rotated watermarked image. The
extracted watermark is being compared by original watermark image using different quality
assessment metrics on each color planes. Table 1.4 shows the values of visual quality of
extracted watermark with the original one. It may be observed that both similarities measure
MSSIM and CC are reasonably good in each color planes that confirming the similarity of
extracted watermark with an original one. Therefore, it may be concluded that the technique is
robust against rotation operation.
6.3.3. Anti – Filtering
In order to check the robustness against filtering operation, the unsharp filter was applied on
watermarked image and thereafter the watermark was extracted from the filtered watermarked
image and compared with original watermark image. Fig.8 shows the visual quality of extracted
watermark from un-sharp filtered watermarked image. Table 1.4 shows the values of quality
assessment metric by comparing extracted watermark from the filtered watermark image and the
original watermark. The CC and MSSIM are good in all the color planes that show the similarity
of extracted watermark with the original one. Table 1.4 verifies that this watermarking technique
is robust against the filtering operation of image processing.
10. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
10
6.3.4 Anti- cropping
Cropping of an image means to cut a part of the image. Accordingly, it is now required to check
whether the watermark is present in the cropped part of the image. Here, cropped parts of size
128*128 of the watermarked image are taken and then the watermark is being extracted by the
cropped part of watermarked image. Fig. 9 shows the visual quality of extracted watermark. The
values of quality assessment metrics are shown in Table 1.4. It is observed that the values of
similarity metrics MSSIM, CC are slightly lower than 0.6 in general. This is obviously due to the
relatively smaller size of the cropped part. However, the values confirm the presence of the
watermark in these cropped sizes
Table 1.4 Robustness test against image processing Operations
Attacks PSN
R
Red_C
C
Gr_C
C
Blue_C
C
Red_MSSI
M
Gr_MSSI
M
Blue_MSSI
M
90 Degree
Rotation
14.64
9
0.9293 0.7614 0.6682 0.8629 0.7311 0.6216
Un-sharp
Filtering
11.23
2
0.8787 0.7583 0.7025 0.8073 0.6889 0.6665
Cropping
128*128
13.08
9
0.7843 0.6339 0.5994 0.7723 0.6047 0.5418
Projective
Shearing
8.584
5
0.8555 0.7001 0.6879 0.7858 0.6530 0.6338
Sparsity
(128*256)
11.64
9
0.8379 0.7487 0.8122 0.7912 0.6939 0.7979
6.3.5 Anti – with other attacks
To test the robustness of the technique two more attacks are performed on watermarked image
one is projective shearing and other is adding some sparsity. Sparsity means adding a number of
zeros in the image. Here a vertical 128*256 sparsity is added into watermarked image. Fig. 10
and Fig. 11 show the visual quality of extracted watermark after the projective shearing operation
and after adding 128*256 sparsity on watermarked image respectively. Table 1.4 shows the
quality of extracted watermark image from these operations. The values of CC and MSSIM in
each color planes are nearly 0.7 in general that is reasonably good confirming the similarity of
watermarks. Therefore, it may be concluded that the technique is robust against any image
processing operations.
7. CONCLUSION
The semi-blind color watermarking technique of embedding the color watermark in RGB image
has been presented. The extraction does not need the original cover image at the time of
extraction. The bit plane and HVS concepts are used for embedding the watermark. The most
significant bit planes of each color planes of watermark image are embedded into the curvelet
coefficients of the blue color plane of the original cover image. To test the scheme, the algorithm
11. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
11
has been tested against invisibility, effectiveness, and robustness. The quality of watermarked
image and extracted watermark are being analyzed by the quality assessment metric such as
PSNR, CC, and MSSIM. By the Experimental results show the above discussed watermarking
technique fulfill all the requirements of watermarking and gives a robust color watermarking
without the loss of quality of the original cover image.
REFERENCES
[1] T. S. Chen, C. C. Chang, and M.S. Hwang,A virtual image cryptosystem based upon vector
quantization, IEEE Transactions on Image Processing, 7 (1998) 1485-1488.
[2 ]C. T. Hsu and J. L. Wu , Hidden digita1 watermarks in images, IEEE Transactions on Images
Processing, 8 (1999) 58-68.
[3] C. Zhang, L. L. Cheng, Z. Qiu and L. L. Chang,Multipurpose Watermarking Based on
multiscaleCurvelet Transform, IEEE transactions on information forensics and security, 3 (2008)
611-619.
[4] I. Cox, J. Kilian, F. Leighton, and T. Shamoon, Secure Spread Spectrum Watermarking for
Multimedia, IEEE Transactions on Image Processing, 6 (1997) 1673-1687.
[5] A. Piva, M. Barni, F. Bartonlini, V. Cappellini, DCT-base watermark recovering without resorting to
the uncorrupted original image,Proc. ICIP, Atlanta, GA, 1(1997) 520–523.
[6] N. Ahmidi, R. Sfabakhsh, A novel DCT-based approach for secure color image watermarking,Proc.
Int. Conf. Information Technology: Coding and Computing, Las Vegas,(2004) 709–713.
[7] J. Huang, Y.Q.Shi, Y.Shi, Embedding image watermarks in Dc components, IEEE trans. Circuits
Syst. Video Technol.10(2000) 974-979.
[8] C. S LU, S. K. Huang, C. J. Sze, H.Y.M. Liao, Cocktail watermarking for digital image protection,
IEEE Trans. Multimedia,2 (2000) 209-224
[9] S. H. Wang, Y. P. Lin, Wavelet tree quantization for copyright protection watermarking,IEEE Trans.
Image Process., 13 (2004) 154–165.
[10] R. Dugad, K. Ratakonda, N. Ahuja, A New Wavelet-Based Scheme for Watermarking Images, Proc.
of Int. Conf. on Image Processing (ICIP 1998), Chicago, 2 (1998) 419-423,
[11] P. Tao, A. M. Eskicioglu, A Robust Multiple Watermarking Scheme in the Discrete Wavelet
Transform Domain, Optics East Internet Multimedia Management Systems Conference, Philadelphia,
PA, 2004
[12] J.J. Lee, W. Kim, N.Y.Lee, G.Y. Kim, A new incremental watermarking based on dual-tree complex
wavelet transform, J. Supercomput., 33 (2005) 133–140.
[13] Hsu, Hidden digital watermarks in images, IEEE Trans. Image Processing, 8 (1999) 55-68.
[14] M. N. Do, M. Vetterli, The finite ridgelet transform for image representation, IEEE Trans. Image
Process., 12 (2003) ,16–28.
[15] E. J. Candes and D. L. Donoho, C. R. A. Cohen , L. L. Schumaker, Eds., Curvelets - A surprisingly
effective nonadaptive representation for objects with edges, in Curves Surfaces, Nashville, TN, pp.
105–120,2000.
[16] E. J. Candes, L. Demanet, D. L. Donoho, L. Ying. , Fast discrete curvelet transforms,Multiscale
Model. Simul. 5 (2005) 861-899.
[17] E. J. Candes and D. L. Donoho, New tight frames of curvelets and optimal representations of objects
with C2 singularities, Comm. Pure Appl. Math, 57 (2004)219–266.
[18] E. J. Candes, D. L. Donoho, Continuous curvelet transform: II. Discretization and frames, Appl.
Comput. Harmon. Anal.19 (2003) 198-222.
[19] T. D. Hien, K. Miyara, et al., Curvelet Transform Based Logo Watermarking, Innovative Algorithms
and Techniques in Automation, Industrial Electronics and Tele-communication, (2007) 305-309.
[20] T. D. Hien, I. Kei, H. Harak, et al., Curvelet-Domain Image Watermarking Based on Edge-
Embedding, Lecture Notes in Computer Science, 4693 (2007) 311-317.
[21] J. P. Shi, Z. J. Zhai, Curvelet Transform for Image Authentication, Rough Set and Knowledge
Technology,(2006), 659-664.
12. International Journal in Foundations of Computer Science & Technology (IJFCST) Vol.7, No.1, January 2017
12
[22] C.Y. Lin, M. Wu, J.A. Bloom, I.J.Cox, M. L.Miller , Y. M. Lui, Rotation scale, and translation
resilient watermarking for images, IEEE Trans. Image Processing, 10 (2001) 767-782.
[23] V.Solachidis, I. Pitas, Circularly symmetric watermarking embedding in 2 D DFT domain, IEEE
Trans. Image Processing, 10 (2001) 1741-1753.
[24] V. Lick, R. Jordan, on digital image watermarking robust to geometric transformation, Proc. IEEE Int.
conf. Image processing, 3(2001) 600-693.
[25] S. Stankovic, I. Djurovic, I. Pitas, watermarking in the space/spatial frequency domain using two
dimensional Radon-Wigner distribution, IEEE Trans. Image Processing, 10 (2001) 650-658.
[26] E. Marini, F. Autrusseau, P. Callet, P. Campisi, Evaluation of standard watermarking techniques,
Electronic imaging, security, steganography and watermarking of multimedia contents, San, 2008
[27] Z. Wangand,A. C. Bovik, A Universal Image Quality Index, IEEE signal processing letters, 9 (2002)
81-84.
[28] Z. Wang, A. C.Bovik, Image Quality Assessment: From Error Visibility to Structural Similarity,
IEEE transaction on image processing, 13 (2004) 600-612.
[29] Z. Wang and A. C. Bovik, "Mean Squared Error: Love It or Leave It?,IEEE Signal Processing
Magazine, 26 (2009)98-117.
[30] D. L. Donoho, M. R Duncan, “Digital Curvelet Transform: Strategy, Implementation and
Experiments,Proc. SPIE, Wavelet Applications VII, 4056 (2000)
[31] S. Jean-Luc, E.J.Candes, D.L.Donoho, "The curvelet transform for image denoising, Image
Processing IEEE Transactions,11 (2002) 670-684.
AUTHORS
Ms. Ranjeeta, working as Associate professor in CGC, Landran, Mohali, Punjab and
pursuing Ph.D from computer department, Thapar University, Patiala. And. The area of her
research is image processing.
Dr. Sanjay Sharma, Professor and head of department, ECE Department, Thapar University,
Patiala. He has a rich experience In the field of antenna and image processing. He has
numbers of research publications in the same field.
Dr. L.R.Raheja, Ex professor, IIT, Kharagpur. He has 40 years of teaching and research
experience. The area of expertise is naval designing, Graphics, Simulation and mathematics.