Music Information Retrieval Based on Signal Processing
Bibliographic record
Abstract
The main focus of this special issue is on the application of digital signal processing techniques for music information retrieval (MIR). MIR is an emerging and exciting area of research that seeks to solve a wide variety of problems dealing with preserving, analyzing, indexing, searching, and accessing large collections of digitized music. There are also strong interests in this field of research from music libraries and the recording industry as they move towards digital music distribution. The demands from the general public for easy access to these music libraries challenge researchers to create tools and algorithms that are robust, small, and fast. Music is represented in either encoded audio waveforms (CD audio, MP3, etc.) or symbolic forms (musical score, MIDI, etc.). Audio representations, in particular, require robust signal processing techniques for many applications of MIR since meaningful descriptions need to be extracted from audio signals in which sounds from multiple instruments and vocals are often mixed together. Researchers in MIR are therefore developing a wide range of new methods based on statistical pattern recognition, classification, andmachine learning techniques such as the HiddenMarkov Model (HMM), maximum likelihood estimation, and Bayes estimation as well as digital signal processing techniques such as Fourier and wavelet transforms, adaptive filtering, and source-filter models. New music interface and query systems leveraging such methods are also important for end users to benefit from MIR research. This issue contains sixteen papers covering wide range of topics in MIR. In the first paper, Diniz et al. introduce new spectral analysis methods that may be useful for pitch and feature extraction of music. In the second paper, Lacoste and Eck make an important contribution in detecting where a note starts, which is fundamental to many of higher-level MIR tasks. The next two papers, by Peeters and Alonso et al. deal with the challenge of finding tempo in music. The subsequent two papers by Kitahara et al. and Woodruff and Pardo consider the problem separating and identifying instruments in music with multiple instruments playing together while Poliner and Ellis focus on the difficult problem of piano transcription. To enhance queries based on sung melodies, Suzuki et al. use both lyric and pitch information. The problem of segmenting music into large sections is refined in the two papers by Jensen and Muller and Kurth. The issue of key finding in music is nontrivial and is covered by Chuan and Chew. The next three papers by West and Lamere, Cataltepe et al., and Barbedo and Lopes address the problem of music similarity and genre classification. A paper by Rossant and Bloch contributes to the advancement of optical music recognition systems, which help to create large symbolic music databases. The last paper by Goto et al. makes a worthy contribution by converting the emerging music notation standard MusicXML to Braille music notation.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.004 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.023 | 0.011 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".