Rozprawy doktorskie na temat „Reconnaissance des modèles de trafic”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Reconnaissance des modèles de trafic”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Oberoi, Kamaldeep Singh. "Modélisation spatio-temporelle du trafic routier en milieu urbain". Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR075/document.
Pełny tekst źródłaFor past several decades, researchers have been interested in understanding traffic evolution, hence, have proposed various traffic models to identify bottleneck locations where traffic congestion occurs, to detect traffic patterns, to predict traffic states etc. Most of the existing models consider traffic as many-particle system, describe it using different scales of representation and explain its evolution quantitatively by deducing relations between traffic variables like flow, density and speed. Such models are mainly focused on computing precise information about traffic using acquired traffic data. However, computation of such precise information requires more processing resources. A way to remedy this problem is to consider traffic evolution in qualitative terms which reduces the required number of processing resources. Since traffic is spatio-temporal in nature, the models which deal with spatio-temporal phenomenon can be applied in case of traffic. Such models represent spatio-temporal phenomenon from qualitative as well as quantitative standpoints. Depending on the intended application, some models are able to differentiate between various entities taking part in the phenomenon, which proves useful in case of traffic since different objects like vehicles, buildings, pedestrians, bicycles etc., directly affecting traffic evolution, can be included in traffic models. Qualitative spatio-temporal models consider the effects of different entities on each other in terms of spatial relations between them and spatio-temporal evolution of the modeled phenomenon is described in terms of variation in such relations over time. Considering different traffic constituents and spatial relations between them leads to the formation of a structure which can be abstracted using graph, whose nodes represent individual constituents and edges represent the corresponding spatial relations. As a result, the evolution of traffic, represented using graph, is described in terms of evolution of the graph itself, i. e. change in graph structure and attributes of nodes and edges, with time. In this thesis, we propose such a graph model to represent traffic. As mentioned above, one of the applications of existing traffic models is in detecting traffic patterns. However, since such models consider traffic quantitatively, in terms of acquired traffic data, the patterns detected using such models are statistical (a term employed by Pattern Recognition researchers) in the sense that they are represented using numerical description. Since graph-based traffic model proposed in this thesis represents the structure of traffic, it can be employed to redefine the meaning of traffic patterns from statistical to structural (also a term from Pattern Recognition community). Structural traffic patterns include different traffic constituents and their inter-links and are represented using time-varying graphs. An algorithm to detect a given structural traffic pattern in the spatio-temporal graph representing traffic is proposed in this thesis. It formalizes this problem as subgraph isomorphism for time-varying graphs. In the end, the performance of the algorithm is tested using various graph parameters
Nguyen, Tuan Anh. "Dimensioning cellular IoT network using stochastic geometry and machine learning techniques". Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT014.
Pełny tekst źródłaNarrowband Internet of Things (NB-IoT) is a Low Power Wide Area technology, which was standardized in the Third Generation Partnership Project release, specifies a new random access procedure and a new transmission scheme for IoT. The advantages of the NB-IoT network are providing deep coverage, low power consumption, and support of a huge number of connections. Especially, NB-IoT can efficiently connect up to 50,000 devices per NB-IoT network cell.We focus our work on the study of NB-IoT network dimensioning. In this regard, we use stochastic geometry and machine learning techniques along with the thesis to characterize key performance indicators of the NB-IoT network, such as coverage probability, the number of required radio resource blocks, and the traffic pattern recognition and prediction based on the downlink control information. The thesis is divided into three major studies. Firstly, we derive the performance of uplink coverage probability in single-cell and multi-cell of NB-IoT network. The analytical expressions of the coverage and successful access probabilities in a single-cell NB-IoT network are presented by considering the packet arrival distribution. In the multi-cell scenario, a prediction of coverage probability is determined directly from the network parameters by using a Deep Neural Network. The subsequent analysis consists of an analytical model to calculate the required radio resource blocks in the multi-cell NB-IoT network and determine the network outage probability. This model is beneficial for operators because it clarifies how they should manage the available spectrum. Finally, the thesis addresses the recognition and prediction traffic type problems using the data collected from the Downlink Control Information. A wide group of machine learning algorithms are implemented and compared to identify the highest performances.The analysis conducted in this thesis demonstrates that stochastic geometry and machine learning techniques can serve as powerful tools to analyze the performance of the NB-IoT network. The frameworks developed in this work provide general analytical tools that can be readily extended to facilitate other research in 5G networks
Saumtally, Tibye. "Modèles bidimensionnels de trafic". Phd thesis, Université Paris-Est, 2012. http://tel.archives-ouvertes.fr/tel-00839526.
Pełny tekst źródłaAw, Abdallahi Bechir. "Modèles hyperboliques pour le trafic routier". Nice, 2001. http://www.theses.fr/2001NICE5625.
Pełny tekst źródłaHatchi, Roméo. "Analyse mathématique de modèles de trafic routier congestionné". Thesis, Paris 9, 2015. http://www.theses.fr/2015PA090048/document.
Pełny tekst źródłaThis thesis is devoted to the mathematical analysis of some models of congested road traffic. The essential notion is the Wardrop equilibrium. It continues Carlier and Santambrogio's works with coauthors. With Baillon they studied the case of two-dimensional cartesian networks that become very dense in the framework of $\Gamma$-convergence theory. Finding Wardrop equilibria is equivalent to solve convex minimisation problems.In Chapter 2 we look at what happens in the case of general networks, increasingly dense. New difficulties appear with respect to the original case of cartesian networks. To deal with these difficulties we introduce the concept of generalized curves. Structural assumptions on these sequences of discrete networks are necessary to obtain convergence. Sorts of Finsler distance are used and keep track of anisotropy of the network. We then have similar results to those in the cartesian case.In Chapter 3 we study the continuous model and in particular the limit problems. Then we find optimality conditions through a duale formulation that can be interpreted in terms of continuous Wardrop equilibria. However we work with generalized curves and we cannot directly apply Prokhorov's theorem, as in \cite{baillon2012discrete, carlier2008optimal}. To use it we consider a relaxed version of the limit problem with Young's measures. In Chapter 4 we focus on the long-term case, that is, we fix only the distributions of supply and demand. As shown in \cite{brasco2013congested} the problem of Wardrop equilibria can be reformulated in a problem à la Beckmann and reduced to solve an elliptic anisotropic and degenerated PDE. We use the augmented Lagrangian scheme presented in \cite{benamou2013augmented} to show a few numerical simulation examples. Finally Chapter 5 is devoted to studying Monge problems with as cost a Finsler distance. It leads to minimal flow problems. Discretization of these problems is equivalent to a saddle-point problem. We then solve it numerically again by an augmented Lagrangian algorithm
Sainct, Rémi. "Étude des instabilités dans les modèles de trafic". Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1067/document.
Pełny tekst źródłaHighway traffic is known to be unstable when the vehicle density becomes too high, and to create stop-and-go waves, with an alternance of free flow and congested traffic. First-order traffic models can't reproduce these oscillations, but higher-order models can, both microscopic (car-following models) and macroscopic (systems of conservation laws).This thesis analyses the representation of unstable traffic states and oscillations in various traffic models. At the microscopic level, because of the flux concavity, the average flow of these oscillations is lower than the equilibrium flow for the same density. An algorithm is given to stabilize the flow with multi-anticipation, using an intelligent autonomous vehicle.At the macroscopic level, this work introduces averaged models, using the fact that the spatio-temporal scale of the oscillations is too small to be correctly predicted by simulations. The averaged LWR model, which consists of two conservation laws, enables a macroscopic representation of the density variance in a heterogeneous traffic, and gives the correct average flow of these states. A comparison with the ARZ model, also of order 2, shows that the averaged model can reproduce a capacity drop in a more realistic way.Finally, this thesis presents the SimulaClaire project of real-time traffic prediction on the ring road of Toulouse, and its parallelized parameter optimization algorithm
Manh, Anne-Gaëlle. "Modèles déformables pour la reconnaissance d'adventices". Montpellier 2, 2001. http://www.theses.fr/2001MON20208.
Pełny tekst źródłaMastio, Matthieu. "Modèles de distribution pour la simulation de trafic multi-agent". Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1147/document.
Pełny tekst źródłaNowadays, analysis and prediction of transport network behavior are crucial elements for the implementation of territorial management policies. Computer simulation of road traffic is a powerful tool for testing management strategies before deploying them in an operational context. Simulation of city-wide traffic requires significant computing power exceeding the capacity of a single computer.This thesis studies the methods to perform large-scale multi-agent traffic simulations. We propose solutions allowing the distribution of such simulations on a large amount of computing cores.One of them distributes the agents directly on the available cores, while the second splits the environment on which the agents evolve. Graph partitioning methods are studied for this purpose, and we propose a partitioning procedure specially adapted to the multi-agent traffic simulation. A dynamic load balancing algorithm is also developed to optimize the performance of the microscopic simulation distribution.The proposed solutions have been tested on a real network representing the Paris-Saclay area.These solutions are generic and can be applied to most existing simulators.The results show that the distribution of the agents greatly improves the performance of the macroscopic simulation, whereas the environment distribution is more suited to microscopic simulation. Our load balancing algorithm also significantly improves the efficiency of the environment based distribution
Alvarez-Hamelin, José Ignacio. "Routage dans Internet : trafic autosimilaire, multicast et modèles de typologie". Paris 11, 2002. http://www.theses.fr/2002PA112267.
Pełny tekst źródłaThe first part of this thesis is dedicated to the study of the Internet topology, and a survey of the Internet models. We present a new model for Internet. This model will allows us to test unicast and multicast routing protocols. The second part is dedicated to multicast protocols. First, we presented a survey of construction technique for multicast trees. We propose two multicast protocols. MSDA protocol optimizes the total delay of multicast messages in a multicast tree. In order to quantify the optimization, we tested MSDA with the topologies obtained with our topology generator. MCT protocol builds the optimal multicast tree according to some predefined quality-of-service parameter. We performed simulations with ARPANET (1995) network topology in order to compare MCT with other classical multicast protocols. These simulations prove the positive impact of MCT for multicast communications. The last part is dedicated to the self-similar model of Internet traffic, and to a new quality-of-service parameter: the probabilistic congestion. This parameter allows the estimation of the rate of packet loss. Probabilistic congestion is adapted to a long-term description of the traffic, and it can be used for unicast routing protocols. We performed a simulation in order to validate our ideas (in the UUNET network and in the generated topologies from our topology model). These simulations prove the usefulness of probabilistic congestion for multicast protocols
Rolland, Chloé. "Modèles orientés objet pour une meilleure prédiction du trafic internet". Paris 6, 2008. http://www.theses.fr/2008PA066657.
Pełny tekst źródłaDousson, Christophe. "Suivi d'évolutions et reconnaissance de chroniques". Toulouse 3, 1994. http://www.theses.fr/1994TOU30264.
Pełny tekst źródłaLeroy, Bertrand. "Modèles déformables et modèles de déformation appliqués à la reconnaissance de visage". Paris 9, 1996. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=1996PA090015.
Pełny tekst źródłaTremblay, Maxime. "Speed-Q Description du Trafic Environnant". Thesis, Université Laval, 2012. http://www.theses.ulaval.ca/2012/28649/28649.pdf.
Pełny tekst źródłaThe goal of this project is to describe the traffic present in the real world of a simulator user so that the virtual environment is more adapted to him. A vehicle equipped with non-overlapping-view cameras is lent to the simulator’s future user so that he can use it in his driving environment. These collected data will be analyzed using detecting and tracking algorithms. The selected detector uses Haarlike features combined with boosted cascaded decision trees. Those detectors have a high training complexity, but produce good results for rigid objects. Tracking is carried out by the matching of SIFT feature points. The research emphasis was put on the development of the detection and tracking framework. The system performs relatively well for the detection and the tracking on medium and large objects, but shows some weakness to detect or track small objects and to track a pose changing object.
Barrat, Sabine. "Modèles graphiques probabilistes pour la reconnaissance de formes". Phd thesis, Université Nancy II, 2009. http://tel.archives-ouvertes.fr/tel-00530755.
Pełny tekst źródłaGoatin, Paola. "Analyse et approximation numérique de quelques modèles macroscopiques de trafic routier". Habilitation à diriger des recherches, Université du Sud Toulon Var, 2009. http://tel.archives-ouvertes.fr/tel-00765410.
Pełny tekst źródłaMessai, Nadhir. "Surveillance du trafic urbain et interurbain à base de modèles neuronaux". Besançon, 2003. http://www.theses.fr/2003BESA2033.
Pełny tekst źródłaThe minimization of the effects of the nonrecurring congestions is a capital challenge that the management traffic centres try to raise using traffic monitoring tools. However, the algorithms employed are generally based on some heuristics and they are incompatible with the operational constraints of exploitation. This work presents a monitoring approach based on neural networks models and gives some arguments in favour of the use of neural networks (NN) for traffic modelling and monitoring. In the context of traffic modelling, NN are used in a simple and systematic way to extract fundamental diagrams (DF) which do not require any calibration effort. In addition, we formulate initialization algorithms which avoid the convergence towards local minima which are very far away from the global minimum. NN are also employed as models that predict the traffic flow. This modelling approach, which is based on a systematic validation procedure, has the advantage to keep away from the theoretical and the experimental difficulties related to the validation of the existing models. Once the modelling phase is achieved, we were interested in the monitoring problems. In this context, we propose, in a first stage, an algorithm based on the static model (DF). The incidents detection results from a segmentation of the space debit/density in four areas and the classification of the measured data in one of these areas. In order to take the edge off the limitations of this static algorithm, we were interested in a monitoring approach, which is based on the analysis of residues resulting from the comparison of real data with those obtained from the prediction model. Furthermore, we develop an alternative procedure which mixes four recurring networks. Lastly, the problem of traffic supervision on a network is tackled. Modular and hierarchical schemas which deal with this difficulty are proposed. These schemas are based on Petri nets and they have the potential to allow a temporal and a spatial observation of incidents and congestions propagations. The modeling and monitoring proposed approaches are tested and compared on two real systems: an urban crossroads of the town of Nancy and a portion of the Californian freeway I-880
Dahmouni, Hamza. "Reconnaissance des services, caractérisation du trafic et évaluation des performances dans les réseaux mobiles multiservices". Télécom Bretagne, 2007. http://www.theses.fr/2007TELB0034.
Pełny tekst źródłaThis thesis deals with the services classification, the data traffic characterization, and the performance evaluation of multi-services mobile networks (GPRS in particular). The first axis of the thesis ended in the development of a new method of recognition and detection of traffic. This method is based on a combination of the protocol and functional aspects of applications. Thus, we associated to each application a first Markov chain whose states are the various types of packets exchanged by the applicative protocols (HTTP, WAP. . . ). Then, we employed the statistical decision theory (Neyman-Pearson test, Küllback-Leibler distance) to define our decision rules. The second axis was devoted to the identification of several statistical parameters for mobile data traffic, which is necessary to feed the tools intervening in the dimensioning processes of mobile networks. In particular, we presented the composition of GPRS traffic in terms of transport protocols and the types of application. Our analyses are made on different levels of traffic, packets, flow and session. This study enabled us to confirm the presence of self-similarity and long rang dependence in mobile traffic. The establishment of performance-closed formula for GPRS constitutes the third axis of this study. To be able to evaluate the performances of this system, we developed an analytical model which takes into account the detailed characteristics of the GPRS system and the sporadic aspect of data traffic (ON/OFF model). This model is used to evaluate the performances of the system in terms of throughput, blocking probability and radio resource utilization
Avila, Manuel. "Optimisation de modèles markoviens pour la reconnaissance de l'écrit". Rouen, 1996. http://www.theses.fr/1996ROUES034.
Pełny tekst źródłaCandille, Laurence. "Modèles de production et reconnaissance automatique de la parole". Avignon, 1996. http://www.theses.fr/1996AVIG0115.
Pełny tekst źródłaAllain, Guillaume. "Prévision et analyse du trafic routier par des méthodes statistiques". Toulouse 3, 2008. http://thesesups.ups-tlse.fr/351/.
Pełny tekst źródłaThe industrial partner of this work is Mediamobile/V-trafic, a company which processes and broadcasts live road-traffic information. The goal of our work is to enhance traffic information with forecasting and spatial extending. Our approach is sometimes inspired by physical modelling of traffic dynamic, but it mainly uses statistical methods in order to propose self-organising and modular models suitable for industrial constraints. In the first part of this work, we describe a method to forecast trafic speed within a time frame of a few minutes up to several hours. Our method is based on the assumption that traffic on the a road network can be summarized by a few typical profiles. Those profiles are linked to the users' periodical behaviors. We therefore make the assumption that observed speed curves on each point of the network are stemming from a probabilistic mixture model. The following parts of our work will present how we can refine the general method. Medium term forecasting uses variables built from the calendar. The mixture model still stands. Additionnaly we use a fonctionnal regression model to forecast speed curves. We then introduces a local regression model in order to stimulate short-term trafic dynamics. The kernel function is built from real speed observations and we integrate some knowledge about traffic dynamics. The last part of our work focuses on the analysis of speed data from in traffic vehicles. These observations are gathered sporadically in time and on the road segment. The resulting data is completed and smoothed by local polynomial regression
Champagne, Nicolas. "Dynamique de trafic dans les réseaux microfluidiques modèles : Embouteillages, chocs et avalanches". Phd thesis, Université Paris-Diderot - Paris VII, 2011. http://pastel.archives-ouvertes.fr/pastel-00631338.
Pełny tekst źródłaGrémillet, Olivier. "Analyse des modèles de trafic agrégé pour les télécommunications multiservices par satellite". Toulouse, ISAE, 2007. http://www.theses.fr/2007ESAE0023.
Pełny tekst źródłaChampagne, Nicolas. "Dynamique de trafic dans des réseaux microfluidiques modèles : embouteillages, chocs et avalanches". Paris 7, 2011. http://www.theses.fr/2011PA077204.
Pełny tekst źródłaThis thesis is devoted to the transport of particles in confined geometries. An original approach is developed, based on new home-made microfluidic tools. First, we study the traffic of particles in microfluidic obstacles networks. Due to hydrodynamics interactions between particles, we show that the traffic dynamics is a nonlinear process: the particle current does not scale with the particle density, We also establish that there exists a maximal current above which no stationary particle flow can be sustained. Then, we study the dynamic response of 1D droplet streams to finite-amplitude longitudinal perturbations. We experimentally and theoretically show that the nonlinear constitutive equation relating particle current to particle density leads to Burgers equation for the droplet stream density, Afterwards, we focus on the flow resulting from high current values in a 2D obstacles network, We observe an intermittent dynamics with avalanche phenomena. To rationalize this, we develop a numerical code close to a cellular automaton. This numerical model turns out to be effective to represent the flow of confined particles in a network of pipes. To conclude, we present the start of an experimental work, It consists in flowing a 2D crystal of solid particles. In such a configuration, hydrodynamic interactions seem to destabilize the lattice of any 2D crystals
Lebbah, Mustapha. "Carte topologique pour données qualitatives : application à la reconnaissance automatique de la densité du trafic routier". Phd thesis, Université de Versailles-Saint Quentin en Yvelines, 2003. http://tel.archives-ouvertes.fr/tel-00161698.
Pełny tekst źródłaCe travail de thèse a été réalisé à la direction de la recherche de RENAULT. Le travail s'est focalisé sur le développement d'un modèle de reconnaissance de trafic.
Le premier modèle proposé dans cette thèse est dédié aux données binaires ''BTM''. C'est un modèle de quantification vectorielle de type carte topologique. Ce modèle prend les caractéristiques principales des cartes topologiques. Pour ce nouveau modèle, afin de prendre en compte les spécificités des données binaires, on a choisi de changer la métrique usuelle utilisée dans les modèles de cartes topologiques et d'utiliser la distance Hamming.
Le second modèle est le premier modèle probabiliste de cartes topologiques dédié aux données binaires. Ce modèle s'inspire de travaux antérieurs qui modélisent une distribution par un mélange de mélange de lois de Bernoulli.
Le troisième modèle est un nouveau modèle de carte topologique appelé CTM (Categorical topological Map) adapté à la classification non supervisée des données qualitatives multi-dimensionnelles. Ce nouveau modèle conserve cependant les principales caractéristiques des deux modèles précédents. Afin de maximiser les vraisemblance des données, CTM utilise de manière classique l'algorithme EM.
Dans ce mémoire, on introduit le domaine d'application propre au travail mené chez RENAULT. Nous détaillerons l'apport original de notre travail: utilisation de l'information catégorielle pour traiter de la reconnaissance du trafic. Nous exposerons les différentes analyses effectuées sur l'application des algorithmes proposés.
Henn, Vincent. "Information routière et affectation du trafic : vers une modélisation floue". Saint-Etienne, 2001. http://www.theses.fr/2001STET4006.
Pełny tekst źródłaWe are interested in traffic assignment modeling (that is describing the way trafic spreads over a road network) especially when traffic information is given to drivers, for example using variable message signs. Network is described with some choice-nodes where trafic streams can split between different options, regarding the predicted cost of each option. This predicted cost is modeled with a fuzzy number, representing both vagueness and uncertainty due to the dynamic aspect of the problem. . . [etc. ]
Sossa, Humberto. "Reconnaissance d'objets polyédriques par indexation dans une base de modèles". Phd thesis, Grenoble INPG, 1992. http://tel.archives-ouvertes.fr/tel-00341784.
Pełny tekst źródłaGaidon, Adrien. "Modèles structurés pour la reconnaissance d'actions dans des vidéos réalistes". Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00780679.
Pełny tekst źródłaSwaileh, Wassim. "Des modèles de langage pour la reconnaissance de l'écriture manuscrite". Thesis, Normandie, 2017. http://www.theses.fr/2017NORMR024/document.
Pełny tekst źródłaThis thesis is about the design of a complete processing chain dedicated to unconstrained handwriting recognition. Three main difficulties are adressed: pre-processing, optical modeling and language modeling. The pre-processing stage is related to extracting properly the text lines to be recognized from the document image. An iterative text line segmentation method using oriented steerable filters was developed for this purpose. The difficulty in the optical modeling stage lies in style diversity of the handwriting scripts. Statistical optical models are traditionally used to tackle this problem such as Hidden Markov models (HMM-GMM) and more recently recurrent neural networks (BLSTM-CTC). Using BLSTM we achieve state of the art performance on the RIMES (for French) and IAM (for English) datasets. The language modeling stage implies the integration of a lexicon and a statistical language model to the recognition processing chain in order to constrain the recognition hypotheses to the most probable sequence of words (sentence) from the language point of view. The difficulty at this stage is related to the finding the optimal vocabulary with minimum Out-Of-Vocabulary words rate (OOV). Enhanced language modeling approaches has been introduced by using sub-lexical units made of syllables or multigrams. The sub-lexical units cover an important portion of the OOV words. Then the language coverage depends on the domain of the language model training corpus, thus the need to train the language model with in domain data. The recognition system performance with the sub-lexical units outperformes the traditional recognition systems that use words or characters language models, in case of high OOV rates. Otherwise equivalent performances are obtained with a compact sub-lexical language model. Thanks to the compact lexicon size of the sub-lexical units, a unified multilingual recognition system has been designed. The unified system performance have been evaluated on the RIMES and IAM datasets. The unified multilingual system shows enhanced recognition performance over the specialized systems, especially when a unified optical model is used
Mathieu, Bruno. "Modèles de production de parole et reconnaissance à partir d'automates". Nancy 1, 1999. http://www.theses.fr/1999NAN10300.
Pełny tekst źródłaThe framework of this thesis is speaker-independent automatic speech recognition. This document begins with a short survey of speech signal processing applied to speech recognition. Then, we describe several common architectures: dynamic time warping of acoustic shapes, artificial intelligence, neural networks and hidden Markov models. This document is made of two main parts. The first part is devoted to the recognition of words. We are using finite state automata for modeling the eleven American spoken digits. As the speech database TiDigits has been used by other teams we can compare our results against thoose obtained with other approaches. The first step is concerned with isolated word recognition. Then, we describe how sentences of the database have been segmented. Last sections of this part describe continuous speech recognition of word sequences, as well as a discussion about strong and weak points of our approach. The second part treats of the use of production models for speech recognition. We begin with a description of the acoustic equations which drive the air flow inside the vocal tract and we present several articulatory models. Then, we justify the choice of Maeda's model. We describe the adaptation of this model to a male speaker. Next, we describe the variational method used for recovering articulatory trajectories from the speech. Finally, the software we built, is described. In the conclusion, we give the results obtained and we exhibit sorne perspectives for future work towards a better speaker indepedent continuous speech recognition system
Sulface, Allain. "Simulation du trafic routier et communication inter-véhicules". Thesis, Université Laval, 2011. http://www.theses.ulaval.ca/2011/28507/28507.pdf.
Pełny tekst źródłaDelle, Monache Maria Laura. "Lois de conservation pour la modélisation du trafic routier". Thesis, Nice, 2014. http://www.theses.fr/2014NICE4056/document.
Pełny tekst źródłaIn this thesis we consider two coupled PDE-ODE models. One to model moving bottlenecks and theother one to describe traffic flow at junctions. First, we consider a strongly coupled PDE-ODE systemthat describes the influence of a slow and large vehicle on road traffic. The model consists of a scalarconservation law accounting for the main traffic evolution, while the trajectory of the slower vehicle isgiven by an ODE depending on the downstream traffic density. The moving constraint is expressed byan inequality on the flux, which models the bottleneck created in the road by the presence of the slowerDépôt de thèse – Donnéescomplémentairesvehicle. We prove the existence of solutions to the Cauchy problem for initial data of bounded variation.Moreover, two numerical schemes are proposed. The first one is a finite volume algorithm that uses alocally nonuniform moving mesh. The second one uses a reconstruction technique to display thebehavior of the vehicle. Next, we consider the Lighthill-Whitham-Richards traffic flow model on ajunction composed by one mainline, an onramp and an offramp, which are connected by a node. Theonramp dynamics is modeled using an ordinary differential equation describing the evolution of thequeue length. The definition of the solution of the Riemann problem at the junction is based on anoptimization problem and the use of a right of way parameter. The numerical approximation is carriedout using a Godunov scheme, modified to take into account the effects of the onramp buffer. Aftersuitable modification, the model is used to solve an optimal control problem on roundabouts. Two costfunctionals are numerically optimized with respect to the right of way parameter
Mahaman, Moutari Mahaman Salissou. "Modélisation mathématique et numérique du trafic automobile". Nice, 2007. http://www.theses.fr/2007NICE4088.
Pełny tekst źródłaIn order to simulate in a relevant way vehicular traffic on large road networks, an essential ingredient is using theoretical tools which allow for an adequate modelling of each component of the network. To achieve this goal, several modelling methods exist to date. However, due to some additional constraints, in particular those related to the development of the road networks infrastructures and the increasing concentration of traffic, the investigation of new modelling tools is necessary. In this work, we have introduced some methods and models, which enable a relevant description of the traffic on road networks, by taking into account its specificity through some particular components of the network such as intersections, highway on and off ramps, toll stations, etc…. The presented approaches are expected to be theoretically rigorous, numerically reliable, and computationally efficient. The first approach we have proposed concerns macroscopic models. It is based on the resolution of the Riemann problem whereas the flux at the junction is optimized. Thereafter we have extended this approach to macroscopic multiclass models. The second approach studied in this work is the hybrid modelling. First, we have proposed a hybrid model based on the classical Eulerian-Lagrangian coupling of the Aw & Rascle second order macroscopic model and a class of microscopic models. In a such hybrid model, the interfaces between the coupled models are fixed in eulerian coordinates. Thereby, the interfaces’ functioning is somehow complex and tedious to work out. In order to circumvent this problem, we have proposed a fully lagrangian coupling approach. The novelty of this new hybrid approach is that the interfaces are moving in lagrangian coordinates. This particular property makes the model much simpler than in the previous case and leads to a rigorous and easy computational model. Finally we have proposed a model describing the formation and evolution of traffic jams. This model is derived from the Aw & Rascle second order macroscopic model and based on a realistic formulation of clusters dynamics. We have analysed the solutions to the associated Riemann problem and we have proved the existence of solutions for this model
Bourrel, Emmanuel. "Modélisation dynamique de l'écoulement du trafic routier : du macroscopique au microscopique". Lyon, INSA, 2003. http://theses.insa-lyon.fr/publication/2003ISAL0073/these.pdf.
Pełny tekst źródłaTo satisfy road managers needs (in particular in terms of decision-making and evaluation of their actions of exploitation), many dynamic traffic flow models have been developed in order to represent propagation of vehicles on a road section. Those models describe traffic flow in a more or less aggregated way and are generally classified into two main groups: microscopic models, which are interested in the dynamics of individualized vehicles, and macroscopic models, more aggregated models which describe traffic as a fluid. One of the difficulties encountered in the study of those models is the great disparity of scales to be considered. The aim of this thesis is to look further into these scales problems (in particular by studying the link that exists between microscopic and macroscopic models) through the development of a hybrid model of traffic flow (a hybrid model is defined as the coupling between a microscopic model and a macroscopic model). The interest of a hybrid model is that it makes it possible to adapt the traffic flow model to the needs to model the various elements of a network. It is thus possible to describe some specific elements where the local phenomena of traffic flow can have global consequences with the microscopic model(toll station, on-ramp, roundabout. . . ) while preserving a global vision of the flow on the rest of the network with the macroscopic model. Although there are some models of this type in the literature, there is no global view of the problems related to hybridization. So it is very difficult to judge the relevance of existing models. This is why we propose in this thesis a general theoretical framework defining these models, in particular by determining the fundamental properties that a hybrid models must have to be valid. We then propose a new hybrid model based on a first order macroscopic model (the Lighthill-Whitham- Richards model). The characteristic of that model is that it makes it possible to take into account the diversity of vehicles behaviour in the microscopic part by introducing distributions on some parameters. The results provided by this model are then studied for three examples of application (one-way toll station, crossing between a major and a minor road, combination of two intersections) in which we show the interest of the coupling between microscopic and macroscopic models
Poublan, Hélène. "Reconnaissance automatique de signaux à évolution continue". Toulouse, INPT, 1991. http://www.theses.fr/1991INPT097H.
Pełny tekst źródłaMagne, Laurent. "Commande optimale décentralisée du trafic urbain". Toulouse, ENSAE, 2001. http://www.theses.fr/2001ESAE0001.
Pełny tekst źródłaHilali, Cherifa Haya. "Modèles de prévision du trafic aérien "passagers" : exemples d'application : la France et le Maroc". Paris 2, 1991. http://www.theses.fr/1991PA020011.
Pełny tekst źródłaIn an attempt to rationalize their operations in order to improve their investments, airline companies increasingly use econometric methods and or models. These tools have been developed especially for passenger traffic which remains, despite grouth in freight traffic, the main part of their operations. The essential role palyed by forecasting in modern management has led us to be particularty interested in this tool for aviation decision matiers. This research has led to comprehend the hinge between econometric technics and the complexity of "the aviation world". Because of this fact we have explored these two fields endeavoring to go beyond their complexities. A descriptive analysis of the principle methodological problems encountered throughout a traffic forecast has allowed us to point out the different orientations that should be taken into account with priority. Our goal was to provide an alternative to the method already in use in morocco in order to propose a detailed econometric model which would be used within the framework of the real life of this country. From our research, we managed to come up with basis results which can be used for domestic moroccan air traffic forecasts, notably for better control of investments of the orientation of the commercial policies of this type of transportation. Regressions concerning france as well as morocco, permitted the. .
Delaye, Adrien. "Méta-modèles de positionnement spatial pour la reconnaissance de tracés manuscrits". Phd thesis, INSA de Rennes, 2011. http://tel.archives-ouvertes.fr/tel-00651446.
Pełny tekst źródłaOneata, Dan. "Modèles robustes et efficaces pour la reconnaissance d'action et leur localisation". Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAM019/document.
Pełny tekst źródłaVideo interpretation and understanding is one of the long-term research goals in computer vision. Realistic videos such as movies present a variety of challenging machine learning problems, such as action classification/action retrieval, human tracking, human/object interaction classification, etc. Recently robust visual descriptors for video classification have been developed, and have shown that it is possible to learn visual classifiers in realistic difficult settings. However, in order to deploy visual recognition systems on large-scale in practice it becomes important to address the scalability of the techniques. The main goal is this thesis is to develop scalable methods for video content analysis (eg for ranking, or classification)
Delaye, Adrien. "Méta-modèles de positionnement spatial pour la reconnaissance de tracé manuscrits". Rennes, INSA, 2011. https://tel.archives-ouvertes.fr/tel-00651446.
Pełny tekst źródłaSpatial meta-models are introduced for a generic description of spatial relations between handwritten objetcs. The models are trainable from data and offer an increased precision thanks to the consideration of objetcs shapes. The fuzzy definition allows to deal with imprecision and provides an intuitive modeling. Meta-models have a predictive ability which enables the description of the modeled relation in the image space, relatively to a reference object. It allows the model visualization and provide a tool for context-driven object segmentation. We proporse a resentation of structured handwritten symbols based only on the description of their spatial information with meta-models. Segmentation of objetcs into primitives is driven by the models prediction ability. Results confirme the importance of spatial information and validate the quality of the proposed models
Chanut, Stéphane. "Modélisation dynamique macroscopique de l'écoulement d'un trafic routier hétérogène poids lourds et véhicules légers". Lyon, INSA, 2005. http://theses.insa-lyon.fr/publication/2005ISAL0040/these.pdf.
Pełny tekst źródłaThe traffic composition is one of the phenomenon that road managers have to address. In particular a question arises: the impact on the flow of trucks. This thesis proposes a traffic flow model making it possible to describe the behavior of a heterogeneous traffic. This proposed model is a macroscopic one, with two classes. The traffic is described like a continuous flow and is assumed to be composed of two homogeneous classes: trucks and passenger cars, which are different from their speeds and their lengths. The model is completely solved and a numerical resolution is built with a Godunov scheme. A particular attention is paid to the passing phenomenon and its effects on the flow by a specific modelling. The applications of the model are numerous, in particular for what concerns the test of regulation strategies for a heterogeneous traffic
Soule, Augustin. "Méthodes et modèles de détection d'anomalies dans les réseaux d'opérateurs". Paris 6, 2006. http://www.theses.fr/2006PA066088.
Pełny tekst źródłaCloarec, Gwenael. "Utilisation de paramètres auxiliaires en reconnaissance de la parole". Avignon, 2007. http://www.theses.fr/2007AVIG1055.
Pełny tekst źródłaThis thesis deals with the introduction into the speech recognition process of auxiliary information relating to different variability sources of the speech signal. Those variability sources have several origins and are usually not taken into account by speech recognition systems. They represent the main cause of degradation of the speech recognition system performance when there exists a mismatch between training and test conditions. In this thesis two ways of taking into account this kind of information are studied. First two auxiliary parameters that carry information about the glottal wave, pitch and voicing, are directly introduced into the acoustic vector. Experimental results show that those parameters improve recognition performance for isolated words recognition whereas they have no effect on continuous speech recognition. Detailed analysis show that they are useful for recognizing noisy data, that is to say kind of data frequently handled by speech recognition systems in fied conditions, and that their influence on speech recognition performance is greatly related to their correlation with the standard acoustic features. A second way of taking into account auxiliary information is also presented. It consists in using acoustic models that are dependent on auxiliary parameters. This dependency is modelled by the weights of the Gaussian functions that constitute the probability densities of the acoustic observation. This method is first applied with the pitch and the energy of the speech signal that are used separately. Then we show that it is also possible to combine several variability sources by combining pitch and energy with the speaker gender and the signal to noise ratio. Finally we show that this method can be used for other variability sources as the speaker accent or speaker classes modelling. In order to handle foreign accented speech, models adapted on speech data from foreign languages are combined at the acoustic level. The densities are made dependant on the speaker's accent by using weight coefficients that give more or less importance to each set of Gaussian functions corresponding to a given language. A similar method is applied to deal with a modelling based on classes of speakers by combining acoustic models of differents speaker classes
Tolba, Chérif. "Contribution à l'utilisation des réseaux de Petri pour la modélisation et la régulation du trafic urbain et interurbain". Besançon, 2004. http://www.theses.fr/2004BESA2034.
Pełny tekst źródłaThe traffic control constitutes a major challenge for the transportation community. Although the significant progress in this area we observe that the traffic problems related to the congestion remain important. Most of the traffic control tools implemented until now are based on the estimate and the short-term forecast of traffic flow. The work of this thesis contributes to use the Petri nets for the urban traffic control and to the integration of two complementary models of interurban traffic: macroscopic and microscopic. Using a grid of a roadway network we established, initially, a macroscopic traffic model based on the potential of the continuous Petri nets with variable speeds (VCPN) in which the global characteristics of traffic flow (flow rate, density, velocity) are re-interpreted by the VCPN parameters. Using an adaptive spatial discretization of the initial VCPN model we have coexisted in the same representation a macroscopic model and a microscopic one. Aiming to apprehending the individual behaviour of the vehicles, we represented the traffic evolution by discrete timed Petri net (TPN). In this novel representation, the magnitudes characteristics of the vehicles movement (position, speed, acceleration) are re-interpreted by the TPN microscopic model. For the purpose of leading to the traffic control methods suitable with the fluctuations of traffic flow in the signal-controlled junctions, we choose the hybrid Petri nets (HPN) in which the traffic lights are modelled by a TPN and the queues evolution by a VCPN. Taking into account the nonlinearity of VCPN model, we took the multi-models approach as a linearization methodology. In the multi-models approach, the traffic flow evolution is described by a set of linear models sequentially activated and validated in their respective domains. The detection of validity domain limits (thresholds) of these linear models permits to evaluate the state of the traffic. The use of this knowledge is used in order to control the traffic lights. So, three control algorithms are developed. The resulting control algorithms are tested and compared with two other ones (fixed cycle time and interval vehicle algorithms)
Can, Arnaud. "Représentation du trafic et caractérisation dynamique du bruit en milieu urbain". Lyon, INSA, 2008. http://theses.insa-lyon.fr/publication/2008ISAL0119/these.pdf.
Pełny tekst źródłaRoad traffic noise prediction models usually consider traffic as a steady noise source. They fail in capturing urban traffic noise dynamics. Static models can be refined by considering mean vehicle trajectories. However, dynamic models improve noise assessment. Dynamic models couple a dynamic traffic model and bath noise emission laws and a sound propagation calculation. Dynamic models improve LAeq estimation and allow for LAeq, evolution estimation. Moreover, classical descriptors (LAeq, statistical descriptors) limits to assess traffic noise dynamics are shawn. Such descriptors fail to characterize noise variations at the traffic signal scale. Specifie descriptors are proposed, based on the analysis of the mean noise patter that repeats every traffic cycle and variations a round this pattern. Dynamics traffic models are compared for classical and specifie descriptors estimation. Models thal represent individually vehicle trajectories allows a precise estimation of LAeq, distributions and mean noise patterns. Lndividualization of behaviors from one vehicle to the others does not improve characterization, and makes calibration more complicated. Finally, the study shows that dynamic noise estimation is still precise even if data are aggregated on large periods. Congested, free and weak flow rates periods should nevertheless be considered for precise noise dynamics characterization
Sebban, Marc. "Modèles théoriques en reconnaissance de formes et architecture hydride pour machine perceptive". Lyon 1, 1996. http://www.theses.fr/1996LYO10307.
Pełny tekst źródłaAnigbogu, Julian Chukwuka. "Reconnaissance de textes imprimés multifontes à l'aide de modèles stochastiques et métriques". Nancy 1, 1992. http://www.theses.fr/1992NAN10150.
Pełny tekst źródłaAit-Mohand, Kamel. "Techniques d'adaptation de modèles markoviens. Application à la reconnaissance de documents anciens". Rouen, 2011. http://www.theses.fr/2011ROUES008.
Pełny tekst źródłaThis work focuses on the recognition of characters in printed documents. The goal is to create a sufficiently robust OCR system that can deal with ancient documents whose peculiarity makes them difficult to process. We created a polyfont recognition system based on Hidden Markov Models (HMM) and we have integrated it into a complete processing chain using open source OCR tools. To improve the performance of this system on new data, we created new adaptation algorithms that jointly modify the structure and emission probabilities of HMMs. We evaluated the polyfont recognition system and the adaptation algorithms on synthetic and real images datasets. The results show that the polyfont recognition system is competitive compared to commercial OCR systems and that our structure-adaptation algorithms are more efficient than other state of the art adaptation algorithms
Oger, Stanislas. "Modèles de langage ad hoc pour la reconnaissance automatique de la parole". Phd thesis, Université d'Avignon, 2011. http://tel.archives-ouvertes.fr/tel-00954220.
Pełny tekst źródłaMaza, Elie. "Prévision de trafic routier par des méthodes statistiques : espérance structurelle d’une fonction aléatoire". Toulouse 3, 2004. http://www.theses.fr/2004TOU30238.
Pełny tekst źródłaIn the first part of this thesis, we describe a travel time forecasting method on the Parisian motorway network. This method is based on a mixture model. Parameters are estimated by an automatic classification method and a training concept. The second part is devoted to the study of a semi-parametric curve translation model. Estimates are carried out by an M-estimation method. We show the consistency and the asymptotic normality of the estimators. In the third part, we widen the function warping model by considering that the warping functions result from a random process. That enables us to define, in an intrinsic way, a concept of structural expectation and thus to get round the non identifiability of the model. We propose an empirical estimator of this structural expectation and we show consistency and asymptotic normality
Megherbi, Brahim. "Scénarios types d'accidents de la circulation sur autoroutes : Elaboration, méthodes de reconnaissance et applications pour le diagnostic et la prévention". Marne-la-vallée, ENPC, 1999. http://www.theses.fr/1999ENPC9913.
Pełny tekst źródła