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: | Arashizshura Arashijinn |

Country: | Estonia |

Language: | English (Spanish) |

Genre: | Automotive |

Published (Last): | 18 June 2004 |

Pages: | 280 |

PDF File Size: | 6.19 Mb |

ePub File Size: | 9.85 Mb |

ISBN: | 882-2-78416-182-2 |

Downloads: | 23706 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Nikokasa |

The experimental results reported here Landmarks: That is to say, a smooth and polynomiwls trajectory is Permission to make digital or hard copies of all or part of this work for approximated with a piecewise discontinuous function. Minimax approximation is particularly meaningful for indexing because in a branch-and-bound search i.

In [17], Perng et al. Special attention is paid to the boundary conditions: Berndt 17 Estimated H-index: Finally, a 4-dimensional example is the four mits no false negatives. In the following, we only focus on ci for 4.

Trauectories 69 Estimated H-index: Furthermore, for better approximation quality, we can use all the N tgajectories points and values of the time series. In Section 5, we present our experimental setup most identical to the optimal minimax polynomial, and is and results. But with a probability w, Gaussian the pruning power to be the average percentage of saved noise N 0, 1 is introduced.

We hypothesize that one of the best possibilities is the polynomial that minimizes the maximum deviation from the true value, which is called the minimax polynomial. However, based on the distance measure For graphs d to fthe y-axis shows the CPU time taken given in [11], the corresponding computation between two in seconds of the entire kNNSearch.

DWT fur- give algorithms for building an index of Chebyshev ther requires the length of a time series be a power of two. This extends the same- of subinterval Ii. Genetic algorithms-based trwjectories aggregate approximation. Thus, it is important to nomials; yet they are easy to compute.

In trjectories event, each ci is O N.

### Indexing spatio-temporal trajectories with Chebyshev polynomials – Dimensions

This polynomial is then expanded and scaled. This is a very important advantage. From 1- to 4-dimensional, real [12] E. Nearest and Translation in Time-series databases. Ng University of British Columbia. The pruning power of Chebyshev approxi- the others are not shown for space limitations.

## Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials

For instance, not as many as the ones for time series. Finally, we prove the in general, among all the polynomials of the same degree, Lower Bounding Lemma. But while Fourier transforma- 1- to 4-dimensional real data sets, as well as generated tion is connected to Chebyshev approximation, the former data sets.

The data set was obtained from dimensional index. The comparison between Cheby- from two sources: To complement that analystic result, we conducted comprehensive experimental evaluation with real and generated 1-dimensional to 4-dimensional data sets.

It is a company which operates a motion capture facility for use by 5. See [16] for more details. Furthermore, the APCA code requires that the procedures by basically replacing line 1 in Figures 4 and 5 length of a trajectory be a multiple of n. Michail Vlachos 17 Estimated H-index: We would also like to expand our framework to conduct sub-trajectory matching. The x-axis is tion is simple, it is natural for many applications with spatio- normalized to the interval [-1, 1], and the y-axis is normal- temporal trajectories, including trajectories for airplanes and ized according to the APCA framework.

The polynomial p t of degree calculations over 10 randomly picked queries.

We used with a continuous function. Chebyshev polynomials enjoys the even earlier. In closing, we make the following scan strategy as described in Section 5. Figure 7 answers this question for the 1- dimensional Stocks data, 3-dimensional Kungfu indexlng, and 4-dimensional Angle data. Examples include earlier works by Faloutsos et al.

ACM Computing Survey, 30, pp. Some of these possiblities have indeed been studied beofre. Trajectoriies length queries for time series data. Our empirical results indicate that Cheby- experimental comparison. Multidimensional Access [26] O. This personal or classroom use is granted without fee provided that copies are mismatch may cause unnecessary error or deviation, and not made or distributed for profit or commercial advantage, and that copies may lead to a loss in pruning power in a branch-and-bound bear this notice and the full citation on the first page.

Real 1- to 4-Dimensional Data Sets curse on the index structure may put a limit on the value of n. Across the three curves in the graph, the absolute time taken is not that important, as the time depends on the size an dimensional index. Showing of 2 references.

The following table provides a summary of those record the four angles of the body joints of a person playing reported here.