SHREC'21: Quantifying shape complexity[Formula presented]

ARSLAN M. F., Haridis A., Rosin P. L., TARI Z. S., Brassey C., Gardiner J. D., ...Daha Fazla

Computers and Graphics (Pergamon), cilt.102, ss.144-153, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 102
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1016/j.cag.2021.09.005
  • Dergi Adı: Computers and Graphics (Pergamon)
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.144-153
  • Anahtar Kelimeler: 3D shape complexity
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

© 2021 Elsevier LtdThis 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.