2012 12th International Conference on Control Automation Robotics &Amp; Vision (ICARCV) 2012
DOI: 10.1109/icarcv.2012.6485261
|View full text |Cite
|
Sign up to set email alerts
|

A 3D classifier trained without field samples

Abstract: This paper presents a 3D classifier that is shown to maintain performance whether trained with real sensor data from the field or purely trained with 3D geometric (Computer Aided Design, CAD, like) models (downloaded from the Internet for instance). The proposed classifier is a global 3D template matching technique which exploits the location of the ground surface for more accurate alignment. The segmentation and position of the ground is given by the segmentation technique in [7] (which does not assumed the g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…The observation likelihood is calculated by measuring the similarity between the shape of the point cloud with each model instance in the database. Similarity is computed by first aligning the point clouds of a pair of objects using the iterative closest point (ICP) algorithm (Besl and McKay, 1992) and then calculating the symmetric residual error (Douillard et al, 2012). Objects may merge or split after each observation if the segmentation changes.…”
Section: Problem Setupmentioning
confidence: 99%
“…The observation likelihood is calculated by measuring the similarity between the shape of the point cloud with each model instance in the database. Similarity is computed by first aligning the point clouds of a pair of objects using the iterative closest point (ICP) algorithm (Besl and McKay, 1992) and then calculating the symmetric residual error (Douillard et al, 2012). Objects may merge or split after each observation if the segmentation changes.…”
Section: Problem Setupmentioning
confidence: 99%
“…The posterior probability distribution for each object after a set of observations is computed using recursive Bayes' rule. The observation likelihood is computed as the symmetric residual error of an iterative closest point (ICP) alignment [8] with each model in the database. Objects may merge or split after each observation if the segmentation changes.…”
Section: Experiments: Active Object Recognitionmentioning
confidence: 99%