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.
For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.
Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment
... Show More
(2)
(1)
This study was conducted on Lake Hamrin situated in Diyala governorate, focal Iraq, between latitudes 44º 53ʹ 26.16 '- 45º 07 ʹ 28.03ʺ and 34º 04ʹ 24.75ʺ ــ 34º 19ʹ 12.74ʺ . As in this study, the surface area of Hamrin Lake was calculated from satellite images during the period from October 2019 to September 2020, with an average satellite image for each month, furthermore,by utilizing the Normalized Differences Water Index (NDWI), the largest surface area was 264,617 km2 for October and the lowest surface area 140.202 km2 for September. The surface temperature of the lake water was also calculated from satellite images of the Landsat 8 satellite, based on ban
... Show More
(12)
(4)
In this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from
... Show More
(9)
(3)
In this study, a genetic algorithm (GA) is used to detect damage in curved beam model, stiffness as well as mass matrices of the curved beam elements is formulated using Hamilton's principle. Each node of the curved beam element possesses seven degrees of freedom including the warping degree of freedom. The curved beam element had been derived based on the Kang and Yoo’s thin-walled curved beam theory. The identification of damage is formulated as an optimization problem, binary and continuous genetic algorithms
(BGA, CGA) are used to detect and locate the damage using two objective functions (change in natural frequencies, Modal Assurance Criterion MAC). The results show the objective function based on change in natural frequency i
The proliferation of manipulated multimedia content poses a significant threat in an era heavily reliant on social networks as primary information sources. Despite numerous countermeasures targeting specific attack types, the seamless nature of image manipulation challenges the differentiation between authentic and altered visuals. This study aims to detect fake images generated by StyleGAN2-ADA using watermark analysis and image content analysis techniques. The first experiment evaluates the performance of watermarking techniques in the spatial (Least Significant Bit (LSB)) and frequency (Discrete Cosine Transform (DCT)) domains using real-life imagery. Then, watermarked images are used as input to the StyleGAN2-ADA model to genera
... Show More
(3)
(3)
Two EM techniques, terrain conductivity and VLF-Radiohm resistivity (using two
different instruments of Geonics EM 34-3 and EMI6R respectively) have been applied to
evaluate their ability in delineation and measuring the depth of shallow subsurface cavities
near Haditha city.
Thirty one survey traverses were achieved to distinguish the subsurface cavities in the
investigated area. Both EM techniques are found to be successfiul tools in study area.