In this paper, two new simple, fast and efficient block matching algorithms are introduced, both methods begins blocks matching process from the image center block and moves across the blocks toward image boundaries. With each block, its motion vector is initialized using linear prediction that depending on the motion vectors of its neighbor blocks that are already scanned and their motion vectors are assessed. Also, a hybrid mechanism is introduced, it depends on mixing the proposed two predictive mechanisms with Exhaustive Search (ES) mechanism in order to gain matching accuracy near or similar to ES but with Search Time ST less than 80% of the ES. Also, it offers more control capability to reduce the search errors. The experimental tests showed that the two proposed search methods outperform the famous three step search algorithm.
(7)
(7)
(5)
(3)
(13)
(12)
The rise of Industry 4.0 and smart manufacturing has highlighted the importance of utilizing intelligent manufacturing techniques, tools, and methods, including predictive maintenance. This feature allows for the early identification of potential issues with machinery, preventing them from reaching critical stages. This paper proposes an intelligent predictive maintenance system for industrial equipment monitoring. The system integrates Industrial IoT, MQTT messaging and machine learning algorithms. Vibration, current and temperature sensors collect real-time data from electrical motors which is analyzed using five ML models to detect anomalies and predict failures, enabling proactive maintenance. The MQTT protocol is used for efficient com
... Show More
(5)
(2)
Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o
... Show More
(2)
Periodontal diseases such as gingivitis and periodontitis are considered common diseases. This study is aimed to predicate these diseases using non-harmful specimens such as saliva throughout the detection of some parameters. In the beginning, a random 51 patients' saliva was collected from outpatients who suffered from different degrees of periodontal diseases. Concurrently, another 40 people who appeared to be healthy were collected, and both patients and healthy people were subjected to a questionnaire form and diagnosed by a specialist dentist. The results of this study revealed that there is no significant difference between males and females in infection with periodontal diseases. As well, smoking is not acting as the main f
... Show More
Abstract
For sparse system identification,recent suggested algorithms are 
-norm Least Mean Square ( -LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named -ZA-LMS,
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
... Show More