Iris recognition from surveillance-type imagery is an active research topic in biometrics. However, iris identification in unconstrained conditions raises many proplems related to localization and alignment, and typically leads to degraded recognition rates. While development has mainly focused on more robust preprocessing, this work highlights the possibility to account for distortions at matc...

This paper argues that automatic phonetic comparison will only return true results if the languages in question have similar and comparably lenient phonologies. In the situation where their phonologies are incompatible and / or restrictive, linguistic knowledge of both of them is necessary to obtain results matching human perception. Whilst the case is mainly exemplified by Levenshtein distance...

Graph data has been commonly used and widely researched both in academia and industry for many applications. And measuring similarity between graphs (i.e., graph matching) is the essential step for graph searching, pattern recognition and machine vision. At present, the most widely used approach to address the graph matching problem is graph edit distance (GED). However, the computation complex...

Hoaxes are non-malicious viruses. They live on deceiving human’s perception by conveying false claims as truth. Throughout history, hoaxes have actually able to influence a lot of people to the extent of tarnishing the victim’s image and credibility. Moreover, wrong and misleading information has always been a distortion to a human’s growth. Some hoaxes were created in a way that they can even ...

We study the problem of finding higher order motifs under the levenshtein measure, otherwise known as the edit distance. In the problem set-up, we are given sequences, each of average length , over a finite alphabet and thresholds and , we are to find composite motifs that contain motifs of length (these motifs occur with atmost differences) in distinct sequences. Two interesting but involved a...

We apply polynomial techniques (i.e., which invole polynomials) to obtain lower and upper bounds on the covering radius of spherical designs as function their dimension, strength, cardinality. In terms inner products we improve due Fazekas Levenshtein propose new bounds. Our approach involves certain signed measures whose corresponding series orthogonal polynomials are positive definite up a (a...

Medical record linkage is becoming increasingly important as clinical data is distributed across independent sources. To improve linkage accuracy we studied different name comparison methods that establish agreement or disagreement between corresponding names. In addition to exact raw name matching and exact phonetic name matching, we tested three approximate string comparators. The approximate...

This paper attempts to establish the importance of differences in the tone inventories for the mutual intelligibility of 15 Chinese dialects. Tone influence for mutual intelligibility was tested in two studies. In the first study mutual intelligibility was measured through opinion testing. The fable “The North Wind and the Sun” was read by one male speaker in each of 15 Chinese dialects with me...

This paper presents an approach to automatically extract and evaluate the “stability” of pronunciation variants (i.e., adequacy of the model to accommodate this variability), based on multiple pronunciations of each lexicon words and the knowledge of a reference baseform pronunciation. Most approaches toward modelling pronunciation variability in speech recognition are based on the inference (t...