音乐中基于压缩的几何模式发现

D. Meredith
{"title":"音乐中基于压缩的几何模式发现","authors":"D. Meredith","doi":"10.1109/CIP.2014.6844503","DOIUrl":null,"url":null,"abstract":"The purpose of musical analysis is to find the best possible explanations for musical objects, where such objects may range from single chords or phrases to entire musical corpora. Kolmogorov complexity theory suggests that the best possible explanation for an object is represented by the shortest possible description of it. Two compression algorithms, COSIATEC and SIATECCOMPRESS, are described that take point-set representations of musical objects as input and generate compressed encodings of these point sets as output. The algorithms were evaluated on a task in which 360 folk songs were classified into tune families using normalized compression distance, a 1-nn classifier and leave-one-out cross-validation. COSIATEC achieved a success rate of 84% on this task, compared with a success rate of 13% for a general-purpose compressor. Variants of the algorithms incorporating modifications that have been suggested in the literature were also run on the task and the results were compared.","PeriodicalId":117669,"journal":{"name":"2014 4th International Workshop on Cognitive Information Processing (CIP)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Compression-based geometric pattern discovery in music\",\"authors\":\"D. Meredith\",\"doi\":\"10.1109/CIP.2014.6844503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of musical analysis is to find the best possible explanations for musical objects, where such objects may range from single chords or phrases to entire musical corpora. Kolmogorov complexity theory suggests that the best possible explanation for an object is represented by the shortest possible description of it. Two compression algorithms, COSIATEC and SIATECCOMPRESS, are described that take point-set representations of musical objects as input and generate compressed encodings of these point sets as output. The algorithms were evaluated on a task in which 360 folk songs were classified into tune families using normalized compression distance, a 1-nn classifier and leave-one-out cross-validation. COSIATEC achieved a success rate of 84% on this task, compared with a success rate of 13% for a general-purpose compressor. Variants of the algorithms incorporating modifications that have been suggested in the literature were also run on the task and the results were compared.\",\"PeriodicalId\":117669,\"journal\":{\"name\":\"2014 4th International Workshop on Cognitive Information Processing (CIP)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 4th International Workshop on Cognitive Information Processing (CIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIP.2014.6844503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th International Workshop on Cognitive Information Processing (CIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIP.2014.6844503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

音乐分析的目的是为音乐对象找到最好的解释,这些对象可以从单个和弦或短语到整个音乐语料库。柯尔莫哥洛夫复杂性理论认为,对一个物体最好的解释就是用最短的描述来表示它。本文描述了两种压缩算法,COSIATEC和SIATECCOMPRESS,它们将音乐对象的点集表示作为输入,并生成这些点集的压缩编码作为输出。在一项任务中,使用归一化压缩距离、1-nn分类器和留一交叉验证将360首民歌分类为曲调族,对这些算法进行了评估。COSIATEC在此任务上的成功率为84%,而通用压缩机的成功率为13%。结合文献中建议的修改的算法变体也在任务上运行,并比较了结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Compression-based geometric pattern discovery in music
The purpose of musical analysis is to find the best possible explanations for musical objects, where such objects may range from single chords or phrases to entire musical corpora. Kolmogorov complexity theory suggests that the best possible explanation for an object is represented by the shortest possible description of it. Two compression algorithms, COSIATEC and SIATECCOMPRESS, are described that take point-set representations of musical objects as input and generate compressed encodings of these point sets as output. The algorithms were evaluated on a task in which 360 folk songs were classified into tune families using normalized compression distance, a 1-nn classifier and leave-one-out cross-validation. COSIATEC achieved a success rate of 84% on this task, compared with a success rate of 13% for a general-purpose compressor. Variants of the algorithms incorporating modifications that have been suggested in the literature were also run on the task and the results were compared.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A closer look at deep learning neural networks with low-level spectral periodicity features Compression-based geometric pattern discovery in music A comparative study of two popular families of sparsity-aware adaptive filters Amplitude of N400 component unaffected by lexical priming for moderately constraining sentences Laplace approximation with Gaussian Processes for volatility forecasting
×
引用
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