arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.2541cs.SDcs.DB
收藏

音频数据处理中的子序列匹配

Employing Subsequence Matching in Audio Data Processing

Faculty of Informatics, Masaryk University(马萨里克大学信息学院)

Petr Volny, David Novak, Pavel Zezula

摘要:

我们概述了当前的问题,音频检索和时间序列子序列匹配。我们讨论了使用子序列匹配方法在音频数据处理,特别是在自动语音识别(ASR)领域,我们的目标是提高性能的检索过程。为了克服已知的问题,从时间序列领域的实现偏差和数据偏差的发生,我们提出了一个子序列匹配框架作为快速原型设计,建设和测试相似性搜索子序列匹配应用程序的工具。该框架是建立在MESSIF(度量相似性搜索实现框架)之上,因此,子序列匹配算法可以利用先进的相似性索引,以显着提高其查询处理性能。为了证明我们的概念,我们提供了一个查询的例子口语术语检测类型的应用程序与使用的语音后验图和子序列匹配方法的设计。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑