Search results for " Match"
showing 10 items of 345 documents
Optimisation et implémentation de méthodes bio-inspirées d'extraction de caractéristiques pour la reconnaissance d'objets visuels
2016
Industry has growing needs for so-called “intelligent systems”, capable of not only ac-quire data, but also to analyse it and to make decisions accordingly. Such systems areparticularly useful for video-surveillance, in which case alarms must be raised in case ofan intrusion. For cost saving and power consumption reasons, it is better to perform thatprocess as close to the sensor as possible. To address that issue, a promising approach isto use bio-inspired frameworks, which consist in applying computational biology modelsto industrial applications. The work carried out during that thesis consisted in select-ing bio-inspired feature extraction frameworks, and to optimize them with the aim t…
Mise en correspondance de lignes à partir de deux vues, estimation du mouvement et reconstruction pour les systèmes centraux
2011
The primary goal of this thesis is to develop generic motion and structure algorithms for images taken from constructed scenes by various types of central imaging systems including perspective, fish-eye and catadioptric systems. As-suming that the mapping between the image pixels and their 3D rays in space is known, instead of image planes, we work on image spheres (projection of the images on a unit sphere) which enable us to present points over the entire viewsphere suitable for presenting omnidirectional images. In the first part of this thesis, we develop a generic and simple line matching approach for images taken from constructed scenes under a short baseline motion as well as a fast …
Interface engineering for improved light transmittance through photonic crystal flat lenses
2010
In this paper, we present photonic crystal flat lenses with interfaces engineered to improve the light transmittance thanks to a broad angles impedance matching. The interface engineering consists in the realization of antireflection gratings on the edges of the lenses which are designed to reduce the propagative waves reflectivity over a wide range of incident angles. The fabricated structures were measured in optical near-field and a four times enhancement of the light transmission efficiency is reported.
Le score de propension : un guide méthodologique pour les recherches expérimentales et quasi expérimentales en éducation
2016
La méthode du score de propension devient de plus en plus populaire pour estimer les effets causaux d’un programme d’intervention. Si les applications empiriques de cette méthode sont encore rares dans les recherches en éducation, des exemples de son utilisation se trouvent aisément dans d’autres disciplines. Cependant, sa mise en place soulève plusieurs questions. L’objectif de cet article est de fournir des éléments de réponses guidant le chercheur et l’évaluateur du domaine de l’éducation pour l’estimation et l’utilisation du score de propension. Les différentes étapes de son application sont présentées pas à pas : évaluation du biais de sélection, construction du score de propension et …
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
A trie-based approach for compacting automata
2004
International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.
Normal, Abby Normal, Prefix Normal
2014
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number \(\textit{pnw}(n)\) of prefix normal words of length n, showing that \(\textit{pnw}(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)\) for some c and \(\textit{pnw}(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)\). We introduce efficient algorithms for testing the prefix normal property and a “mechanical algorithm” for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes t…
The Effect of Public Subsidies for Formal Care on the Care Provision for Disabled Elderly People in France
2012
Ce papier vise à évaluer l’effet de l’allocation personnalisée d’autonomie (APA) sur l’aide reçue par les personnes âgées dépendantes vivant à domicile. À partir des données de l’enquête Handicap-Santé Ménage, nous proposons une analyse statistique basée sur une méthode d’appariement par score de propension. Nos résultats suggèrent que l’aide professionnelle financée par l’intermédiaire de l’APA se substitue partiellement, selon le niveau de dépendance et les ressources en aide informelle, à de l’aide professionnelle financée de manière privée et à de l’aide informelle, mais que globalement, bénéficier de l’APA améliore la prise en charge des personnes âgées dépendantes. The aim of this pap…
Using recursive Bayesian estimation for matching GPS measurements to imperfect road network data
2010
Map-matching refers to the process of projecting positioning measurements to a location on a digital road network map. It is an important element of intelligent transportation systems (ITS) focusing on driver assistance applications, on emergency and incident management, arterial and freeway management, and other applications. This paper addresses the problem of map-matching in the applications characterized by imperfect map quality and restricted computational resources - e.g. in the context of community-based ITS applications. Whereas a number of map-matching methods are available, often these methods rely on topological analysis, thereby making them sensitive to the map inaccuracies. In …
Multi-dimensional pattern matching with dimensional wildcards
1995
We introduce a new multi-dimensional pattern matching problem, which is a natural generalization of the on-line search in string matching. We are given a text matrix A[1: n1, ..., 1:n d ] of size N= n1×n2×...×n d , which we may preprocess. Then, we are given, online, an r-dimensional pattern matrix B[1:m1,...,1:m r ] of size M= m1×m2×...×m r , with 1≤r≤d. We would like to know whether B*=B*[*, 1:m1,*, ...,1: mr, *] occurs in A, where * is a dimensional wildcard such that B* is any d-dimensional matrix having size 1 × ... × m1×...1×m r ×...1 and containing the same elements as B. Notice that there might be (d/r)≤2d occurrences of B* for each position of A. We give CRCW-PRAM algorithms for pr…