Clustering of Strokes from Pen-Based Music Notation: An Experimental Study

A comfortable way of digitizing a new music composition is by using a pen-based recognition system, in which the digital score is created with the sole effort of the composition itself. In this kind of systems, the input consist of a set of pen strokes. However, it is hitherto unclear the different types of strokes that must be considered for this task. This paper presents an experimental study on automatic labeling of these strokes using the well-known k-medoids algorithm. Since recognition of pen-based music scores is highly related to stroke recognition, it may be profitable to repeat the process when new data is received through user interaction. Therefore, our intention is not to propose some stroke labeling but to show which stroke dissimilarities perform better within the clustering process. Results show that there can be found good methods in the trade-off between cluster complexity and classification accuracy, whereas others offer a very poor performance.

[1]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[2]  Renato Cordeiro de Amorim,et al.  Constrained clustering with Minkowski Weighted K-Means , 2012 .

[3]  Lior Rokach,et al.  Data Mining And Knowledge Discovery Handbook , 2005 .

[4]  Alex Waibel,et al.  Readings in speech recognition , 1990 .

[5]  Per Ola Kristensson,et al.  Continuous Recognition and Visualization of Pen Strokes and Touch-Screen Gestures , 2011, SBIM.

[6]  Lior Rokach,et al.  A survey of Clustering Algorithms , 2010, Data Mining and Knowledge Discovery Handbook.

[7]  Timothy C. Bell,et al.  The Challenge of Optical Music Recognition , 2001, Comput. Humanit..

[8]  John Benjafield,et al.  Cognition, 3rd ed. , 2007 .

[9]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[10]  Juan Ramón Rico-Juan,et al.  Confidence voting method ensemble applied to off-line signature verification , 2012, Pattern Analysis and Applications.

[11]  Carlos Guedes,et al.  Optical music recognition: state-of-the-art and open issues , 2012, International Journal of Multimedia Information Retrieval.

[12]  Sergios Theodoridis,et al.  Pattern Recognition, Third Edition , 2006 .

[13]  José Oncina,et al.  Recognition of Pen-Based Music Notation: The HOMUS Dataset , 2014, 2014 22nd International Conference on Pattern Recognition.

[14]  Jin Hyung Kim,et al.  Online Handwriting Recognition , 2014, Handbook of Document Image Processing and Recognition.

[15]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

[16]  Claire Cardie,et al.  Proceedings of the Eighteenth International Conference on Machine Learning, 2001, p. 577–584. Constrained K-means Clustering with Background Knowledge , 2022 .

[17]  Juan Ramón Rico-Juan,et al.  Edit Distance for Ordered Vector Sets: A Case of Study , 2006, SSPR/SPR.

[18]  Jaime S. Cardoso,et al.  Optical recognition of music symbols , 2010, International Journal on Document Analysis and Recognition (IJDAR).

[19]  Francisco Herrera,et al.  Data Preprocessing in Data Mining , 2014, Intelligent Systems Reference Library.

[20]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .