Search results for " Match"

Automatic Extraction of Blood Vessels, Bifurcations and End Points in the Retinal Vascular Tree

2008

In this paper we present an effective algorithm for automated extraction of the vascular tree in retinal images, including bifurcations, crossovers and end-points detection. Correct identification of these features in the ocular fundus helps the diagnosis of important systematic diseases, such as diabetes and hypertension. The pre-processing consists in artefacts removal based on anisotropic diffusion filter. Then a matched filter is applied to enhance blood vessels. The filter uses a full adaptive kernel because each vessel has a proper orientation and thickness. The kernel of the filter needs to be rotated for all possible directions. As a consequence, a suitable kernel has been designed …

Probabilistic techniques for bridging the semantic gap in schema alignment

Connecting pieces of informations from heterogeneous sources sharing the same domain is an open challenge in Semantic Web, Big Data and business communities. The main problem in this research area is to bridge the expressiveness gap between relational databases and ontologies. In general, an ontology is more expressive and captures more semantic information behind data than a relational database does. On the other side, databases are the most common used persistent storage system and they grant benefits such as security and data integrity but they need to be managed by expert users. The problem is quite significant above all when enterprise or corporate ontologies are used to share infomation…

Reverse-Safe Text Indexing

2021

We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed). A data structure D is called z - reverse-safe when there exist at least z datasets with the same set of answers as the ones stored by D . The main challenge is to ensure that D stores as many answers to useful queries as possible, is constructed efficiently, and has size close to the size of the original dataset it encodes. Given a text of length n and an integer z , we propose an algorithm that constructs a z -reverse-safe data structure ( z -RSDS) that has size O(n) and answers decision and counting pattern matc…

Using dense stereo matching techniques in survey

2013

In recent years there has been an enormous increase in the dissemination of modelling techniques known as dense stereo matching (DSM) or image-based modelling (IBM) using free, low cost, open source software, especially applications involving the survey of cultural heritage (architecture, archaeology, and town planning). The algorithms used by these software programmes process photographic datasets and provide a 3D model of the scene in question. During complex survey and 3D restitution procedures, these techniques save time (processing) and money: these advantages Can he useful to any professional. This is why it is important to identify the real potential and limits of these software prog…

On a Conjecture on Bidimensional Words

2003

We prove that, given a double sequence w over the alphabet A (i.e. a mapping from Z2 to A), if there exists a pair (n0, m0) ∈ Z2 such that pw(n0, m0) < 1/100n0m0, then w has a periodicity vector, where pw is the complexity function in rectangles of w.

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching

2010

Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the text s requires to find a substring t of s with p(t) = q. The corresponding decision problem is to verify whether at least one such match exists. So, for example for the alphabet Σ = {a, b, c}, the string s = abaccbabaaa has Parikh vector p(s) = (6,3,2), and the Parikh vector q = (2,1,1) appears once in s in position (1,4). Like its more precise counterpart, the renown Exact String Matching, Jumbled Pattern Matching has ubiquitous applications, e.g., string matching with a dyslectic word processor, table rearrangements, …

Proposition d'un dispositif sécurisé de suivi statistique de la diversité dans les entreprises signataires de la Charte de la diversité

2015

It appears to be quite difficult to verify compliance of non-discrimination and diversity promotion priniciplesin the enterprises, in terms of recruitment, career management and job stability. Beyond the methodologicalconcerns, it seems indeed particularly sensitive to give full account of these phenomenum on all aspects ofcareer paths and for each enterprise signatory of the French Charter of Diversity. This paper will outline someengineering items in statistics in order to try to address these issues with statistical matching techniques.It will also put into perspective the evolution of the statistical matching techniques perception in connectionwith the law project for a digital Republic

Extensible User-Based XML Grammar Matching

2009

International audience; XML grammar matching has found considerable interest recently due to the growing number of heterogeneous XML documents on the web and the increasing need to integrate, and consequently search and retrieve XML data originated from different data sources. In this paper, we provide an approach for automatic XML grammar matching and comparison aiming to minimize the amount of user effort required to perform the match task. We propose an open framework based on the concept of tree edit distance, integrating different matching criterions so as to capture XML grammar element semantic and syntactic similarities, cardinality and alternativeness constraints, as well as data-ty…

Matching factorization theorems with an inverse-error weighting

2018

We propose a new fast method to match factorization theorems applicable in different kinematical regions, such as the transverse-momentum-dependent and the collinear factorization theorems in Quantum Chromodynamics. At variance with well-known approaches relying on their simple addition and subsequent subtraction of double-counted contributions, ours simply builds on their weighting using the theory uncertainties deduced from the factorization theorems themselves. This allows us to estimate the unknown complete matched cross section from an inverse-error-weighted average. The method is simple and provides an evaluation of the theoretical uncertainty of the matched cross section associated w…

Parameter Matching Analysis of Hydraulic Hybrid Excavators Based on Dynamic Programming Algorithm

2013

Published version of an article in the journal: Journal of Applied Mathematics. Also available from the publisher at: http://dx.doi.org/10.1155/2013/615608 Open Access In order to meet the energy saving requirement of the excavator, hybrid excavators are becoming the hot spot for researchers. The initial problem is to match the parameter of each component, because the system is tending to be more complicated due to the introduction of the accumulator. In this paper, firstly, a new architecture is presented which is hydraulic hybrid excavator based on common pressure rail combined switched function (HHES). Secondly, the general principle of dynamic programming algorithm (DPA) is explained. T…