Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(7)
Euclidean Distance
Human Motion
Indexation
Metric Space
Motion Capture
Search Space
Vector Data
Subscribe
Academic
Publications
Sublinear querying of realistic timeseries and its application to human motion
Sublinear querying of realistic timeseries and its application to human motion,10.1145/1743384.1743411,Omar U. Florez,Alexander Ocsa,Curtis E. Dyreson
Edit
Sublinear querying of realistic timeseries and its application to human motion
BibTex
|
RIS
|
RefWorks
Download
Omar U. Florez
,
Alexander Ocsa
,
Curtis E. Dyreson
This paper introduces a novel hashing algorithm for large timeseries databases, which can improve the querying of human motion. Timeseries that represent
human motion
come from many sources, in particular, videos and
motion capture
systems. Motion-related timeseries have features which are not commonly present in traditional types of
vector data
and that create additional indexing challenges: high and variable dimensionality, no
Euclidean distance
without normalization, and a
metric space
not fully defined. New techniques are needed to index motion-related timeseries. The algorithm that we present in this paper generalizes the dot product operator to hash timeseries of variable dimensionality without assuming constant dimensionality or requiring dimensionality normalization, unlike other approaches. By avoiding normalization, our hashing algorithm preserves more timeseries information and improves retrieval accuracy, and by hashing achieves sublinear computation time for most searches. Additionally, we show how to further improve the hashing by partitioning the
search space
using timeseries within the index. This paper also reports the results of experiments that show that the algorithm performs well in the querying of real
human motion
datasets.
Conference:
Multimedia Information Retrieval
, pp. 137-146, 2010
DOI:
10.1145/1743384.1743411
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
portal.acm.org
)
(
portal.acm.org
)
(
www.informatik.uni-trier.de
)
(
doi.acm.org
)
More »
References
(14)
The TS-tree: efficient time series search and retrieval
(
Citations: 9
)
Ira Assent
,
Ralph Krieger
,
Farzad Afschari
,
Thomas Seidl
Conference:
Extending Database Technology - EDBT
, pp. 252-263, 2008
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
(
Citations: 746
)
Paolo Ciaccia
,
Marco Patella
,
Pavel Zezula
Conference:
Very Large Data Bases - VLDB
, pp. 426-435, 1997
Locality-sensitive hashing scheme based on p-stable distributions
(
Citations: 268
)
Mayur Datar
,
Nicole Immorlica
,
Piotr Indyk
,
Vahab S. Mirrokni
Conference:
Symposium on Computational Geometry - SOCG
, pp. 253-262, 2004
Similarity Search in High Dimensions via Hashing
(
Citations: 224
)
Unknown
Conference:
Very Large Data Bases - VLDB
, 1997
R-trees: a dynamic index structure for spatial searching
(
Citations: 3114
)
Antonin Guttman
Conference:
International Conference on Management of Data - SIGMOD
, pp. 47-57, 1984