检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军信息工程大学信息系统工程学院,河南郑州450002
出 处:《信号处理》2013年第6期743-752,共10页Journal of Signal Processing
基 金:国家自然科学基金(61175017)资助项目
摘 要:提出了一种融合音素边界信息的语音样例快速检索方法。该方法首先提取查询样例和测试集的音素后验概率;然后,运用层次凝聚聚类算法将音素后验概率序列分段(即音素边界检测),计算每个分段的平均向量并将其分别组成新查询和新索引,再运用动态时间规整进行语音样例的检索;最后,使用虚拟相关反馈技术对检索结果进行修正。实验结果表明:尽管此方法的检索精度略低于直接运用动态时间规整进行检索的检索精度,但其检索速度大大优于后者,且与其他相关文献提出的方法相比,此方法在检索速度方面也具有明显优势。This paper presents a method of fast query-by-example spoken term detection ( QbE STD) integrating the phoneme boundary Information. According to this method, the phoneme posterior probabilities of query examples and test materials should be extracted firstly, and then phoneme posterior probabilities are segmented into segment sequences using hierarchical agglomerative clustering(HAC) algorithm( phoneme boundary detection), new queries and new indexes can be composed of the expectation vectors of the segment sequences. The dynamic time warping(DTW) procedure is formulated to implement QbE STD. Finally, the detection results can be modified by pseudo relevance feedback (PRF). The experimental results indicate that although the method presented by the paper has a slight reduction of the detection performance as compared with DTW, there is a great advantage over the latter in the detection speed, and compared with the method presented by other paper,the method presented by the paper also has far more superiorities in the detection speed.
关 键 词:音素后验概率 层次凝聚聚类 动态时间规整 虚拟相关反馈
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229