Identifying Cover Songs Using Information-Theoretic Measures of Similarity

This work is licensed under a Creative Commons Attribution 3.0 License. For more information, see http://creativecommons.org/licenses/by/3.0/This paper investigates methods for quantifying similarity between audio signals, specifically for the task of cover song detection. We consider an information-theoretic approach, where we compute pairwise measures of predictability between time series. We compare discrete-valued approaches operating on quantized audio features, to continuous-valued approaches. In the discrete case, we propose a method for computing the normalized compression distance, where we account for correlation between time series. In the continuous case, we propose to compute information-based measures of similarity as statistics of the prediction error between time series. We evaluate our methods on two cover song identification tasks using a data set comprised of 300 Jazz standards and using the Million Song Dataset. For both datasets, we observe that continuous-valued approaches outperform discrete-valued approaches. We consider approaches to estimating the normalized compression distance (NCD) based on string compression and prediction, where we observe that our proposed normalized compression distance with alignment (NCDA) improves average performance over NCD, for sequential compression algorithms. Finally, we demonstrate that continuous-valued distances may be combined to improve performance with respect to baseline approaches. Using a large-scale filter-and-refine approach, we demonstrate state-of-the-art performance for cover song identification using the Million Song Dataset.The work of P. Foster was supported by an Engineering and Physical Sciences Research Council Doctoral Training Account studentship

Cues from neuroepithelium and surface ectoderm maintain neural crest-free regions within cranial mesenchyme of the developing chick

Within the developing vertebrate head, neural crest cells (NCCs) migrate from the dorsal surface of the hindbrain into the mesenchyme adjacent to rhombomeres (r)1 plus r2, r4 and r6 in three segregated streams. NCCs do not enter the intervening mesenchyme adjacent to r3 or r5, suggesting that these regions contain a NCC-repulsive activity. We have used surgical manipulations in the chick to demonstrate that r3 neuroepithelium and its overlying surface ectoderm independently help maintain the NCC-free zone within r3 mesenchyme. In the absence of r3, subpopulations of NCCs enter r3 mesenchyme in a dorsolateral stream and an ectopic cranial nerve forms between the trigeminal and facial ganglia. The NCC-repulsive activity dissipates/degrades within 5-10 hours of r3 removal. Initially, r4 NCCs more readily enter the altered mesenchyme than r2 NCCs, irrespective of their maturational stage. Following surface ectoderm removal, mainly r4 NCCs enter r3 mesenchyme within 5 hours, but after 20 hours the proportions of r2 NCCs and r4 NCCs ectopically within r3 mesenchyme appear similar

Atmospheric effects on remote sensing of non-uniform temperature sources

The effects are considered of an absorbing, emitting, and scattering atmosphere upon the remote sensing of surface areas having non-uniform intensity. These atmospheric effects may be significant in determination, by remote sensing, of non-uniform surface temperature distributions, and the results of the investigation are applicable in such cases. Analytical methods and a digital computational program are presented, expressing the results in terms of contrast and contrast transmittance between two adjacent emitting areas having unequal intensities, in the presence of a additional disturbing emitters. In the computational procedure, emitting areas are replaced by point-source emitters, each assigned and effective intensity based upon the intensity of the area it replaces. Absorbing, emitting, and scattering behavior of the atmosphere may be specified in the computational procedure either by means of analytical atmospheric models or by means of calibrating ground level emitters

Reliable routing scheme for indoor sensor networks

Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may create long hops routes, and the high quality paths will be frequently used. This leads to shorter lifetime of such paths; thereby the entire network's lifetime will be significantly minimized. This paper briefly presents a reliable load-balanced routing (RLBR) scheme for indoor ad hoc wireless sensor networks, which integrates routing information from different layers. The proposed scheme aims to redistribute the relaying workload and the energy usage among relay sensor nodes to achieve balanced energy dissipation; thereby maximizing the functional network lifetime. RLBR scheme was tested and benchmarked against the TinyOS-2.x implementation of MintRoute on an indoor testbed comprising 20 Mica2 motes and low power listening (LPL) link layer provided by CC1000 radio. RLBR scheme consumes less energy for communications while reducing topology repair latency and achieves better connectivity and communication reliability in terms of end-to-end packets delivery performance

Dynamic weight parameter for the Random Early Detection (RED) in TCP networks

This paper presents the Weighted Random Early Detection (WTRED) strategy for congestion handling in TCP networks. WTRED provides an adjustable weight parameter to increase the sensitivity of the average queue size in RED gateways to the changes in the actual queue size. This modification, over the original RED proposal, helps gateways minimize the mismatch between average and actual queue sizes in router buffers. WTRED is compared with RED and FRED strategies using the NS-2 simulator. The results suggest that WTRED outperforms RED and FRED. Network performance has been measured using throughput, link utilization, packet loss and delay

Negative differential resistance due to single-electron switching

We present the multilevel fabrication and measurement of a Coulomb-blockade device displaying tunable negative differential resistance (NDR). Applications for devices displaying NDR include amplification, logic, and memory circuits. Our device consists of two Al/Al$_{x}$O$_{y}$ islands that are strongly coupled by an overlap capacitor. Our measurements agree excellently with a model based on the orthodox theory of single-electron transport.Comment: 3 pages, 3 figures; submitted to AP

A Graphical Language for Proof Strategies

Complex automated proof strategies are often difficult to extract, visualise, modify, and debug. Traditional tactic languages, often based on stack-based goal propagation, make it easy to write proofs that obscure the flow of goals between tactics and are fragile to minor changes in input, proof structure or changes to tactics themselves. Here, we address this by introducing a graphical language called PSGraph for writing proof strategies. Strategies are constructed visually by "wiring together" collections of tactics and evaluated by propagating goal nodes through the diagram via graph rewriting. Tactic nodes can have many output wires, and use a filtering procedure based on goal-types (predicates describing the features of a goal) to decide where best to send newly-generated sub-goals. In addition to making the flow of goal information explicit, the graphical language can fulfil the role of many tacticals using visual idioms like branching, merging, and feedback loops. We argue that this language enables development of more robust proof strategies and provide several examples, along with a prototype implementation in Isabelle

Speeding up active mesh segmentation by local termination of nodes.

This article outlines a procedure for speeding up segmentation of images using active mesh systems. Active meshes and other deformable models are very popular in image segmentation due to their ability to capture weak or missing boundary information; however, where strong edges exist, computations are still done after mesh nodes have settled on the boundary. This can lead to extra computational time whilst the system continues to deform completed regions of the mesh. We propose a local termination procedure, reducing these unnecessary computations and speeding up segmentation time with minimal loss of quality

Sequential Complexity as a Descriptor for Musical Similarity

We propose string compressibility as a descriptor of temporal structure in audio, for the purpose of determining musical similarity. Our descriptors are based on computing track-wise compression rates of quantised audio features, using multiple temporal resolutions and quantisation granularities. To verify that our descriptors capture musically relevant information, we incorporate our descriptors into similarity rating prediction and song year prediction tasks. We base our evaluation on a dataset of 15500 track excerpts of Western popular music, for which we obtain 7800 web-sourced pairwise similarity ratings. To assess the agreement among similarity ratings, we perform an evaluation under controlled conditions, obtaining a rank correlation of 0.33 between intersected sets of ratings. Combined with bag-of-features descriptors, we obtain performance gains of 31.1% and 10.9% for similarity rating prediction and song year prediction. For both tasks, analysis of selected descriptors reveals that representing features at multiple time scales benefits prediction accuracy.Comment: 13 pages, 9 figures, 8 tables. Accepted versio