Search results for " Match"
showing 10 items of 345 documents
Keypoint descriptor matching with context-based orientation estimation
2014
Abstract This paper presents a matching strategy to improve the discriminative power of histogram-based keypoint descriptors by constraining the range of allowable dominant orientations according to the context of the scene under observation. This can be done when the descriptor uses a circular grid and quantized orientation steps, by computing or providing a global reference orientation based on the feature matches. The proposed matching strategy is compared with the standard approaches used with the SIFT and GLOH descriptors and the recent rotation invariant MROGH and LIOP descriptors. A new evaluation protocol based on an approximated overlap error is presented to provide an effective an…
What is the optimal environment for the long-term physical development of the young elite rugby player? : Study of the physical characteristics and c…
2023
To ensure long-term sporting success, a governing body such as French Rugby Union (FFR) must implement a physical development plan from youth to senior player. In this way, federal academies have been created for players from 15 years old (category under 16 (U16)), to 17 years old and then the development continues in clubs. Throughout their youth career, players might experience U18 or U20 teams, selection which are the two only national youth French team. The aim of this thesis was to describe the physical development of young French rugby players from their entry into national pathway (U16) to U20. To achieve this, we first described the anthropometric and physical characteristics of pla…
Strong chromatic index of products of graphs
2007
Graphs and Algorithms
From Nerode's congruence to Suffix Automata with mismatches
2009
AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…
Motif patterns in 2D
2008
AbstractMotif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of …
Real-Time Assembly Support System with Hidden Markov Model and Hybrid Extensions
2022
This paper presents a context-aware adaptive assembly assistance system meant to support factory workers by embedding predictive capabilities. The research is focused on the predictor which suggests the next assembly step. Hidden Markov models are analyzed for this purpose. Several prediction methods have been previously evaluated and the prediction by partial matching, which was the most efficient, is considered in this work as a component of a hybrid model together with an optimally configured hidden Markov model. The experimental results show that the hidden Markov model is a viable choice to predict the next assembly step, whereas the hybrid predictor is even better, outperforming in so…
New Error Measures to Evaluate Features on Three-Dimensional Scenes
2011
In this paper new error measures to evaluate image features in three-dimensional scenes are proposed and reviewed. The proposed error measures are designed to take into account feature shapes, and ground truth data can be easily estimated. As other approaches, they are not error-free and a quantitative evaluation is given according to the number of wrong matches and mismatches in order to assess their validity
Improving point matching on multimodal images using distance and orientation automatic filtering
2016
International audience; Speed Up Robust Features SURF is one of the most popular and efficient methods used for image registration task. In order to achieve a correct registration, a good matching of feature point is required. However in the case of multimodal images, the high and non-linear intensity changes between different modalities led to many outliers (mismatching of detected points) and consequently a fail in the registration. Therefore, in this paper we introduce an efficient method devoted to the detection and removal of such outlier. It's based on an automatic filtering of outliers on both distance and orientation between features points. We tested our proposed method on a set of…
Mixed Reality Annotation of Robotic-Assisted Surgery videos with real- time tracking and stereo matching
2023
Robotic-Assisted Surgery (RAS) is beginning to unlock its potential. However, despite the latest advances in RAS, the steep learning curve of RAS devices remains a problem. A common teaching resource in surgery is the use of videos of previous procedures, which in RAS are almost always stereoscopic. It is important to be able to add virtual annotations onto these videos so that certain elements of the surgical process are tracked and highlighted during the teaching session. Including virtual annotations in stereoscopic videos turns them into Mixed Reality (MR) experiences, in which tissues, tools and procedures are better observed. However, an MR-based annotation of objects requires trackin…
Robust Fault Detection of Linear Uncertain Time-Delay Systems Using Unknown Input Observers
2013
This paper deals with the problem of fault detection for linear uncertain time-delay systems. The proposed method for Luenberger observers is developed for unknown input observers (UIOs), and a novel procedure for the design of residual based on UIOs is presented. The design procedure is carried out based on the ${H}_{\infty }$ model matching approach which minimizes the difference between generated residuals by the optimal observer and those by the designed observer in the presence of uncertainties. The optimal observer is designed for the ideal system and works so that the fault effect is maximized while the exogenous disturbances and noise effects are minimized. This observer can give di…