Abstract
The hybrid Ant Colony Optimization (ACO) – k-means image segmentation algorithm for MRI images segmentation is considered. The proposed algorithm and sub-system for the medical image segmentation have been implemented. The time complexity of proposed algorithm is investigated using consequences from Drift theorem. It is established that the proposed algorithm has a polynomial estimation of complexity. Images from the Ossirix image dataset and real medical images were used for testing. Comparison of segmentation accuracy have been performed between proposed algorithm and competing algorithms C-means and Magic Wand.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
