interest point detectors
Recently Published Documents


TOTAL DOCUMENTS

35
(FIVE YEARS 5)

H-INDEX

10
(FIVE YEARS 0)

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4343
Author(s):  
Franco Hidalgo ◽  
Thomas Bräunl

Modern visual SLAM (vSLAM) algorithms take advantage of computer vision developments in image processing and in interest point detectors to create maps and trajectories from camera images. Different feature detectors and extractors have been evaluated for this purpose in air and ground environments, but not extensively for underwater scenarios. In this paper (I) we characterize underwater images where light and suspended particles alter considerably the images captured, (II) evaluate the performance of common interest points detectors and descriptors in a variety of underwater scenes and conditions towards vSLAM in terms of the number of features matched in subsequent video frames, the precision of the descriptors and the processing time. This research justifies the usage of feature detectors in vSLAM for underwater scenarios and present its challenges and limitations.


2019 ◽  
Vol 148 (10) ◽  
pp. 55-64
Author(s):  
Francisco Javier Valdepeña Rivera ◽  
Dante Mújica Vargas ◽  
Miguel Ángel Ruíz

Author(s):  
Jacek Komorowski ◽  
Konrad Czarnota ◽  
Tomasz Trzcinski ◽  
Lukasz Dabala ◽  
Simon Lynen

2015 ◽  
Vol 2015 ◽  
pp. 1-16
Author(s):  
Min Mao ◽  
Kuang-Rong Hao ◽  
Yong-Sheng Ding

Since the image feature points are always gathered at the range with significant intensity change, such as textured portions or edges of an image, which can be detected by the state-of-the-art intensity based point-detectors, there is nearly no point in the areas of low textured detected by classical interest-point detectors. In this paper we describe a novel algorithm based on affine transform and graph cut for interest point detecting and matching from wide baseline image pairs with weakly textured object. The detection and matching mechanism can be separated into three steps: firstly, the information on the large textureless areas will be enhanced by adding textures through the proposed texture synthesis algorithm TSIQ. Secondly, the initial interest-point set is detected by classical interest-point detectors. Finally, graph cuts are used to find the globally optimal set of matching points on stereo pairs. The efficacy of the proposed algorithm is verified by three kinds of experiments, that is, the influence of point detecting from synthetic texture with different texture sample, the stability under the different geometric transformations, and the performance to improve the quasi-dense matching algorithm, respectively.


Sign in / Sign up

Export Citation Format

Share Document