This work focuses on the topic of melodic characterization and similarity in a specific musical repertoire: a cappella flamenco singing, more specifically in debla and martinete styles. We propose the combination of manual and automatic description. First, we use a state-of-the-art automatic transcription method to account for general melodic similarity from music recordings. Second, we define ...

The aim of the project is to find the missing color samples at each pixel location by the combination of similarity algorithm and the variance of colour difference algorithm. Many demosaicing algorithms find edges in horizontal and vertical directions, which are not suitable for other directions. Hence using the similarity algorithm the edges are found in different directions. But in this simil...

Biological sequence similarity analysis presents visualization challenges, primarily because of the massive amounts of discrete, multi-dimensional data. Genomic data generated by molecular biologists is analyzed by algorithms that search for similarity to known sequences in large genomic databases. The output from these algorithms can be several thousand pages of text, and is difficult to analy...

Four experiments are reported, the aim of which was to explore the achromatic-colour and distance relations that determine the probability of achromatic surfaces grouping perceptually. The first two experiments were performed to test Wertheimer's conjecture that similarity and dissimilarity of achromatic colours jointly determine grouping. The results indicate that only similarity of achromatic...

Machine learning algorithms have been successfully employed in solving the record linkage problem. Machine learning casts the record linkage problem as a classification problem by training a classifier that classifies 2 records as duplicates or unique. Irrespective of the machine learning algorithm used, the initial step in training a classifier involves selecting a set of similarity functions ...

We use results from the 2011 MIREX “Audio Music Similarity and Retrieval” task for a meta analysis of the hub phenomenon. Hub songs appear similar to an undesirably high number of other songs due to a problem of measuring distances in high dimensional spaces. Comparing 17 algorithms we are able to confirm that different algorithms produce very different degrees of hubness. We also show that hub...

In this work we study the validity of the so-called curse of dimensionality for indexing of databases for similarity search. We perform an asymptotic analysis, with a test model based on a sequence of metric spaces (Ωd) from which we pick datasets Xd in an i.i.d. fashion. We call the subscript d the dimension of the space Ωd (e.g. for R d the dimension is just the usual one) and we allow the si...

Similarity solutions play an important role in many fields of science. The recent book of Barenblatt [2] discusses many examples. Often, outstanding unresolved issues are whether a similarity solution is dynamically attractive, and if it is, to what particular solution does the system evolve. By recasting the dynamic problem in a form to which centre manifold theory may be applied, based upon a...

Documents Clustering is a technique in which relationships between sets of documents are being automatically discovered and documents are divided into groups of similar specimens. The groups that are created during the process of clustering should be specified by the high degree of similarity between the elements that belong to the same group and low degree of similarity between the elements th...

Similarity has highly application dependent and even subjective characteristics. Similarity models therefore have to be adaptable to application specific requirements and individual user preferences. We focus on two aspects of adaptable similarity search: (1) Adaptable Similarity Models. Examples include pixelbased shape similarity as well as 2D and 3D shape histograms, applied to biomolecular ...