{"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}
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.