Publication
In this paper, we propose a fast method to recognize human actions which accounts for intra-class variability in the
way an action is performed. We propose the use of a low
dimen...
ICFHR
2010
13 years 2 months ago
2010
In this paper, we present an innovative approach to integrate spatial relations in stroke clustering for handwritten Devanagari character recognition. It handles strokes of any num...
SDM
2004
SIAM
13 years 8 months ago
2004
SIAM
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
ESANN
2004
13 years 8 months ago
2004
In text-dependent speaker verification the speech signals have to be time-aligned. For that purpose dynamic time warping (DTW) can be used which performs the alignment by minimizi...
PETRA
2010
ACM
13 years 9 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
PAKDD
2010
ACM
14 years 6 days ago
2010
ACM
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
HAIS
2010
Springer
14 years 7 days ago
2010
Springer
The recognition of manual actions, i.e., hand movements, hand postures and gestures, plays an important role in human-computer interaction, while belonging to a category of particu...
MM
2003
ACM
14 years 20 days ago
2003
ACM
In this paper, we propose an approach that retrieves motion of objects from the videos based on the dynamic time warping of view invariant characteristics. The motion is represent...
PKDD
2005
Springer
14 years 28 days ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...