Dynamic Time Warping with boundaries constraint relaxation

Ilan D. Shallom; Raziel Haimi-Cohen; Tal Golan

doi:10.1109/EEIS.1989.720123

Dynamic Time Warping with boundaries constraint relaxation

Ilan D. Shallom, Raziel Haimi-Cohen, Tal Golan

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

4 Scopus citations

Abstract

Conventional Dynamic Time Warping (DTW) assumes exact knowledge of the boundaries of both reference and test sequences. However, the output of practical end point detectors is inaccurate, especially with noisy input. This results in a severe deterioration of the accuracy of isolated word recognition. This work presents a modified DTW algorithm in which the boundaries constraint is relaxed so as to reflect endpoint detection errors. The effect of this modification on the dynamic programming optimization is analyzed and experimental results are presented to demonstrate the capability of the algorithm to overcome endpoint errors.

Original language	English
DOIs	https://doi.org/10.1109/EEIS.1989.720123
State	Published - 1 Jan 1989
Externally published	Yes
Event	16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989 - Tel-Aviv, Israel Duration: 7 Mar 1989 → 9 Mar 1989

Conference

Conference	16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989
Country/Territory	Israel
City	Tel-Aviv
Period	7/03/89 → 9/03/89

ASJC Scopus subject areas

Software
Computer Networks and Communications
Signal Processing
Electrical and Electronic Engineering
Instrumentation

Access to Document

10.1109/EEIS.1989.720123

Cite this

@conference{ed1426ec84724905806716ddd6b65e2e,

title = "Dynamic Time Warping with boundaries constraint relaxation",

abstract = "Conventional Dynamic Time Warping (DTW) assumes exact knowledge of the boundaries of both reference and test sequences. However, the output of practical end point detectors is inaccurate, especially with noisy input. This results in a severe deterioration of the accuracy of isolated word recognition. This work presents a modified DTW algorithm in which the boundaries constraint is relaxed so as to reflect endpoint detection errors. The effect of this modification on the dynamic programming optimization is analyzed and experimental results are presented to demonstrate the capability of the algorithm to overcome endpoint errors.",

author = "Shallom, {Ilan D.} and Raziel Haimi-Cohen and Tal Golan",

note = "Publisher Copyright: {\textcopyright} 1990 IEEE.; 16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989 ; Conference date: 07-03-1989 Through 09-03-1989",

year = "1989",

month = jan,

day = "1",

doi = "10.1109/EEIS.1989.720123",

language = "English",

}

TY - CONF

T1 - Dynamic Time Warping with boundaries constraint relaxation

AU - Shallom, Ilan D.

AU - Haimi-Cohen, Raziel

AU - Golan, Tal

PY - 1989/1/1

Y1 - 1989/1/1

N2 - Conventional Dynamic Time Warping (DTW) assumes exact knowledge of the boundaries of both reference and test sequences. However, the output of practical end point detectors is inaccurate, especially with noisy input. This results in a severe deterioration of the accuracy of isolated word recognition. This work presents a modified DTW algorithm in which the boundaries constraint is relaxed so as to reflect endpoint detection errors. The effect of this modification on the dynamic programming optimization is analyzed and experimental results are presented to demonstrate the capability of the algorithm to overcome endpoint errors.

AB - Conventional Dynamic Time Warping (DTW) assumes exact knowledge of the boundaries of both reference and test sequences. However, the output of practical end point detectors is inaccurate, especially with noisy input. This results in a severe deterioration of the accuracy of isolated word recognition. This work presents a modified DTW algorithm in which the boundaries constraint is relaxed so as to reflect endpoint detection errors. The effect of this modification on the dynamic programming optimization is analyzed and experimental results are presented to demonstrate the capability of the algorithm to overcome endpoint errors.

UR - http://www.scopus.com/inward/record.url?scp=85067342807&partnerID=8YFLogxK

U2 - 10.1109/EEIS.1989.720123

DO - 10.1109/EEIS.1989.720123

M3 - Paper

AN - SCOPUS:85067342807

T2 - 16th Conference of Electrical and Electronics Engineers in Israel, EEIS 1989

Y2 - 7 March 1989 through 9 March 1989

ER -

Dynamic Time Warping with boundaries constraint relaxation

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this