SCORE PROCESSING FOR MIR

Donncha S.Ó. Maidín; Margaret Cahill

SCORE PROCESSING FOR MIR

Donncha S.Ó. Maidín
, Margaret Cahill

University of Limerick
Centre for Computational Musicology and Computer Music

Research output: Contribution to conference › Paper › peer-review

Abstract

The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, including some from music information retrieval. The score representation was designed for the development of general algorithms and applications. The common container-iterator paradigm is used, in which the score is modelled as a container of objects, such as clefs, key signatures, time signatures, notes, rests and barlines. Access to objects within the score is achieved through iterators. These iterators provide the developer with a mechanism for accessing the information content of the score. The iterators are designed to achieve a high level of data hiding, so that the user is shielded from the substantial underlying complexity of score representation, while at the same time, having access to the score’s full information content.

Original language	English
Pages	59-64
Number of pages	6
Publication status	Published - 2001
Event	2nd Annual International Symposium on Music Information Retrieval, ISMIR 2001 - Bloomington, United States Duration: 15 Oct 2001 → 17 Oct 2001

Conference

Conference	2nd Annual International Symposium on Music Information Retrieval, ISMIR 2001
Country/Territory	United States
City	Bloomington
Period	15/10/01 → 17/10/01

Cite this

@conference{b6fcfe3263524ac2b413a9f343d68fbb,

title = "SCORE PROCESSING FOR MIR",

abstract = "The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, including some from music information retrieval. The score representation was designed for the development of general algorithms and applications. The common container-iterator paradigm is used, in which the score is modelled as a container of objects, such as clefs, key signatures, time signatures, notes, rests and barlines. Access to objects within the score is achieved through iterators. These iterators provide the developer with a mechanism for accessing the information content of the score. The iterators are designed to achieve a high level of data hiding, so that the user is shielded from the substantial underlying complexity of score representation, while at the same time, having access to the score{\textquoteright}s full information content.",

author = "Maid{\'i}n, \{Donncha S.{\'O}.\} and Margaret Cahill",

note = "Publisher Copyright: {\textcopyright} ISMIR 2001 - 2nd Annual International Symposium on Music Information Retrieval. All rights reserved.; 2nd Annual International Symposium on Music Information Retrieval, ISMIR 2001 ; Conference date: 15-10-2001 Through 17-10-2001",

year = "2001",

language = "English",

pages = "59--64",

}

TY - CONF

T1 - SCORE PROCESSING FOR MIR

AU - Maidín, Donncha S.Ó.

AU - Cahill, Margaret

PY - 2001

Y1 - 2001

N2 - The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, including some from music information retrieval. The score representation was designed for the development of general algorithms and applications. The common container-iterator paradigm is used, in which the score is modelled as a container of objects, such as clefs, key signatures, time signatures, notes, rests and barlines. Access to objects within the score is achieved through iterators. These iterators provide the developer with a mechanism for accessing the information content of the score. The iterators are designed to achieve a high level of data hiding, so that the user is shielded from the substantial underlying complexity of score representation, while at the same time, having access to the score’s full information content.

AB - The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, including some from music information retrieval. The score representation was designed for the development of general algorithms and applications. The common container-iterator paradigm is used, in which the score is modelled as a container of objects, such as clefs, key signatures, time signatures, notes, rests and barlines. Access to objects within the score is achieved through iterators. These iterators provide the developer with a mechanism for accessing the information content of the score. The iterators are designed to achieve a high level of data hiding, so that the user is shielded from the substantial underlying complexity of score representation, while at the same time, having access to the score’s full information content.

UR - https://www.scopus.com/pages/publications/33845764668

M3 - Paper

AN - SCOPUS:33845764668

SP - 59

EP - 64

T2 - 2nd Annual International Symposium on Music Information Retrieval, ISMIR 2001

Y2 - 15 October 2001 through 17 October 2001

ER -

SCORE PROCESSING FOR MIR

Abstract

Conference

Other files and links

Fingerprint

Cite this