# Différences

Cette page vous donne les différences entre la révision choisie et la version actuelle de la page.

lebel:structuring-music-by-means-of-audio-clustering-and-graph-search-algorithms:clustering-example-1 [2017/03/22 18:50] Frédéric Le Bel |
lebel:structuring-music-by-means-of-audio-clustering-and-graph-search-algorithms:clustering-example-1 [2019/04/13 17:49] (Version actuelle) Frédéric Le Bel |
||
---|---|---|---|

Ligne 49: | Ligne 49: | ||

Here are two examples of structuring music using a graph search algorithm. The first one explores the previous clusters space network based on the shortest Hamiltonian path principles, meaning that the following sequence of clusters (path) is the one with the minimum total distance that visits each cluster exactly once. In other words, the clusters are sequenced in a way that the global similarity is maximised. The second one uses the exact same principles but instead of being based on the clusters space, it is based on the features space, meaning that each component of the sequence is a unique sound as opposed to a group of sounds. | Here are two examples of structuring music using a graph search algorithm. The first one explores the previous clusters space network based on the shortest Hamiltonian path principles, meaning that the following sequence of clusters (path) is the one with the minimum total distance that visits each cluster exactly once. In other words, the clusters are sequenced in a way that the global similarity is maximised. The second one uses the exact same principles but instead of being based on the clusters space, it is based on the features space, meaning that each component of the sequence is a unique sound as opposed to a group of sounds. | ||

- | **1)** Using the [[https://nuage.ircam.fr/index.php/s/xXGP69W9OdPocOD|demo standalone]],\\ | + | **1)** Using the [[https://nuage.ircam.fr/index.php/s/annYMevM8Uig37B|demo standalone]],\\ |

* the sounds are sequenced according to different Markov chains deduced from each local MST (intra-cluster) while the clusters are sequenced according to the following shortest Hamiltonian path (inter-cluster) calculated using a customised nearest neighbour algorithm. Note that the path below corresponds to the minimum spanning tree above if you read it from right to left. | * the sounds are sequenced according to different Markov chains deduced from each local MST (intra-cluster) while the clusters are sequenced according to the following shortest Hamiltonian path (inter-cluster) calculated using a customised nearest neighbour algorithm. Note that the path below corresponds to the minimum spanning tree above if you read it from right to left. | ||

Ligne 69: | Ligne 69: | ||

N.B. For more information on using a similar approach in the field of instrumental music (music notation), refer to: | N.B. For more information on using a similar approach in the field of instrumental music (music notation), refer to: | ||

* G. Assayag, M. Castellengo, and C. Malherbel, "Functional integration of complex instrumental sounds in music writing", Proceedings of the ICMC, 1985. | * G. Assayag, M. Castellengo, and C. Malherbel, "Functional integration of complex instrumental sounds in music writing", Proceedings of the ICMC, 1985. | ||

- | * http://quod.lib.umich.edu/cache//b/b/p/bbp2372.1985.030/bbp2372.1985.030.pdf#page=1;zoom=75 | ||

N.B. For more information on using a similar approach in the field of sound synthesis/hybridization, refer to: | N.B. For more information on using a similar approach in the field of sound synthesis/hybridization, refer to: | ||

* C. E. Cella, J. J. Burred, "Advanced sound hybridizations by means of the theory of sound-types", Proceedings of the ICMC, 2013. | * C. E. Cella, J. J. Burred, "Advanced sound hybridizations by means of the theory of sound-types", Proceedings of the ICMC, 2013. | ||

- | * http://www.soundtypes.com/index.html | ||

---- | ---- |