Abstract
A well-structured and indexed database alleviates the computing burden on large data. This paper describes groundwork for presenting the data in a compact, distinctive form, improving the procedures of applying keypoint detection algorithms to preprocess and reduce the relevant features of the images. Our method computes for an image a number of SURF keypoints in a given interval, by adapting the threshold related to the Hessian matrix blob detector. This type of approach allows selecting the level of detail to use in image description and gives us control over the computing time. We named this method DENOL (Descriptor Number On Limits) and tested it on images from two datasets, UCID and an original image database which we propose, IIT_DB. Very good retrieval results and a significantly reduced computing time are achieved.
Get full access to this article
View all access options for this article.
