Topological structures learning using the Delaunay triangulation and cascade support vector machines Mohamed cherif Rahal May 27, 2014

Institut VeDeCoM, 77 rue des Chantiers, 78000 Versailles [email protected]

Abstract Reliable object recognition is an important step for enabling mobile systems to reason and act in the real world. A high-level perception model ables to integrate multiple sensors can signicantly increase the capabilities of such systems. Tasks such as obstacle avoidance, mapping, and tracking can provide real benets from a fast and general objects detector able to recognise and identify relevant objects from training stages. Our problematic deals with the recognition of objects on the way of sensors-equipped mobile system. Most of the existing vehicular and robotic sensors provide a set of points in R3 at each time period. Having this huge amount of data organised as timestamped sets of points, our aim is to cluster, learn and recognise structures from each set of points. However, these clustering and recognition tasks must be done in real time and without any notion about the number of desired clusters. The problem is clearly related to srstly an unsupervised task folowed by a supervised learning task. In the clustering stage, rst we compute the delaunay triangulation. Then we apply the α-shape algorithm using a suitble parameter α. Finally we extract the clusters by using connected component graph-based research approach.For each connected component which represents an object in the scene, we extract a certain number of features. After the clustering and features extraction phase, a labeling and learning tasks are needed to create the learning model. For the last stage we use a cascade SVM based technique.

Fig.1 An Example of the application of the α-shpa algorithme on a 3-d point cloud provided by a velodyne laser-scanner of 64 layers.

References [1] Dominique Gruyer, Aurélien Cord, Rachid Belaroussi (2014): Vehicle detection and tracking by collaborative fusion between laser scanner and camera. IROS 2013: 5207-5214. [2] Edelsbrunner, H., Mucke, E. P. Three-Dimensional Alpha Shapes. ACM Transactions on Graphics 1994 , 13(1), pp.43-72. [3] Chen, Z., Pears, N., Freeman, M., Austin,J. : Road Vehicle Classication using Support Vector Machines. ICIS 2009. IEEE International Conference on Intelligent System(Volume:4). 1

Topological structures learning using the Delaunay ...

May 27, 2014 - [1] Dominique Gruyer, Aurélien Cord, Rachid Belaroussi (2014): Vehicle detection and tracking by collaborative fusion between laser scanner and camera. IROS 2013: 5207-5214. [2] Edelsbrunner, H., Mucke, E. P. Three-Dimensional Alpha Shapes. ACM Transactions on Graphics. 1994 , 13(1), pp.43-72.

103KB Sizes 0 Downloads 120 Views

Recommend Documents

On Reliable Topological Structures for Message ...
Paper approved by the Editor for Computer Communication of the ... C-0609 and in part by the National Science Foundation under Grant. The author is with the ..... by (noting that in H(n - 1, k - 1) every vertex has degree ... (c) The Graph BA.

Video Storyboard Design Using Delaunay Graphs
content of a video with minimum data. Video ... detecting local variations in the input data, and it fails to give good .... For this work, we use HD descriptor, a.

sonia delaunay
Her work extends to painting, textile design and stage set design. She was the first living female artist to have a retrospective exhibition at the Louvre in 1964, ...

Delaunay Triangulation Demo - GitHub
by Liu jiaqi & Qiao Xin & Wang Pengshuai. 1 Introduction. Delaunay triangulation for a set P of points in a plane is a triangulation DT(P) such that no point in P is ...

Download Delaunay Mesh Generation (Chapman ...
Hall/CRC Computer & Information Science. Series) Full ... Science Series) Full eBook ... Deep Learning (Adaptive Computation and Machine Learning Series).

Delaunay triangulations on the word RAM: Towards a ...
Mathematics and Computer Science. Technische Universiteit Eindhoven. The Netherlands. [email protected]. Abstract—The Delaunay triangulation of n points ...

Chromatin Topological Transitions
Page 1 ... 3)) In particular, it is often hard to make the difference between direct ..... 4) G. J. Narlikar, H. Y. Fan and R. E. Kingston, Cell 108 (2002), 475.

Delaunay triangulations on the word RAM: Towards a ...
∗Department of Mathematics and Computer Science, TU. Eindhoven, The Netherlands. pute these data structures fast. Such algorithms typ- ically run fast in .... steps in the previous paragraph are done in linear time, the constants in the computation

Data Structures Using C++.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Data Structures ...

Chromatin Topological Transitions - LPTMC
This leads to both compaction and topological deformation of the DNA by one negative turn per nucleosome. 2). Acting both as a compaction and regulatory tool, nucleosomes must be reasonably stable while keeping some dynamic properties to allow transi

Chromatin Topological Transitions
(c) In the three-state model of chromatin fiber, chromatin fiber in front .... whole scenario can be conveniently experimented at desk by using an old XXth century ...

An improved Incremental Delaunay Triangulation Algorithm
Abstract: The incremental insertion algorithm of. Delaunay triangulation in 2D is very popular due to its simplicity and stability. We briefly discuss.

Topological quantum computation
Oct 10, 2002 - information is stored and manipulated in “topological degrees of freedom” rather ... The gates are taken from a fixed finite library of unitary 2 × 2 .... collective electronic systems, e.g. the fractional quantum Hall effect [13]