.png){kind=icon}
.png){kind=icon}
Return
Non-convex onion-peeling using a shape hull algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2004.05.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
onion-peeling
non-convex shapes
A-shape
robust statistics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
No organization information available