@incollection{muller_dynamic_2007,
	address = {Berlin, Heidelberg},
	title = {Dynamic {Time} {Warping}},
	isbn = {978-3-540-74048-3},
	url = {https://doi.org/10.1007/978-3-540-74048-3_4},
	abstract = {Dynamic time warping (DTW) is a well-known technique to find an optimal alignment between two given (time-dependent) sequences under certain restrictions (Fig. 4.1). Intuitively, the sequences are warped in a nonlinear fashion to match each other. Originally, DTW has been used to compare different speech patterns in automatic speech recognition, see [170]. In fields such as data mining and information retrieval, DTW has been successfully applied to automatically cope with time deformations and different speeds associated with time-dependent data.In this chapter, we introduce and discuss the main ideas of classical DTW (Sect. 4.1) and summarize several modifications concerning local as well as global parameters (Sect. 4.2). To speed up classical DTW, we describe in Sect. 4.3 a general multiscale DTW approach. In Sect. 4.4, we show how DTW can be employed to identify all subsequence within a long data stream that are similar to a given query sequence (Sect. 4.4). A discussion of related alignment techniques and references to the literature can be found in Sect. 4.5.},
	language = {en},
	urldate = {2021-03-26},
	booktitle = {Information {Retrieval} for {Music} and {Motion}},
	publisher = {Springer},
	editor = {Müller, Meinard},
	year = {2007},
	doi = {10.1007/978-3-540-74048-3_4},
	keywords = {Automatic Speech Recognition, Constraint Region, Cost Matrix, Dynamic Time Warping, Edit Distance},
	pages = {69--84},
}

{"_id":"WRKH4a2Gpc8C53e8L","bibbaseid":"mller-dynamictimewarping-2007","bibdata":{"bibtype":"incollection","type":"incollection","address":"Berlin, Heidelberg","title":"Dynamic Time Warping","isbn":"978-3-540-74048-3","url":"https://doi.org/10.1007/978-3-540-74048-3_4","abstract":"Dynamic time warping (DTW) is a well-known technique to find an optimal alignment between two given (time-dependent) sequences under certain restrictions (Fig. 4.1). Intuitively, the sequences are warped in a nonlinear fashion to match each other. Originally, DTW has been used to compare different speech patterns in automatic speech recognition, see [170]. In fields such as data mining and information retrieval, DTW has been successfully applied to automatically cope with time deformations and different speeds associated with time-dependent data.In this chapter, we introduce and discuss the main ideas of classical DTW (Sect. 4.1) and summarize several modifications concerning local as well as global parameters (Sect. 4.2). To speed up classical DTW, we describe in Sect. 4.3 a general multiscale DTW approach. In Sect. 4.4, we show how DTW can be employed to identify all subsequence within a long data stream that are similar to a given query sequence (Sect. 4.4). A discussion of related alignment techniques and references to the literature can be found in Sect. 4.5.","language":"en","urldate":"2021-03-26","booktitle":"Information Retrieval for Music and Motion","publisher":"Springer","editor":[{"propositions":[],"lastnames":["Müller"],"firstnames":["Meinard"],"suffixes":[]}],"year":"2007","doi":"10.1007/978-3-540-74048-3_4","keywords":"Automatic Speech Recognition, Constraint Region, Cost Matrix, Dynamic Time Warping, Edit Distance","pages":"69–84","bibtex":"@incollection{muller_dynamic_2007,\n\taddress = {Berlin, Heidelberg},\n\ttitle = {Dynamic {Time} {Warping}},\n\tisbn = {978-3-540-74048-3},\n\turl = {https://doi.org/10.1007/978-3-540-74048-3_4},\n\tabstract = {Dynamic time warping (DTW) is a well-known technique to find an optimal alignment between two given (time-dependent) sequences under certain restrictions (Fig. 4.1). Intuitively, the sequences are warped in a nonlinear fashion to match each other. Originally, DTW has been used to compare different speech patterns in automatic speech recognition, see [170]. In fields such as data mining and information retrieval, DTW has been successfully applied to automatically cope with time deformations and different speeds associated with time-dependent data.In this chapter, we introduce and discuss the main ideas of classical DTW (Sect. 4.1) and summarize several modifications concerning local as well as global parameters (Sect. 4.2). To speed up classical DTW, we describe in Sect. 4.3 a general multiscale DTW approach. In Sect. 4.4, we show how DTW can be employed to identify all subsequence within a long data stream that are similar to a given query sequence (Sect. 4.4). A discussion of related alignment techniques and references to the literature can be found in Sect. 4.5.},\n\tlanguage = {en},\n\turldate = {2021-03-26},\n\tbooktitle = {Information {Retrieval} for {Music} and {Motion}},\n\tpublisher = {Springer},\n\teditor = {Müller, Meinard},\n\tyear = {2007},\n\tdoi = {10.1007/978-3-540-74048-3_4},\n\tkeywords = {Automatic Speech Recognition, Constraint Region, Cost Matrix, Dynamic Time Warping, Edit Distance},\n\tpages = {69--84},\n}\n\n\n\n","editor_short":["Müller, M."],"key":"muller_dynamic_2007","id":"muller_dynamic_2007","bibbaseid":"mller-dynamictimewarping-2007","role":"editor","urls":{"Paper":"https://doi.org/10.1007/978-3-540-74048-3_4"},"keyword":["Automatic Speech Recognition","Constraint Region","Cost Matrix","Dynamic Time Warping","Edit Distance"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"incollection","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx","pzyFFGWvxG2bs63zP"],"keywords":["automatic speech recognition","constraint region","cost matrix","dynamic time warping","edit distance"],"search_terms":["dynamic","time","warping"],"title":"Dynamic Time Warping","year":2007,"author_short":["Müller, M."]}