Fast image retrieval with grid-based keypoint detector and binary descriptor

As an alternative to vector-based descriptors, such as SIFT and SURF, more computationally efficient binary descriptors, such as BRISK and ORB, have recently been proposed. These binary descriptors are usually used in combination with a novel scale-space FAST-based detector to be suitable for real-time applications, but it consumes more time than creating binary descriptors. Therefore, if accuracy can be kept similar, keypoint sampling by a grid is better than FAST-based detector because it consumes almost no time. In this paper, grid-based sampling and BRISK keypoint detector are tested for image retrieval. Experimental results demonstrate that grid-based sampling out performs keypoint detector in terms of accuracy and processing speed.