Euclidean-distance-based canonical forms for non-rigid 3D shape retrieval

Pickup, David ORCID: https://orcid.org/0000-0003-2894-0822, Sun, Xianfang ORCID: https://orcid.org/0000-0002-6114-0766, Rosin, Paul L. ORCID: https://orcid.org/0000-0002-4965-3884 and Martin, Ralph R. 2015. Euclidean-distance-based canonical forms for non-rigid 3D shape retrieval. Pattern Recognition 48 (8) , pp. 2500-2512. 10.1016/j.patcog.2015.02.021

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (4MB) | Preview

Abstract

Retrieval of 3D shapes is a challenging problem, especially for non-rigid shapes. One approach giving favourable results uses multidimensional scaling (MDS) to compute a canonical form for each mesh, after which rigid shape matching can be applied. However, a drawback of this method is that it requires geodesic distances to be computed between all pairs of mesh vertices. Due to the super-quadratic computational complexity, canonical forms can only be computed for low-resolution meshes. We suggest a linear time complexity method for computing a canonical form, using Euclidean distances between pairs of a small subset of vertices. This approach has comparable retrieval accuracy but lower time complexity than using global geodesic distances, allowing it to be used on higher resolution meshes, or for more meshes to be considered within a time budget.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Additional Information:	This is an open access article under the terms of the CC-BY license.
Publisher:	Elsevier
ISSN:	0031-3203
Funders:	EPSRC
Date of First Compliant Deposit:	30 March 2016
Date of Acceptance:	21 February 2015
Last Modified:	09 May 2023 19:31
URI:	https://orca.cardiff.ac.uk/id/eprint/71104

Citation Data

Cited 25 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item