يقترح هذا البحث طريقة جديدة لتقدير دالة كثافة الرابطة باستخدام تحليل المويجات كطريقة لامعلمية، من أجل الحصول على نتائج أكثر دقة وخالية من مشكلة تاثيرات الحدود التي تعاني منها طرائق التقدير اللامعلمية. اذ تعد طريقة المويجات طريقة اوتماتيكية للتعامل مع تاثيرات الحدود وذلك لانها لا تأخذ بنظر الاعتبار إذا كانت السلسلة الزمنية مستقرة او غير مستقرة. ولتقدير دالة كثافة الرابطة تم استعمال المحاكاة لتوليد البيانات وباستعمال خمسة دوال رابطة مختلفة مثل Gaussian وFrank وTawn وRotation Tawn وJoe وبخمسة أحجام مختلفة للعينات عند ثلاثة مستويات ارتباط موجبة، واعتمادًا على الحلول المتعددة، أظهرت النتائج أن تقدير دالة الكثافة الرابطة بطريقة المويجات عندما يكون مستوى الارتباط كانت الرابطة Gaussian في المرتبة الأولى تليها الرابطةFrank واحتلت الرابطة Joe المرتبة الأخيرة. اما في حالة الارتباطات المتوسطة والضعيفة كانت الرابطة Tawn في المرتبة الأولى تليها الرابطة Rotation Tawn في حين جاءت Gaussian بالمرتبة الأخيرة. بالاعتماد على المعايير (Root Mean Square Error, Akiake Information Criteria, and Logarithm likelihood criteria) ، وتبين من خلال الرسم (Contour plot) والشكل ثلاثي الابعاد (3D plot) لدوال الرابطة الحقيقية. فضلا عن اشكال التمهيد لكل منها باستخدام طريقة (ECDWT)، ويتضح من خلال الاشكال الدائرية ان توزيع مشاهدات الدالة الرابطة المقدرة بطريقة (ECDWT) كان دقيقا عند الاطراف بينما كان اقل دقة عند المركز لكل من الدوال Gaussian وTawn.
Fingerprint recognition is one among oldest procedures of identification. An important step in automatic fingerprint matching is to mechanically and dependably extract features. The quality of the input fingerprint image has a major impact on the performance of a feature extraction algorithm. The target of this paper is to present a fingerprint recognition technique that utilizes local features for fingerprint representation and matching. The adopted local features have determined: (i) the energy of Haar wavelet subbands, (ii) the normalized of Haar wavelet subbands. Experiments have been made on three completely different sets of features which are used when partitioning the fingerprint into overlapped blocks. Experiments are conducted on
... Show MoreA new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th
... Show MoreThis paper is concerned with combining two different transforms to present a new joint transform FHET and its inverse transform IFHET. Also, the most important property of FHET was concluded and proved, which is called the finite Hankel – Elzaki transforms of the Bessel differential operator property, this property was discussed for two different boundary conditions, Dirichlet and Robin. Where the importance of this property is shown by solving axisymmetric partial differential equations and transitioning to an algebraic equation directly. Also, the joint Finite Hankel-Elzaki transform method was applied in solving a mathematical-physical problem, which is the Hotdog Problem. A steady state which does not depend on time was discussed f
... Show MoreIn this work, the fractional damped Burger's equation (FDBE) formula = 0,
Abstract The wavelet shrink estimator is an attractive technique when estimating the nonparametric regression functions, but it is very sensitive in the case of a correlation in errors. In this research, a polynomial model of low degree was used for the purpose of addressing the boundary problem in the wavelet reduction in addition to using flexible threshold values in the case of Correlation in errors as it deals with those transactions at each level separately, unlike the comprehensive threshold values that deal with all levels simultaneously, as (Visushrink) methods, (False Discovery Rate) method, (Improvement Thresholding) and (Sureshrink method), as the study was conducted on real monthly data represented in the rates of theft crimes f
... 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 MoreThe 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 MoreThis search has introduced the techniques of multi-wavelet transform and neural network for recognition 3-D object from 2-D image using patches. The proposed techniques were tested on database of different patches features and the high energy subband of discrete multi-wavelet transform DMWT (gp) of the patches. The test set has two groups, group (1) which contains images, their (gp) patches and patches features of the same images as a part of that in the data set beside other images, (gp) patches and features, and group (2) which contains the (gp) patches and patches features the same as a part of that in the database but after modification such as rotation, scaling and translation. Recognition by back propagation (BP) neural network as
... Show More