SHREC’21: Quantifying shape complexity[Formula presented]

Date

2021-01-01

Author

Arslan, Mazlum Ferhat
Rosin, Paul L.
Tarı, Zehra Sibel
Gardiner, James D.
Genctav, Asli
Genctav, Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

152
views

0
downloads

© 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.

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85116734753&origin=inward
https://hdl.handle.net/11511/94543

Journal

Computers and Graphics (Pergamon)

DOI

https://doi.org/10.1016/j.cag.2021.09.005

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

On the reduction of Gaussian inverse Wishart mixtures Granström, Karl; Orguner, Umut (2012-09-12) This paper presents an algorithm for reduction of Gaussian inverse Wishart mixtures. Sums of an arbitrary number of mixture components are approximated with single components by analytically minimizing the Kullback-Leibler divergence. The Kullback-Leibler difference is used as a criterion for deciding whether or not two components should be merged, and a simple reduction algorithm is given. The reduction algorithm is tested in simulation examples in both one and two dimensions. The results presented in the ...
Low-Level Hierarchical Multiscale Segmentation Statistics of Natural Images Akbaş, Emre (2014-09-01) This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain ...
An Experimental Study on the Reliability of COSMIC Measurement Results Ungan, Erdir; Demirörs, Onur; Top, Ozden Ozcan; Ozkan, Baris (2009-11-06) In this paper, we present the results of a functional software size measurement experiment. We have conducted this experiment to analyze variances in functional software size measurement results among individuals. We aimed to isolate the factors that cause these variances. At the end of the study, statistical results are displayed. Common measurement problems were presented including their causes. And finally factors leading to discrepancies were identified based on these findings.
Domain-Structured Chaos in a Hopfield Neural Network Akhmet, Marat (World Scientific Pub Co Pte Lt, 2019-12-30) In this paper, we provide a new method for constructing chaotic Hopfield neural networks. Our approach is based on structuring the domain to form a special set through the discrete evolution of the network state variables. In the chaotic regime, the formed set is invariant under the system governing the dynamics of the neural network. The approach can be viewed as an extension of the unimodality technique for one-dimensional map, thereby generating chaos from higher-dimensional systems. We show that the dis...
Improving the big bang-big crunch algorithm for optimum design of steel frames Hasançebi, Oğuzhan (null; 2012-01-01) This paper presents an improved version of the big bang-big crunch (BB-BC) algorithm namely exponential BB-BC algorithm (EBB-BC) for optimum design of steel frames according to ASD-AISC provisions. It is shown that the standard version of the algorithm sometimes is unable to provide reasonable solutions for problems from discrete design optimization of steel frames. Therefore, by investigating the shortcomings of the BB-BC algorithm, it is aimed to enhance the algorithm for solving complicated steel frame o...

Citation Formats

M. F. Arslan, P. L. Rosin, Z. S. Tarı, J. D. Gardiner, A. Genctav, and M. Genctav, “SHREC’21: Quantifying shape complexity[Formula presented],” Computers and Graphics (Pergamon), pp. 0–0, 2021, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85116734753&origin=inward.