Faster retrieval with a two-pass dynamic-time-warping lower bound

DOI10.1016/J.PATCOG.2008.11.030MaRDI QIDQ2270858zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel Lemire

Publication date 29 July 2009

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL http://r-libre.teluq.ca/225/1/0811.3301v2.pdf

zbMATH Keywords

classificationindexingtime seriesvery large databases

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Pattern recognition, speech recognition (68T10)

Recommendations

• Fast and exact warping of time series using adaptive segmental approximations
• Boundary-based lower-bound functions for dynamic time warping and their indexing
• Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies
• Fast exact dynamic time warping on run-length encoded time series
• Time series motifs discovery under DTW allows more robust discovery of conserved structure

Cites work

• An energy-based similarity measure for time series
• Dynamic programming algorithm optimization for spoken word recognition
• Efficient many-to-Many point matching in one dimension
• Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
• Fast and exact warping of time series using adaptive segmental approximations
• scientific article; zbMATH DE number 2089697 (Why is no real title available?)
• scientific article; zbMATH DE number 3875591 (Why is no real title available?)
• scientific article; zbMATH DE number 2080487 (Why is no real title available?)
• scientific article; zbMATH DE number 954129 (Why is no real title available?)
• scientific article; zbMATH DE number 5182608 (Why is no real title available?)
• On-line signature recognition based on VQ-DTW

Cited in

(16)

• Wavelet-based dynamic time warping
• Distance measure with improved lower bound for multivariate time series
• Speeding up similarity search under dynamic time warping by pruning unpromising alignments
• Fast and exact warping of time series using adaptive segmental approximations
• Time series motifs discovery under DTW allows more robust discovery of conserved structure
• Early abandoning and pruning for elastic distances including dynamic time warping
• FastEE: fast ensembles of elastic distances for time series classification
• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• First and second derivatives in time series classification using DTW
• The DTW data distribution over a grid computing architecture
• Boundary-based lower-bound functions for dynamic time warping and their indexing
• Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
• Approximating length-restricted means under dynamic time warping
• Similarity search for spatial trajectories using online lower bounding DTW and presorting strategies
• Fast approximations and coresets for (k,)-median under dynamic time warping
• Time series classification by class-specific Mahalanobis distance measures

This page was built for publication: Faster retrieval with a two-pass dynamic-time-warping lower bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270858)