2009:Audio Cover Song Identification - Revision history

Kahyun Choi: /* Evaluation */

2011-12-20T04:58:01Z

‎Evaluation

2010-05-13T18:32:14Z

Robot: Automated text replacement (-\[\[([A-Z][^:]+)\]\] +2009:\1)

2009-09-08T19:53:11Z

‎Potential Participants

2009-08-18T10:47:35Z

‎Potential Participants

2009-08-18T10:45:40Z

‎Potential Participants

2009-08-12T21:56:29Z

‎Task Description

2009-08-10T07:18:25Z

‎Potential Participants

2009-08-04T19:02:23Z

‎Potential Participants

2009-08-02T14:25:55Z

‎Discussions for 2009

2009-08-02T14:25:32Z

‎Evaluation

@@ Line 82: / Line 82: @@
 ==Evaluation==
-We could employ the same measures used in [[2007:Audio Cover Song]].
+We could employ the same measures used in [[2007:Audio_Cover_Song_Identification]].
 ==Potential Participants==

@@ Line 3: / Line 3: @@
 The text of this section is copied from the 2008 page. Please add your comments and discussions for 2009.
-The Audio Cover Song task was a new task for MIREX 2006 and was last run in 2008. It was closely related to the [[Audio Music Similarity and Retrieval]] (AMS) task as the cover songs were embedded in the Audio Music Similarity and Retrieval test collection.
+The Audio Cover Song task was a new task for MIREX 2006 and was last run in 2008. It was closely related to the [[2009:Audio Music Similarity and Retrieval]] (AMS) task as the cover songs were embedded in the Audio Music Similarity and Retrieval test collection.
 ==Task Description==

← Older revision		Revision as of 19:53, 8 September 2009
Line 89:		Line 89:
	* Suman Ravuri & Dan Ellis (International Computer Science Institute/UC Berkeley & Columbia respectively) - still interested. Mostly likely 1 algorithm with a fairly low probability (< 15%) of another algorithm.		* Suman Ravuri & Dan Ellis (International Computer Science Institute/UC Berkeley & Columbia respectively) - still interested. Mostly likely 1 algorithm with a fairly low probability (< 15%) of another algorithm.
	* Joan Serr├á (Music Technology Group, Universitat Pompeu Fabra) - One algorithm		* Joan Serr├á (Music Technology Group, Universitat Pompeu Fabra) - One algorithm
		+	* Teppo E. Ahonen (Dept. of Computer Science, University of Helsinki)

@@ Line 88: / Line 88: @@
 * R├⌐mi foucard & Mathieu Lagrange (Telecom ParisTech)
 * Suman Ravuri & Dan Ellis (International Computer Science Institute/UC Berkeley & Columbia respectively) - still interested. Mostly likely 1 algorithm with a fairly low probability (< 15%) of another algorithm.
-* Joan Serr├á (Music Technology Group, Universitat Pompeu Fabra)
+* Joan Serr├á (Music Technology Group, Universitat Pompeu Fabra) - One algorithm

← Older revision		Revision as of 10:45, 18 August 2009
Line 88:		Line 88:
	* R├⌐mi foucard & Mathieu Lagrange (Telecom ParisTech)		* R├⌐mi foucard & Mathieu Lagrange (Telecom ParisTech)
	* Suman Ravuri & Dan Ellis (International Computer Science Institute/UC Berkeley & Columbia respectively) - still interested. Mostly likely 1 algorithm with a fairly low probability (< 15%) of another algorithm.		* Suman Ravuri & Dan Ellis (International Computer Science Institute/UC Berkeley & Columbia respectively) - still interested. Mostly likely 1 algorithm with a fairly low probability (< 15%) of another algorithm.
		+	* Joan Serr├á (Music Technology Group, Universitat Pompeu Fabra)

← Older revision		Revision as of 21:56, 12 August 2009
Line 10:		Line 10:
	Using each of these cover song files in turn as as the "seed/query" file, we will examine the returned lists of items for the presence of the other 10 versions of the "seed/query" file.		Using each of these cover song files in turn as as the "seed/query" file, we will examine the returned lists of items for the presence of the other 10 versions of the "seed/query" file.

		+
		+	==New Dataset for 2009==
		+	On top of the previous Audio Cover Song dataset, we are going to use the [http://www.mazurka.org.uk/ Mazurka dataset]. We are going to randomly choose 11 versions from 49 mazurkas and run it as a separate subtask. The I/O format will be the same as previous years. Systems will return a distance matrix of 539x539.

	== Discussions for 2009 ==		== Discussions for 2009 ==

@@ Line 85: / Line 85: @@
 * Vishweshwara Rao & Preeti Rao (Indian Institute of Technology Bombay, India)
 * R├⌐mi foucard & Mathieu Lagrange (Telecom ParisTech)
-* Suman Ravuri (International Computer Science Institute/UC Berkeley)
+* Suman Ravuri & Dan Ellis (International Computer Science Institute/UC Berkeley & Columbia respectively) - still interested. Mostly likely 1 algorithm with a fairly low probability (< 15%) of another algorithm.

@@ Line 13: / Line 13: @@
 == Discussions  for 2009 ==
-Your comments here.
+Is there any interest in running a general identification sub-task? That is, the input would be a reference song and a test song, and the algorithm would classify the reference/test pair as either a reference/cover or a reference/non-cover. Ultimately, this is what we want any cover song detection algorithm to do and given the rather large strides the MIR community has made on cover song detection over the past couple years, I think this new sub-task would be both challenging and meaningful. - Suman Ravuri
 === Command Line Calling Format ===

← Older revision		Revision as of 14:25, 2 August 2009
Line 80:		Line 80:

	We could employ the same measures used in [[2007:Audio Cover Song]].		We could employ the same measures used in [[2007:Audio Cover Song]].
−
−	Is there any interest in running a general identification sub-task? That is, the input would be a reference song and a test song, and the algorithm would classify the reference/test pair as either a reference/cover or a reference/non-cover. Ultimately, this is what we want any cover song detection algorithm to do and given the rather large strides the MIR community has made on cover song detection over the past couple years, I think this new sub-task would be both challenging and meaningful. - Suman Ravuri

	==Potential Participants==		==Potential Participants==