2018 IEEE International Conference on Robotics and Automation (ICRA) 2018
DOI: 10.1109/icra.2018.8461049
|View full text |Cite
|
Sign up to set email alerts
|

A General Framework for Flexible Multi-Cue Photometric Point Cloud Registration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
15
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 18 publications
(16 citation statements)
references
References 9 publications
1
15
0
Order By: Relevance
“…The approaches maintain a sparse feature map. Without occupancy grid or dense point cloud outputs available out‐of‐the‐box like lidar approaches, they can be then difficult to use on a real robot. Dense visual odometry (DVO)‐SLAM (Kerl, Sturm, & Cremers, ), Reg Green Blue inverse Depth (RGBiD)‐SLAM (Gutierrez‐Gomez, Mayol‐Cuevas, & Guerrero, ), and multi‐cue photometric registration (MPR) (Della Corte, Bogoslavskyi, Stachniss, & Grisetti, ), instead of using local visual features to estimate motion, use photometric and depth errors over all pixels of the RGB‐D images. They can generate dense point clouds of the environment.…”
Section: Popular Slam Approaches Available On Rosmentioning
confidence: 99%
“…The approaches maintain a sparse feature map. Without occupancy grid or dense point cloud outputs available out‐of‐the‐box like lidar approaches, they can be then difficult to use on a real robot. Dense visual odometry (DVO)‐SLAM (Kerl, Sturm, & Cremers, ), Reg Green Blue inverse Depth (RGBiD)‐SLAM (Gutierrez‐Gomez, Mayol‐Cuevas, & Guerrero, ), and multi‐cue photometric registration (MPR) (Della Corte, Bogoslavskyi, Stachniss, & Grisetti, ), instead of using local visual features to estimate motion, use photometric and depth errors over all pixels of the RGB‐D images. They can generate dense point clouds of the environment.…”
Section: Popular Slam Approaches Available On Rosmentioning
confidence: 99%
“…Such initialization is usually obtained by estimating the transformation between two images using a combination of RANSAC and direct solvers, and then computing the depth through triangulation between the stereo pair. Della Corte et al [31] developed a registration algorithm called MPR, which was built on this idea. As a result, MPR is able to operate on depth images capturing different cues and obtained with arbitrary projection functions.…”
Section: Ils In Roboticsmentioning
confidence: 99%
“…In this case, the block size is determined from the dimension of the perturbation vector of the variables in the template argument list. We extended the factors at this level to implement approaches such as dense multi-cue registration [31]. Special structures in the Jacobians can be exploited to speed up the calculation of H k whose computation has a non negligible cost.…”
Section: Factorsmentioning
confidence: 99%
“…Della Corte et. al [31] developed a registration algorithm called MPR, which was built on this idea. As a result, MPR is able to operate on depth images capturing different cues and obtained with arbitrary projection functions.…”
Section: A Ils In Roboticsmentioning
confidence: 99%