Parameter-Free Ordered Partial Match Alignment with Hidden State Time Warping
Parameter-Free Ordered Partial Match Alignment with Hidden State Time Warping
复制标题
DOI：
10.3390/app12083783
复制
发表时间：
2022-04-01
影响因子：
2.7
通讯作者：
Tsai, Timothy J.
中科院分区：
文献类型：
--
作者：
Chang, Claire;Shaw, Thaxter;Tsai, Timothy J.
本文研究了有序部分匹配对齐问题，其目标是在存在潜在不匹配区域的情况下对齐两个序列。我们提出了一种称为隐藏状态时间扭曲的新型无参数动态编程对齐方法，该方法允许对齐路径在两个不同平面之间切换：对应于匹配部分的“可见”平面和对应于不匹配部分的“隐藏”平面。通过定义两个不同的平面，我们可以在每个平面中允许不同类型的时间扭曲（例如，在匹配区域中施加最大扭曲因子，同时允许在非匹配区域中完全不受约束的移动）。所得算法可以通过动态编程确定最佳连续对准路径，并且可见平面产生包含匹配区域的（可能）不连续对准路径。我们表明，这种方法在涉及语音和音乐的两个不同的部分匹配对齐问题上优于现有的无参数方法。
This paper investigates an ordered partial matching alignment problem, in which the goal is to align two sequences in the presence of potentially non-matching regions. We propose a novel parameter-free dynamic programming alignment method called hidden state time warping that allows an alignment path to switch between two different planes: a "visible" plane corresponding to matching sections and a "hidden" plane corresponding to non-matching sections. By defining two distinct planes, we can allow different types of time warping in each plane (e.g., imposing a maximum warping factor in matching regions while allowing completely unconstrained movements in non-matching regions). The resulting algorithm can determine the optimal continuous alignment path via dynamic programming, and the visible plane induces a (possibly) discontinuous alignment path containing matching regions. We show that this approach outperforms existing parameter-free methods on two different partial matching alignment problems involving speech and music.