A shallow description framework for musical style recognition Pedro J. Ponce de León, Carlos Pérez-Sancho and José Manuel Iñesta Departamento de Lenguajes.

Slides:



Advertisements
Similar presentations
Pseudo-Relevance Feedback For Multimedia Retrieval By Rong Yan, Alexander G. and Rong Jin Mwangi S. Kariuki
Advertisements

Automatic Music Classification Cory McKay. 2/47 Introduction Many areas of research in music information retrieval (MIR) involve using computers to classify.
Outline Introduction Music Information Retrieval Classification Process Steps Pitch Histograms Multiple Pitch Detection Algorithm Musical Genre Classification.
Pitch-spelling algorithms David Meredith Aalborg University.
AUTOMATIC SPEECH CLASSIFICATION TO FIVE EMOTIONAL STATES BASED ON GENDER INFORMATION ABSTRACT We report on the statistics of global prosodic features of.
Accelerometer-based Transportation Mode Detection on Smartphones
A Novel Scheme for Video Similarity Detection Chu-Hong Hoi, Steven March 5, 2003.
LYU0103 Speech Recognition Techniques for Digital Video Library Supervisor : Prof Michael R. Lyu Students: Gao Zheng Hong Lei Mo.
Tree structured representation of music for polyphonic music information retrieval David Rizo Departament of Software and Computing Systems University.
T.Sharon 1 Internet Resources Discovery (IRD) Music IR.
Presented by Zeehasham Rasheed
A Wavelet-Based Approach to the Discovery of Themes and Motives in Melodies Gissel Velarde and David Meredith Aalborg University Department of Architecture,
1 Music Classification Using SVM Ming-jen Wang Chia-Jiu Wang.
Music Indexing and Retrieval for Multimedia Digital Libraries King Fahd University of Petroleum and Minerals Information and Computer Science Department.
Handwritten Character Recognition using Hidden Markov Models Quantifying the marginal benefit of exploiting correlations between adjacent characters and.
JSymbolic and ELVIS Cory McKay Marianopolis College Montreal, Canada.
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
Polyphonic Queries A Review of Recent Research by Cory Mckay.
All features considered separately are relevant in a speech / music classification task. The fusion allows to raise the accuracy rate up to 94% for speech.
TINONS1 Nonlinear SP and Pattern recognition
Time-Domain Methods for Speech Processing 虞台文. Contents Introduction Time-Dependent Processing of Speech Short-Time Energy and Average Magnitude Short-Time.
1 Music Classification Using Significant Repeating Patterns Chang-Rong Lin, Ning-Han Liu, Yi-Hung Wu, Arbee L.P. Chen, Proc. of 9th International Conference,
JSymbolic Cedar Wingate MUMT 621 Professor Ichiro Fujinaga 22 October 2009.
Table 3:Yale Result Table 2:ORL Result Introduction System Architecture The Approach and Experimental Results A Face Processing System Based on Committee.
Transcription of Text by Incremental Support Vector machine Anurag Sahajpal and Terje Kristensen.
Student: Mike Jiang Advisor: Dr. Ras, Zbigniew W. Music Information Retrieval.
Music Information Retrieval -or- how to search for (and maybe find) music and do away with incipits Michael Fingerhut Multimedia Library and Engineering.
Aspects of Music Information Retrieval Will Meurer School of Information University of Texas.
Rhythmic Transcription of MIDI Signals Carmine Casciato MUMT 611 Thursday, February 10, 2005.
Modeling Expressive Performances of the Singing Voice Maria-Cristina Marinescu (Universidad Carlos III de Madrid) Rafael Ramirez (Universitat Pompeu Fabra)
Extracting Melody Lines from Complex Audio Jana Eggink Supervisor: Guy J. Brown University of Sheffield {j.eggink
Hidden Markov Classifiers for Music Genres. Igor Karpov Rice University Comp 540 Term Project Fall 2002.
Automatic music classification and the importance of instrument identification Cory McKay and Ichiro Fujinaga Music Technology Area Faculty of Music McGill.
Singer similarity / identification Francois Thibault MUMT 614B McGill University.
Duraid Y. Mohammed Philip J. Duncan Francis F. Li. School of Computing Science and Engineering, University of Salford UK Audio Content Analysis in The.
Melodic Similarity Presenter: Greg Eustace. Overview Defining melody Introduction to melodic similarity and its applications Choosing the level of representation.
A NOVEL METHOD FOR COLOR FACE RECOGNITION USING KNN CLASSIFIER
MMDB-8 J. Teuhola Audio databases About digital audio: Advent of digital audio CD in Order of magnitude improvement in overall sound quality.
GENDER AND AGE RECOGNITION FOR VIDEO ANALYTICS SOLUTION PRESENTED BY: SUBHASH REDDY JOLAPURAM.
Objectives: Terminology Components The Design Cycle Resources: DHS Slides – Chapter 1 Glossary Java Applet URL:.../publications/courses/ece_8443/lectures/current/lecture_02.ppt.../publications/courses/ece_8443/lectures/current/lecture_02.ppt.
Content-Based MP3 Information Retrieval Chueh-Chih Liu Department of Accounting Information Systems Chihlee Institute of Technology 2005/06/16.
Improving Music Genre Classification Using Collaborative Tagging Data Ling Chen, Phillip Wright *, Wolfgang Nejdl Leibniz University Hannover * Georgia.
1 Hidden Markov Model: Overview and Applications in MIR MUMT 611, March 2005 Paul Kolesnik MUMT 611, March 2005 Paul Kolesnik.
Alex Stabile. Research Questions: Could a computer learn to distinguish between different composers? Why does music by different composers even sound.
Classification of melody by composer using hidden Markov models Greg Eustace MUMT 614: Music Information Acquisition, Preservation, and Retrieval.
1 / 22 jSymbolic Jordan Smith – MUMT 611 – 6 March 2008.
Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.
BASS TRACK SELECTION IN MIDI FILES AND MULTIMODAL IMPLICATIONS TO MELODY gPRAI Pattern Recognition and Artificial Intelligence Group Computer Music Laboratory.
Metamidi: a tool for automatic metadata extraction from MIDI files Tomás Pérez-García, Jose M. Iñesta, and David Rizo Computer Music Laboratory University.
Tree structured and combined methods for comparing metered polyphonic music Kjell Lëmstrom David Rizo Valero José Manuel Iñesta CMMR’08 May 21, 2008.
Melody Recognition with Learned Edit Distances Amaury Habrard Laboratoire d’Informatique Fondamentale CNRS Université Aix-Marseille José Manuel Iñesta,
Looking for New, Not Known Music Only : Music Retrieval by Melody Style Fang-Fei Kuo Dept. of Computer Science and Information Engineering National Chiao.
Melody Characterization by a Fuzzy Rule System Pedro J. Ponce de León, David Rizo, José M. Iñesta (DLSI, Univ. Alicante) Rafael Ramírez (MTG, Univ. Pompeu.
Stochastic Text Models for Music Categorization Carlos Pérez-Sancho, José M. Iñesta, David Rizo Pattern Recognition and Artificial Intelligence group Department.
Genre Classification of Music by Tonal Harmony Carlos Pérez-Sancho, David Rizo Departamento de Lenguajes y Sistemas Informáticos, Universidad de Alicante,
Melody track identification in music symbolic files David Rizo Pedro J. Ponce de León Antonio Pertusa Carlos Pérez-Sancho José M. Iñesta The 19th International.
Automatic Transcription of Polyphonic Music
Tomás Pérez-García, Carlos Pérez-Sancho, José M. Iñesta
Rhythmic Transcription of MIDI Signals
Music Matching Speaker : 黃茂政 指導教授 : 陳嘉琳 博士.
A Melody Composer for both Tonal and Non-Tonal Languages
Introduction to Music Information Retrieval (MIR)
Aspects of Music Information Retrieval
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Handwritten Characters Recognition Based on an HMM Model
John H.L. Hansen & Taufiq Al Babba Hasan
Melodic Similarity CS 275B/Music 254.
Domingo Mery Department of Computer Science
Pitch Spelling Algorithms
Presentation transcript:

A shallow description framework for musical style recognition Pedro J. Ponce de León, Carlos Pérez-Sancho and José Manuel Iñesta Departamento de Lenguajes y Sistemas Informáticos Universidad de Alicante One challenging task for pattern recognition algorithms in the field of computer music is the automatic recognition of musical style, that has a number of applications like indexing and selecting musical databases in music information retrieval (MIR). In this paper, the classification of monophonic melodies of two different musical styles (jazz and classical) represented symbolically as MIDI files is studied, using different classification methods: Bayesian classier and nearest neighbour classier. From the music sequences, a number of melodic, harmonic, and rhythmic statistical descriptors are computed and used for style recognition. We present a performance analysis of such algorithms against different description models and parameters. Abstract This work has been funded by the Spanish CICyT project TIRIG; code TIC C04-04 Pattern recognition algorithms are applicable to a number of computer music research tasks. E.g.: content-based organisation, indexing, and exploration of digital music databases (digital music libraries). Sound data (WAV, MP3, etc.) and Symbolic data (digital scores, MIDI, MusicXML, etc.) Modelization of the music style. The computer could be trained in the user musical taste in order to look for that kind of music over large musical databases. Pattern recognition algorithms are applicable to a number of computer music research tasks. E.g.: content-based organisation, indexing, and exploration of digital music databases (digital music libraries). Sound data (WAV, MP3, etc.) and Symbolic data (digital scores, MIDI, MusicXML, etc.) Modelization of the music style. The computer could be trained in the user musical taste in order to look for that kind of music over large musical databases. Introduction To develop a system able to distinguish musical styles from a symbolic representation of melodies: 1)Proposal of melodic, harmonic, and rhythmic statistical descriptors. 2)Jazz vs. Classical music classification. 3)To explore the method performance for different classification algorithms, descriptor models, and parameter values. To develop a system able to distinguish musical styles from a symbolic representation of melodies: 1)Proposal of melodic, harmonic, and rhythmic statistical descriptors. 2)Jazz vs. Classical music classification. 3)To explore the method performance for different classification algorithms, descriptor models, and parameter values. Objectives: Training set: Files were collected from the Internet without pre-processing before input to the system. From each file, the melody (monophonic) is extracted and descriptors are extracted. Training set: Files were collected from the Internet without pre-processing before input to the system. From each file, the melody (monophonic) is extracted and descriptors are extracted. Music data We have shown the ability of two classifiers to map symbolic representations of melodic segments into a set of musical styles using melodic, harmonic and rhythmic statistical descriptors. Both Bayes and NN classifiers perform comparatively well and reach a success of 94% for the problem of a classification of jazz versus classical music. The average was of a 83.3%. The best performances were found for large window sizes and small or moderate displacements. Larger corpora and different styles are currently under study. Other classification schemes are going to be tested. Also voting schemes and classifier ensembles will be tested. We have shown the ability of two classifiers to map symbolic representations of melodic segments into a set of musical styles using melodic, harmonic and rhythmic statistical descriptors. Both Bayes and NN classifiers perform comparatively well and reach a success of 94% for the problem of a classification of jazz versus classical music. The average was of a 83.3%. The best performances were found for large window sizes and small or moderate displacements. Larger corpora and different styles are currently under study. Other classification schemes are going to be tested. Also voting schemes and classifier ensembles will be tested. 4. Conclusions Approach considered in this work MIDI filesLength in measuresAuthors Mozart, Bach, Schubert, Chopin, Grieg, Vivaldi, Schumann, Brahms, Beethoven, Dvorak, Haendel, Paganini and Mendelssohn Charlie Parker, Duke Ellington, Bill Evans, Miles Davis, etc. Description by sliding window: The windows have a length of  measures and are displaced  measures each time. The melodic fragments are described in terms of 22 descriptors of three different kinds: Feature selection and descriptor models: After a feature selection procedure, those descriptors having a greater discrimination power have been grouped into models: Description by sliding window: The windows have a length of  measures and are displaced  measures each time. The melodic fragments are described in terms of 22 descriptors of three different kinds: Feature selection and descriptor models: After a feature selection procedure, those descriptors having a greater discrimination power have been grouped into models: Descriptors ModelDescriptors 6 Pitch range, max. interval, dev. note duration, max. note duration, dev. pitch, avg. note duration 7 + syncopation 10 + avg. pitch, dev. of intervals, number of notes 13 + number of silences, min. interval, num. non-diatonic notes 22 All the descriptors Descriptors Data Classification Overall features (2): number of notes and silences. Pitch features (4): Note duration (4): min., max., mean and standard deviations Silence duration (4): Intervals (4): Non diatonic notes (3): number, average and standard deviation Melodic descriptors: Harmonic descriptors: Syncopation (1): estimated number of syncopations. Rhythmic descriptor: Width (  ): number of measures described Displacement (  ): number of measures the window is shifted forward Given a melody composed of m measures, the number of segments obtained from it is For example: The number of segments extracted from the training set for the point  =3;  =1 is For  =100;  =20 is only 119. Width (  ): number of measures described Displacement (  ): number of measures the window is shifted forward Given a melody composed of m measures, the number of segments obtained from it is For example: The number of segments extracted from the training set for the point  =3;  =1 is For  =100;  =20 is only 119. Window parameters Bayesian + Nearest neighbours 10-fold crossvalidation: results presented are average of each 10 sub-experiments 2 classifiers, 5 models Window parameter space:   1,...,100,    1,...,  2275 points A total of experiments were performed Bayesian + Nearest neighbours 10-fold crossvalidation: results presented are average of each 10 sub-experiments 2 classifiers, 5 models Window parameter space:   1,...,100,    1,...,  2275 points A total of experiments were performed Classifiers Parameter space Classification performances k-NNBayes Parameter space Classification performances k-NNBayes Classification results   model classifier Worst zone: Small window and displacements Best zone: large window and small displacements < 80% > 92%