Non-convex onion-peeling using a shape hull algorithm

被引:11
|
作者
Fadili, MJ
Melkemi, M
ElMoataz, A
机构
[1] ENSICAEN 6, CNRS, UMR 6072, GREYC, F-14050 Caen, France
[2] Univ Lyon 1, CNRS, FRE 2672, LIRIS, F-69622 Villeurbanne, France
关键词
onion-peeling; non-convex shapes; A-shape; robust statistics;
D O I
10.1016/j.patrec.2004.05.015
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The convex onion-peeling of a set of points is the organization of these points into a sequence of interpolating convex polygons. This method is adequate to detect the shape of the "center" of a set of points when this shape is convex. However it reveals inadequate to detect non-convex shapes. Alternatively, we propose an extension of the convex onion-peeling method. It consists in representing a set of points with a sequence of non-convex polylines which are computed using the A-shape descriptor. This method is applied to robust statistical estimation. It is shown that it makes the estimators robust to the presence of outliers by removing suspect samples from the available population. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:1577 / 1585
页数:9
相关论文
共 50 条
  • [21] Non-convex shape optimization by dissipative Hamiltonian flows
    Bolten, M.
    Doganay, O. T.
    Gottschalk, H.
    Klamroth, K.
    [J]. ENGINEERING OPTIMIZATION, 2024,
  • [22] The non-convex shape of (234) Barbara, the first Barbarian
    Tanga, P.
    Carry, B.
    Colas, F.
    Delbo, M.
    Matter, A.
    Hanus, J.
    Lagoa, V. Ali
    Andrei, A. H.
    Assafin, M.
    Audejean, M.
    Behrend, R.
    Camargo, J. I. B.
    Carbognani, A.
    Cedres Reyes, M.
    Conjat, M.
    Cornero, N.
    Coward, D.
    Crippa, R.
    de Ferra Fantin, E.
    Devogele, M.
    Dubos, G.
    Frappa, E.
    Gillon, M.
    Hamanowa, H.
    Jehin, E.
    Klotz, A.
    Kryszczynska, A.
    Lecacheux, J.
    Leroy, A.
    Manfroid, J.
    Manzini, F.
    Maquet, L.
    Morelle, E.
    Mottola, S.
    Polinska, M.
    Roy, R.
    Todd, M.
    Vachier, F.
    Vera Hernandez, C.
    Wiggins, P.
    [J]. MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2015, 448 (04) : 3382 - 3390
  • [23] Discontinuity-Adaptive Shape from Focus Using a Non-convex Prior
    Ramnath, K.
    Rajagopalan, A. N.
    [J]. PATTERN RECOGNITION, PROCEEDINGS, 2009, 5748 : 181 - 190
  • [24] Individual Cell Electrophysiology (ICE) of Cardiac Myocytes _ Using Innovative 'Onion-Peeling' Technique to Study the ICE of Excitable Cells
    Banyasz, Tamas
    Jian, Zhong
    Horvath, Balazs
    Izu, Leighton T.
    Ye Chen-Izu
    [J]. BIOPHYSICAL JOURNAL, 2012, 102 (03) : 544A - 544A
  • [25] A Non-convex Economic Load Dispatch Using Hybrid Salp Swarm Algorithm
    Alkoffash, Mahmud Salem
    Awadallah, Mohammed A.
    Alweshah, Mohammed
    Abu Zitar, Raed
    Assaleh, Khaled
    Al-Betar, Mohammed Azmi
    [J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2021, 46 (09) : 8721 - 8740
  • [26] An improved non-convex model for discriminating efficient units in free disposal hull
    Shiraz, Rashed Khanjani
    Tavana, Madjid
    Di Caprio, Debora
    Vakili, Javad
    [J]. MEASUREMENT, 2015, 69 : 222 - 235
  • [27] Non-convex clustering using expectation maximization algorithm with rough set initialization
    Mitra, P
    Pal, SK
    Siddiqi, MA
    [J]. PATTERN RECOGNITION LETTERS, 2003, 24 (06) : 863 - 873
  • [28] A Non-convex Economic Load Dispatch Using Hybrid Salp Swarm Algorithm
    Mahmud Salem Alkoffash
    Mohammed A. Awadallah
    Mohammed Alweshah
    Raed Abu Zitar
    Khaled Assaleh
    Mohammed Azmi Al-Betar
    [J]. Arabian Journal for Science and Engineering, 2021, 46 : 8721 - 8740
  • [29] A PROJECTION ALGORITHM FOR NON-CONVEX SPLIT FEASIBILITY PROBLEM
    Yang, Yang
    Qu, Bia
    Qiu, Ming
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2024, 20 (01): : 45 - 57
  • [30] Cuckoo search algorithm for non-convex economic dispatch
    Vo, Dieu N.
    Schegner, Peter
    Ongsakul, Weerakorn
    [J]. IET GENERATION TRANSMISSION & DISTRIBUTION, 2013, 7 (06) : 645 - 654