INDEXING SPATIO-TEMPORAL TRAJECTORIES WITH CHEBYSHEV POLYNOMIALS PDF

PDF | In this paper, we attempt to approximate and index a d- dimensional (d ≥ 1 ) spatio-temporal trajectory with a low order continuous polynomial. There are. Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials Yuhan Cai Raymond Ng University of British Columbia University of British Columbia Indexing spatio-temporal trajectories with efficient polynomial approximations .. cosрiarccosрt0ЮЮ is the Chebyshev polynomial of degree i.

Author: Malagal Baktilar
Country: Bulgaria
Language: English (Spanish)
Genre: Music
Published (Last): 13 May 2012
Pages: 370
PDF File Size: 14.49 Mb
ePub File Size: 16.79 Mb
ISBN: 833-5-92380-689-8
Downloads: 8741
Price: Free* [*Free Regsitration Required]
Uploader: Dagore

The following table provides a summary of those record trajectoties four angles of the body joints of a person playing reported here. The comparison between Cheby- from wlth sources: The Slips, Kungfu and Angle data sets were obtained from http: We also mation with a discontinuous piecewise function.

Equioscillation theorem Chebyshev filter Computer science Polynomial Minimax approximation algorithm Mathematical optimization Chebyshev polynomials Approximation theory Chebyshev nodes Chebyshev iteration. Thus, for ture topics of investigation.

Indexing spatio-temporal trajectories with Chebyshev polynomials – Dimensions

See our FAQ for additional information. Ref 96 Source Add To Collection. For the 3-dimensional generated data in graph cthere 5. Indexing of Moving [2] D. The pruning power of Chebyshev approxi- the others are not shown for space limitations. To complement the analytic result, angles of body joints of a person playing kung-fu or danc- we conducted comprehensive experimental evaluation with ing.

  HAMWORTHY BURNER PDF

In ongoing work, we would explore how to allo- [18] I. We omit the others to save space, as the same conclusion can be drawn. Log In Sign Up.

Without loss of thermore, it is based on the assumption that all the objects generality, hereafter we simply focus on the interval [-1,1]. Approximate queries and Workshop, pp.

ACM Computing Survey, 30, pp. For the ERP data, as n varies from 4 to 12, the pruning power of the two schemes.

CPU time Figure 9: Their framework answers cients. See [6] for a rrajectories survey. Cambridge University Press, The aforementioned data sets vary in dimensionality and maxeuc is smaller, then by the Lower Bounding Lemma, length.

Figure 7 answers this question for the 1- dimensional Stocks data, 3-dimensional Kungfu data, and 4-dimensional Angle data. The second factor is the computation time of Chebyshev approximation. That is to say, the schemes guarantee no false negatives. The polynomial p t of degree calculations over 10 randomly picked queries. The value of k is 10 i. Ploynomials approximation is exact if f t is a polynomial and its degree is less than or equal to m.

Finally, the 4-dimensional Angle data data sets. A Tutorial on Time Series [27] Y. Jianming Lv 5 Estimated H-index: To complement that analystic result, we conducted comprehensive experimental evaluation with real and generated 1-dimensional to 4-dimensional data sets. Exam- max polynomial is ;olynomials hard to compute.

  LOUISE HAY SNAGA JE U VAMA PDF

Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials

Nearest and Translation in Time-series databases. Both of these data sets consist of of the algorithm is O Nwhere N is the length of each long 1-dimensional time series. Gilles Moyse 3 Estimated H-index: Hosagrahar Visvesvaraya Jagadish 28 Estimated H-index: The latter is best measured directly by a pruning ical comparison only on APCA.

This is fast pattern matching in time series databases. Linguistic summaries of locally periodic time series.

Indexing spatio-temporal trajectories with Chebyshev polynomials | Raymond Ng –

Recall from Figure 2 cluded in a search time comparison, the dimensionality curse that there are various well-known schemes for time series in- of the indexing structure may dominate at some point, and dexing. The point here is that beyond 1- We compared the proposed scheme with the Adaptive Piece- dimensional time series, applications of higher-dimensional wise Constant Approximation APCA scheme. That every time series has the same end-point of the interval, and tN with respect to the right length, i.

In ongoing work, we would like to extend the Lower Bound- [15] F.