2011
Employing Subsequence Matching in Audio Data Processing
VOLNÝ, Petr; David NOVÁK a Pavel ZEZULAZákladní údaje
Originální název
Employing Subsequence Matching in Audio Data Processing
Autoři
VOLNÝ, Petr; David NOVÁK a Pavel ZEZULA
Vydání
Brno, FIMU-RS-2011-04, 2011
Nakladatel
Faculty of Informatics, Masaryk University, Brno
Další údaje
Jazyk
angličtina
Typ výsledku
Audiovizuální tvorba
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Česká republika
Utajení
není předmětem státního či obchodního tajemství
Odkazy
Kód RIV
RIV/00216224:14330/11:00049994
Organizační jednotka
Fakulta informatiky
Klíčová slova anglicky
audio retrieval; subsequnce matching; similarity search; time series
Štítky
Změněno: 18. 4. 2012 00:11, RNDr. Pavel Šmerk, Ph.D.
Anotace
V originále
We overview current problems of audio retrieval and time-series subsequence matching. We discuss the usage of subsequence matching approaches in audio data processing, especially in automatic speech recognition (ASR) area and we aim at improving performance of the retrieval process. To overcome the problems known from the time-series area like the occurrence of implementation bias and data bias we present a Subsequence Matching Framework as a tool for fast prototyping, building, and testing similarity search subsequence matching applications. The framework is build on top of MESSIF (Metric Similarity Search Implementation Framework) and thus the subsequence matching algorithms can exploit advanced similarity indexes in order to significantly increase their query processing performance. To prove our concept we provide a design of query-by-example spoken term detection type of application with the usage of phonetic posteriograms and subsequence matching approach.
Návaznosti
| GPP202/10/P220, projekt VaV |
| ||
| VF20102014004, projekt VaV |
|