Elzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.
Embedding an identifying data into digital media such as video, audio or image is known as digital watermarking. In this paper, a non-blind watermarking algorithm based on Berkeley Wavelet Transform is proposed. Firstly, the embedded image is scrambled by using Arnold transform for higher security, and then the embedding process is applied in transform domain of the host image. The experimental results show that this algorithm is invisible and has good robustness for some common image processing operations.
Automatic recognition of individuals is very important in modern eras. Biometric techniques have emerged as an answer to the matter of automatic individual recognition. This paper tends to give a technique to detect pupil which is a mixture of easy morphological operations and Hough Transform (HT) is presented in this paper. The circular area of the eye and pupil is divided by the morphological filter as well as the Hough Transform (HT) where the local Iris area has been converted into a rectangular block for the purpose of calculating inconsistencies in the image. This method is implemented and tested on the Chinese Academy of Sciences (CASIA V4) iris image database 249 person and the IIT Delhi (IITD) iris
... Show Morethe research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream
The art of preventing the detection of hidden information messages is the way that steganography work. Several algorithms have been proposed for steganographic techniques. A major portion of these algorithms is specified for image steganography because the image has a high level of redundancy. This paper proposed an image steganography technique using a dynamic threshold produced by the discrete cosine coefficient. After dividing the green and blue channel of the cover image into 1*3-pixel blocks, check if any bits of green channel block less or equal to threshold then start to store the secret bits in blue channel block, and to increase the security not all bits in the chosen block used to store the secret bits. Firstly, store in the cente
... Show MoreThe Field Programmable Gate Array (FPGA) approach is the most recent category, which takes the place in the implementation of most of the Digital Signal Processing (DSP) applications. It had proved the capability to handle such problems and supports all the necessary needs like scalability, speed, size, cost, and efficiency.
In this paper a new proposed circuit design is implemented for the evaluation of the coefficients of the two-dimensional Wavelet Transform (WT) and Wavelet Packet Transform (WPT) using FPGA is provided.
In this implementation the evaluations of the WT & WPT coefficients are depending upon filter tree decomposition using the 2-D discrete convolution algorithm. This implementation w
... Show More<p class="0abstract">Image denoising is a technique for removing unwanted signals called the noise, which coupling with the original signal when transmitting them; to remove the noise from the original signal, many denoising methods are used. In this paper, the Multiwavelet Transform (MWT) is used to denoise the corrupted image by Choosing the HH coefficient for processing based on two different filters Tri-State Median filter and Switching Median filter. With each filter, various rules are used, such as Normal Shrink, Sure Shrink, Visu Shrink, and Bivariate Shrink. The proposed algorithm is applied Salt& pepper noise with different levels for grayscale test images. The quality of the denoised image is evaluated by usi
... Show MoreCopper oxide (CuO) nanoparticles were synthesized through the thermal decomposition of a copper(II) Schiff-base complex. The complex was formed by reacting cupric acetate with a Schiff base in a 2:1 metal-to-ligand ratio. The Schiff base itself was synthesized via the condensation of benzidine and 2-hydroxybenzaldehyde in the presence of glacial acetic acid. This newly synthesized symmetric Schiff base served as the ligand for the Cu(II) metal ion complex. The ligand and its complex were characterized using several spectroscopic methods, including FTIR, UV-vis, 1H-NMR, 13C-NMR, CHNS, and AAS, along with TGA, molar conductivity and magnetic susceptibility measurements. The CuO nanoparticles were produced by thermally decomposing the
... Show MoreCopper oxide (CuO) nanoparticles were synthesized through the thermal decomposition of a copper(II) Schiff-base complex. The complex was formed by reacting cupric acetate with a Schiff base in a 2:1 metal-to-ligand ratio. The Schiff base itself was synthesized via the condensation of benzidine and 2-hydroxybenzaldehyde in the presence of glacial acetic acid. This newly synthesized symmetric Schiff base served as the ligand for the Cu(II) metal ion complex. The ligand and its complex were characterized using several spectroscopic methods, including FTIR, UV-vis, 1H-NMR, 13C-NMR, CHNS, and AAS, along with TGA, molar conductivity and magnetic susceptibility measurements. The CuO nanoparticles were produced by thermally decomposing the
... Show MoreAchieving an accurate and optimal rate of penetration (ROP) is critical for a cost-effective and safe drilling operation. While different techniques have been used to achieve this goal, each approach has limitations, prompting researchers to seek solutions. This study’s objective is to conduct the strategy of combining the Bourgoyne and Young (BYM) ROP equations with Bagging Tree regression in a southern Iraqi field. Although BYM equations are commonly used and widespread to estimate drilling rates, they need more specific drilling parameters to capture different ROP complexities. The Bagging Tree algorithm, a random forest variant, addresses these limitations by blending domain kno