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.
This document summarizes a technique called CADU (collaborative adaptive down-sampling and upconversion) to improve image compression at low bit rates. The technique adaptively decreases high frequency information by directionally prefiltering an image before uniform downsampling. This allows the downsampled image to be conventionally compressed while avoiding aliasing artifacts. At the decoder, the low-resolution image is decompressed and then upconverted to the original resolution using constrained least squares restoration with an autoregressive model. Experimental results show CADU outperforms JPEG2000 in PSNR and visual quality at low to medium bit rates. The technique suggests oversampling wastes resources and could hurt quality given tight bit budgets.
A New Watermarking Algorithm Based on Image Scrambling and SVD in the Wavelet...IDES Editor
A new watermarking algorithm which is based on
image scrambling and SVD in the wavelet domain is discussed
in this paper. In the proposed algorithm, chaotic signals are
generated using logistic mapping and are used for scrambling
the original watermark. The initial values of logistic mapping
are taken as private keys. The covert image is decomposed
into four bands using integer wavelet transform; we apply
SVD to each band and embed the
The proposed system implements an image watermarking technique that incorporates human visual system (HVS) models into watermark embedding. The watermarking is performed in the wavelet domain. The algorithm first calculates the coarseness of different subbands (HH, HL, LH) to select the subband with the highest coarseness for watermark embedding. It then embeds the watermark bits into the selected subband by modifying the least significant bits of coefficients based on their values. Experimental results on test images show the technique is robust, with average watermark extraction rates of 80-95% and high PSNR values, even after filtering.
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.
Novel DCT based watermarking scheme for digital imagesIDES Editor
There is an ever growing interest in copyright
protection of multimedia content, thus digital
watermarking techniques are widely practiced. Due to
the internet connectivity and digital libraries the
research interest of protecting digital content
watermarking is extensively researched. In this paper
we present a novel watermark generation scheme
based on the histogram of the image and apply it to the
original image in the transform(DCT) domain. Further
we study the performance of the watermark against
some common attacks that can take place with images.
Experimental results show that the embedded
watermark is imperceptible and image quality is not
degraded.
This paper presents a new approach for the enhancement of Synthetic Radar Imagery using Discrete Wavelet Transform and its variants. Some of the approaches like nonlocal filtering (NLF) techniques, and multiscale iterative reconstruction (e.g., the BM3D method) do not solve the RE/SR imaging inverse problems in descriptive settings imposing some structured regularization constraints and exploits the sparsity of the desired image representations for resolution enhancement (RE) and superresolution (SR) of coherent remote sensing (RS). Such approaches are not properly adapted to the SR recovery of the speckle-corrupted low resolution (LR) coherent radar imagery. These pitfalls are eradicated by using DWT approach wherein the despeckled/deblurred HR image is recovered from the LR speckle/blurry corrupted radar image by applying some of the descriptive-experiment-design-regularization (DEDR) based re-constructive steps. Next, the multistage RE is consequently performed in each scaled refined SR frame via the iterative reconstruction of the upscaled radar images, followed by the discrete-wavelet-transform-based sparsity promoting denoising with guaranteed consistency preservation in each resolution frame. The performance of the method proposed is compared in terms of the number of iterations taken by it with other techniques existing in the literature.
This document summarizes a research paper that proposes a new algorithm to detect copy-move forgery in digital images using Discrete Wavelet Transform (DWT). The algorithm works by applying DWT to decompose the input image into sub-bands, dividing the low-frequency sub-band into overlapping blocks, sorting the blocks lexicographically, identifying duplicate blocks based on their positions, and calculating shift vectors between matching blocks to detect the duplicated regions. The algorithm is more accurate and efficient than previous methods as it performs detection at the lowest DWT resolution to reduce computational complexity. Experimental results on test images show the algorithm can accurately detect copy-move forgeries with different sized duplicated regions.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes and analyzes different digital watermarking techniques under various attacks. It compares the Least Significant Bit (LSB), Discrete Cosine Transform (DCT), and Discrete Wavelet Transform (DWT) watermarking algorithms in terms of invisibility, distortion, and robustness. The LSB, DCT, and DWT watermark embedding and extraction procedures are described. Simulation results showed that the algorithms had good robustness against common image processing operations and were invisible with low distortion.
This document summarizes a technique called CADU (collaborative adaptive down-sampling and upconversion) to improve image compression at low bit rates. The technique adaptively decreases high frequency information by directionally prefiltering an image before uniform downsampling. This allows the downsampled image to be conventionally compressed while avoiding aliasing artifacts. At the decoder, the low-resolution image is decompressed and then upconverted to the original resolution using constrained least squares restoration with an autoregressive model. Experimental results show CADU outperforms JPEG2000 in PSNR and visual quality at low to medium bit rates. The technique suggests oversampling wastes resources and could hurt quality given tight bit budgets.
A New Watermarking Algorithm Based on Image Scrambling and SVD in the Wavelet...IDES Editor
A new watermarking algorithm which is based on
image scrambling and SVD in the wavelet domain is discussed
in this paper. In the proposed algorithm, chaotic signals are
generated using logistic mapping and are used for scrambling
the original watermark. The initial values of logistic mapping
are taken as private keys. The covert image is decomposed
into four bands using integer wavelet transform; we apply
SVD to each band and embed the
The proposed system implements an image watermarking technique that incorporates human visual system (HVS) models into watermark embedding. The watermarking is performed in the wavelet domain. The algorithm first calculates the coarseness of different subbands (HH, HL, LH) to select the subband with the highest coarseness for watermark embedding. It then embeds the watermark bits into the selected subband by modifying the least significant bits of coefficients based on their values. Experimental results on test images show the technique is robust, with average watermark extraction rates of 80-95% and high PSNR values, even after filtering.
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.
Novel DCT based watermarking scheme for digital imagesIDES Editor
There is an ever growing interest in copyright
protection of multimedia content, thus digital
watermarking techniques are widely practiced. Due to
the internet connectivity and digital libraries the
research interest of protecting digital content
watermarking is extensively researched. In this paper
we present a novel watermark generation scheme
based on the histogram of the image and apply it to the
original image in the transform(DCT) domain. Further
we study the performance of the watermark against
some common attacks that can take place with images.
Experimental results show that the embedded
watermark is imperceptible and image quality is not
degraded.
This paper presents a new approach for the enhancement of Synthetic Radar Imagery using Discrete Wavelet Transform and its variants. Some of the approaches like nonlocal filtering (NLF) techniques, and multiscale iterative reconstruction (e.g., the BM3D method) do not solve the RE/SR imaging inverse problems in descriptive settings imposing some structured regularization constraints and exploits the sparsity of the desired image representations for resolution enhancement (RE) and superresolution (SR) of coherent remote sensing (RS). Such approaches are not properly adapted to the SR recovery of the speckle-corrupted low resolution (LR) coherent radar imagery. These pitfalls are eradicated by using DWT approach wherein the despeckled/deblurred HR image is recovered from the LR speckle/blurry corrupted radar image by applying some of the descriptive-experiment-design-regularization (DEDR) based re-constructive steps. Next, the multistage RE is consequently performed in each scaled refined SR frame via the iterative reconstruction of the upscaled radar images, followed by the discrete-wavelet-transform-based sparsity promoting denoising with guaranteed consistency preservation in each resolution frame. The performance of the method proposed is compared in terms of the number of iterations taken by it with other techniques existing in the literature.
This document summarizes a research paper that proposes a new algorithm to detect copy-move forgery in digital images using Discrete Wavelet Transform (DWT). The algorithm works by applying DWT to decompose the input image into sub-bands, dividing the low-frequency sub-band into overlapping blocks, sorting the blocks lexicographically, identifying duplicate blocks based on their positions, and calculating shift vectors between matching blocks to detect the duplicated regions. The algorithm is more accurate and efficient than previous methods as it performs detection at the lowest DWT resolution to reduce computational complexity. Experimental results on test images show the algorithm can accurately detect copy-move forgeries with different sized duplicated regions.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes and analyzes different digital watermarking techniques under various attacks. It compares the Least Significant Bit (LSB), Discrete Cosine Transform (DCT), and Discrete Wavelet Transform (DWT) watermarking algorithms in terms of invisibility, distortion, and robustness. The LSB, DCT, and DWT watermark embedding and extraction procedures are described. Simulation results showed that the algorithms had good robustness against common image processing operations and were invisible with low distortion.
In the current scenario compression of video files is in high demand. Color video compression has become a significant technology to lessen the memory space and to decrease transmission time. Video compression using fractal technique is based on self similarity concept by comparing the range block and domain block. However, its computational complexity is very high. In this paper we presented hybrid video compression technique to compress Audio/Video Interleaved file and overcome the problem of Computational complexity. We implemented Discrete Wavelet Transform and hybrid fractal HV partition technique using Particle Swarm Optimization (called mapping of PSO) for compression of videos. The analysis demonstrate that hybrid technique gives a very good speed up to compress video and achieve Peak Signal to Noise Ratio.
The document proposes a new video watermarking algorithm using the dual-tree complex wavelet transform (DTCWT). The DTCWT offers advantages like shift invariance and directional selectivity. The algorithm embeds a watermark by adding its coefficients to high frequency DTCWT coefficients of video frames. Masks are used to hide the watermark perceptually. Experimental results show the proposed method is robust to geometric distortions, lossy compression, and a joint attack, outperforming comparable DWT-based methods. It is suitable for playback control due to its robustness and simple implementation.
Performance comparison of hybrid wavelet transforms formed using dct, walsh, ...ijcsit
1. The document discusses a proposed watermarking method using hybrid wavelet transforms and singular value decomposition (SVD).
2. Hybrid wavelet transforms are generated from combinations of discrete cosine transform (DCT), Walsh, Haar, and discrete Kekre transform (DKT). DCT is tested as both the global and local component of the hybrid transform.
3. SVD is applied to the watermark before embedding in the mid-frequency coefficients of the hybrid wavelet transformed host image.
4. The method is tested against various attacks including compression, cropping, noise addition, and resizing. Using DCT as the global component is found to be more robust, particularly against compression attacks.
This document presents a comparison of two image inpainting techniques - curvature driven diffusion (CDD) inpainting and total variation (TV) inpainting. The paper aims to apply these two inpainting methods to grayscale and color images to restore damaged regions. CDD inpainting works by solving partial differential equations of isophote intensity, while TV inpainting is based on texture filling. Experimental results on various images are shown to demonstrate the effectiveness of the two approaches. The document also discusses related work, provides implementation details of the two methods, and outlines potential future work including hardware implementation.
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.
This document presents a new algorithm for progressive medical image coding using binary wavelet transforms (BWT). It divides grayscale medical images into binary bit-planes and applies a three-level BWT to each bit-plane. It then encodes each BWT bit-plane using quadtree-based partitioning to exploit the energy concentration in high-frequency subbands. Experiments on ultrasound, MRI and CT images show it provides significant improvements in bitrate for required quality compared to existing progressive image coding methods.
Performance Analysis of Digital Watermarking Of Video in the Spatial Domainpaperpublications3
Abstract:In this paper, we have suggested the spatial domain method for the digital video watermarking for both visible and invisible watermarks. The methods are used for the copyright protection as well as proof of ownership. In this paper we first extracted the frames from the video and then used spatial domain characteristics of the frames where we directly worked on the pixel value of the frame according to the watermark and calculated different parameters.
Keywords:Digital video watermarking, copyright protection, spatial domain watermarking, Least Significant bit substitution.
This document proposes an enhanced adaptive data hiding technique in the discrete wavelet transform (DWT) domain. It begins with background information on DWT and quantization techniques like uniform and adaptive quantization. It then describes how data can be embedded in the non-zero DWT coefficients after adaptive quantization. Specifically, it embeds secret data by modifying the quantized DWT coefficients in a way that minimizes distortion to maintain good visual quality of the cover image. The goal is to improve data hiding capacity while preserving the quality of the cover image as measured by metrics like peak signal-to-noise ratio (PSNR) and the human visual system (HVS).
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.
FPGA Based Design of High Performance Decimator using DALUT AlgorithmIDES Editor
This paper presents a multiplier less approach
to implement high speed and area efficient decimator for
down converter of Software Defined Radios. This
technique substitutes multiply-and-accumulate (MAC)
operations with look up table (LUT) accesses. Proposed
decimator has been implemented using Partitioned
distributed arithmetic look up table (DALUT) algorithm
by taking optimal advantage of embedded LUTs of target
FPGA device. This method is useful to enhance the system
performance in terms of speed and area. The proposed
decimator has used half band polyphase decomposition
FIR structure. The decimator has been designed with
Matlab 7.6, simulated with Modelsim 6.3XE simulator,
synthesized with Xilinx Synthesis Tool (XST) 10.1 and
implemented on Spartan-3E based 3s500efg320-4 FPGA
device. The proposed DALUT approach has shown an
improvement of 24% in speed by saving almost 50%
resources of target device as compared to MAC based
approach.
A Dual Tree Complex Wavelet Transform Construction and Its Application to Ima...CSCJournals
This paper discusses the application of complex discrete wavelet transform (CDWT) which has significant advantages over real wavelet transform for certain signal processing problems. CDWT is a form of discrete wavelet transform, which generates complex coefficients by using a dual tree of wavelet filters to obtain their real and imaginary parts. The paper is divided into three sections. The first section deals with the disadvantage of Discrete Wavelet Transform (DWT) and method to overcome it. The second section of the paper is devoted to the theoretical analysis of complex wavelet transform and the last section deals with its verification using the simulated images.
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.
Simple and Fast Implementation of Segmented Matrix Algorithm for Haar DWT on ...IDES Editor
Haar discrete wavelet transform (DWT), the
simplest among all DWTs, has diverse applications in signal
and image processing fields. A traditional approach for 2D
Haar DWT is 1D row operation followed by and 1D column
operation. In 2002, Chen and Liao presented a fast algorithm
for 2D Haar DWT based on segmented matrix. However, this
method is infeasible for its high computational requirements
for processing large sized images. In this paper, we have
implemented the segmented matrix algorithm on a low cost
NVIDIA’s GPU to achieve speedup in computation. The
efficiency of our GPU based implementation is measured and
compared with CPU based algorithms. Our experimental
results show performance improvement over a factor of 28.5
compared with Chen and Liao’s CPU based segmented matrix
algorithm and a factor of 8 compared to MATLAB’s wavelet
function for an image of size 2560×2560.
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.
This document presents a comparative analysis of digital image watermarking techniques in the frequency domain using MATLAB Simulink. It discusses watermarking using discrete cosine transform (DCT) and discrete wavelet transform (DWT). For DCT, the image is divided into blocks and DCT is applied before embedding the watermark in middle frequency coefficients. For extraction, the same process is reversed. For DWT, the image is decomposed into sub-bands before embedding the watermark into the low-high frequency sub-band. Extraction follows the reverse process. The document also proposes a technique using both DCT and DWT that embeds a watermark into DCT coefficients of DWT sub-bands for increased robust
Fractal Image Compression Using Quadtree DecompositionHarshit Varshney
This document summarizes a student project on fractal image compression using quadtree decomposition. It introduces fractal image compression and quadtree decomposition partitioning. The proposed algorithm divides the original image using quadtree decomposition with a threshold of 0.2 and minimum and maximum block sizes of 2 and 64. It records fractal coding information and uses Huffman coding for compression. Experimental results on test images show compression ratios from 2.45 to 12.79 and reconstruction PSNR values from 22.24 to 27.35.
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.
Discrete cosine transform (DCT) is a widely used tool in image and video compression applications. Recently, the high-throughput DCT designs have been adopted to fit the requirements of real-time application.
Operating the shifting and addition in parallel, an error-compensated adder-tree (ECAT) is proposed to deal with the truncation errors and to achieve low-error and high-throughput discrete cosine transform (DCT) design. Instead of the 12 bits used in previous works, 9-bit distributed arithmetic. DA-based DCT core with an error-compensated adder-tree (ECAT). The proposed ECAT operates shifting and addition in parallel by unrolling all the words required to be computed. Furthermore, the error-compensated circuit alleviates the truncation error for high accuracy design. Based on low-error ECAT, the DA-precision in this work is chosen to be 9 bits instead of the traditional 12 bits. Therefore, the hardware cost is reduced, and the speed is improved using the proposed ECAT.
Transform coding is used in image and video processing to exploit correlations between neighboring pixels. The discrete cosine transform (DCT) is commonly used as it provides good energy compaction and de-correlation. DCT represents data as a sum of variable frequency cosine waves in the frequency domain. It has properties like separability and orthogonality that make it efficient for computation. DCT exhibits excellent energy compaction and removal of redundancy between pixels, making it useful for image and video compression.
High Speed and Area Efficient 2D DWT Processor Based Image Compressionsipij
The document describes a proposed high speed and area efficient 2D discrete wavelet transform (DWT) processor design for image compression applications implemented on FPGAs. The design uses a pipelined partially serial architecture to enhance speed while optimally utilizing FPGA resources. Simulation results show the design operating at 231MHz on a Spartan 3 FPGA, a 15% improvement over alternative designs. Resource utilization and speed are improved compared to previous implementations through the optimized DWT processor architecture and FPGA platform choice.
In the current scenario compression of video files is in high demand. Color video compression has become a significant technology to lessen the memory space and to decrease transmission time. Video compression using fractal technique is based on self similarity concept by comparing the range block and domain block. However, its computational complexity is very high. In this paper we presented hybrid video compression technique to compress Audio/Video Interleaved file and overcome the problem of Computational complexity. We implemented Discrete Wavelet Transform and hybrid fractal HV partition technique using Particle Swarm Optimization (called mapping of PSO) for compression of videos. The analysis demonstrate that hybrid technique gives a very good speed up to compress video and achieve Peak Signal to Noise Ratio.
The document proposes a new video watermarking algorithm using the dual-tree complex wavelet transform (DTCWT). The DTCWT offers advantages like shift invariance and directional selectivity. The algorithm embeds a watermark by adding its coefficients to high frequency DTCWT coefficients of video frames. Masks are used to hide the watermark perceptually. Experimental results show the proposed method is robust to geometric distortions, lossy compression, and a joint attack, outperforming comparable DWT-based methods. It is suitable for playback control due to its robustness and simple implementation.
Performance comparison of hybrid wavelet transforms formed using dct, walsh, ...ijcsit
1. The document discusses a proposed watermarking method using hybrid wavelet transforms and singular value decomposition (SVD).
2. Hybrid wavelet transforms are generated from combinations of discrete cosine transform (DCT), Walsh, Haar, and discrete Kekre transform (DKT). DCT is tested as both the global and local component of the hybrid transform.
3. SVD is applied to the watermark before embedding in the mid-frequency coefficients of the hybrid wavelet transformed host image.
4. The method is tested against various attacks including compression, cropping, noise addition, and resizing. Using DCT as the global component is found to be more robust, particularly against compression attacks.
This document presents a comparison of two image inpainting techniques - curvature driven diffusion (CDD) inpainting and total variation (TV) inpainting. The paper aims to apply these two inpainting methods to grayscale and color images to restore damaged regions. CDD inpainting works by solving partial differential equations of isophote intensity, while TV inpainting is based on texture filling. Experimental results on various images are shown to demonstrate the effectiveness of the two approaches. The document also discusses related work, provides implementation details of the two methods, and outlines potential future work including hardware implementation.
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.
This document presents a new algorithm for progressive medical image coding using binary wavelet transforms (BWT). It divides grayscale medical images into binary bit-planes and applies a three-level BWT to each bit-plane. It then encodes each BWT bit-plane using quadtree-based partitioning to exploit the energy concentration in high-frequency subbands. Experiments on ultrasound, MRI and CT images show it provides significant improvements in bitrate for required quality compared to existing progressive image coding methods.
Performance Analysis of Digital Watermarking Of Video in the Spatial Domainpaperpublications3
Abstract:In this paper, we have suggested the spatial domain method for the digital video watermarking for both visible and invisible watermarks. The methods are used for the copyright protection as well as proof of ownership. In this paper we first extracted the frames from the video and then used spatial domain characteristics of the frames where we directly worked on the pixel value of the frame according to the watermark and calculated different parameters.
Keywords:Digital video watermarking, copyright protection, spatial domain watermarking, Least Significant bit substitution.
This document proposes an enhanced adaptive data hiding technique in the discrete wavelet transform (DWT) domain. It begins with background information on DWT and quantization techniques like uniform and adaptive quantization. It then describes how data can be embedded in the non-zero DWT coefficients after adaptive quantization. Specifically, it embeds secret data by modifying the quantized DWT coefficients in a way that minimizes distortion to maintain good visual quality of the cover image. The goal is to improve data hiding capacity while preserving the quality of the cover image as measured by metrics like peak signal-to-noise ratio (PSNR) and the human visual system (HVS).
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.
FPGA Based Design of High Performance Decimator using DALUT AlgorithmIDES Editor
This paper presents a multiplier less approach
to implement high speed and area efficient decimator for
down converter of Software Defined Radios. This
technique substitutes multiply-and-accumulate (MAC)
operations with look up table (LUT) accesses. Proposed
decimator has been implemented using Partitioned
distributed arithmetic look up table (DALUT) algorithm
by taking optimal advantage of embedded LUTs of target
FPGA device. This method is useful to enhance the system
performance in terms of speed and area. The proposed
decimator has used half band polyphase decomposition
FIR structure. The decimator has been designed with
Matlab 7.6, simulated with Modelsim 6.3XE simulator,
synthesized with Xilinx Synthesis Tool (XST) 10.1 and
implemented on Spartan-3E based 3s500efg320-4 FPGA
device. The proposed DALUT approach has shown an
improvement of 24% in speed by saving almost 50%
resources of target device as compared to MAC based
approach.
A Dual Tree Complex Wavelet Transform Construction and Its Application to Ima...CSCJournals
This paper discusses the application of complex discrete wavelet transform (CDWT) which has significant advantages over real wavelet transform for certain signal processing problems. CDWT is a form of discrete wavelet transform, which generates complex coefficients by using a dual tree of wavelet filters to obtain their real and imaginary parts. The paper is divided into three sections. The first section deals with the disadvantage of Discrete Wavelet Transform (DWT) and method to overcome it. The second section of the paper is devoted to the theoretical analysis of complex wavelet transform and the last section deals with its verification using the simulated images.
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.
Simple and Fast Implementation of Segmented Matrix Algorithm for Haar DWT on ...IDES Editor
Haar discrete wavelet transform (DWT), the
simplest among all DWTs, has diverse applications in signal
and image processing fields. A traditional approach for 2D
Haar DWT is 1D row operation followed by and 1D column
operation. In 2002, Chen and Liao presented a fast algorithm
for 2D Haar DWT based on segmented matrix. However, this
method is infeasible for its high computational requirements
for processing large sized images. In this paper, we have
implemented the segmented matrix algorithm on a low cost
NVIDIA’s GPU to achieve speedup in computation. The
efficiency of our GPU based implementation is measured and
compared with CPU based algorithms. Our experimental
results show performance improvement over a factor of 28.5
compared with Chen and Liao’s CPU based segmented matrix
algorithm and a factor of 8 compared to MATLAB’s wavelet
function for an image of size 2560×2560.
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.
This document presents a comparative analysis of digital image watermarking techniques in the frequency domain using MATLAB Simulink. It discusses watermarking using discrete cosine transform (DCT) and discrete wavelet transform (DWT). For DCT, the image is divided into blocks and DCT is applied before embedding the watermark in middle frequency coefficients. For extraction, the same process is reversed. For DWT, the image is decomposed into sub-bands before embedding the watermark into the low-high frequency sub-band. Extraction follows the reverse process. The document also proposes a technique using both DCT and DWT that embeds a watermark into DCT coefficients of DWT sub-bands for increased robust
Fractal Image Compression Using Quadtree DecompositionHarshit Varshney
This document summarizes a student project on fractal image compression using quadtree decomposition. It introduces fractal image compression and quadtree decomposition partitioning. The proposed algorithm divides the original image using quadtree decomposition with a threshold of 0.2 and minimum and maximum block sizes of 2 and 64. It records fractal coding information and uses Huffman coding for compression. Experimental results on test images show compression ratios from 2.45 to 12.79 and reconstruction PSNR values from 22.24 to 27.35.
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.
Discrete cosine transform (DCT) is a widely used tool in image and video compression applications. Recently, the high-throughput DCT designs have been adopted to fit the requirements of real-time application.
Operating the shifting and addition in parallel, an error-compensated adder-tree (ECAT) is proposed to deal with the truncation errors and to achieve low-error and high-throughput discrete cosine transform (DCT) design. Instead of the 12 bits used in previous works, 9-bit distributed arithmetic. DA-based DCT core with an error-compensated adder-tree (ECAT). The proposed ECAT operates shifting and addition in parallel by unrolling all the words required to be computed. Furthermore, the error-compensated circuit alleviates the truncation error for high accuracy design. Based on low-error ECAT, the DA-precision in this work is chosen to be 9 bits instead of the traditional 12 bits. Therefore, the hardware cost is reduced, and the speed is improved using the proposed ECAT.
Transform coding is used in image and video processing to exploit correlations between neighboring pixels. The discrete cosine transform (DCT) is commonly used as it provides good energy compaction and de-correlation. DCT represents data as a sum of variable frequency cosine waves in the frequency domain. It has properties like separability and orthogonality that make it efficient for computation. DCT exhibits excellent energy compaction and removal of redundancy between pixels, making it useful for image and video compression.
High Speed and Area Efficient 2D DWT Processor Based Image Compressionsipij
The document describes a proposed high speed and area efficient 2D discrete wavelet transform (DWT) processor design for image compression applications implemented on FPGAs. The design uses a pipelined partially serial architecture to enhance speed while optimally utilizing FPGA resources. Simulation results show the design operating at 231MHz on a Spartan 3 FPGA, a 15% improvement over alternative designs. Resource utilization and speed are improved compared to previous implementations through the optimized DWT processor architecture and FPGA platform choice.
Development of a Cassava Starch Extraction Machineijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
The Myth of Softening behavior of the Cohesive Zone Model Exact derivation of...ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
[論文紹介] BlendedMVS: A Large-scale Dataset for Generalized Multi-view Stereo Ne...Seiya Ito
The document proposes a large-scale dataset called BlendedMVS for learning-based multi-view stereo networks. BlendedMVS was created by first generating high-quality textured 3D mesh models from input images, rendering the meshes to obtain depth maps, and then blending the rendered images with the original images to introduce realistic lighting information. It contains over 17,000 high-resolution images covering various indoor and outdoor scenes. Three state-of-the-art MVS networks (MVSNet, R-MVSNet, and Point-MVSNet) are trained on BlendedMVS and show improved generalization ability compared to being trained on other smaller datasets.
A robust combination of dwt and chaotic function for image watermarkingijctet
This document summarizes a research paper on a robust image watermarking technique that combines discrete wavelet transform (DWT) and a chaotic function. The proposed method embeds a watermark into selected blocks of the low-frequency DWT subband of an image. It calculates the Euclidean distance between blocks of the watermark and image to select the most similar block for embedding. Experimental results on standard test images show the proposed method achieves better performance than previous methods in terms of PSNR and structural similarity under compression attacks. The extraction accuracy remains high even with noise attacks, though it degrades more under filtering attacks.
Image compression using Hybrid wavelet Transform and their Performance Compa...IJMER
Images may be worth a thousand words, but they generally occupy much more space in hard disk, or
bandwidth in a transmission system, than their proverbial counterpart. Compressing an image is significantly
different than compressing raw binary data. Of course, general purpose compression programs can be used to
compress images, but the result is less than optimal. This is because images have certain statistical properties
which can be exploited by encoders specifically designed for them. Also, some of the finer details in the image
can be sacrificed for the sake of saving a little more bandwidth or storage space. Compression is the process of
representing information in a compact form. Compression is a necessary and essential method for creating
image files with manageable and transmittable sizes. The data compression schemes can be divided into
lossless and lossy compression. In lossless compression, reconstructed image is exactly same as compressed
image. In lossy image compression, high compression ratio is achieved at the cost of some error in reconstructed
image. Lossy compression generally provides much higher compression than lossless compression.
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.
PREVENTING COPYRIGHTS INFRINGEMENT OF IMAGES BY WATERMARKING IN TRANSFORM DOM...ijistjournal
1) The document discusses a method for preventing copyright infringement of images using watermarking in the transform domain and a full counter propagation neural network.
2) It aims to encode the host image before watermark embedding to enhance security. The fast and effective full counter propagation neural network then helps successfully embed the watermark without deteriorating the image quality.
3) Previous techniques embedded watermarks directly in images, but the authors find neural network synapses provide a better way to reduce distortion and increase message capacity when embedding watermarks.
This document discusses a project to implement image segmentation algorithms in parallel on a RISC processor for real-time processing. The project proposes a new segmentation chain using topological operators like thinning and crest restoration. This chain was tested on medical images and able to process 33 512x512 images per second on a 3.06GHz Pentium IV processor using SSE instructions, demonstrating it can meet real-time constraints. The new chain provides high quality segmentation and is well-suited for medical applications.
This document discusses parallel processing and compound image compression techniques. It examines the computational complexity and quantitative optimization of various image compression algorithms like BTC, DCT, DWT, DTCWT, SPIHT and EZW. The performance is evaluated in terms of coding efficiency, memory usage, image quality and quantity. Block Truncation Coding and Discrete Cosine Transform compression methods are described in more detail.
Novel Approach for Image Restoration and TransmissionCSCJournals
This paper develops a new technique in image restoration and transmission process, where the image size is halved after transforming it to the frequency domain by applying discrete Fourier transform. The conjugate symmetry and mirror property of transformed image spectrums could be utilized by deleting the redundant spectrums from second half image after tracking and keeping the conjugated locations. Those redundant locations are kept using one- to- one relationship. Depending on the halving procedure, the new image size will be divided by two. A reconstructed procedure is created to redistribute the deleted spectrum with their associated locations. The reconstructed image is ready now for restoring again by applying the inverse discrete Fourier transform back to the spatial domain. The restored image is qualified using Peak Signal to Noise Ratio measurement and the result was very satisfied. The advantages of this technique appear in the storage cost, where the memory locations will be reduced to the half. Also, from communication side, this work approved that the image transmission time needs to transmit the halved image is half of the original one.
The objective of this work is to propose an image
denoising technique and compare it with image denoising
using ridgelets. The proposed method uses slantlet transform
instead of wavelets in ridgelet transform. Experimental result
shows that the proposed method is more effective than ridgelets
in noise removal. The proposed method is effective in
compressing images while preserving edges.
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 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.
Gray Image Watermarking using slant transform - digital image processingNITHIN KALLE PALLY
SLANT TRANSFORM
This section details the proposed semi-blind watermarking scheme for copyright protection of digital images. The following subsections present the steps involved in the watermark embedding and extraction processes along with a brief description about the Slant transform, DWT and SVD
Slant transform is derived from saw tooth waveforms. A slant transform matrix has a constant basis vector corresponding to zero sequency and slant basis vector basis vectors monotonically decreases with sequency inconstant step from maximum to minimum. The matrix has sequency property and high energy compaction property[12]. The lowest order of slant matrix is 2 and 2 X 2 matrix is identical to Hadamard matrix
This document summarizes an image watermarking algorithm in the discrete wavelet transform (DWT) domain for image authentication. The algorithm first converts the input image to grayscale and divides the Y component into blocks. It then applies a 2-level DWT and uses a Canny edge detector to generate a watermark from the image contours. The watermark is embedded in the DWT coefficients after applying an Arnold transform for security. In extraction, the watermark is recovered from the DWT coefficients and compared to the original to authenticate the image. Experiments show the algorithm is effective against attacks like image pasting while maintaining high PSNR for perceptual invisibility of the watermark.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document discusses a digital video watermarking technique using discrete cosine transform (DCT) and perceptual analysis. It proposes embedding a binary watermark in the DCT domain of video frames. A mathematical model is developed to insert a visible watermark into video frames in the DCT domain while considering characteristics of the human visual system to minimize perceptual quality impact. Experimental results show a watermarked video frame with the watermark logo embedded at different positions. The technique aims to provide copyright protection for digital video applications.
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
This document summarizes a research paper that proposes a content-based hybrid DWT-DCT watermarking technique for image authentication in color images. The technique embeds statistical features extracted from the host image as the watermark. Four different statistical features are used to generate the watermark - the Frobenius norm, mean, standard deviation, and combined mean and standard deviation of the host image blocks. The watermark is then embedded into the host image by applying both DWT and DCT transforms. During extraction, the same process is applied to extract the watermark for authentication. Experimental results show the technique is robust against various attacks like compression, noise, and filters.
The growing trend of online image sharing and downloads today mandate the need for better encoding and
decoding scheme. This paper looks into this issue of image coding. Multiple Description Coding is an
encoding and decoding scheme that is specially designed in providing more error resilience for data
transmission. The main issue of Multiple Description Coding is the lossy transmission channels. This work
attempts to address the issue of re-constructing high quality image with the use of just one descriptor
rather than the conventional descriptor. This work compare the use of Type I quantizer and Type II
quantizer. We propose and compare 4 coders by examining the quality of re-constructed images. The 4
coders are namely JPEG HH (Horizontal Pixel Interleaving with Huffman Coding) model, JPEG HA
(Horizontal Pixel Interleaving with Arithmetic Encoding) model, JPEG VH (Vertical Pixel Interleaving
with Huffman Encoding) model, and JPEG VA (Vertical Pixel Interleaving with Arithmetic Encoding)
model. The findings suggest that the use of horizontal and vertical pixel interleavings do not affect the
results much. Whereas the choice of quantizer greatly affect its performance.
Similar to nternational Journal of Computational Engineering Research(IJCER) (20)
In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.
Introducing Milvus Lite: Easy-to-Install, Easy-to-Use vector database for you...Zilliz
Join us to introduce Milvus Lite, a vector database that can run on notebooks and laptops, share the same API with Milvus, and integrate with every popular GenAI framework. This webinar is perfect for developers seeking easy-to-use, well-integrated vector databases for their GenAI apps.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
20 Comprehensive Checklist of Designing and Developing a WebsitePixlogix Infotech
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
nternational Journal of Computational Engineering Research(IJCER)
1. International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 6
Phase Watermarking Algorithm using Hybrid Multi-Polarity
Hadamard Transform
Sk. Khamuruddeen1, S.V.Devika2, Neerugatti Vishwanath3, P.Prem Kishan4,
J.Chandra Shekar5, G.Shravan Kumar6, G.Swetha7
1
(Assistant Professor, Department of ECE, HITAM, Hyderabad, India)
2
(Associate Professor, Department of ECE, HITAM, Hyderabad, India)
3
(Assistant professor, Department of ECE, ST. Peters Engineering College, Hyderabad)
4
(Assistant professor, Department of ECE, MLRIT, Hyderabad)
5
(Assistant professor, Department of ECE, ST. Peters Engineering College, Hyderabad)
6
(Assistant professor, Department of ECE, MLRIT, Hyderabad)
7
( Associate Professor, Department of ECE, ACTS, Hyderabad)
Abstract
In this paper, a robust phase watermarking (a) It should be perceptually invisible and should not
algorithm for still images is presented where the result in artifacts that are different from those that may be
watermark information is conveyed in the phase seen in the original image.
spectrum in the transform domain. Phase watermarking
algorithm that uses multi-polarity Walsh-Hadamard and (b) It should be robust to common signal processing
Complex Hadamard transform is developed. The operations such as sharpening, resizing, lossy
robustness of presented algorithm is investigated by its compression, etc since operations that damage the
uniqueness, JPEG encoding, image resizing, dithering watermarked images also damage the embedded data.
noise distortions, sharpening, cropping and successive Pirates may also attempt to remove the embedded
watermarking. watermark through other modifications to the
watermarked images.
Keyword’s- Unified complex Hadamard transform A novel hybrid watermarking technique for grey
·Multi-polarity complex Hadamard transform ·Multi- scale images based on the modified multi-resolution
polarity Walsh-Hadamard transform ·Phase multi-polarity Walsh-Hadamard and Complex Hadamard
watermarking · Spectral techniques transforms has been proposed and implemented in the C
language. A series of tests to gauge the robustness of the
I. Introduction: watermark is performed and the experimental results are
With the explosive growth of the Internet, the also presented. The new watermarking technique based
use of digital images is becoming more widespread as on multi-polarity Walsh- Hadamard and Complex
digital images are easily transmitted over networked Hadamard transforms can also be used in digital and
systems. However, this has also heightened the problem color image processing.
of copyright protection. The owners of digital images are
reluctant to allow the distribution of their works in a II. Complex Hadamard Transform:
networked environment as exact copies can be obtained An orthogonal transform known as the unified
easily. Although encryption can be applied to limit access Complex Hadamard Transform (CHT) has recently been
to only valid key-holders, there is no way to trace the considered as the tool in spectral approach to logic design
reproduction or retransmission of the decrypted images. and in various applications in digital signal processing
A digital watermark is intended to complement and communications .The detailed properties and
cryptographic processes. It is an imperceptible performance of this transform in the above areas is
identification code that is permanently embedded in the available in . To better suit applications in logic design
image and remains within the image after the decryption similarly to multi-polarity Walsh-Hadamard transform
process. The owner and intended recipients of the image the CHT transform has been generalized to multi-polarity
can be identified through the decoding of the embedded transform in . This latter version of the CHT transform is
copyrights information in the image. The characteristics used in this article to convey the watermark information.
of an effective image watermark are as follows. Some necessary information about basic properties of
multi polarity CHT is given below.
Issn 2250-3005(online) October| 2012 Page 130
2. International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 6
the image. The ll quadrant in Fig. 2 forms another image
with half the resolution. The same transformation is
applied to this reduced resolution image twice to form the
pyramid structure.
(c) The lowest frequency band (LFB) is segmented into n
8×8 blocks.
III. Novel Hybrid Technique for Watermarking:
The design and implementation of a novel (d) The two-dimensional multi-polarity CHT is
hybrid transform domain based watermarking technique performed on the segmented 8 × 8 blocks by applying the
for grey scale images is described in this section. Figure one dimensional multi-polarity CHT on the rows
1 illustrates the stages involved in the insertion of followed by the columns. The CHT coefficients of a real
watermark. It should be noticed that the secret key could image are complex-valued which leads to a magnitude
be added easily in our watermarking scheme. The and phase representation for the transformed image.
insertion of the watermark consists of the following
steps:
(a) The raw pixels are extracted from the BMP image and
stored in a two-dimensional array. The dimensions of the
image are adjusted to the next higher multiple of 8 to
handle images of different sizes. For example, the
original dimensions of an image are 500 × 300 pixels.
The dimensions of the image are adjusted to 504 × 304
pixels, where the additional pixels are filled with 0.
(b) The modified multi-resolution integer-valued multi
polarity WHT is applied to decompose the image into a
pyramid structure with various bands such as the low
frequency band, low-high frequency band, high
frequency band etc. The modified multi-resolution
integer-valued multi-polarity WHT is implemented in
two steps and applied three times. The decomposition is
performed as follows:
(e) After altering selected CHT coefficients, an inverse
two-dimensional multi-polarity CHT is applied by
performing the one-dimensional multi-polarity CHT on
the columns followed by the rows.
Where I [y,x], T1[y,x] and T2[y,x] refer to pixels in
The original, temporary and transformed images,
respectively. The symbol “:” on the left hand side of
The comma refers to the rows of the image. When the
Symbol “:” appears after the comma, it refers to the
Columns. Width and height denote the dimensions of the
ll quadrant and _· represents the downward truncation. y
and x denote the rows and columns of the images,
respectively. The two-dimensional transformation is
performed by applying the transformation on the rows of
Issn 2250-3005(online) October| 2012 Page 131
3. International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 6
(a) The raw image pixels are extracted from the original
and test images in BMP format. The dimensions of the
images are adjusted to the next higher multiple of 8 to
handle images of different sizes.
(b) The following steps are performed for the original
image:
(1) The original image is decomposed into the pyramid
structure using the modified multi-resolution multi
polarity WHT.
(2) A forward multi-polarity CHT is performed on the
segmented 8×8 blocks of the LFB.
(3) The watermark is inserted.
(4) An inverse multi-polarity CHT is performed and all
the imaginary parts are set to zero.
(5) An inverse modified multi-resolution multi-polarity
WHT is computed and the results of the inverse
transformation are limited in the range from 0 to 255.
(6) A modified multi-resolution multi-polarity WHT is
performed again followed by the forward multi polarity
CHT of the segmented 8 × 8 blocks of the
LFB.
(c) A modified multi-resolution multi-polarity WHT is
performed on the test image followed by the forward
multi polarity CHT of the segmented 8 ×8 blocks of the
LFB.
(d) A comparison of selected CHT transform coefficients
of both images is performed.
(f) The inverse modified multi-resolution multi-polarity The flow chart for the verification of watermark is given
WHT is applied three times. The construction of the in Fig. 4. D1,D2 and D3 are three predefined thresholds
watermarked image from the altered transformed image obtained empirically that are equal to 1.25◦ , 0.5n and
is performed using the following inverse transformation: 17.5, respectively. The number of elements in the
watermark sequence is n. If the absolute phase difference
(qi ) of the respective transform coefficients from the
original watermarked
(wi ) and test (yi ) images exceeds D1, the particular
selected transform coefficient fails the watermark test.
The test image is considered to be a watermarked copy of
the image if either one of the following conditions is
satisfied:
(1) The number of selected transform coefficients r
clearing the watermark test is equal to n.
(2) r is greater than D2 and the test parameter u is greater
where I1[y,x], T1[y,x] and T3[y,x] refer to pixels in than D3.
the reconstructed, temporary and altered transformed
images, respectively.
(g) BMP file format is applied to create the watermarked
copy of the original image.
IV. Extraction of Water mark:
Figure 3 summarizes the stages involved in the
extraction of watermark. It should be noticed that the
watermark detector does not need the original image
when a hash of the original image is used as a watermark.
The steps to extract the embedded watermark are
performed as follows: Fig.4.Original and watermarked versions of Lena
Issn 2250-3005(online) October| 2012 Page 132
4. International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 6
The above-mentioned test parameters are defined as respect to the original image is 41.34 dB. The
follows: watermarked image is subjected to a series of tests to
gauge the robustness of the embedded watermark such
as:
(a) Uniqueness of Watermark: Fig shows the response of
the watermark detector to 1000 randomly generated
watermarks of which only one matches the watermark
embedded in Fig. . The positive response due to the
correct watermark is very much stronger than the
response due to incorrect watermark.
(b) JPEG Compression: In this test, the watermarked
image is compressed using the standard JPEG encoding .
Figure shows a JPEG encoded version of Lena at 10%
quality factor and 0% smoothing. The embedded
watermark is still detected even though the JPEG
encoded image is clearly distorted. Table 1 lists the
results for the JPEG compression tests from 10% to
100% quality factor.
Fig. 5 Watermark detector response (uniqueness of
watermark)
Fig. 6 JPEG encoded version of Lena at 10% quality and
0% smoothing.
V. Experimental results:
The proposed watermarking technique has been
implemented in the C language. In order to evaluate the
proposed technique, the original grey scale image (Lena
from [2]) of 256 × 256 pixels shown in Fig. is
watermarked using the proposed scheme. The
watermarked version is shown in Fig.. The robustness of Fig. 7 Image of Lena after five successive watermarking
the watermark depends directly on the embedding operations
strength, which in turn influences the visual degradation
of the image. The PSNR of the watermarked image with
Issn 2250-3005(online) October| 2012 Page 133
5. International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 6
4. Falkowski, B.J.: Properties and ways of
calculation of multi polarity generalized Walsh
transforms. IEEE Trans. Circuits Syst. II: Analog
Digit. Signal Process. 41(6), 380–391 (1994)
5. Falkowski, B.J.: Family of generalized multi-
polarity complex Hadamard transforms. IEE
Proc. Vis. Image Signal Process. 145(6), 371–378
(1998)
6. Falkowski, B.J., Rahardja, S.: Complex
Hadamard transforms: properties, relations and
architecture. IEICE Trans. Fundam. Electron.
Commun. Comput. Sci. E87-A(8), 2077–2083
(2004)
7. Jahne, B.: Digital Image Processing, 5th edn.
Springer, Berlin (2002)
8. Ó Ruanaidh, J.J.K., Dowling, W.J., Boland, F.M.:
Watermarking digital images for copyright
Fig. 8 Watermark detector response (successive protection. IEE Proc. Vis. Image Signal Process.
watermarking) 143(4), 250–256 (1996)
9. Ó Ruanaidh, J.J.K., Dowling, W.J., Boland, F.M.:
(c) Successive watermarking: The original image is Phase watermarking of digital images. In: Proc.
watermarked, the watermarked image is then IEEE Int. Conf. on Image Processing, pp. 239–
watermarked and so on. This can be considered as 242 (1996)
another form of attack in which it is clear that significant 10. Plataniotis, K.N., Venetsanopoulos, A.N.: Color
image degradation eventually occurs as the process is Image Processing and Applications. Springer,
repeated. After five successive watermarking operations, Berlin (2000)
the five watermarks are still detected in the resulting 11. Proakis, J.G.: Digital Communications, 4th edn.
image (PSNR = 31.18 dB) shown in Fig.7. In the McGraw-Hill, New York (2001)
response of the watermark detector given in Fig.8, the 12. Rahardja, S., Falkowski, B.J.: Comparative study
five spikes clearly indicate the presence of the of discrete orthogonal transforms in adaptive
watermarks and demonstrate that successive signal processing. IEICE Trans. Fundam.
watermarking does not remove the embedded Electron. Commun. Comput. Sci. E82-A(8),
watermarks. 1386–1390 (1999)
13. Rahardja, S., Falkowski, B.J.: Family of unified
VI. Conclusion: complex
A new hybrid technique for watermarking grey Hadamard transforms. IEEE Trans. Circuits Syst.
scale images based on the multi-resolution modified II: Analog Digit. Signal Process. 46(8), 1094–
multi-polarity WHT and CHT is proposed and developed. 1100 (1999)
The quality of the watermarked image is very good. The 14. Rahardja, S., Falkowski, B.J.: Complex
proposed technique also exhibits robustness to JPEG composite spectra of unified complex Hadamard
compression up to 10% quality factor, successive transform for logic functions. IEEE Trans.
watermarking, sharpening, dithering distortion (25%), Circuits Syst. II: Analog Digit. Signal Process.
cropping and scaling up to 31.64% of the original image. 47(11), 1291–1297 (2000)
15. Rahardja, S., Ser, W., Lin, Z.: UCHT-based
References: complex sequences for asynchronous CDMA
1. Agaian, S.S.: Hadamard Matrices and Their system. IEEE Trans. Commun. 51(4), 618–626
Applications. Lecture Notes in Mathematics, vol. (2003)
1168. Springer, Berlin (1980) 16. Robin, M., Poulin, M.: Digital Television
2. CityU-IPL Image Database at Fundamentals: Design and Installation of Video
http://www.image.cityu.hk/ imagedb/ and Audio Systems. McGraw-Hill, New York
3. Cox, I.J., Killian, J., Leighton, F.T., Shamoon, T.: (1998)
Secure spread spectrum watermarking for 17. Rojaini, K.B.: Programming in C with Numerical
multimedia. IEEE Trans. Image Process. 6(12), Methods for Engineers. Prentice Hall, Englewood
1673–1687 (1997) Cliffs (1996) 1
Issn 2250-3005(online) October| 2012 Page 134
6. International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 6
18. Swanson, M.D., Kobayashi, M., Tewfik, A.H.:
Multimedia dataembedding and watermarking
techniques. Proc. IEEE 86(6),1064–1087 (1998)
19. Tian, J.: Wavelet-based reversible watermarking
for authentication.In: Proc. SPIE Security and
Watermarking of Multimedia Contents IV, San
Jose, USA, pp. 679–690 (2002)
20. Wallace, G.K.: The JPEG still picture P.Prem Kishan working as an Assistant Professor in
compression standard. Commun.ACM 34(4), 30– MLRIT, His area of interest is VLSI & Signal
44 (1991)
processing.
21. Xie, S., Rahardja, S.: Performance evaluation for
quaternary DSSSMA communications with
complex signature sequences over Rayleigh-
fading channels. IEEE Trans. Wirel. Commun.
4(1), 266–277 (2005)
22. Yaroslavsky, L.P.: Digital Picture Processing.
Springer, Berlin (1985)
AUTHORS:
J.Chandra Shekar working as Assistant Professor in
ST. Peters college of Engineering, Hyderabad and his
area of interest Fiber Optic Instrumentation and
Communication, Wireless communication
Mr.SK. Khamuruddeen working as an Assistant
Professor in Hyderabad Institute of Technology &
Management, His area of interest is VLSI & System
Design. you can reach him.
G.Shravan Kumar working as an Assistant Professor in
MLRIT, His area of interest is VLSI & System Design.
Mrs. S. V. Devika Working as an Associate Professor in
Hyderabad Institute of Technology & Management, her
area of interest is communications, VLSI & Antenna
theory. Mrs. G.Swetha as an Associate Professor in ACTS, her
area of interest is communications, VLSI & Antenna
theory.
Neerugatti Viswanath working as Assistant Professor in
ST. Peters college of Engineering, Hyderabad and his
area of interest is signal processing and communication
engineering.
Issn 2250-3005(online) October| 2012 Page 135