11,050 Hits in 4.7 sec

Encoding Timing Information For Musical Query Matching

Bryan Pardo, William P. Birmingham
2002 Zenodo  
Timing Information for Musical Query Matching were placed in bin 0.  ...  timing information for musical query retrieval.  ... 
doi:10.5281/zenodo.1415776 fatcat:6sx7lb75ozbktbpsjsrzndq2eu

A Polyphonic Music Retrieval System Using N-Grams

Shyamala Doraisamy, Stefan M. Rüger
2004 Zenodo  
With MODN, we continue to look at match points but the match points for polyphonic musical documents would be the position in the text document that matches the first term available of the query sequence  ...  Polyphonic music pieces are encoded as an ordered pair of onset time (in milliseconds) and pitch (in MIDI semitone numbers) and these are sorted based on the onset times.  ... 
doi:10.5281/zenodo.1417961 fatcat:jnpbgegmfncuhm7wija3kheh2e

Content-based retrieval for music collections

Yuen-Hsien Tseng
1999 Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '99  
The system uses a pitch profile encoding for queries in any key and an n-note indexing method for approximate matching in sub-linear time.  ...  The use of extracted key melodies improves performance over direct search of the music database. For the type of burst mismatch, a query expansion approach is applied.  ...  A pitch profile encoding is used for allowing queries in any key levels and an n-note indexing method is adopted for approximate matching in sub-linear time.  ... 
doi:10.1145/312624.312675 dblp:conf/sigir/Tseng99 fatcat:ks5hcg4tyzhpdk7664ywv2fbda

Polyphonic music retrieval

Shyamala Doraisamy
2005 SIGIR Forum  
For this, ratios of onset times between two adjacent pairs of pitch events are used.  ...  This Music Information Retrieval (MIR) study investigates the use of n-grams and textual Information Retrieval (IR) approaches for the retrieval and access of polyphonic music data.  ...  matching (when query patterns have to be matched by scanning the whole collection) would not be feasible for large collections (as the matching time would grow linearly to the size of the collection)  ... 
doi:10.1145/1067268.1067289 fatcat:6kh6aflmnjgvlnr2zwtpn32oxi

An Approach Towards A Polyphonic Music Retrieval System

Shyamala Doraisamy
2001 Zenodo  
exact matching techniques that demand less retrieval processing time [7, 8] .  ...  Onset time ratios have proven useful for incorporating rhythm information.  ... 
doi:10.5281/zenodo.1415621 fatcat:z3xpo4m5nbfdtawo2bdkng7twi

A survey of query-by-humming similarity methods

Alexios Kotsifakos, Panagiotis Papapetrou, Jaakko Hollmén, Dimitrios Gunopulos, Vassilis Athitsos
2012 Proceedings of the 5th International Conference on PErvasive Technologies Related to Assistive Environments - PETRA '12  
In this paper, we focus on providing a brief overview of the representations to encode music pieces, and also on the methods that have been proposed for QBH or other similarly defined problems.  ...  In QBH the goal is to find the song(s) most similar to a hummed query in an efficient manner.  ...  REPRESENTING MUSIC PIECES Although many approaches represent notes by encoding only pitch, it has been shown that the use of both pitch and duration information improves music retrieval [20] and the  ... 
doi:10.1145/2413097.2413104 dblp:conf/petra/KotsifakosPHGA12 fatcat:fjjy7whdyndxnhanlbkhzhagc4

Analyzing The Influence Of Pitch Quantization And Note Segmentation On Singing Voice Alignment In The Context Of Audio-Based Query-By-Humming

Jose J. Valero-Mas, Justin Salamon, Emilia Gómez
2015 Proceedings of the SMC Conferences  
Iñesta for kindly proofreading this paper.  ...  Smith-Waterman requires a series of costs to be defined: a reward for symbol matches (C MATCH ), a penalty for mismatches (C MISMATCH ) and two costs for time warps (C INSERTION and C DELETION ).  ...  The most likely reason for this is again the fact that the use of the PAA algorithm does not take into account the musical nature of the data to encode, thus abstracting away relevant information necessary  ... 
doi:10.5281/zenodo.851123 fatcat:wzuh3nqv75cz3pjz5a5m2hhgmq

Scalable Searching and Ranking for Melodic Pattern Queries

Philippe Rigaux, Nicolas Travers
2019 Zenodo  
Collections are searched for scores that match a melodic pattern, results are ranked on their similarity with the pattern, and matching fragments are finally identified on the fly.  ...  We present the design and implementation of a scalable search engine for large Digital Score Libraries. It covers the core features expected from an information retrieval system.  ...  Section 6.5) and matching n-grams are merged at query time.  ... 
doi:10.5281/zenodo.3527931 fatcat:4kfzsjbua5gejdiao7tlk6gfjq

Query-based Deep Improvisation

Shlomo Dubnov
2019 Zenodo  
Our experiments provide new insight into relations between the representational and structural information of latent states and the query signal, suggesting their possible use for composition purposes.  ...  In this paper we explore techniques for generating new music using a Variational Autoencoder (VAE) neural network that was trained on a corpus of specific style.  ...  Acknowledgment The author would like to thank the anonymous reviewers for the thorough and informative review.  ... 
doi:10.5281/zenodo.4285264 fatcat:gmamnhnaprhhzgye7bzftk4npe

A Framework for Content-Based Search in Large Music Collections

Tiange Zhu, Raphaël Fournier-S'niehotta, Philippe Rigaux, Nicolas Travers
2022 Big Data and Cognitive Computing  
We propose a general framework for building a scalable search engine, based on (i) a music description language that represents music content independently from a specific encoding, (ii) an extendible  ...  As a proof of concept, we also detail an actual implementation of the framework for searching in large collections of XML-encoded music scores, based on the popular ElasticSearch system.  ...  MNX [10] , or MEI [11, 12] ), music notation can also be seen as a support for music information processing.  ... 
doi:10.3390/bdcc6010023 fatcat:nm3xvru735fexlo34y2ksdg2ki

Finding structure in audio for music information retrieval

B. Pardo
2006 IEEE Signal Processing Magazine  
QUERY BY HUMMING: VOCAL SEARCH In the field of music information retrieval, melodic query by example has typically been cast as query by humming.  ...  Given a database of melodies encoded as note transitions, the best match to the query is found using the same probabilistic string-matching methods commonly used in the bioinformatics community to align  ...  CONCLUSIONS This article has presented a brief overview of recent approaches to two problems of great interest for music information retrieval: query by example and automated source separation.  ... 
doi:10.1109/msp.2006.1628889 fatcat:5k7qoy6gkvhr3ge3eekusawkey

Crystal (demonstration abstract)

Yuen-Hsien Tseng
1999 Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '99  
A pitch profile encoding is used for allowing queries in any key and an n-note indexing method is adopted for approximate matching in sublinear time.  ...  The overall effect is that the response time and search failure are both reduced even with more discrepancy between queries and the music data.  ... 
doi:10.1145/312624.312758 dblp:conf/sigir/Tseng99a fatcat:efmivi23mrhulovhk4f5sbzdxe

Semex - An Efficient Music Retrieval Prototype

Kjell Lemström, Sami Perttu
2000 Zenodo  
Acknowledgments The authors are grateful to Professor Esko Ukkonen for his support to this project.  ...  The setting for a content-based music information retrieval problem is as follows.  ...  A musical query pattern p = p 1 p 2 p m is a sequence of integers, more precisely, p i 2 , for i = 1 ; : : : m .  ... 
doi:10.5281/zenodo.1415907 fatcat:puxwy5ciwfeqvagecmtb3clrhe

Query by Humming Systems Using Melody Matching Model Based on the Genetic Algorithm

Jing Qin, Hongfei Lin, Xinyue Liu
2011 Journal of Software  
Query by humming (QBH) refers to music information retrieval systems where short audio clips of singing or humming act as queries.  ...  Index Terms-music information retrieval, melody contour representation, audio system  ...  SIMILARITY MATCHING Euclidean distance is the most widely used similarity measure for time series similarity research.  ... 
doi:10.4304/jsw.6.12.2416-2420 fatcat:g5zhrxn3nnaxvnqtpmxvo5z6g4

Exploring Robust Music Fingerprinting Methods With Data-driven Methodologies

Aditya Bhattacharjee, Marius Miron, Furkan Yesiler
2021 Zenodo  
and unique fin-gerprints for query search and retrieval.  ...  Music recognition tools have been one of the primary research problems in music information retrieval.  ...  This results in 33-times more query matching time for audio identification.  ... 
doi:10.5281/zenodo.5553864 fatcat:6x5lovub3fbqlkrq2asmig7bhm
« Previous Showing results 1 — 15 out of 11,050 results