Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval

2003 ◽  
pp. 224-237 ◽  
Author(s):  
Kjell Lemström ◽  
Gonzalo Navarro
Keyword(s):  
Music Retrieval ◽  
Approximate Matching ◽  
Parallel Techniques

scholarly journals Efficient Retrieval of Music Recordings Using Graph-Based Index Structures

Signals ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 336-352
Author(s):  
Frank Zalkow ◽  
Julian Brandner ◽  
Meinard Müller
Keyword(s):  
Nearest Neighbor ◽  
Response Times ◽  
Negative Impact ◽  
Nearest Neighbor Search ◽  
Index Structure ◽  
Search Problem ◽  
Index Structures ◽  
Music Retrieval ◽  
Retrieval Systems ◽  
Music Recordings

Flexible retrieval systems are required for conveniently browsing through large music collections. In a particular content-based music retrieval scenario, the user provides a query audio snippet, and the retrieval system returns music recordings from the collection that are similar to the query. In this scenario, a fast response from the system is essential for a positive user experience. For realizing low response times, one requires index structures that facilitate efficient search operations. One such index structure is the K-d tree, which has already been used in music retrieval systems. As an alternative, we propose to use a modern graph-based index, denoted as Hierarchical Navigable Small World (HNSW) graph. As our main contribution, we explore its potential in the context of a cross-version music retrieval application. In particular, we report on systematic experiments comparing graph- and tree-based index structures in terms of the retrieval quality, disk space requirements, and runtimes. Despite the fact that the HNSW index provides only an approximate solution to the nearest neighbor search problem, we demonstrate that it has almost no negative impact on the retrieval quality in our application. As our main result, we show that the HNSW-based retrieval is several orders of magnitude faster. Furthermore, the graph structure also works well with high-dimensional index items, unlike the tree-based structure. Given these merits, we highlight the practical relevance of the HNSW graph for music information retrieval (MIR) applications.

MUSEMBLE: A novel music retrieval system with automatic voice query transcription and reformulation

2008 ◽  
Vol 81 (7) ◽  
pp. 1065-1080 ◽  
Author(s):  
Seungmin Rho ◽  
Byeong-jun Han ◽  
Eenjun Hwang ◽  
Minkoo Kim
Keyword(s):  
Retrieval System ◽  
Music Retrieval

Approximate Matching of Digital Point Sets Using a Novel Angular Tree

2009 ◽  
Vol 31 (5) ◽  
pp. 769-782 ◽  
Author(s):  
P. Bhowmick ◽  
R.K. Pradhan ◽  
B.B. Bhattacharya
Keyword(s):  
Point Sets ◽  
Approximate Matching

MULTI-VERSION MUSIC SEARCH USING ACOUSTIC FEATURE UNION AND EXACT SOFT MAPPING

2009 ◽  
Vol 03 (02) ◽  
pp. 209-234 ◽  
Author(s):  
YI YU ◽  
KAZUKI JOE ◽  
VINCENT ORIA ◽  
FABIAN MOERCHEN ◽  
J. STEPHEN DOWNIE ◽  
...  
Keyword(s):  
Collision Probability ◽  
Acoustic Feature ◽  
Music Retrieval ◽  
Feature Sets ◽  
Soft Mapping ◽  
Audio Features ◽  
Music Audio ◽  
Locality Sensitive Hash ◽  
Principle Of Similarity ◽  
Search Quality

Research on audio-based music retrieval has primarily concentrated on refining audio features to improve search quality. However, much less work has been done on improving the time efficiency of music audio searches. Representing music audio documents in an indexable format provides a mechanism for achieving efficiency. To address this issue, in this work Exact Locality Sensitive Mapping (ELSM) is suggested to join the concatenated feature sets and soft hash values. On this basis we propose audio-based music indexing techniques, ELSM and Soft Locality Sensitive Hash (SoftLSH) using an optimized Feature Union (FU) set of extracted audio features. Two contributions are made here. First, the principle of similarity-invariance is applied in summarizing audio feature sequences and utilized in training semantic audio representations based on regression. Second, soft hash values are pre-calculated to help locate the searching range more accurately and improve collision probability among features similar to each other. Our algorithms are implemented in a demonstration system to show how to retrieve and evaluate multi-version audio documents. Experimental evaluation over a real "multi-version" audio dataset confirms the practicality of ELSM and SoftLSH with FU and proves that our algorithms are effective for both multi-version detection (online query, one-query vs. multi-object) and same content detection (batch queries, multi-queries vs. one-object).

Minimodel of semantic synthesis of Russian sentences

2021 ◽  
Vol 44 (1) ◽  
pp. 101-136
Author(s):  
Lidija Iordanskaja ◽  
Igor Mel’čuk
Keyword(s):  
Semantic Representation ◽  
Conceptual Representation ◽  
Syntactic Structures ◽  
Approximate Matching ◽  
Sufficient Detail

Abstract A formal linguistitic model is presented, which produces, for a given conceptual representation of an extralinguistic situation, a corresponding semantic representation [SemR] that, in its turn, underlies the deep-syntactic representations of four near-synonymous Russian sentences expressing the starting information. Two full-fledged lexical entries are given for the lexemes besporjadki ‘disturbance’ and stolknovenie ‘clash(N)’, appearing in these sentences. Some principles of lexicalization – that is, matching the formal lexicographic definitions to the starting semantic representation in order to produce the deep-syntactic structures of the corresponding sentences – are formulated and illustrated; the problem of approximate matching is dealt with in sufficient detail.

scholarly journals Cross-Modal Music Retrieval and Applications: An Overview of Key Methodologies

2019 ◽  
Vol 36 (1) ◽  
pp. 52-62 ◽  
Author(s):  
Meinard Mueller ◽  
Andreas Arzt ◽  
Stefan Balke ◽  
Matthias Dorfer ◽  
Gerhard Widmer
Keyword(s):  
Music Retrieval ◽  
Modal Music
Sign in / Sign up

Export Citation Format

Share Document