Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Knowledge-driven, interactive animation of human running
GI '96 Proceedings of the conference on Graphics interface '96
Similarity-based queries for time series data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficiently supporting ad hoc queries in large datasets of time sequences
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Comparing constraint-based motion editing methods
Graphical Models
Introduction to Computer Graphics
Introduction to Computer Graphics
Motion texture: a two-level statistical model for character motion synthesis
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Interactive motion generation from examples
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Interactive control of avatars animated with human motion data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Verbs and Adverbs: Multidimensional Motion Interpolation
IEEE Computer Graphics and Applications
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Snap-together motion: assembling run-time animations
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
The Haar Wavelet Transform in the Time Series Similarity Paradigm
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
An Algorithm for Computing the Overlay of k-Dimensional Spaces
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Realistic synthesis of novel human movements from a database of motion capture examples
HUMO '00 Proceedings of the Workshop on Human Motion (HUMO'00)
Sound-by-numbers: motion-driven sound synthesis
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Similarity Search Over Time-Series Data Using Wavelets
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Motion synthesis from annotations
ACM SIGGRAPH 2003 Papers
Efficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
3D motion retrieval with motion index tree
Computer Vision and Image Understanding - Special isssue on video retrieval and summarization
Multi-Scale Histograms for Answering Queries over Time Series Data
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Indexing large human-motion databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Skyline Index for Time Series Data
IEEE Transactions on Knowledge and Data Engineering
Perceptually consistent example-based human motion retrieval
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Proceedings of the 2008 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Real-time dance pattern recognition invariant to anthropometric and temporal differences
ACIVS'12 Proceedings of the 14th international conference on Advanced Concepts for Intelligent Vision Systems
| Hi-index | 0.00 |
Current optical motion capture devices are capable of capturing motion at frequencies exceeding 1000Hz thereby generating gigabytes of motion data. In this paper we propose a method to solve the problem of subsequence motion matching in large motion databases. Our method supports non-uniform time-scaling. We begin with a polar-angle representation of the motion that gives a continuous thread in a multi-dimensional space. We improve the performance of the matching process by generating a motion curve index based on a representation of multiple 1-D signals rather than by partitioning the multi-dimensional space into subspaces as done in some previous work. Given a motion query, we sweep a hypercube along the query thread. Motion subsequences intersected by the hypercube form a matching set. Our method matches any possible non-uniform time-scaled subsequences between the query and the database, since any non-uniform time-scaled motion retains the same shape and location of the thread in the multi-dimensional space. We propose a new method to perform fast hypercube sweeping by utilizing a histogram. The histogram counts how many dimensions of each point on the thread are matched. A point is inside the hypercube when its count equals the total dimension d. The histogram is incrementally updated to minimize the sweeping cost. Our results show that the performance of our method depends on the speed of the query motion. We stress test our method by streaming the query motion against a motion database to determine its performance. The results show that the system can handle larger databases on slower query motion and vice versa.