research centers


Search results: Found 3

Listing 1 - 3 of 3
Sort by

Article
A Novel Algorithm To Detect and Extract The Texts of Road- Sign Plates in Video Scenes

Authors: Abdul Munem S. Rahma --- Teaba Wala Aldeen Khairi
Journal: Engineering and Technology Journal مجلة الهندسة والتكنولوجيا ISSN: 16816900 24120758 Year: 2016 Volume: 34 Issue: 2 Part (B) Scientific Pages: 180-193
Publisher: University of Technology الجامعة التكنولوجية

Loading...
Loading...
Abstract

Traffic Road-Signs contain useful information for the road users; the operation of many of modern applications like the automatic or smart vehicle requires an automatic discrimination of the texts of the traffic road-sign. Discrimination of text compose of several stages, the first of these stages is detection and extraction of the texts. In this work, an algorithm is developed to detect, locate, and segment of the texts and the word in the video clips, that existing in the road signs in the city of Baghdad. The proposed approach includes two stages, the first one is processing the image to locate and extract images of the road-sign and neglect the rest of the image, and the second stage is processing the image of the road-sign plate to detect and extract the texts without symbols and shapes. The basic structure of the algorithm depends on the following functions: edge-detector, dilation, and filling-hole, morphological-opening. The total recall values of 89%, the total precision value of 93%.The algorithm is, then, tested based on video clips, implementation of the algorithm based on video clips confirms its ability to detect the texts which may appear in the video scenes, recall-rate(r) is excellent with a total value of 94.5% and a total precision value of 86.5%.The algorithm is tested to measure its validity to work under real-time operation, by processing one frame and exceed a set of next frames, the test appears that the algorithm is able to work under real-time operation with recall-rate(r) of(93%).


Article
Optimized Performance of Consensus algorithm in Multi Agent System Using PSO

Authors: Safanah Mudheher Raafat --- Ahmed Mudheher Hasan --- Teaba Wala Aldeen Khairi --- Karar Ghalib Ali
Journal: AL-NAHRAIN JOURNAL FOR ENGINEERING SCIENCES مجلة النهرين للعلوم الهندسية ISSN: 25219154 / eISSN 25219162 Year: 2018 Volume: 21 Issue: 2 Pages: 292-299
Publisher: Al-Nahrain University جامعة النهرين

Loading...
Loading...
Abstract

This paper provides a theoretical framework for analysis of consensus algorithm for multi- agent networked systems considering the role of directed information flow. Improvement of the performance of the implemented consensus algorithm has been achieved by using Particle Swarm Optimization (PSO). Concepts of information consensus in networks and methods of convergence are applied as well. Our analysis framework is based on tools algebraic Graph Theory (GT). Simulation of multi-agent system and the performance of a consensus algorithm have been discussed. Acceleration the network while approaching the required goal has been accomplished and elimination of undesired swing that appears during the acceleration was proved.


Article
A Comparison Between SPSO and QPSO from View Point of Optimization
مقارنة بين SPSO و QPSO من وجهة نظر المفاضلة

Loading...
Loading...
Abstract

Particle swarm optimization (PSO) has magnetized different investigators who are concerned in dealing with different optimization problems, due to its ease of implementation and reasonable performance. However, PSO algorithm is trapped in the local optima easily because of the quick loss of the population variance. Hence, enhancement of the performance of PSO and detraction the relaying on factors are led to significant variants of SPSO. One important variant is the quantum behavior of particle swarm optimization (QPSO), which is dependent on the dynamical analysis of SPSO and quantum mechanics. This paper presents a notion for the optimization of nonlinear functions using swarm methodology and a comparison between SPSO and QPSO are given. These two algorithms are analyzed on both unimodal and multimodal, high and low dimensional continuous functions. The results on eight benchmark functions show that the QPSO algorithm can perform much better than the SPSO.

اجتذب مفاضلة سرب الجسيمات (PSO) العديد من الباحثين المهتمين بالتعامل مع مشاكل المفاضلة المختلفة، بسبب سهولة التنفيذ، وعدد قليل من المعلمات المضبوطة، والأداء المقبول. ومع ذلك، خوارزمية PSO سهلة الفخ في optima المحلية بسبب فقدان سريع للتنوع السكاني. لذلك يتم مفاضلة أداء PSO وتقليل الاعتماد على المعلمات إلى أشكال هامة من SPSO. أحد المتغيرات المهمة هو مفاضلة سرب الجسيمات المحسوب على الكم (QPSO) والذي يعتمد على التحليل الديناميكي لـ SPSO والميكانيكا الكمومية. في هذه الورقة، تم تقديم مفهوم لمفاضلة الوظائف غير الخطية باستخدام منهج سرب الجسيمات، تتم مقارنة بين SPSO و QPSO. يتم اختبار هذين الخوارزميتين على كل من الوظائف المستمرة أحادية الواسطة ومتعددة الوسائط، منخفضة وعالية الأبعاد. تظهر النتائج التجريبية على 8 وظائف معيارية، أن خوارزمية QPSO يمكن أن تكون أفضل بكثير من SPSO.

Listing 1 - 3 of 3
Sort by
Narrow your search

Resource type

article (3)


Language

English (3)


Year
From To Submit

2019 (1)

2018 (1)

2016 (1)