The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2012 IEEE/RSJ International Conference on Intelligent Robots and Systems 2012
DOI: 10.1109/iros.2012.6385492
|View full text |Cite
|
Sign up to set email alerts
|

A new feature detector and stereo matching method for accurate high-performance sparse stereo matching

Abstract: Abstract-Hardware platforms with limited processing power are often incapable of running dense stereo analysis algorithms at acceptable speed. Sparse algorithms provide an alternative but generally lack in accuracy. To overcome this predicament, we present an efficient sparse stereo analysis algorithm that applies a dense consistency check, leading to accurate matching results. We further improve matching accuracy by introducing a new feature detector based on FAST, which exhibits a less clustered feature dist… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
19
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 18 publications
(20 citation statements)
references
References 19 publications
1
19
0
Order By: Relevance
“…Since keyframe creation has to be fast, we apply a FAST corner detector on multiple pyramid levels. As also noticed in [15], FAST corners tend to flock to image regions with high contrast whereas there might be some regions with no FAST corners at all. We tackle this problem by detecting many FAST corners more than needed and assigning each to one of n × n grid cells within the image.…”
Section: Mappingsupporting
confidence: 56%
“…Since keyframe creation has to be fast, we apply a FAST corner detector on multiple pyramid levels. As also noticed in [15], FAST corners tend to flock to image regions with high contrast whereas there might be some regions with no FAST corners at all. We tackle this problem by detecting many FAST corners more than needed and assigning each to one of n × n grid cells within the image.…”
Section: Mappingsupporting
confidence: 56%
“…Because sparse stereo matching is much faster than any dense algorithm, this MAV can maintain a high pose estimation rate of 30 Hz. This high performance can be credited to the efficiency of PTAM as well as to the efficiency of the used sparse stereo algorithm, which was previously published in [15]. Because this method appears to be much faster than all other existing approaches, it makes the most promising base for creating an MAV capable of simultaneously processing the imagery of two stereo cameras.…”
Section: Related Workmentioning
confidence: 99%
“…The two algorithms published in [15], for which an efficient open source implementation is available, are used for both of these tasks. Feature detection is, however, extended to include a scale space and an upper bound for the total number of features.…”
Section: Processing Of Forward-facing Camerasmentioning
confidence: 99%
“…Because sparse stereo matching is much faster than any dense algorithm, this MAV can maintain a high pose estimation rate of 30 Hz. This high performance can be credited to the efficiency of PTAM as well as to the efficiency of the used sparse stereo algorithm, which was previously published in [17]. Because this method appears to be much faster than all other existing approaches, it makes the most promising base for creating an MAV capable of simultaneously processing the imagery of two stereo cameras.…”
Section: Related Workmentioning
confidence: 99%
“…The two algorithms published in [17], for which an efficient open source implementation is available, are used for both of these tasks. Feature detection is, however, extended to include a scale space and an upper bound for the total number of features.…”
Section: Processing Of Forward-facing Camerasmentioning
confidence: 99%