메뉴 건너뛰기




Volumn , Issue , 2007, Pages 75-82

Dynamics-aware similarity of moving objects trajectories

Author keywords

dynamics; similarity; trajectories

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATE MATCHING; BOUNDED ERRORS; CONSTANT SPEED; DEGREE OF SIMILARITY; DISTANCE FUNCTIONS; EFFICIENT ALGORITHM; HAUSDORFF DISTANCE; MOTION OF INDIVIDUAL; MOVING OBJECTS; MOVING OBJECTS DATABASES; OPTIMAL MATCHING; SIMILARITY;

EID: 52949127470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1341012.1341027     Document Type: Conference Paper
Times cited : (32)

References (30)
  • 1
    • 0001818178 scopus 로고
    • Efficient similarity search in sequence databases
    • Rakesh Agrawal, Christos Faloutsos, and Arun N. Swami. Efficient similarity search in sequence databases. In FODO, 1993.
    • (1993) FODO
    • Agrawal, R.1    Faloutsos, C.2    Swami, A.N.3
  • 2
    • 21144453588 scopus 로고    scopus 로고
    • Comparison of distance measures for planar curves
    • A. Alt, C. Knauer, and C. Wenk. Comparison of distance measures for planar curves. Algorithmica, 38, 2004.
    • (2004) Algorithmica , vol.38
    • Alt, A.1    Knauer, C.2    Wenk, C.3
  • 5
    • 0002404105 scopus 로고    scopus 로고
    • Discrete geometric shapes: Matching, interpolation, and approximation
    • H. Alt and L. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In Handbook of Computational Geometry, 1999.
    • (1999) Handbook of Computational Geometry
    • Alt, H.1    Guibas, L.2
  • 6
    • 0005471086 scopus 로고    scopus 로고
    • Matching polygonal curves with respect to the fréchet distance
    • H. Alt, C. Knauer, and C. Wenk. Matching polygonal curves with respect to the fréchet distance. In STACS, 2001.
    • (2001) STACS
    • Alt, H.1    Knauer, C.2    Wenk, C.3
  • 8
    • 84976826673 scopus 로고
    • Voronoi diagrams - A survey of a fundamental geometric data structure
    • F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3), 1991.
    • (1991) ACM Comput. Surv. , vol.23 , Issue.3
    • Aurenhammer, F.1
  • 10
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • Thomas Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6(2), 2002.
    • (2002) GeoInformatica , vol.6 , Issue.2
    • Brinkhoff, T.1
  • 11
    • 33745324689 scopus 로고    scopus 로고
    • Spatio-temporal data reduction with deterministic error bounds
    • H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. VLDB Journal, 15(3), 2006.
    • (2006) VLDB Journal , vol.15 , Issue.3
    • Cao, H.1    Wolfson, O.2    Trajcevski, G.3
  • 13
    • 0000418612 scopus 로고
    • An appraisal of some shortest - Path algorithms
    • S. E. Dreyfus. An appraisal of some shortest - path algorithms. Operations Research, 17(3), 1969.
    • (1969) Operations Research , vol.17 , Issue.3
    • Dreyfus, S.E.1
  • 14
    • 5444272992 scopus 로고    scopus 로고
    • Multi-scale classification of moving objects trajectories
    • C. du Mouza and R. Rigaux. Multi-scale classification of moving objects trajectories. In SSDBM, 2004.
    • (2004) SSDBM
    • Du Mouza, C.1    Rigaux, R.2
  • 15
    • 34247487834 scopus 로고    scopus 로고
    • Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
    • to appear
    • A. Efrat, Q. Fan, and S. Venkatasubramanian. Curve matching, time warping, and light fields: New algorithms for computing similarity between curves. J. Mathematic Imaging and Vision, 2007. to appear.
    • (2007) J. Mathematic Imaging and Vision
    • Efrat, A.1    Fan, Q.2    Venkatasubramanian, S.3
  • 16
    • 0031338770 scopus 로고    scopus 로고
    • Distance measures for point sets and their computation
    • T. Eiter and H. Mannila. Distance measures for point sets and their computation. Acta Inf., 34(2), 1997.
    • (1997) Acta Inf. , vol.34 , Issue.2
    • Eiter, T.1    Mannila, H.2
  • 18
    • 33745326935 scopus 로고    scopus 로고
    • Modeling and querying moving objects in networks
    • R.H. Güting, V.T. de Almeida, and Z. Ding. Modeling and querying moving objects in networks. VLDB J., 15(2), 2006.
    • (2006) VLDB J. , vol.15 , Issue.2
    • Güting, R.H.1    De Almeida, V.T.2    Ding, Z.3
  • 22
    • 0032205948 scopus 로고    scopus 로고
    • Minimax geometric fitting of two corresponding sets of points and dynamic furthest voronoi diagrams
    • K. Imai, S. Sumino, and H. Imai. Minimax geometric fitting of two corresponding sets of points and dynamic furthest voronoi diagrams. IEICE Trans. Inf. and Syst., E81-D(11), 1998.
    • (1998) IEICE Trans. Inf. and Syst. , vol.E81-D , Issue.11
    • Imai, K.1    Sumino, S.2    Imai, H.3
  • 23
    • 79959675968 scopus 로고    scopus 로고
    • April
    • Forbes Online Issue http://www.forbes.com/home, April 2006.
    • (2006) Forbes Online Issue
  • 29
    • 15544383958 scopus 로고    scopus 로고
    • Elastic translation invariant matching of trajectories
    • M. Vlachos, G. Kollios, and D. Gunopulos. Elastic translation invariant matching of trajectories. Machine Learning, 58, 2005.
    • (2005) Machine Learning , vol.58
    • Vlachos, M.1    Kollios, G.2    Gunopulos, D.3
  • 30
    • 45149124407 scopus 로고    scopus 로고
    • Addressing the need for map-matching speed: Localizing global curve-matching algorithms
    • C. Wenk, R. Salas, and D. Pfoser. Addressing the need for map-matching speed: Localizing global curve-matching algorithms. In SSDBM, 2006.
    • (2006) SSDBM
    • Wenk, C.1    Salas, R.2    Pfoser, D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.