Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to restore the artifacts happened in the binary map. Results: The tests results specified that the proposed method is a fast static sprite area detection algorithm that leads quickly to remarkable sprite location. Conclusion: It is found that the proposed strategies can allocate the sprite (survive) areas easily and in appropriate way and distinguish static sprite region which demonstrate survived region.
A total of 48 experiments were conducted to investigate the impact of slit weir dimensions and locations on the maximum scour depth and scour area created upstream. The slit weir model was a 110 mm slit opening, and it was installed at the end of the working section in a laboratory flume. The flume was 10.0 m long, 30 cm wide, 30 cm deep, and almost middle. It includes a 2 m working section with a mobile bed with 110 mm in thickness. In the mobile bed, two types of nonuniform sand (with a geometric standard deviation of 1.58 and 1.6) were tested separately. The weir dimensions and location were changed with flow rates. Then dimensions of the slit weir were changed from 60 x 110 mm to 60 x 70 mm (width x height), while th
... Show More
(1)
The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods depended on selecting the primes p and q in order to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article gives new construction of the RSA algorithm and DH key exchange using the
primes p,qfrom areal number x.
The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola
... Show More
(7)
(6)
Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
(14)
(3)
The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.
The estimation of the parameters of linear regression is based on the usual Least Square method, as this method is based on the estimation of several basic assumptions. Therefore, the accuracy of estimating the parameters of the model depends on the validity of these hypotheses. The most successful technique was the robust estimation method which is minimizing maximum likelihood estimator (MM-estimator) that proved its efficiency in this purpose. However, the use of the model becomes unrealistic and one of these assumptions is the uniformity of the variance and the normal distribution of the error. These assumptions are not achievable in the case of studying a specific problem that may include complex data of more than one model. To
... Show More
(22)
(14)
Security concerns in the transfer of medical images have drawn a lot of attention to the topic of medical picture encryption as of late. Furthermore, recent events have brought attention to the fact that medical photographs are constantly being produced and circulated online, necessitating safeguards against their inappropriate use. To improve the design of the AES algorithm standard for medical picture encryption, this research presents several new criteria. It was created so that needs for higher levels of safety and higher levels of performance could be met. First, the pixels in the image are diffused to randomly mix them up and disperse them all over the screen. Rather than using rounds, the suggested technique utilizes a cascad
... Show More
(8)
(2)