Non-convex onion peeling using a shape hull algorithm

Jalal M. Fadili (1) , Mahmoud Melkemi (2) , Abderrahim Elmoataz (1, 3)

1 Equipe Image - Laboratoire GREYC - UMR6072
2 COMBINING - COMputational BIology and data miNING
3 LUSAC - Laboratoire Universitaire des Sciences Appliquées de Cherbourg

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

Mots clés: Onion-peeling; Non-convex shapes; A-shape; Robust statistics

Domaines: Traitement des images [eess.IV]

Jalal M. Fadili, Mahmoud Melkemi, Abderrahim Elmoataz. Non-convex onion peeling using a shape hull algorithm. Pattern Recognition Letters, 2004, 25 (14), pp.1577-1585. ⟨10.1016/j.patrec.2004.05.015⟩. ⟨hal-01123869⟩