Search Results - (( dynamic bandwidth optimisation algorithm ) OR ( dynamic candidate detection algorithm ))

Improvement real-time detection of moving vehicle in a dynamic scene using shadow removal method / Khairul Azman Ahmad, Mohd Halim Mohd Noor,Mohamad Adha Mohamad Idin by Ahmad, Khairul Azman, Mohd Noor, Mohd Halim, Mohamad Idin, Mohamad Adha

Get full text
Get full text

Efficient distance computation algorithm between nearly intersected objects using dynamic pivot point in virtual environment application by Hamzah Asyrani Sulaiman, Abdullah Bade, Mohd Harun Abdullah

Get full text
Get full text
Get full text
Get full text

Efficient distance computation algorithm between nearly intersect objects using dynamic pivot point in virtual environment application by Sulaiman, Hamzah Asyrani, Bade, Abdullah, Abdullah, Mohd Harun

Get full text
Get full text

A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

“…The obstacle borders are regarded as the environment’s borders for static obstacle avoidance. However, once dynamic obstacles appear in front of the GLS waves, the system detects them as new dynamic obstacle borders. …”
Get full text
Get full text
Get full text
Get full text

Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

“…Hence, the algorithm must overcome the problem of dynamic updates in the internal parameters or counter the concept drift. …”
Get full text
Get full text

Moving objects detection from UAV captured videos using trajectories of matched regional adjacency graphs by Harandi, Bahareh Kalantar Ghorashi

“…Specifically, the objectives of this thesis are (i) to develop an image registration technique based on multigraph matching, (ii) to detect occluded objects through exploration of candidate object correspondences in longer frame sequences, and (iii) to develop a robust graph coloring algorithm for multiple moving object detection under different transformations. …”
Get full text
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…For static obstacle avoidance, the boundaries of the obstacle(s) are considered borders of the environment. However, the algorithm detects obstacles as a new border in dynamic obstacles once it occurs in front of the GLS waves. …”
Get full text

Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text

A malware analysis and detection system for mobile devices / Ali Feizollah by Ali, Feizollah

“…We then used feature selection algorithms and deep learning algorithms to build a detection model. …”
Get full text
Get full text
Get full text

A multi-color based features from facial images for automatic ethnicity identification model by Mohd Zamri, Osman, Mohd Aizaini, Maarof, Mohd Foad, Rohani, Nilam Nur Amir, Sjarif, Nor Saradatul Akmar, Zulkifli

“…In the feature extraction process, a dynamic skin color detection is adapted to extract the skin color information from the face candidate. …”
Get full text
Get full text
Get full text

Efficient reconfigurable architectures for 3-D medical image compression by Ahmad, Afandi

“…These applications require continuous hardware servicing, and as a result dynamic partial recon�guration (DPR) has been introduced. …”
Get full text
Get full text