Possibilistic BRISK method for an efficient registration (PBRISK) | IEEE Conference Publication | IEEE Xplore

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 i...Show More

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.
Date of Conference: 02-05 September 2020
Date Added to IEEE Xplore: 20 October 2020
ISBN Information:

ISSN Information:

Conference Location: Sousse, Tunisia
References is not available for this document.

I. Introduction

Image registration is one of the most important method of image processing. It is the process of superimposing two or more images of the same scene or it can be said like this, it is the process of transforming different sets of data into one coordinate system. The method of image registration can be alienated into two types. First one is known as Area Based Image Registration and second one is Feature Based Image Registration. Area Based Image Registration is useful for providing the information about pixel intensity, where as Feature based Image Registration is beneficial for extracting the useful features from an image like Regions, Points and Corners etc. [4]. It Consist four steps [1]. These are Feature Detection, Feature Matching, Transform Model Estimation, Image Resampling and Transformation. In the process of Feature Detection, features can be detected from an image like closed-boundary regions, edges, contours, line intersections, corners, etc. from both targeted and sensed images.

Select All
1.
J. Bauer, N. Sünderhauf and P. Protzel, "Comparing Several Implementations of Two Recently Published Feature Detectors", In Proc. of the International Conference on Intelligent and Autonomous Systems IAV, 2007.
2.
T. Lindeberg, "Feature Detection with Automatic Scale Selection", Int. J. Comput. Vis, vol. 30, pp. 79-116, 1998.
3.
Cyril CHAILLOUX, "Recalage d’images sonar par appariement de régions", Application à la génération de mosa¨ıque Rapport de thèse.
4.
E. Rosten, R. Porter and T. Drummond, "Faster and better: A machine learning approach to corner detection", IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, pp. 105-119, 2010.
5.
E. Karami, M. Shehata and A. Smith, "Image Identification Using SIFT Algorithm: Performance Analysis Against Different Image Deformations", in Proceedings of the 2015 Newfoundland Electrical and Computer Engineering Conference, November, 2015.
6.
Herbert Bay, Andreas Ess, Tinne Tuytelaars and Luc Van Gool, "SURF: Speeded Up Robust Features", Computer Vision and Image Understanding (CVIU), vol. 110, no. 3, pp. 346-359, 2008.
7.
Manuel Grand-brochier, "Descripteurs 2D et 2D+t de points d’intérêt pour des appariements robustes", Ecole Doctorale Sciences Pour L’Ingénieur de Clermont-Ferrand, 2012.
8.
M. Martinez, A. Collet and S. S. Srinivasa, "MOPED: A Scalable and low Latency Object Recognition and Pose Estimation System", In IEEE International Conference on Robotics and Automation, 2010.
9.
N. Y. Khan, B. McCane and G. Wyvill, "SIFT and SURF Performance Evaluation Against Various Image Deformations on Benchmark Dataset", Proceedings of 2011 International Conference of Digital Image Computing Techniques and Applications.
10.
M. Martinez, A. Collet and S. S. Srinivasa, "MOPED: A Scalable and low Latency Object Recognition and Pose Estimation System", In IEEE International Conference on Robotics and Automation. IEEE, 2010.
11.
D. G.. Lowe, "Distinctive image features from scale-invariant keypoints", International journal of computer vision, vol. 60, no. 2, pp. 91-110, 2004.
12.
J. Figat, T. Kornuta and W.. Kasprzak, "Performance Evaluation of Binary Descriptors of Local Features", In Computer Vision and Graphics, pp. 187-194, 2014.
13.
D. Bekele, M. Teutsch and T. Schuchert, "Evaluation of binary keypoint descriptors", In Image Processing (ICIP) 2013 20th IEEE International Conference, pp. 3652-3656, 2013.
14.
C. Achard, E. Bigorgne and J. Devars, "A sub-pixel and multispectral corner detector", International Conference on Pattern Recognition, vol. 3, pp. 971-974, 2000.
15.
A. Choksuriwong, H. Laurent and B. Emile, "Etude comparative de descripteur invariants d’objets", ORASIS, 2005.
16.
"SURF: Speeded Up Robust Features Herbert Bay (ETH Zurich); Tinne Tuytelaars (Katolieke Universiteit Leuven); Luc Van Gool (ETH Zurich)", 9th European Conference on Computer Vision, May 7 - 13, 2006, [online] Available: http://link.springer.com/chapter/10.1007/11744023.
17.
Z. Zhang, "Iterative point matching for registration of free-form surfaces", International Journal of Computer Vision, vol. 13, no. 2, pp. 119-152, 1994.
18.
J. B. Antoine Maintz and Max A. Viergever, "A survey of medical image registration", Medical Image Analysis, vol. 2, no. 1, pp. 1-36, 1998.
19.
Manuel Grand-brochier, "Descripteurs 2D et 2D+t de points d’intérêt pour des appariements robustes", Ecole Doctorale Sciences Pour L’Ingénieur de Clermont-Ferrand, 2012.
20.
D. J. DUBOIS, Fuzzy sets and systems: theory and applications, Academic press, vol. 144, 1980.
21.
M. L. N. MCALLISTER, "Possibility theory: An approach to computerized processing of uncertainty (didier dubois and henri prade with the collaboration of henri farreny roger martin-clouaire and claudette testemale; ef handing trans.)", SIAM Review, vol. 34, no. 1, pp. 147-148, 1992.
Contact IEEE to Subscribe

References

References is not available for this document.