A Novel Approach for Lane Detection Sensor via Maximum a Posteriori Estimation and Inertia Narrowed Region Particle Swarm Optimization

2015 ◽  
Vol 13 (2) ◽  
pp. 117-122
Author(s):  
Bing Yu ◽  
Yuan Liu
Author(s):  
Priya Thiruvasagam ◽  
Kalavathi Palanisamy

Background and Objective: In order to reduce time complexity and to improve the computational efficiency in diagnosing process, automated brain tissue segmentation for magnetic resonance brain images is proposed in this paper. Methods: This method incorporates two processes, the first one is preprocessing and the second one is segmentation of brain tissue using Histogram based Swarm Optimization techniques. The proposed method was investigated with images obtained from twenty volumes and eighteen volumes of T1-Weighted images obtained from Internet Brain Segmentation Repository (IBSR), Alzheimer disease images from Minimum Interval Resonance Imaging in Alzheimer's Disease (MIRIAD) and T2-Weighted real-time images collected from SBC Scan Center Dindigul. Results: The proposed technique was tested with three brain image datasets. Quantitative evaluation was done with Jaccard (JC) and Dice (DC) and also it was compared with existing swarm optimization techniques and other methods like Adaptive Maximum a posteriori probability (AMAP), Biased Maximum a posteriori Probability (BMAP), Maximum a posteriori Probability (MAP), Maximum Likelihood (ML) and Tree structure K-Means (TK-Means). Conclusion: The performance comparative analysis shows that our proposed method Histogram based Darwinian Particle Swarm Optimization (HDPSO) gives better results than other proposed techniques such as Histogram based Particle Swarm Optimization (HPSO), Histogram based Fractional Order Darwinian Particle Swarm Optimization (HFODPSO) and with existing swarm optimization techniques and other techniques like Adaptive Maximum a posteriori Probability (AMAP), Biased Maximum a posteriori Probability (BMAP), Maximum a posteriori Probability (MAP), Maximum Likelihood (ML) and Tree structure K-Means (TK-Means).


2021 ◽  
Vol 11 (11) ◽  
pp. 4780
Author(s):  
Muhammad Salman Qamar ◽  
Shanshan Tu ◽  
Farman Ali ◽  
Ammar Armghan ◽  
Muhammad Fahad Munir ◽  
...  

This work presents a novel Best-Worst Ant System (BWAS) based algorithm to settle the Traveling Salesman Problem (TSP). The researchers has been involved in ordinary Ant Colony Optimization (ACO) technique for TSP due to its versatile and easily adaptable nature. However, additional potential improvement in the arrangement way decrease is yet possible in this approach. In this paper BWAS based incorporated arrangement as a high level type of ACO to upgrade the exhibition of the TSP arrangement is proposed. In addition, a novel approach, based on hybrid Particle Swarm Optimization (PSO) and ACO (BWAS) has also been introduced in this work. The presentation measurements of arrangement quality and assembly time have been utilized in this work and proposed algorithm is tried against various standard test sets to examine the upgrade in search capacity. The outcomes for TSP arrangement show that initial trail setup for the best particle can result in shortening the accumulated process of the optimization by a considerable amount. The exhibition of the mathematical test shows the viability of the proposed calculation over regular ACO and PSO-ACO based strategies.


Sign in / Sign up

Export Citation Format

Share Document