Spatiotemporal Compression Techniques for Moving Point Objects

Moving object data handling has received a fair share of attention over recent years in the spatial database community. This is understandable as positioning technology is rapidly making its way into the consumer market, not only through the already ubiquitous cell phone but soon also through small, on-board positioning devices in many means of transport and in other types of portable equipment. It is thus to be expected that all these devices will start to generate an unprecedented data stream of time-stamped positions. Sooner or later, such enormous volumes of data will lead to storage, transmission, computation, and display challenges. Hence, the need for compression techniques.

[1]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[2]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[3]  E. R. White.  Assessment of Line-Generalization Algorithms Using Characteristic Points , 1985 .

[4]  Hagit Shatkay,et al.  Approximate queries and representations for large data sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[5]  George F. Jenks.  LINES, COMPUTERS, AND HUMAN FRAILTIES* , 1981 .

[6]  Leonidas J. Guibas,et al.  Algorithmic issues in modeling motion , 2002, CSUR.

[7]  B. Saltin,et al.  Muscle, genes and athletic performance. , 2000, Scientific American.

[8]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[9]  Robert B McMaster,et al.  A Statistical Analysis of Mathematical Measures for Linear Simplification , 1986 .

[10]  G. Schoch,et al.  Role of interferon in the pathogenesis of virus diseases in mice as demonstrated by the use of anti-interferon serum. I. Rapid evolution of encephalomyocarditis virus infection , 1976, The Journal of experimental medicine.

[11]  M. Cooper.  Antennas get smart. , 2003, Scientific American.

[12]  Eamonn J. Keogh,et al.  An online algorithm for segmenting time series , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[13]  J. Hershberger,et al.  Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .

[14]  Mirco Nanni.  Distances for Spatio-Temporal Clustering , 2002, SEBD.

[15]  Roy Ladner,et al.  The 2-3TR-tree, a trajectory-oriented index structure for fully evolving valid-time spatio-temporal datasets , 2002, GIS '02.

[16]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[17]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.

[18]  Nirvana Meratnia,et al.  A New Perspective on Trajectory Compression Techniques , 2003 .

[19]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[20]  Oscar H. Ibarra,et al.  Trajectory queries and octagons in moving object databases , 2002, CIKM '02.