2010 20th International Conference on Pattern Recognition 2010
DOI: 10.1109/icpr.2010.270
|View full text |Cite
|
Sign up to set email alerts
|

Pose Estimation of Known Objects by Efficient Silhouette Matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
24
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 20 publications
(24 citation statements)
references
References 10 publications
0
24
0
Order By: Relevance
“…Specifically, different simulations are characterized by random extractions for the range and pointing uncertainties, as well as for the detection process and the presence of outliers based on the computed values for the probability of detection and on the percentage of outliers. Regarding the pose initialization, a large angular step (Δ¼ 201) has been adopted in the TM algorithm to sample the attitude parameter space, thus limiting the number of templates to about 3600, much less than typical values which range between 5000 and 10,000 [17]. This allows an initial pose estimation accuracy of order Δ in the relative attitude, and of about 1 m in the relative position.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Specifically, different simulations are characterized by random extractions for the range and pointing uncertainties, as well as for the detection process and the presence of outliers based on the computed values for the probability of detection and on the percentage of outliers. Regarding the pose initialization, a large angular step (Δ¼ 201) has been adopted in the TM algorithm to sample the attitude parameter space, thus limiting the number of templates to about 3600, much less than typical values which range between 5000 and 10,000 [17]. This allows an initial pose estimation accuracy of order Δ in the relative attitude, and of about 1 m in the relative position.…”
Section: Resultsmentioning
confidence: 99%
“…A fundamental limitation of this technique is the high computational cost, since pose search must be carried out over the entire pose space that has to be densely sampled in order to get sufficient accuracy [16]. Hence, further studies are needed to overcome this limitation starting from the possibility of organizing the pose database with hierarchical structures [17], generate the database on line (i.e. after target first acquisition) and operating with sparse point clouds.…”
Section: Introductionmentioning
confidence: 99%
“…2D methods can be found in (Haniff et al, 2011), (Xu et al, 2008) or (Fan et al, 2014) and are, in principle, suitable to achieve sub-pixel accuracies. 3D approaches determining the pose of an object like reported in (Ulrich et al, 2009) or (Reinbacher et al, 2010) have advantages over 2D methods but may lead to insufficient results according to real time capability or accuracy for specific tasks. Cars need to pass several alignment and initial operation processes before their delivery.…”
Section: Related Workmentioning
confidence: 99%
“…Liebelt and Schertler [21] proposed a new similarity measure that combines the contour matching and the appearance-based mutual information measure in order to increase alignment precision. In [12], the normalized cross correlation is used to evaluate the similarity between the two contours and the contour matching is accelerated by a hierarchical clustering scheme. Nevertheless, this kind of registration methods is strongly dependent on foreground segmentation technique and is sensitive to occlusion.…”
Section: Related Workmentioning
confidence: 99%
“…In recent years, 3D-2D vehicle registration has attracted more and more attentions, which provides a new way for vehicle recognition [8][9][10][11], localization [12][13][14] and tracking [15][16][17][18]. With the rapid development of 3D modeling technology, 3D vehicle model can be easily obtained.…”
Section: Introductionmentioning
confidence: 99%