在历史乐谱的数字档案中集成作家识别的知识组件

I. Bruder, Temenushka Ignatova, Lars Milewski
{"title":"在历史乐谱的数字档案中集成作家识别的知识组件","authors":"I. Bruder, Temenushka Ignatova, Lars Milewski","doi":"10.1145/996350.996463","DOIUrl":null,"url":null,"abstract":"In our work we consider two different approaches to map documents into the feature space. On one hand, we use a semi-automatic, knowledge-based procedure to let musicology experts determine the set of feature values for a document manually. On the other hand, we plan the integration of an automatic approach for feature extraction based on image processing techniques. However, currently we deal only with the results from the manual mapping implementation. We use the features extracted from the collection of music scores, and the information in the distance matrices to cluster the scores according to their handwriting characteristics. In the best case, a cluster represents exactly one writer. For the clustering of the feature sets we use the k-nearest neighbor method. The distance between two feature sets, also referred to as \"feature vectors\", is derived using a normalized, weighted Hamming distance function. The Hamming distance returned better results than the Euclidean and other higher order distance functions, which were tested.","PeriodicalId":362133,"journal":{"name":"Proceedings of the 2004 Joint ACM/IEEE Conference on Digital Libraries, 2004.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Integrating knowledge components for writer identification in a digital archive of historical music scores\",\"authors\":\"I. Bruder, Temenushka Ignatova, Lars Milewski\",\"doi\":\"10.1145/996350.996463\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In our work we consider two different approaches to map documents into the feature space. On one hand, we use a semi-automatic, knowledge-based procedure to let musicology experts determine the set of feature values for a document manually. On the other hand, we plan the integration of an automatic approach for feature extraction based on image processing techniques. However, currently we deal only with the results from the manual mapping implementation. We use the features extracted from the collection of music scores, and the information in the distance matrices to cluster the scores according to their handwriting characteristics. In the best case, a cluster represents exactly one writer. For the clustering of the feature sets we use the k-nearest neighbor method. The distance between two feature sets, also referred to as \\\"feature vectors\\\", is derived using a normalized, weighted Hamming distance function. The Hamming distance returned better results than the Euclidean and other higher order distance functions, which were tested.\",\"PeriodicalId\":362133,\"journal\":{\"name\":\"Proceedings of the 2004 Joint ACM/IEEE Conference on Digital Libraries, 2004.\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 Joint ACM/IEEE Conference on Digital Libraries, 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/996350.996463\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2004 Joint ACM/IEEE Conference on Digital Libraries, 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/996350.996463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在我们的工作中,我们考虑了两种将文档映射到特征空间的不同方法。一方面,我们使用半自动的、基于知识的程序,让音乐学专家手动确定文档的特征值集。另一方面,我们计划集成一种基于图像处理技术的自动特征提取方法。然而,目前我们只处理手工映射实现的结果。我们使用从乐谱集合中提取的特征,以及距离矩阵中的信息,根据乐谱的笔迹特征对乐谱进行聚类。在最好的情况下,一个集群只代表一个写入器。对于特征集的聚类,我们使用k近邻方法。两个特征集之间的距离,也称为“特征向量”,是使用标准化的加权汉明距离函数导出的。汉明距离比欧几里得和其他高阶距离函数返回的结果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integrating knowledge components for writer identification in a digital archive of historical music scores
In our work we consider two different approaches to map documents into the feature space. On one hand, we use a semi-automatic, knowledge-based procedure to let musicology experts determine the set of feature values for a document manually. On the other hand, we plan the integration of an automatic approach for feature extraction based on image processing techniques. However, currently we deal only with the results from the manual mapping implementation. We use the features extracted from the collection of music scores, and the information in the distance matrices to cluster the scores according to their handwriting characteristics. In the best case, a cluster represents exactly one writer. For the clustering of the feature sets we use the k-nearest neighbor method. The distance between two feature sets, also referred to as "feature vectors", is derived using a normalized, weighted Hamming distance function. The Hamming distance returned better results than the Euclidean and other higher order distance functions, which were tested.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信