Ramkumar, B.B.RamkumarLaber, RobRobLaberBojinov, HristoHristoBojinovHegde, Ravi SadanandaRavi SadanandaHegde2025-08-312025-08-312020-10-0110.1007/s11554-019-00861-22-s2.0-85062890829https://d8.irins.org/handle/IITG2025/23065The recently proposed, KAZE image feature detection and description algorithm (Alcantarilla et al. in Proceedings of the British machine vision conference. LNCS, vol 7577, no 6, pp 13.1–13.11, 2013) offers significantly improved robustness in comparison to conventional algorithms like SIFT (scale-invariant feature transform) and SURF (speeded-up robust features). The improved robustness comes at a significant computational cost, however, limiting its use for many applications. We report a GPU acceleration of the KAZE algorithm that is significantly faster than its CPU counterpart. Unlike previous reports, our acceleration does not resort to binary descriptors and can serve as a drop-in replacement for CPU-KAZE, SIFT, SURF etc. By achieving nearly tenfold speedup (for a 1920 by 1200 sized image, our Compute Unified Device Architecture (CUDA)-C implementation took around 245 ms on a single GPU in comparison to nearly 2400 ms for a 16-threaded CPU version) without degradation in feature extraction performance, our work expands the applicability of the KAZE algorithm. Additionally, the strategies described here could also prove useful for the GPU implementation of other nonlinear scale-space-based image processing algorithms.falseFeature description | Feature detection | GPU acceleration | KAZE features | Nonlinear scale spaceArticle186182191169-11821 October 202015arJournal14