Analysis of Suitable Natural Feature Computer Vision Algorithms for Augmented Reality Services

被引:4
作者
Cirulis, Arnis [1 ]
Brigmanis-Brigis, Kristaps [1 ]
Zvejnieks, Gatis [2 ]
机构
[1] Vidzeme Univ Appl Sci, Sociotech Syst Engn Inst, Virtual & Augmented Real Lab, Cesu Str 4, LV-4200 Valmiera, Latvia
[2] SIA Overly, Kr Valdemara Str 115-5, Riga, Latvia
来源
BALTIC JOURNAL OF MODERN COMPUTING | 2020年 / 8卷 / 01期
关键词
Augmented Reality; Computer Vision; Natural Feature Detection Algorithms;
D O I
10.22364/bjmc.2020.8.1.10
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The first step in working with object augmentation in an augmented reality system is to identify the target object, so its pose in respect to the camera can be determined for precise and accurate augmented content generation over the target object. In modern augmented reality systems natural feature detection algorithms are widely used for detecting, identifying and tracking planar textured objects. All-natural feature algorithms detect interest points or keypoints (detector) in an image (scene) and/or calculate descriptors for keypoints (extractor). Algorithms can include both parts, detection and extraction, and can have just one of them realized. There is a variety of algorithms available nowadays for developers to use. Starting from floating point descriptor-based ones as SIFT and SURF and a row of binary descriptor-based algorithms such as BRIEF, ORB, BRISK, FREAK, KAZE, A-KAZE, LATCH. In addition, there are algorithms which only detect interest points, as FAST or A-GAST. Furthermore, it is possible to use one algorithm for keypoint detection and afterwards use another for descriptor extraction. Given such a variety of available algorithms, it is necessary to analyse them by understanding their working principles, so they can be classified by their strengths and weaknesses and in what situations the use of one or another algorithm is more appropriate. Since it is possible to use combinations of algorithms, a table of possible cases is provided. For clarity we must mention that various algorithms, which are not mentioned here, are available but we take an overview of the above listed as all of them are included in the OpenCV library and are widely used in the industry.
引用
收藏
页码:174 / 181
页数:8
相关论文
共 13 条
[1]  
Alahi A, 2012, PROC CVPR IEEE, P510, DOI 10.1109/CVPR.2012.6247715
[2]  
[Anonymous], 2001, INTEL CORPORATION
[3]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[4]   BRIEF: Binary Robust Independent Elementary Features [J].
Calonder, Michael ;
Lepetit, Vincent ;
Strecha, Christoph ;
Fua, Pascal .
COMPUTER VISION-ECCV 2010, PT IV, 2010, 6314 :778-792
[5]  
Fernandez Alcantarilla P., 2013, Fast Explicit Diffusion for Accelerated Features in Nonlinear Scale Spaces
[6]   Comparative Evaluation of Binary Features [J].
Heinly, Jared ;
Dunn, Enrique ;
Frahm, Jan-Michael .
COMPUTER VISION - ECCV 2012, PT II, 2012, 7573 :759-773
[7]  
Kastrenakes J., 2017, GOOGLES PROJECT TANG
[8]  
Leutenegger S, 2011, IEEE I CONF COMP VIS, P2548, DOI 10.1109/ICCV.2011.6126542
[9]  
Levi G, 2016, IEEE WINT CONF APPL
[10]   Distinctive image features from scale-invariant keypoints [J].
Lowe, DG .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 60 (02) :91-110