SHREC’21: Quantifying shape complexity
Name
CAG-S-21-00532.pdf
Size
1.35 MB
Format
Adobe PDF
Checksum (MD5)
55e6cc42f48b47e462f5b3158fc2ab24
Author(s)
Arslan, Mazlum Ferhat
Haridis, Alexandros
Rosin, Paul L.
Tari, Sibel
Brassey, Charlotte
Gardiner, James D.
Genctav, Asli
Genctav, Murat
Date Issued
February 2022
Journal
Computers & Graphics
Publisher
Elsevier BV
Citation
Arslan, Mazlum Ferhat, Haridis, Alexandros, Rosin, Paul L., Tari, Sibel, Brassey, Charlotte et al. 2022. "SHREC’21: Quantifying shape complexity." Computers & Graphics, 102.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Architecture
Terms of Use
Creative Commons Attribution-Noncommercial-ShareAlike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.cag.2021.09.005
