Chord recognition from symbolic data is a complex task, due to its strong context dependency and the large number of possible combinations of the intervals which the chords are made of, specially when dealing with dissonances, such as 7, 9, 13 and suspended chords. None of the current approaches deal with such complexity. Most of them consider only simple chord patterns, in the best cases, incl...

A circle graph is the intersection graph of a set of chords on a circle. A graph is Helly circle if there is a model of chords satisfying the Helly property. In 2003 it was conjectured that Helly circle graphs are exactly diamond-free circle graphs. In this work, we propose a method to compress any Helly circle representation of a graph and give some ideas to advance in an inductive proof of th...

MAPS – standing for MIDI Aligned Piano Sounds – is a database of MIDI-annotated piano recordings. MAPS has been designed in order to be released in the music information retrieval research community, especially for the development and the evaluation of algorithms for single-pitch or multipitch estimation and automatic transcription of music. It is composed by isolated notes, random-pitch chords...

In this investigation we propose a novel approach for classifying polyphonic melodies. Our main idea comes from for automatic classi cation of polyphonic melodies by Hidden Markov model where the states correspond to well-tempered chords over the music and the observation sequences to some feature values called pitch spectrum. The similarity among harmonies can be considered by means of the fea...

This article relates two categories of music-theoretical graphs, in which points represent notes and chords, respectively. It unifies previous work by Brower, Callender, Cohn, Douthett, Gollin, O’Connell, Quinn, Steinbach, and myself, while also introducing new models of voice-leading structure—including a three-note octahedral Tonnetz and tetrahedral models of four-note diatonic and chromatic ...

A two-step circle detection method using pairs of chords is proposed. It is shown how the center of the circle is computed from two intersecting chords. First, a 2D HT method based on the idea finds the centers of the circles in the image. Then, a 1D radius histogram is used to compute the radii. The experimental results show that the proposed method detects the circles effectively.