Paper
26 November 2003 Motion trajectory representations for efficient storage and search
Grzegorz Galinski, Wladyslaw Skarbek
Author Affiliations +
Abstract
Novel motion trajectory representations are introduced for efficient storage, transmission and search. Bit size reducing is obtained by specialization of motion trajectory temporal models to each spatial coordinate contrary to MPEG-7 approach where temporal models are the same for all spatial dimensions. On trajectories of MPEG-7 experimentation model (XM) the average bit gain is about 17%. For motion trajectory matching in search applications, the proposed similarity measure is based on exact integral formula for piecewise polynomial representation. This approach is not only more accurate but on average at least one order of magnitude faster than vector distance for discrete dense interpolation of trajectories, which is proposed in MPEG-7 XM. For long or complex shape trajectories matching in large databases can be too slow. Therefore we propose two acceleration techniques reducing significantly the number of trajectory comparisons: distance of trajectory centroids and distance of trajectory dispersion vectors. Using both techniques allows to skip about 95% trajectory comparisons when they are stored in X-tree or M-tree.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Grzegorz Galinski and Wladyslaw Skarbek "Motion trajectory representations for efficient storage and search", Proc. SPIE 5242, Internet Multimedia Management Systems IV, (26 November 2003); https://doi.org/10.1117/12.510971
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Motion models

Databases

Motion measurement

Multimedia

Video

Visualization

Back to Top