Share Email Print
cover

Proceedings Paper

Motion trajectory representations for efficient storage and search
Author(s): Grzegorz Galinski; Wladyslaw Skarbek
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 26 November 2003
PDF: 8 pages
Proc. SPIE 5242, Internet Multimedia Management Systems IV, (26 November 2003); doi: 10.1117/12.510971
Show Author Affiliations
Grzegorz Galinski, Warsaw Univ. of Technology (Poland)
Wladyslaw Skarbek, Warsaw Univ. of Technology (Poland)


Published in SPIE Proceedings Vol. 5242:
Internet Multimedia Management Systems IV
John R. Smith; Sethuraman Panchanathan; Tong Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top