Search results for "Matching"
showing 10 items of 509 documents
MESH COMPARISON USING ATTRIBUTE DEVIATION METRIC
2004
We propose a mesh comparison method using a new attribute deviation metric. The considered meshes contain geometrical and appearance attributes (material color, texture, temperature, etc.). The proposed deviation metric computes local differences between the attributes of two meshes. A mesh comparison assessment can be done easily and quickly using this metric. The techniques proposed are applicable in a number of ways, e.g. 3D matching and registration, and the example described in the paper is the simplification of a surface by iteratively reducing its complexity according to an error metric. The results are presented showing the success of the algorithm through comparisons with other me…
An Automatic Three-Dimensional Fuzzy Edge Detector
2009
Three-dimensional object analysis is of particular interest in many research fields. In this context, the most common data representation is boundary mesh, namely, 2D surface embedded in 3D space. We will investigate the problem of 3D edge extraction, that is, salient surface regions characterized by high flexure. Our automatic edge detection method assigns a value, proportional to the local bending of the surface, to the elements of the mesh. Moreover, a proper scanning window, centered on each element, is used to discriminate between smooth zones of the surface and its edges. The algorithm does not require input parameters and returns a set of elements that represent the salient features …
Robust fault detection design for unknown inputs Takagi-Sugeno models with parametric uncertainties and time-varying delays
2014
This paper deals with the design of robust fault detection system for Takagi-Sugeno (T-S) modes with parametric uncertainties and time-varying delay. An Unknown Input Observer (UIO) is designed such that the unknown inputs are thoroughly decoupled from residual signals while they show the maximum possible sensitivity to the faults and the minimum possible sensitivity to the external disturbances. Since the system under consideration is subjected to parametric uncertainties, the H ∞ model matching approach is used to design an optimal observer. Design procedure is given in terms of Linear Matrix Inequalities (LMIs). Finally, a numerical example is presented to show the effectiveness of the p…
Metodo di Template Matching per l'Analisi di Immagini
2012
La presente invenzione si riferisce ad un metodo di Template Matching per l’analisi di immagini da ImmunoFluorescenza Indiretta (IFI) per la rivelazione e classificazione automatica di pattern autoanticorpali. L’invenzione qui presentata generalizza il metodo del Template Matching operando innovativamente il mapping del contenuto visuale dell’immagine con particolari funzioni discrete qui denominate “mappatori”; inoltre, utilizzando le informazioni provenienti dalla sovrapposizione dei vari mappatori con un metodo di confronto funzionale, realizza una funzione di correlazione originale. La metodologia descritta nel seguito presenta una flessibilità tale da renderla applicabile a qualsiasi p…
Automatic orientation and 3D modelling from markerless rock art imagery
2013
This paper investigates the use of two detectors and descriptors on image pyramids for automatic image orientation and generation of 3D models. The detectors and descriptors replace manual measurements and are used to detect, extract and match features across multiple imagery. The Scale-Invariant Feature Transform (SIFT) and the Speeded Up Robust Features (SURF) will be assessed based on speed, number of features, matched features, and precision in image and object space depending on the adopted hierarchical matching scheme. The influence of applying in addition Area Based Matching (ABM) with normalised cross-correlation (NCC) and least squares matching (LSM) is also investigated. The pipel…
Text Compression Using Antidictionaries
1999
International audience; We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.
Asymmetric Comparison and Querying of Biological Networks
2011
Comparing and querying the protein-protein interaction (PPI) networks of different organisms is important to infer knowledge about conservation across species. Known methods that perform these tasks operate symmetrically, i.e., they do not assign a distinct role to the input PPI networks. However, in most cases, the input networks are indeed distinguishable on the basis of how the corresponding organism is biologically well characterized. In this paper a new idea is developed, that is, to exploit differences in the characterization of organisms at hand in order to devise methods for comparing their PPI networks. We use the PPI network (called Master) of the best characterized organism as a …
Approximate Matching over Biological RDF Graphs
2012
In the last few years, the amount of biological interaction data discovered and stored in public databases (e.g., KEGG [2]) considerably increased. To this aim, RDF is a powerful representation for interactions (or pathways), since they can be modeled as directed graphs, often referred to as biological networks, where nodes represent cellular components and the (labeled or unlabeled) edges correspond to interactions among components. Often for a given organism some components are known to be linked by well studied interactions. Such groups of components are called modules and they can be represented by sub-graphs in the corresponding biological network model. At today, one of the most impor…
A basic analysis toolkit for biological sequences
2007
This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory an…
Are Low Prices Compromises Collusion Guarantees? An Experimental Analysis of Price Matching Policies
2001
In this paper we experimentally test the ability of Price-Matching Guarantees (PMG) to rise prices above the competitive level. We implement three different treatments of symmetric duopolies to check the effect of PMG both as a market institution and as a business strategy. In the absence of any low-price guarantee, prices get close to the Bertrand-Nash equilibrium although in the 50 rounds of the experiment no full convergence is obtained. The existence of PMG as an institution in a market where firms decide only about prices results in a clear collusive outcome as all markets quickly and fully converge to the collusive prediction. If we allow subjects to decide whether they adopt price ma…