SHREC'21: Quantifying shape complexity

Arslan, Mazlum Ferhat, Haridis, Alexandros, Rosin, Paul L. ORCID: https://orcid.org/0000-0002-4965-3884, Tari, Sibel, Brassey, Charlotte, Gardiner, James D., Genctav, Asli and Genctav, Murat 2022. SHREC'21: Quantifying shape complexity. Computers and Graphics 102 , pp. 144-153. 10.1016/j.cag.2021.09.005

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (1MB)

Abstract

This paper presents the results of SHREC’21 track: Quantifying Shape Complexity. Our goal is to investigate how good the submitted shape complexity measures are (i.e. with respect to ground truth) and investigate the relationships between these complexity measures (i.e. with respect to correlations). The dataset consists of three collections: 1800 perturbed cube and sphere models classified into 4 categories, 50 shapes inspired from the fields of architecture and design classified into 2 categories, and the data from the Princeton Segmentation Benchmark, which consists of 19 natural object categories. We evaluate the performances of the methods by computing Kendall rank correlation coefficients both between the orders produced by each complexity measure and the ground truth and between the pair of orders produced by each pair of complexity measures. Our work, being a quantitative and reproducible analysis with justified ground truths, presents an improved means and methodology for the evaluation of shape complexity.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Elsevier
ISSN:	0097-8493
Date of First Compliant Deposit:	21 September 2021
Date of Acceptance:	16 September 2021
Last Modified:	20 May 2023 21:05
URI:	https://orca.cardiff.ac.uk/id/eprint/144324

Actions (repository staff only)

Edit Item