SHREC’21: Quantifying shape complexity



Arslan, Mazlum Ferhat, Haridis, Alexandros, Rosin, Paul L, Tari, Sibel, Brassey, Charlotte, Gardiner, James D ORCID: 0000-0003-1902-3416, Genctav, Asli and Genctav, Murat
(2022) SHREC’21: Quantifying shape complexity. Computers and Graphics (UK), 102. pp. 144-153.

[img] Text
Arslan 2021 - journal pre proof.pdf - Author Accepted Manuscript

Download (2MB) | Preview

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
Uncontrolled Keywords: 3D shape complexity
Divisions: Faculty of Health and Life Sciences
Faculty of Health and Life Sciences > Institute of Life Courses and Medical Sciences
Depositing User: Symplectic Admin
Date Deposited: 11 Mar 2022 11:16
Last Modified: 18 Jan 2023 21:11
DOI: 10.1016/j.cag.2021.09.005
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3150594