Possibilistic BRISK method for an efficient registration (PBRISK)

Abstract

This paper aims to present a possibilistic registration method using BRISK. BRISK method is a key point detector and descriptor. It is rotation and scale invariant, but it takes more time to detect the feature points and it suffers from the high number of outliers. The main idea of the proposed method is to apply the theory of possibilities for extracting primitives to obtaining an efficient registration. We explore the suitability of the BRISK method for the task of image registration by limiting the outlier’s number. The proposed method uses the semantic aspect of images for features detection as well as matching. This “semantic focussing process” allows reducing the quantity of information, as well as the noise effects during the matching process by the creation of a new space called “Semantic knowledge space” which contains a set of projections of images each presenting a single content called a “possibilistic maps The experiments as well as the comparative study carried out, using medical images, show the efficiency of the proposed method in terms of outliers’ reduction, noise robustness, time complexity and precision improved.