Search results for " Match"
showing 10 items of 345 documents
Rethinking the sGLOH Descriptor
2018
sGLOH (shifting GLOH) is a histogram-based keypoint descriptor that can be associated to multiple quantized rotations of the keypoint patch without any recomputation. This property can be exploited to define the best distance between two descriptor vectors, thus avoiding computing the dominant orientation. In addition, sGLOH can reject incongruous correspondences by adding a global constraint on the rotations either as an a priori knowledge or based on the data. This paper thoroughly reconsiders sGLOH and improves it in terms of robustness, speed and descriptor dimension. The revised sGLOH embeds more quantized rotations, thus yielding more correct matches. A novel fast matching scheme is a…
205 Minimally invasive approaches in locally advanced cervical cancer patients undergoing radical surgery after chemoradiotherapy: a propensity score…
2020
Objectives To evaluate the oncological and surgical outcome of minimally invasive radical surgery (MI-RS) compared to open radical surgery (O-RS) in locally advanced cervical cancer (LACC) after preoperative chemoradiation (CT/RT). Methods Data relative to stage IB2-IVA cervical cancer patients managed by CT/RT and RS were retrospectively analyzed. Results Starting from 686 patients, the propensity score matching resulted in 462 cases (231 per group), balanced for FIGO stage, lymph node status, histotype, tumor grade and clinical response to CT/RT. Overall, 107 recurrences were registered with no difference in the pattern of recurrences between the two surgical approaches. The 5-year diseas…
Nuclear quantum effects in liquid water from path-integral simulations using anab initioforce-matching approach
2014
We have applied path integral simulations, in combination with new ab initio based water potentials, to investigate nuclear quantum effects in liquid water. Because direct ab initio path integral simulations are computationally expensive, a flexible water model is parameterized by force-matching to density functional theory-based molecular dynamics simulations. The resulting effective potentials provide an inexpensive replacement for direct ab inito molecular dynamics simulations and allow efficient simulation of nuclear quantum effects. Static and dynamic properties of liquid water at ambient conditions are presented and the role of nuclear quantum effects, exchange-correlation functionals…
Mathematical Morphology for Color Images: An Image-Dependent Approach
2012
This paper proposes one possibility to generalize the morphological operations (particularly, dilation, erosion, opening, and closing) to color images. First, properties of a desirable generalization are stated and a brief review is done on former approaches. Then, the method is explained, which is based on a total ordering of the colors in an image induced by its color histogram; this is valid for just one image and may present problems in smoothly coloured images. To solve these drawbacks a refinement consisting of smoothing the histogram and using a joint histogram of several images is presented. Results of applying the so-defined morphological operations on several sets of images are sh…
Languages with mismatches
2007
AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…
"Indexing structures for approximate string matching
2003
In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis.
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
2001
We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…
Monitoring the Internal and External Loads of Young Team Handball Players during Competition
2021
This study aimed to examine the internal- and external-training-load (ITL and ETL, respectively) during a match of young handball players. Field testing included heart-rate monitoring (memory belt, Suunto) as a marker of ITL and accelerometry (motion-biosensor, Actical Respironcis, Philips) as a marker of ETL. Time motion analysis data were obtained by recording the player’s game activities and later analysed with the Matlab software package. T-test and Pearson-product-moment correlation coefficient were used to examine the differences and the relationship between variables collected in the study. The t-test analysis did not show significant differences between the total distance covered (2…
Linear-size suffix tries
2016
Suffix trees are highly regarded data structures for text indexing and string algorithms [MCreight 76, Weiner 73]. For any given string w of length n = | w | , a suffix tree for w takes O ( n ) nodes and links. It is often presented as a compacted version of a suffix trie for w, where the latter is the trie (or digital search tree) built on the suffixes of w. Here the compaction process replaces each maximal chain of unary nodes with a single arc. For this, the suffix tree requires that the labels of its arcs are substrings encoded as pointers to w (or equivalent information). On the contrary, the arcs of the suffix trie are labeled by single symbols but there can be Θ ( n 2 ) nodes and lin…
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
2007
Abstract Background Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. However, the alignment methods seem inadequate for post-genomic studies since they do not scale well with data set size and they seem to be confined only to genomic and proteomic sequences. Therefore, alignment-free similarity measures are actively pursued. Among those, USM (Universal Similarity Metric) has gained prominence. It is based on the deep theory of Kolmogorov Complexity and universality is its most novel striking feature. Since it can only be approximated via data compression, USM is a methodology rath…