Published in

Elsevier, International Journal of Approximate Reasoning: Uncertainty in Intelligent Systems, (60), p. 57-70

DOI: 10.1016/j.ijar.2015.03.001

Links

Tools

Export citation

Search in Google Scholar

Keypoint descriptor fusion with Dempster–Shafer Theory

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Keypoint matching is the task of accurately finding the location of a scene point in two images. Many keypoint descriptors have been proposed in the literature aiming at providing robustness against scale, translation and rotation transformations, each having advantages and disadvantages. This paper proposes a novel approach to fuse the information from multiple keypoint descriptors using Dempster–Shafer Theory of evidence [1], which has proven particularly efficient in combining sources of information providing incomplete, imprecise, biased, and conflictive knowledge. The matching results of each descriptor are transformed into an evidence distribution on which a confidence factor is computed making use of its entropy. Then, the evidence distributions are fused using Dempster–Shafer Theory (DST), considering its confidence. As result of the fusion, a new evidence distribution that improves the result of the best descriptor is obtained. Our method has been tested with SIFT, SURF, ORB, BRISK and FREAK descriptors using all possible combinations of them. Results on the Oxford keypoint dataset [2] shows that the proposed approach obtains an improvement of up to compared to the best one (FREAK).