indexing large human-motion databases.pptVIP

VLDB - Aug 2004 Themis Palpanas Fair Use Agreement Indexing Large Human-Motion Databases Eamonn Keogh, Themis Palpanas Victor B. Zordan,Dimitrios Gunopulos University of California, Riverside Marc Cardle University of Cambridge Motion Capture records motion data from live actors Motion Capture records motion data from live actors used for data-driven animation Motion Capture in Games Industry Motion Capture in Movie Industry Motivation motion capture data segmented in short sequences, stored in motion libraries composed to create long, realistic motion sequences important to find similar sequences form pool of similar sequences choose the most promising, to continue the motion Motivation Dynamic Time Warping (DTW) Considers only local adjustments in time, to match two time series However sometimes global adjustments are required DTW is being extensively used uniform scaling is complementary combination of both techniques offers rich, high-quality result set Uniform Scaling time series query, Q, length n candidate, C, length m (mn) Uniform Scaling time series query, Q, length n candidate, C, length m (mn) stretch Q to length p (n≤p≤m): Qp Qpj = Q┌j*n/p┐, 1 ≤ j ≤ p scaling factor, sf = p/n max scaling factor, sfmax= m/n Problem Statement given time series, Q database of candidate time series, {D} find argminp{ dist(Qp, {D} ) } dist(Qp, {D} )= Euclidean Distance between time series Problem Statement given time series, Q database of candidate time series, {D} find argminp{ dist(Qp, {D} ) } dist(Qp, {D} )= Euclidean Distance between time series Outline Speeding Up Search Scaling Up To Large Databases Experimental Evaluation Related Work Conclusions Best Uniform Scaling Match brute force algorithm: for each time series in {D} for each sf, 1 ≤ sf ≤ sfmax compute distance between the two time series find the best overall match time complexity: O(|D|(m-n)) extremely expensive! Lower Bounding Uniform Scaling lower bound distance between t