Parameter-free modelling of 2D shapes with ellipses

被引:32
作者
Panagiotakis, Costas [1 ,2 ]
Argyros, Antonis [2 ,3 ]
机构
[1] Technol Educ Inst Crete, Dept Business Adm, Agios Nikolaos 72100, Crete, Greece
[2] Fdn Res & Technol Hellas FORTH, Inst Comp Sci, Iraklion 70013, Crete, Greece
[3] Univ Crete, Dept Comp Sci, Iraklion, Greece
关键词
Ellipses fitting; Shape analysis; Shape complexity; Expectation-Maximisation; Model selection; AIC; BIC; LEVEL SET METHOD; ROBUST; DIMENSION; ALGORITHM;
D O I
10.1016/j.patcog.2015.11.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Our goal is to represent a given 2D shape with an automatically determined number of ellipses, so that the total area covered by the ellipses is equal to the area of the original shape without any assumption or prior knowledge about the object structure. To solve this interesting theoretical problem, first we employ the skeleton of the 2D shape which provides important information on the parameters of the ellipses that could approximate the original shape. For a given number of such ellipses, the hard Expectation Maximisation (EM) algorithm is employed to maximise the shape coverage under the Equal Area constraint. Different models (i.e., solutions involving different numbers of ellipses) are evaluated based on the Akaike Information Criterion (AIC). This considers a novel, entropy-based shape complexity measure that balances the model complexity and the model approximation error. In order to minimise the AIC criterion, two variants are proposed and evaluated: (a) the augmentative method that gradually increases the number of considered ellipses starting from a single one and (b) the decremental method that decreases the number of ellipses starting from a large, automatically defined set. The obtained quantitative results on more than 4000 2D shapes included in standard as well as in custom datasets, quantify the performance of the proposed methods and illustrate that their solutions agree with human intuition. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:259 / 275
页数:17
相关论文
共 50 条
  • [31] A Class of Parameter-free Filled Functions for Box-constrained System of Nonlinear Equations
    Yuan, Liu-yang
    Wan, Zhong-ping
    Tang, Qiu-hua
    Zheng, Yue
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2016, 32 (02): : 355 - 364
  • [32] A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption
    Bartlett, Peter L.
    Gabillon, Victor
    Valko, Michal
    ALGORITHMIC LEARNING THEORY, VOL 98, 2019, 98
  • [33] A parameter-free mixed formulation for the Stokes equations and linear elasticity with strongly symmetric stress
    Zhao, Lina
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2024, 155 (35-50) : 35 - 50
  • [34] Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search
    Yokoyama, Shu
    Kaneko, Tomoyuki
    Tanaka, Tetsuro
    ADVANCES IN COMPUTER GAMES, ACG 2015, 2015, 9525 : 210 - 222
  • [35] An Adaptive and Near Parameter-free Evolutionary Computation Approach Towards True Automation in AutoML
    Evans, Benjamin
    Xue, Bing
    Zhang, Mengjie
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [36] SPECIFIC PARAMETER-FREE GLOBAL OPTIMIZATION TO SPEED UP SETTING AND AVOID FACTORS INTERACTIONS
    Rodriguez-Reche, Rafael
    Prado, Rocio P.
    Garcia-Galan, Sebastian
    Enrique Munoz-Exposito, Jose
    Ruiz-Reyes, Nicolas
    COMPUTING AND INFORMATICS, 2019, 38 (02) : 265 - 290
  • [37] Weighted geometric circle fitting for the Brogar Ring: Parameter-free approach and bias analysis
    Hu, Yu
    Fang, Xing
    Qin, Yuxin
    Akyilmaz, O.
    MEASUREMENT, 2022, 192
  • [38] Noniterative Parameter-Free Fault Location for Practically Transposed Transmission Lines With Synchronized/Unsynchronized Measurements
    Lu, Dian
    Wan, Jun
    Duan, Mengzhao
    Xie, Yuhao
    Fan, Rui
    Liu, Yu
    IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, 2025, 74
  • [39] Restarts Subject to Approximate Sharpness: A Parameter-Free and Optimal Scheme For First-Order Methods
    Adcock, Ben
    Colbrook, Matthew J.
    Neyra-Nesterenko, Maksym
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2025,
  • [40] Control of minimum member size in parameter-free structural shape optimization by a medial axis approximation
    Schmitt, Oliver
    Steinmann, Paul
    COMPUTATIONAL MECHANICS, 2018, 61 (06) : 717 - 727