基于感知哈希的加密语音检索算法

Huan Zhao, Shaofang He
{"title":"基于感知哈希的加密语音检索算法","authors":"Huan Zhao, Shaofang He","doi":"10.1109/FSKD.2016.7603458","DOIUrl":null,"url":null,"abstract":"In order to further improve the robustness and discrimination of perceptual hashing and retrieval speed in large-scale data, a novel retrieval algorithm over encrypted speech is proposed. Before encrypted speech is uploaded, perceptual hashing sequences must be embedded as a digital watermark. In the process of generating perceptual hashing, multifractal characteristic of speech that has good distinctiveness and robustness is introduced, and the technology of piecewise aggregate approximation is used for compressing data size. The retrieval process does not need decryption but requires the generation of perceptual hashing sequence of query speech segment. Each perceptual hashing set in system hash table should then be matched successively. Experimental results indicate that the perceptual hashing generated from multifractal characteristics shows better distinctiveness and robustness than those derived from time and frequency domain features in existing methods. Furthermore, because of employing the technology of piecewise aggregate approximation, the generated perceptual hashing has small amounts of data, which leads to the greatly improvement of retrieval speed. And finally, the proposed retrieval algorithm achieves high recall and precision ratios in terms of the variety of content holding operation.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"A retrieval algorithm for encrypted speech based on perceptual hashing\",\"authors\":\"Huan Zhao, Shaofang He\",\"doi\":\"10.1109/FSKD.2016.7603458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to further improve the robustness and discrimination of perceptual hashing and retrieval speed in large-scale data, a novel retrieval algorithm over encrypted speech is proposed. Before encrypted speech is uploaded, perceptual hashing sequences must be embedded as a digital watermark. In the process of generating perceptual hashing, multifractal characteristic of speech that has good distinctiveness and robustness is introduced, and the technology of piecewise aggregate approximation is used for compressing data size. The retrieval process does not need decryption but requires the generation of perceptual hashing sequence of query speech segment. Each perceptual hashing set in system hash table should then be matched successively. Experimental results indicate that the perceptual hashing generated from multifractal characteristics shows better distinctiveness and robustness than those derived from time and frequency domain features in existing methods. Furthermore, because of employing the technology of piecewise aggregate approximation, the generated perceptual hashing has small amounts of data, which leads to the greatly improvement of retrieval speed. And finally, the proposed retrieval algorithm achieves high recall and precision ratios in terms of the variety of content holding operation.\",\"PeriodicalId\":373155,\"journal\":{\"name\":\"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2016.7603458\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2016.7603458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

为了进一步提高大规模数据中感知哈希的鲁棒性、识别率和检索速度,提出了一种基于加密语音的检索算法。在上传加密语音之前,必须将感知哈希序列作为数字水印嵌入。在生成感知哈希的过程中,引入了语音的多重分形特征,该特征具有良好的显著性和鲁棒性,并采用分段聚合近似技术压缩数据大小。检索过程不需要解密,但需要生成查询语音段的感知哈希序列。然后依次匹配系统哈希表中的每个感知哈希集。实验结果表明,由多重分形特征生成的感知哈希比现有方法中由时域和频域特征生成的感知哈希具有更好的显著性和鲁棒性。此外,由于采用了分段聚合近似技术,生成的感知哈希数据量小,大大提高了检索速度。最后,本文提出的检索算法在内容保持操作的多样性方面实现了较高的查全率和查准率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A retrieval algorithm for encrypted speech based on perceptual hashing
In order to further improve the robustness and discrimination of perceptual hashing and retrieval speed in large-scale data, a novel retrieval algorithm over encrypted speech is proposed. Before encrypted speech is uploaded, perceptual hashing sequences must be embedded as a digital watermark. In the process of generating perceptual hashing, multifractal characteristic of speech that has good distinctiveness and robustness is introduced, and the technology of piecewise aggregate approximation is used for compressing data size. The retrieval process does not need decryption but requires the generation of perceptual hashing sequence of query speech segment. Each perceptual hashing set in system hash table should then be matched successively. Experimental results indicate that the perceptual hashing generated from multifractal characteristics shows better distinctiveness and robustness than those derived from time and frequency domain features in existing methods. Furthermore, because of employing the technology of piecewise aggregate approximation, the generated perceptual hashing has small amounts of data, which leads to the greatly improvement of retrieval speed. And finally, the proposed retrieval algorithm achieves high recall and precision ratios in terms of the variety of content holding operation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel electrons drifting algorithm for non-linear optimization problems Performance assessment of fault classifier of chemical plant based on support vector machine A theoretical line losses calculation method of distribution system based on boosting algorithm Building vietnamese dependency treebank based on Chinese-Vietnamese bilingual word alignment Optimizing self-adaptive gender ratio of elephant search algorithm by min-max strategy
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1