Fast algorithms for single and multiple pattern Cartesian tree matching

2021 ◽  
Vol 849 ◽  
pp. 47-63
Author(s):  
Siwoo Song ◽  
Geonmo Gu ◽  
Cheol Ryu ◽  
Simone Faro ◽  
Thierry Lecroq ◽  
...  
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