The multi-focus image fusion method can fuse more than one focused image to generate a single image with more accurate description. The purpose of image fusion is to generate one image by combining information from many source images of the same scene. In this paper, a multi-focus image fusion method is proposed with a hybrid pixel level obtained in the spatial and transform domains. The proposed method is implemented on multi-focus source images in YCbCr color space. As the first step two-level stationary wavelet transform was applied on the Y channel of two source images. The fused Y channel is implemented by using many fusion rule techniques. The Cb and Cr channels of the source images are fused using principal component analysis (PCA).

Universal image stego-analytic has become an important issue due to the natural images features curse of dimensionality. Deep neural networks, especially deep convolution networks, have been widely used for the problem of universal image stegoanalytic design. This paper describes the effect of selecting suitable value for number of levels during image pre-processing with Dual Tree Complex Wavelet Transform. This value may significantly affect the detection accuracy which is obtained to evaluate the performance of the proposed system. The proposed system is evaluated using three content-adaptive methods, named Highly Undetetable steGO (HUGO), Wavelet Obtained Weights (WOW) and UNIversal WAvelet Relative Distortion (UNIWARD).
The obtain

FG Mohammed, HM Al-Dabbas, Science International, 2018 - Cited by 2

This paper is illustrates the sufficient conditions of the uniformly asymptotically stable and the bounded of the zero solution of fifth order nonlinear differential equation with a variable delay τ(t)

The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.

بهذا البحث نقارن معاييرالمعلومات التقليدية (AIC , SIC, HQ , FPE ) مع معيارمعلومات الانحراف المحور (MDIC) المستعملة لتحديد رتبة انموذج الانحدارالذاتي (AR) للعملية التي تولد البيانات,باستعمال المحاكاة وذلك بتوليد بيانات من عدة نماذج للأنحدارالذاتي,عندما خضوع حد الخطأ للتوزيع الطبيعي بقيم مختلفة لمعلماته

The main aim of this paper is to introduce the relationship between the topic of coding theory and the projective plane of order three. The maximum value of size of code over finite field of order three and an incidence matrix with the parameters,  (length of code),  (minimum distance of code) and  (error-correcting of code ) have been constructed. Some examples and theorems have been given.

Plane cubics curves may be classified up to isomorphism or projective equivalence. In this paper, the inequivalent elliptic cubic curves which are non-singular plane cubic curves have been classified projectively over the finite field of order nineteen, and determined if they are complete or incomplete as arcs of degree three. Also, the maximum size of a complete elliptic curve that can be constructed from each incomplete elliptic curve are given.

  The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] .  Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.

The main goal of this paper is to show that a
-arc in
and
is subset of a twisted cubic, that is, a normal rational curve. The maximum size of an arc in a projective space or equivalently the maximum length of a maximum distance separable linear code are classified. It is then shown that this maximum is
for all dimensions up to
.