In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.

Nowadays, it is quite usual to transmit data through the internet, making safe online communication essential and transmitting data over internet channels requires maintaining its confidentiality and ensuring the integrity of the transmitted data from unauthorized individuals. The two most common techniques for supplying security are cryptography and steganography. Data is converted from a readable format into an unreadable one using cryptography. Steganography is the technique of hiding sensitive information in digital media including image, audio, and video. In our proposed system, both encryption and hiding techniques will be utilized. This study presents encryption using the S-DES algorithm, which generates a new key in each cyc

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

The aim of this work is to evaluate the one- electron expectation value from the radial electronic density function D(r1) for different wave function for the 2S state of Be atom . The wave function used were published in 1960,1974and 1993, respectavily. Using Hartree-Fock wave function as a Slater determinant has used the partitioning technique for the analysis open shell system of Be (1s22s2) state, the analyze Be atom for six-pairs electronic wave function , tow of these are for intra-shells (K,L) and the rest for inter-shells(KL) . The results are obtained numerically by using computer programs (Mathcad).

Stumpff functions are an infinite series that depends on the value of z. This value results from multiplying the reciprocal semi-major axis with a universal anomaly. The purpose from those functions is to calculate the variation of the universal parameter (variable) using Kepler's equation for different orbits. In this paper, each range for the reciprocal of the semi-major axis, universal anomaly, and z is calculated in order to study the behavior of Stumpff functions C(z) and S(z). The results showed that when z grew, Stumpff functions for hyperbola, parabola, and elliptical orbits were also growing. They intersected and had a tendency towards zero for both hyperbola and parabola orbits, but for elliptical orbits, Stumpff functions