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 条
  • [1] Parameter-free optic disc detection
    Duanggate, Cattleya
    Uyyanonvara, Bunyarit
    Makhanov, Stanislav S.
    Barman, Sarah
    Williamson, Tom
    COMPUTERIZED MEDICAL IMAGING AND GRAPHICS, 2011, 35 (01) : 51 - 63
  • [2] Parameter-free Laplacian centrality peaks clustering
    Yang, Xu-Hua
    Zhu, Qin-Peng
    Huang, Yu-Jiao
    Xiao, Jie
    Wang, Lei
    Tong, Fei-Chang
    PATTERN RECOGNITION LETTERS, 2017, 100 : 167 - 173
  • [3] PARAMETER-FREE FISTA BY ADAPTIVE RESTART AND BACKTRACKING
    Aujol, Jean-Francois
    Calatroni, Luca
    Dossal, Charles
    Labarriere, Hippolyte
    Rondepierre, Aude
    SIAM JOURNAL ON OPTIMIZATION, 2024, 34 (04) : 3259 - 3285
  • [4] Parameter-free linear relationship (PFLR) and its application to 3D QSAR
    Farkas, Oedoen
    Jakli, Imre
    Kalaszi, Adrian
    Imre, Gabor
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 45 (03) : 598 - 606
  • [5] Benchmarking Parameter-Free AMaLGaM on Functions With and Without Noise
    Bosman, Peter A. N.
    Grahl, Joern
    Thierens, Dirk
    EVOLUTIONARY COMPUTATION, 2013, 21 (03) : 445 - 469
  • [6] A Parameter-Free Classification Method for Large Scale Learning
    Boulle, Marc
    JOURNAL OF MACHINE LEARNING RESEARCH, 2009, 10 : 1367 - 1385
  • [7] PARAMETER-FREE ACCELERATED GRADIENT DESCENT FOR NONCONVEX MINIMIZATION
    Marumo, Naoki
    Takeda, Akiko
    SIAM JOURNAL ON OPTIMIZATION, 2024, 34 (02) : 2093 - 2120
  • [8] Parameter-free Paretian optimisation in electromagnetics: a kinematic formulation
    Di Barba, Paolo
    Dughiero, Fabrizio
    Sieni, Elisabetta
    IET SCIENCE MEASUREMENT & TECHNOLOGY, 2013, 7 (02) : 93 - 103
  • [9] Towards Parameter-Free Clustering for Real-World Data
    Hou, Jian
    Yuan, Huaqiang
    Pelillo, Marcello
    PATTERN RECOGNITION, 2023, 134
  • [10] Parameter-free fault location for transmission lines based on optimisation
    Davoudi, Masoud
    Sadeh, Javad
    Kamyab, Ebadollah
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2015, 9 (11) : 1061 - 1068