Some techniques for analyzing time complexity of evolutionary algorithms

2011 ◽  
Vol 34 (6) ◽  
pp. 755-766 ◽  
Author(s):  
Lixin Ding ◽  
Jinghu Yu
Algorithmica ◽  
2016 ◽  
Vol 78 (2) ◽  
pp. 561-586 ◽  
Author(s):  
Benjamin Doerr ◽  
Frank Neumann ◽  
Andrew M. Sutton

2020 ◽  
Vol 2020 (1) ◽  
pp. 105-108
Author(s):  
Ali Alsam

Vision is the science that informs us about the biological and evolutionary algorithms that our eyes, opticnerves and brains have chosen over time to see. This article is an attempt to solve the problem of colour to grey conversion, by borrowing ideas from vision science. We introduce an algorithm that measures contrast along the opponent colour directions and use the results to combine a three dimensional colour space into a grey. The results indicate that the proposed algorithm competes with the state of art algorithms.


Author(s):  
Suresha .M ◽  
. Sandeep

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.


Sign in / Sign up

Export Citation Format

Share Document