arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.11085cs.LGcs.ITcs.SDeess.ASmath.IT
收藏

基于最大可变换模式的音乐理解与压缩

Understanding and Compressing Music with Maximal Transformable Patterns

Aalborg University(奥尔堡大学)

David Meredith

摘要:

我们提出了一个多项式时间的算法,发现所有的最大模式在一个点集,$D\subset\mathbb{R}^k$,这是相关的转换在一个用户指定的类,$F$,双射在$\mathbb{R}^k$。我们还提出了第二种算法,发现这些最大模式的出现集合,然后使用这些出现集合的紧凑编码来计算输入点集的lossslightly压缩编码。该编码采用一组对$E=\left\lbrace\left\langle P_1, T_1\right\rangle,\left\langle P_2, T_2\right\rangle,\ldots\left\langle P_{\ell}, T_{\ell}\right\rangle\right\rbrace$的形式,其中每个$\langle P_i,T_i\rangle$由最大模式$P_i\subseteq D$和将$P_i$映射到$D$的其他子集上的一组变换$T_i\subset F$组成。每个变换由在$F$内唯一标识它的实值向量编码,并且该向量的长度用作$F$的复杂度的度量。我们评估新的压缩算法与三个不同复杂度的转换类,对任务的民歌旋律到调家庭分类。最复杂的类测试包括所有的音乐变换的换位,反转,逆行,增加和减少的组合。我们发现,扩大转换类提高了这项任务的性能。然而,平均而言,它并没有提高压缩因子,这可能是由于数据集(在这种情况下,民歌旋律)太短且简单,无法从潜在的更大数量的模式关系中受益,这些模式关系可以与更大的转换类相匹配。

英文摘要:

We present a polynomial-time algorithm that discovers all maximal patterns in a point set, $D\subset\mathbb{R}^k$, that are related by transformations in a user-specified class, $F$, of bijections over $\mathbb{R}^k$. We also present a second algorithm that discovers the set of occurrences for each of these maximal patterns and then uses compact encodings of these occurrence sets to compute a losslessly compressed encoding of the input point set. This encoding takes the form of a set of pairs, $E=\left\lbrace\left\langle P_1, T_1\right\rangle,\left\langle P_2, T_2\right\rangle,\ldots\left\langle P_{\ell}, T_{\ell}\right\rangle\right\rbrace$, where each $\langle P_i,T_i\rangle$ consists of a maximal pattern, $P_i\subseteq D$, and a set, $T_i\subset F$, of transformations that map $P_i$ onto other subsets of $D$. Each transformation is encoded by a vector of real values that uniquely identifies it within $F$ and the length of this vector is used as a measure of the complexity of $F$. We evaluate the new compression algorithm with three transformation classes of differing complexity, on the task of classifying folk-song melodies into tune families. The most complex of the classes tested includes all combinations of the musical transformations of transposition, inversion, retrograde, augmentation and diminution. We found that broadening the transformation class improved performance on this task. However, it did not, on average, improve compression factor, which may be due to the datasets (in this case, folk-song melodies) being too short and simple to benefit from the potentially greater number of pattern relationships that are discoverable with larger transformation classes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑