2008:Query by Singing/Humming

Status

The goal of the Query-by-Singing/Humming (QBSH) task is the evaluation of MIR systems that take as query input queries sung or hummed by real-world users. More information can be found in:

• 2006:QBSH:_Query-by-Singing/Humming
• 2006:QBSH_Discussion_Page

Please feel free to edit this page.

Query Data

1. Roger Jang's corpus (MIREX2006 QBSH corpus) which is comprised of 2797 queries along with 48 ground-truth MIDI files. All queries are from the beginning of references.

2. ThinkIT corpus comprised of 355 queries and 106 monophonic ground-truth MIDI files (with MIDI 0 or 1 format). There are no "singing from beginning" gurantee. This corpus will be published after the task running.

3. Noise MIDI will be the 2000 Essen collection(can be accessed from http://www.esac-data.org/).

To build a large test set which can reflect real-world queries, it is suggested that every participant makes a contribution to the evaluation corpus.

Evaluation Corpus Contribution

Every participant will be asked to contribute 100~200 wave queries (8k 16bits) as well as the ground truth MIDI as test data. Please make your contributed data conformed to the format used in the ThinkIT corpus (TITcorpus). These test data will be released after the competition as a public-domain QBSH dataset.

Here is a simple tool for recording query data. You may need to have .NET 2.0 or above installed in your system in order to run this program. The generated files conform to the format used in the ThinkIT corpus. Of course you are also welcomed to use your own program to record the query data.

Task description

Classic QBSH evaluation:

• Input: human singing/humming snippets (.wav). Queries are from Roger Jang's corpus and ThinkIT corpus.
• Database: ground-truth and noise MIDI files(which are monophonic). Comprised of 48+106 Roger Jang's and ThinkIT's ground-truth along with a cleaned version of Essen Database(2000+ MIDIs which are used last year)
• Output: top-20 candidate list.
• Evaluation: Mean Reciprocal Rank (MRR) and Top-X hit rate.

To make algorithms able to share intermediate steps, participants are encouraged to submit separate transcriber and matcher modules instead of integrated ones, which is according to Rainer Typke's suggestion. So transcribers and matchers from different submissions could work together with the same pre-defined interface and thus for us it's possible to find the best combination.

Interface

The following was based on the suggestion by Xiao Wu last year with some modifications.

1. Database indexing/building. Calling format should look like

indexing %db_list% %dir_workspace_root%

where db_list is the input list of database midi files named as uniq_key.mid. For example:

./QBSH/Database/00001.mid
./QBSH/Database/00002.mid
./QBSH/Database/00003.mid
./QBSH/Database/00004.mid
...

Output indexed files are placed into dir_workspace_root.

2. Pitch tracker. Calling format:

pitch_transcriber %query.list% %dir_query_pitch%

Each input file dir_query/query_xxxxx.wav in query.list outputs a transcription dir_query_pitch/query_xxxxx.pitch, and each text line of the generated pitch file represents a query pitch formated as pitch %onset_time% %duration% %midi_pitch%. Example:

pitch 2000 250 297.93
pitch 2250 250 294.17
pitch 2500 500 337.72
pitch 3200 220 298.80
...

Here onset_time and duration are counted in millisecond.

3. Pitch matcher. Calling format:

pitch_matcher %db_list% %pitch.list% %result%

where pitch.list looks like

dir_query_pitch/query_00001.pitch
dir_query_pitch/query_00002.pitch
dir_query_pitch/query_00003.pitch
...

and the result file gives top-20 candidates(if has) for each query:

query_00001: 00025 01003 02200 ... 
query_00002: 01547 02313 07653 ... 
query_00003: 03142 00320 00973 ... 
...

Participants

If you think there is a slight chance that you might want to participate, please add your name and e-mail address to this list

• Liang-Yu Davidson Chen (davidson833 at mirlab dot org)
• Lei Wang (leiwang.mir at gmail dot com)
• Xiao Wu (xwu2006 at gmail dot com)
• Matti Ryyn├ñnen and Anssi Klapuri (Tampere University of Technology), matti.ryynanen <at> tut.fi, anssi.klapuri <at> tut.fi

Xiao Wu's Comments

In my opinion, QBSH (even for QBH in monophonic database) is still far from "a solved problem". Many problems are still chanllenging our systems (robustness in noise environment, efficiency in 10000-larger database, etc.). So, this year we may setup a more tough test for the participants.

Lei Wang's Comments

I looked through the Essen collection today, and i found that there are some songs is the same as the ground-truth midi in Roger's Corpus. These midi files should not be added as the noise midi, right?

Davidson's Comments

Since there are 5000+ noise MIDI in the Essen's collection, and the MIREX committee will add more extra MIDIs, the effect of repetitive MIDIs should be minimal.

And in terms of the evaluation method, shall we use Mean Reciprocal Rank (MRR) as last year?

Mert`s Comments

Hi everyone. The noise collection used in this tasks are a subset of the Essen collection. 2000 files that were selected manually that are different than the queries.

Davidson's Comments

A method to alleviate the repetitive MIDI problem is to change the evaluation method to "hit in the top 10", i.e. 1 point is scored if the ground truth MIDI is selected in the top 10 or 0 points otherwise.

Thinkit's query contribution

ThinkIT QBH corpus is available at TITcorpus. (355 audio files along with 106 MIDI files)