2009
DOI: 10.1007/978-3-642-03767-2_92
|View full text |Cite
|
Sign up to set email alerts
|

Isometric Deformation Modelling for Object Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
35
0
1

Year Published

2010
2010
2015
2015

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 40 publications
(38 citation statements)
references
References 8 publications
2
35
0
1
Order By: Relevance
“…We used the well-known evaluation tool: the Precision Recall plot. We plotted the Precision Recall graph for the whole database in comparison with the best results run with methods involved in the benchmark (Ohbuchi [42] (MR-BF-DSIFT-E), Smeets [43] (DMEVD), and Wuhrer [44] (CF)). Fig.…”
Section: Experiments and Discussionmentioning
confidence: 99%
“…We used the well-known evaluation tool: the Precision Recall plot. We plotted the Precision Recall graph for the whole database in comparison with the best results run with methods involved in the benchmark (Ohbuchi [42] (MR-BF-DSIFT-E), Smeets [43] (DMEVD), and Wuhrer [44] (CF)). Fig.…”
Section: Experiments and Discussionmentioning
confidence: 99%
“…We also compare with the state-of-the-art method, including ShapeDNA [35] and DM-EVD [38], which show the best performance in a larger contest [29]. We test the ShapeDNA method on the the same simplified meshes, and take the result of DM-EVD and other methods from [28], in which DM-EVD is performed on the fine meshes.…”
Section: Hksmentioning
confidence: 99%
“…To deal with non-rigid deformations (bendings) it is necessary to adopt shape descriptions that are invariant to isometric shape deformations. A suitable metric for comparing non-rigid shapes is the geodesic one; indeed 3D shape descriptions based on geodesics, such as geodesic distance matrices [68] or geodesic skeleton paths [38], have been successfully adopted for non-rigid shape comparison, see also [44]. In addition to geodesic, more sophisticated choices are possible, such as the diffusion or the commute-time distance [77].…”
Section: Related Literaturementioning
confidence: 99%
“…Let G be a n × n geodesic distance matrix, where n is the number of vertices in S and the element G(i, j) denotes the geodesic distance from the vertex i to vertex j on S. Building on G, the centralised geodesic matrix [50] is defined as D = G − 1 n G − G1 n +1 n G1 n , where 1 n denotes a n×n matrix having each component equal to 1/n. Following [68], a spectral representation of the geodesic distance is finally adopted as shape descriptor, that is, a vector of eigenvalues…”
Section: Colour + Shape Descriptors (Runs Ve1-3)mentioning
confidence: 99%