Statistical Traffic State Analysis in Large-scale Transportation Networks Using Locality-Preserving Non-negative Matrix Factorization

Statistical traffic data analysis is a hot topic in traffic management and control. In this field, current research progresses focus on analyzing traffic flows of individual links or local regions in a transportation network. Less attention are paid to the global view of traffic states over the entire network, which is important for modeling large-scale traffic scenes. Our aim is precisely to propose a new methodology for extracting spatio-temporal traffic patterns, ultimately for modeling large-scale traffic dynamics, and long-term traffic forecasting. We attack this issue by utilizing Locality-Preserving Non-negative Matrix Factorization (LPNMF) to derive low-dimensional representation of network-level traffic states. Clustering is performed on the compact LPNMF projections to unveil typical spatial patterns and temporal dynamics of network-level traffic states. We have tested the proposed method on simulated traffic data generated for a large-scale road network, and reported experimental results validate the ability of our approach for extracting meaningful large-scale space-time traffic patterns. Furthermore, the derived clustering results provide an intuitive understanding of spatial-temporal characteristics of traffic flows in the large-scale network, and a basis for potential long-term forecasting.Comment: IET Intelligent Transport Systems (2013

A robot behavior-learning experiment using Particle Swarm Optimization for training a neural-based Animat

International audienceWe investigate the use of Particle Swarm Optimization (PSO), and compare with Genetic Algorithms (GA), for a particular robot behavior-learning task: the training of an animat behavior totally determined by a fully-recurrent neural network, and with which we try to fulfill a simple exploration and food foraging task. The target behavior is simple, but the learning task is challenging because of the dynamic complexity of fully-recurrent neural networks. We show that standard PSO yield very good results for this learning problem, and appears to be much more effective than simple GA

Clustering and Modeling of Network level Traffic States based on Locality Preservative Non-negative Matrix Factorization

International audienceIn this paper, we propose to cluster and model network-level traffic states based on a geometrical weighted similarity measure of network-level traffic states and locality preservative non-negative matrix factorization. The geometrical weighted similarity measure makes use of correlation between neighboring roads to describe spatial configurations of global traffic patterns. Based on it, we project original high-dimensional network-level traffic information into a feature space of much less dimensionality through the matrix factorization method. With the obtained low-dimensional representation of global traffic information, we can describe global traffic patterns and the evolution of global traffic states in a flexible way. The experiments prove validity of our method for the case of large-scale traffic network

Analysis of Large-scale Traffic Dynamics using Non-negative Tensor Factorization

International audienceIn this paper, we present our work on clustering and prediction of temporal dynamics of global congestion configurations in large-scale road networks. Instead of looking into temporal traffic state variation of individual links, or of small areas, we focus on spatial congestion configurations of the whole network. In our work, we aim at describing the typical temporal dynamic patterns of this network-level traffic state and achieving long-term prediction of the large-scale traffic dynamics, in a unified data-mining framework. To this end, we formulate this joint task using Non-negative Tensor Factorization (NTF), which has been shown to be a useful decomposition tools for multivariate data sequences. Clustering and prediction are performed based on the compact tensor factorization results. Experiments on large-scale simulated data illustrate the interest of our method with promising results for long-term forecast of traffic evolution

Détecteurs de points d'intérêt 3D basés sur la courbure

National audienceDans cet article, nous proposons un nouveau détecteur de points d'intérêt 3D (keypoint). Notre sélection des points saillants se base sur l'expression de la variation locale de la surface à travers les courbures principales calculées sur un nuage de points ordonnés, associé à une seule vue (deux dimensions et demie). Nous avons comparé sept méthodes qui combinent ces courbures et extraient des keypoints en se basant sur: 1) un seuillage des valeurs d'un facteur de qualité: Quality Factor (FQ), 2) un seuillage sur une mesure de l'indice de forme: Shape Index (SI), 3) les composantes connexes d'une carte de classification basée sur SI, 4) les composantes connexes d'une carte de classification basée sur SI et l'intensité de courbure : Curvedness (C), 5) les composantes connexes d'une carte de classification basée sur la courbure gaussienne (H) et la courbure moyenne (K), 6) une combinaison des deux derniers critères 4 et 5 (SC_HK) avec un tri final selon C et 7) une combinaison des trois critères 1, 4 et 5 (SC_HK_FQ). Une évaluation de la performance de ces détecteurs en termes de stabilité et répétabilité, montre la supériorité des deux nouveaux détecteurs SC_HK et SC_HK_FQ

Analysis of Large-Scale Traffic Dynamics in an Urban Transportation Network Using Non-Negative Tensor Factorization

International audienceIn this paper, we present our work on clustering and prediction of temporal evolution of global congestion configurations in a large-scale urban transportation network. Instead of looking into temporal variations of traffic flow states of individual links, we focus on temporal evolution of the complete spatial configuration of congestions over the network. In our work, we pursue to describe the typical temporal patterns of the global traffic states and achieve long-term prediction of the large-scale traffic evolution in a unified data-mining framework. To this end, we formulate this joint task using regularized Non-negative Tensor Factorization, which has been shown to be a useful analysis tool for spatio-temporal data sequences. Clustering and prediction are performed based on the compact tensor factorization results. The validity of the proposed spatio-temporal traffic data analysis method is shown on experiments using simulated realistic traffic data

Fast 3D keypoints detector and descriptor for view-based 3D objects recognition

International audienceIn this paper, we propose a new 3D object recognition method that employs a set of 3D keypoints extracted from point cloud representation of 3D views. The method makes use of the 2D organization of range data produced by 3D sensor. Our novel 3D interest points approach relies on surface type classifi-cation and combines the Shape Index (SI) - curvedness(C) map with the Gaus-sian (H) - Mean (K) map. For each extracted keypoint, a local description using the point and its neighbors is computed by joining the Shape Index histogram and the normalized histogram of angles between normals. This new proposed descriptor IndSHOT stems from the descriptor CSHOT (Color Signature of Histograms of OrienTations) which is based on the definition of a local, robust and invariant Reference Frame RF. This surface patch descriptor is used to find the correspondences between query-model view pairs in effective and robust way. Experimental results on Kinect based datasets are presented to validate the proposed approach in view based 3D object recognition

Keypoints-based background model and foreground pedestrian extraction for future smart cameras

International audienceIn this paper, we present a method for background modeling using only keypoints, and detection of foreground moving pedestrians using background keypoints substraction followed by adaBoost classification of foreground keypoints. A first experimental evaluation shows very promising detection performances in real-time

3D keypoint detectors and descriptors for 3D objects recognition with TOF camera

International audienceThe goal of this work is to evaluate 3D keypoints detectors and descriptors, which could be used for quasi real time 3D object recognition. The work presented has three main objectives: extracting descriptors from real depth images, obtaining an accurate degree of invariance and robustness to scale and viewpoints, and maintaining the computation time as low as possible. Using a 3D time-of-flight (ToF) depth camera, we record a sequence for several objects at 3 different distances and from 5 viewpoints. 3D salient points are then extracted using 2 different curvatures-based detectors. For each point, two local surface descriptors are computed by combining the shape index histogram and the normalized histogram of angles between the normal of reference feature point and the normals of its neighbours. A comparison of the two detectors and descriptors was conducted on 4 different objects. Experimentations show that both detectors and descriptors are rather invariant to variations of scale and viewpoint. We also find that the new 3D keypoints detector proposed by us is more stable than a previously proposed Shape Index based detector