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.
The propagation of laser beam in the underdense deuterium plasma has been studied via computer simulation using the fluid model. An appropriate computer code “HEATER” has been modified and is used for this purpose. The propagation is taken to be in a cylindrical symmetric medium. Different laser wavelengths (1 = 10.6 m, 2 = 1.06 m, and 3 = 0.53 m) with a Gaussian pulse type and 15 ns pulse widths have been considered. Absorption energy and laser flux have been calculated for different plasma and laser parameters. The absorbed laser energy showed maximum for = 0.53 m. This high absorbitivity was inferred to the effect of the pondermotive force.
The Planning and Resource Development Department of the Iraqi Ministry of Health is very interested in improving medical care, health education, and village training programs. Accordingly, and through the available capabilities of the ministry, itdesires to allocate seven health centers to four villages in Baghdad, Iraq therefore the ministry needs to determine the number of health centers allocated to each of these villages which achieves the greatest degree of the overall effectiveness of the seven health centers in a fuzzy environment. The objective of this study is to use a fuzzy dynamic programming(DP) method to determine the optimal allocation of these centers, which allows the greatest overall effectiveness of these health centers
... Show MoreConstruction contractors usually undertake multiple construction projects simultaneously. Such a situation involves sharing different types of resources, including monetary, equipment, and manpower, which may become a major challenge in many cases. In this study, the financial aspects of working on multiple projects at a time are addressed and investigated. The study considers dealing with financial shortages by proposing a multi-project scheduling optimization model for profit maximization, while minimizing the total project duration. Optimization genetic algorithm and finance-based scheduling are used to produce feasible schedules that balance the finance of activities at any time w
The distribution of the expanded exponentiated power function EEPF with four parameters, was presented by the exponentiated expanded method using the expanded distribution of the power function, This method is characterized by obtaining a new distribution belonging to the exponential family, as we obtained the survival rate and failure rate function for this distribution, Some mathematical properties were found, then we used the developed least squares method to estimate the parameters using the genetic algorithm, and a Monte Carlo simulation study was conducted to evaluate the performance of estimations of possibility using the Genetic algorithm GA.
String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co
... Show More