Non-convex onion-peeling using a shape hull algorithm
نویسندگان
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Non-convex onion peeling using a shape hull algorithm Jalal M. Fadili, Mahmoud Melkemi, Abderrahim Elmoataz
منابع مشابه
Optimizing map labeling of point features based on an onion peeling approach
Map labeling of point-features is the problem of placing text labels to corresponding point-features on a map in a way that minimizes overlaps while satisfying basic rules for the quality. This problem is a critical problem in the applications of cartography and Geographical Information Systems (GIS). In this paper we study the fundamental issues related to map labeling of point-features and de...
متن کاملNumber 3
Outlier Detection is a critical and cardinal research task due its array of applications in variety of domains ranging from data mining, clustering, statistical analysis, fraud detection, network intrusion detection and diagnosis of diseases etc. Over the last few decades, distance-based outlier detection algorithms have gained significant reputation as a viable alternative to the more traditio...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملDynamic Ham-Sandwich Cuts for Two Point Sets with Bounded Convex-Hull-Peeling Depth
We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two (possibly overlapping) point sets in the plane, with a bounded number of convex-hull peeling layers. The ham-sandwich cut of S1 and S2 is a line that simultaneously bisects the area, perimeter or vertex count of both point sets. Our algorithm supports insertion and deletion of vertices in O(c log n) tim...
متن کاملPartial shape matching using convex hull and Fourier descriptors
An application of Fourier descriptors and convex hull for shape analysis is presented. Convex hull is used for dividing a shape into small parts. Amplitude spectrum which is invariant to scaling, translation and choosing a starting point is obtained from the Fourier descriptors (see e.g [1-3]) and used for comparison. All calculations are performed with the author's software and some algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 25 شماره
صفحات -
تاریخ انتشار 2004