A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. F...A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.展开更多
In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type f...In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type fixed point theorem are obtained.展开更多
提出了一种近似旋律匹配(approximate melody matching)的新方法——线性对齐匹配法,并在此基础上实现了一个哼唱检索(query by humming)系统原型.与已有的基于内容的音乐检索(content-based music retrieval)不同,该算法并非基于近似...提出了一种近似旋律匹配(approximate melody matching)的新方法——线性对齐匹配法,并在此基础上实现了一个哼唱检索(query by humming)系统原型.与已有的基于内容的音乐检索(content-based music retrieval)不同,该算法并非基于近似符号串匹配、统计模型或者特征空间,而是根据相近旋律的音高轮廓在几何上的相似性,将音高和节奏特征一并考虑所设计而成的全新算法.通过实验检验该算法的有效性,在含有3864首乐曲的搜索空间中,检索62段人声哼唱,线性对齐匹配法取得了90.3％的前3位命中率,相比传统的近似符号匹配算法高出11％以上.这一实验结果有力地表明了线性对齐匹配法的有效性,及其应用于大型数字音乐检索引擎的可行性.展开更多
文摘A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.
基金This work is supported by the Scientific Research Foundation of Bijie University.
文摘In this article, a Ky Fan matching theorem for transfer compactly open covers is established. As applications, a Fan-Browder coincidence theorem, a Ky Fan best approximation theorem and a Brouwer-Schauder-Rothe type fixed point theorem are obtained.
基金supported by the National 111 Project of China(Grant No.B17050)China Ministry of Education Project of the Humanity and Social Science Research Foundation(Grant No.19YJC790150).
文摘提出了一种近似旋律匹配(approximate melody matching)的新方法——线性对齐匹配法,并在此基础上实现了一个哼唱检索(query by humming)系统原型.与已有的基于内容的音乐检索(content-based music retrieval)不同,该算法并非基于近似符号串匹配、统计模型或者特征空间,而是根据相近旋律的音高轮廓在几何上的相似性,将音高和节奏特征一并考虑所设计而成的全新算法.通过实验检验该算法的有效性,在含有3864首乐曲的搜索空间中,检索62段人声哼唱,线性对齐匹配法取得了90.3％的前3位命中率,相比传统的近似符号匹配算法高出11％以上.这一实验结果有力地表明了线性对齐匹配法的有效性,及其应用于大型数字音乐检索引擎的可行性.
