音乐哼唱检索技术在WEB上的应用

将基于内容的哼唱检索技术用于WEB上。首先阐述了音乐检索现状,并对基于内容的音乐检索过程进行了详细地分析,然后介绍了WEB的相关技术,提出了将音乐检索技术用于WEB的思路,最后对全文归纳总结,并对进一步的工作进行了展望。     

一种启发式的用哼唱检索音乐的层次化方法

“用哼唱检索音乐”是一种友好的基于内容的音乐检索方法,它已经引起了广泛的研究兴趣;在对音乐库做了统计分析的基础上,总结了一些启发式规则,帮助对哼唱输入进行基音检测、音符分割,哼唱输入表达为音高轮廓图和节奏,音乐库中的音乐按音乐的节奏类型分为不同的节奏区域,并从每首音乐中抽取旋律轮廓图和节奏信息,用递归神经网络记忆旋律轮廓,音乐库的索引是神经网络的权值矩阵,将哼唱输入与音乐库中的音乐匹配的过程就是计算神经网络的输出过程。实验结果显示了所提方法的有效性。     

一种哼唱检索的新方法

文章提出了一种近似旋律匹配的新方法--线性对齐匹配法.与已有的基于内容的音乐检索不同,该算法并非基于近似符号串匹配、统计模型或者特征空间,而是根据相近旋律的音高轮廓在几何上的相似性,将音高和节奏特征一并考虑设计而成的全新算法.在含有1652首乐曲的搜索空间中,检索57段人声哼唱,该方法取得了93%的前3位命中率.这一实验结果表明了线性对齐匹配法的有效性,及其应用于大型数字音乐检索引擎的可行性.     

一种改进的哼唱式音乐检索方法

针对哼唱式音乐检索的非准确性,本文提出了一种新的旋律表示方法,并根据旋律的表示采用了两次匹配算法,将相似度最高的乐曲输出。实验结果表明,该方法提高了哼唱式音乐检索的准确率。     

基于哼唱的音乐检索应用系统

通过研究哼唱旋律基频提取和检索算法,给出了一个完整的基于哼唱的音乐检索系统框架。系统主要分析了旋律特征提取和近似旋律匹配部分。旋律特征提取部分采用基于差分Mel倒谱法求基频;旋律匹配部分对经典的动态时间弯折算法原理分析后,根据声音特征引入音长差序列的余弦相似度,提高了检索效率和精度。在340首MIDI歌曲的测试集上,前三位识别效率提高3.7%,用时降低16%,系统的性能有明显改善。     

基于色彩共生矩阵的图像检索方法

本文介绍了基于色彩共生矩阵的图像检索方法。在灰度共生矩阵的基础上,我们提出了色彩共生矩阵的概念,并从中提取出颜色和纹理特征进行图像检索。该算法易于实现,特征库简洁、高速、且具有较好的检索效果。     

简析基于内容的音乐检索

基于内容的音乐信息检索就是把音乐本身的内涵作为查询条件,对一个由不同格式音频媒体所构成的音乐数据库实施查询的过程。文章全面总结了这一领域所取得的主要研究成果,重点介绍了在音频符号序列音乐检索和波形音乐数据检索中所使用的各种智能分析检索方法．并列举了当前较具规模和影响力的项目和系统。     

语音查询项检索中的两阶段得分规整方法*

得分规整为语音查询项检索系统中的必要过程,文中提出两阶段得分规整方法.先引入rank-p和relative-to-max这2个特征至区分性得分规整方法中,使正确候选结果和错误候选结果的置信度得分区分性更大,更易进行关键词确认.再应用基于优化查询项权重代价指标的得分规整方法得到最优的语音查询项检索性能.实验表明,文中方法同时利用区分性和基于优化查询项权重代价指标得分规整方法的优点,相比最佳单一得分规整方法性能更优.     

基于隐含语义分析的音乐检索

为提高音乐检索效率,使检索结果与搜索目的更接近,提出了基于隐含语义分析的音乐检索方法.将曲谱表示为标准音符和音转的交替串,基于每个交替串使用频率高于包含它的多交替串排列的事实,设计了音乐词汇统计算法.为使各分句能整齐地转化为相同维数的向量,使用最长的分句长度作为标准维数,基于增加频率和的原则进行单词的重新分割.实验结果表明,基于隐含语义分析的检索能获得令人满意的检索结果.     

软阈值共生矩阵的图像纹理检索

利用软阈值和循环共生矩阵技术,对经典共生矩阵算法进行了改进。在不影响检索效果的情况下,检索效率大为提高,改进了经典算法的性能。     

Analysis of Vowels in Sung Queries for a Music Information Retrieval System

A method for analyzing and categorizing the vowels of a sung query is described and analyzed. This query system uses a combination of spectral analysis and parametric clustering techniques to divide a single query into different vowel regions. The method is applied separately to each query, so no training or repeated measures are necessary. The vowel regions are then transformed into strings and string search methods are used to compare the results from various songs. We apply this method to a small pilot study consisting of 40 sung queries from each of 7 songs. Approximately 60% of the queries are correctly identified with their corresponding song, using only the vowel stream as the identifier.     

一种新的近似旋律匹配方法及其在哼唱检索系统中的应用

提出了一种近似旋律匹配(approximate meltlody matching)的新方法——线性对齐匹配法,并在此基础上实现了一个哼唱检索(queryby humming)系统原型．与已有的基于内容的音乐检索(content-based music retrieval)不同,该算法并非基于近似符号串匹配、统计模型或者特征空间,而是根据相近旋律的音高轮廓在几何上的相似性,将音高和节奏特征一并考虑所设计而成的全新算法．通过实验检验该算法的有效性,在含有3864首乐曲的搜索空间中,检索62段人声哼唱,线性对齐匹配法取得了90．3％的前3位命中率,相比传统的近似符号匹配算法高出11％以上．这一实验结果有力地表明了线性对齐匹配法的有效性,及其应用于大型数字音乐检索引擎的可行性．     

Robust Polyphonic Music Retrieval with N-grams

In this paper we investigate the retrieval performance of monophonic and polyphonic queries made on a polyphonic music database. We extend the n-gram approach for full-music indexing of monophonic music data to polyphonic music using both rhythm and pitch information. We define an experimental framework for a comparative and fault-tolerance study of various n-gramming strategies and encoding levels. For monophonic queries, we focus in particular on query-by-humming systems, and for polyphonic queries on query-by-example. Error models addressed in several studies are surveyed for the fault-tolerance study. Our experiments show that different n-gramming strategies and encoding precision differ widely in their effectiveness. We present the results of our study on a collection of 6366 polyphonic MIDI-encoded music pieces.     

有效的哼唱旋律基音提取方法研究与实现

为使用户可以通过哼唱音乐片段的方式,在较大规模乐曲库中能实时、准确、快速搜索到目标歌曲,结合多种音乐的乐理特点和音乐的数字化表示,提出考虑周期性测度改进传统端点检测方案,并综合线性预测分析（LPC）和相关函数与削波法相结合的方法进行旋律基音提取。实验表明利用LPC仅仅保留声门激励信号的特点,有效地减少了声道共振峰的影响,而采用削波法也一定程度减少噪声的干扰并使得计算相关函数的运算量大为减少,更显著的是考虑周期性测度的端点检测可以找到更精确的语音段,可以准确提取旋律并有效达到哼唱检索实时性要求。     

The design and implementation of a digital music library

The design and implementation of Harbin Institute of Technology—Digital Music Library (HIT-DML) is presented in this paper. Firstly, a novel framework, a music data model, and a query language are proposed as the theoretical foundation of the library. Secondly, music computing algorithms used in the library for feature extracting and matching are described. In addition, indices are introduced for both mining themes of music objects and accelerating content-based information retrieval. Finally, experimental results on the indices and the current development of the library are provided. HIT-DML is distinguished by the following points. First, it is inherently based on database systems, and combines database technologies with multimedia technologies seamlessly. Musical data are structurally stored. Second, it has a solid theoretical foundation, from framework and data model to query language. Last, it can retrieve musical information based on content against different kinds of musical instruments. The indices used, also power the library.     

The uses and gratifications of using Facebook music listening applications

Despite rapid adoption of social media as a means of music listening, little is known about users’ motivations. This study applies the uses and gratifications approach to users’ motivations for using music listening applications on Facebook. Participants completed an online survey, and 153 out of 576 respondents indicated that they used a Facebook music listening application. A principal axis factor analysis identified three different motivations for this usage, namely entertainment, communication, and habitual diversion gratifications. The entertainment and communication gratifications replicate those found in prior uses and gratifications research concerning other social networking features, illustrating the strong similarity between uses of music and social media. However, the habitual diversion gratification may serve to distinguish listening applications from other features. Identifying and explaining these factors is relevant to social media users, musicians and application designers, as they explain what motivates a means of music listening that is gaining prominence.     

Composition and Retrieval of Visual Information for Video Databases

This paper presents a new visual aggregation model for representing visual information about moving objects in video data. Based on available automatic scene segmentation and object tracking algorithms, the proposed model provides eight operations to calculate object motions at various levels of semantic granularity. It represents trajectory, color and dimensions of a single moving object and the directional and topological relations among multiple objects over a time interval. Each representation of a motion can be normalized to improve computational cost and storage utilization. To facilitate query processing, there are two optimal approximate matching algorithms designed to match time-series visual features of moving objects. Experimental results indicate that the proposed algorithms outperform the conventional subsequence matching methods substantially in the similarity between the two trajectories. Finally, the visual aggregation model is integrated into a relational database system and a prototype content-based video retrieval system has been implemented as well.     

The parallel computation of eigenvalues and eigenvectors of large Hermitian matrices using the AMT DAP 510

The solution of the algebraic eigenvalue problem is an important component of many applications in science and engineering. With the advent of novel architecture machines, much research effort is now being expended in the search for parallel algorithms for the computation of eigensystems which can gainfully exploit the processing power which these machines provide. Among important recent work References 1-4 address the real symmetric eigenproblem in both its dense and sparse forms, Reference 5 treats the unsymmetric eigenproblem, and Reference 6 investigates the solution of the generalized eigenproblem. In this paper two algorithms for the parallel computation of the eigensolution of Hermitian matrices on an array processor are presented. These algorithms are based on the Parallel Orthogonal Transformation algorithm (POT) for the solution of real symmetric matrices[7,8]. POT was developed to exploit the SIMD parallelism supported by array processors such as the AMT DAP 510. The new algorithms use the highly efficient implementation strategies devised for use in POT. The implementations of the algorithms permit the computation of the eigensolution of matrices whose order exceeds the mesh size of the array processor used. A comparison of the efficiency of the two algorithms for the solution of a variety of matrices is given.     

The effects of using a portable music player on simulated driving performance and task-sharing strategies

This study examined the effects of performing scrollable music selection tasks using a portable music player (iPod Touch™) on simulated driving performance and task-sharing strategies, as evidenced through eye glance behaviour and secondary task performance. A total of 37 drivers (18–48 yrs) completed the PC-based MUARC Driver Distraction Test (DDT) while performing music selection tasks on an iPod Touch. Drivers’ eye glance behaviour was examined using faceLAB eye tracking equipment. Results revealed that performing music search tasks while driving increased the amount of time that drivers spent with their eyes off the roadway and decreased their ability to maintain a constant lane position and time headway from a lead vehicle. There was also evidence, however, that drivers attempted to regulate their behaviour when distracted by decreasing their speed and taking a large number of short glances towards the device. Overall, results suggest that performing music search tasks while driving is problematic and steps to prohibit this activity should be taken.