降低计算复杂度的高匹配深度音频指纹识别

V. Kamesh, Nagarjuna Pampana, Mohit Sinha, S. Bandopadhaya
{"title":"降低计算复杂度的高匹配深度音频指纹识别","authors":"V. Kamesh, Nagarjuna Pampana, Mohit Sinha, S. Bandopadhaya","doi":"10.1109/ICRIEECE44171.2018.9009156","DOIUrl":null,"url":null,"abstract":"In this paper, a novel audio fingerprint technique with higher matching depth at a reduced computational complexity has been proposed. Any audio clip can be identified from a huge audio collection by its audio fingerprint which contains some unique extractable and perceivable features of it. One of the major concern in the process of identification of a sample audio clip from huge audio collection is the computational complexity involved in it. In proposed technique, peak pairs are chosen from the alternate time bins sorted in the descending order of the amplitude of the spectrogram of the audio file under consideration, as opposed to the sequential selection across consecutive time bins in the decreasing order of their amplitude in the basic methods. This paper also proposes a simple mode based ranking algorithm to provide the user with multiples matches in case of a possible false positive match.","PeriodicalId":393891,"journal":{"name":"2018 International Conference on Recent Innovations in Electrical, Electronics & Communication Engineering (ICRIEECE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Audio Fingerprinting with Higher Matching Depth at Reduced Computational Complexity\",\"authors\":\"V. Kamesh, Nagarjuna Pampana, Mohit Sinha, S. Bandopadhaya\",\"doi\":\"10.1109/ICRIEECE44171.2018.9009156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel audio fingerprint technique with higher matching depth at a reduced computational complexity has been proposed. Any audio clip can be identified from a huge audio collection by its audio fingerprint which contains some unique extractable and perceivable features of it. One of the major concern in the process of identification of a sample audio clip from huge audio collection is the computational complexity involved in it. In proposed technique, peak pairs are chosen from the alternate time bins sorted in the descending order of the amplitude of the spectrogram of the audio file under consideration, as opposed to the sequential selection across consecutive time bins in the decreasing order of their amplitude in the basic methods. This paper also proposes a simple mode based ranking algorithm to provide the user with multiples matches in case of a possible false positive match.\",\"PeriodicalId\":393891,\"journal\":{\"name\":\"2018 International Conference on Recent Innovations in Electrical, Electronics & Communication Engineering (ICRIEECE)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Recent Innovations in Electrical, Electronics & Communication Engineering (ICRIEECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRIEECE44171.2018.9009156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Recent Innovations in Electrical, Electronics & Communication Engineering (ICRIEECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRIEECE44171.2018.9009156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种新的音频指纹识别技术,在降低计算复杂度的同时具有更高的匹配深度。任何音频片段都可以通过其音频指纹从庞大的音频集合中识别出来,音频指纹包含了一些独特的可提取和可感知的特征。从海量音频集合中识别样本音频剪辑的主要问题之一是其涉及的计算复杂性。在所提出的技术中,峰值对是从按考虑的音频文件的频谱图幅度降序排序的交替时间桶中选择的,而不是在基本方法中按其幅度降序在连续时间桶中进行顺序选择。本文还提出了一种简单的基于模式的排序算法,以便在可能出现误报匹配的情况下为用户提供多个匹配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Audio Fingerprinting with Higher Matching Depth at Reduced Computational Complexity
In this paper, a novel audio fingerprint technique with higher matching depth at a reduced computational complexity has been proposed. Any audio clip can be identified from a huge audio collection by its audio fingerprint which contains some unique extractable and perceivable features of it. One of the major concern in the process of identification of a sample audio clip from huge audio collection is the computational complexity involved in it. In proposed technique, peak pairs are chosen from the alternate time bins sorted in the descending order of the amplitude of the spectrogram of the audio file under consideration, as opposed to the sequential selection across consecutive time bins in the decreasing order of their amplitude in the basic methods. This paper also proposes a simple mode based ranking algorithm to provide the user with multiples matches in case of a possible false positive match.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信