2011 International Conference on Electronics, Communications and Control (ICECC) 2011
DOI: 10.1109/icecc.2011.6066483
|View full text |Cite
|
Sign up to set email alerts
|

Clustering of trajectories based on Hausdorff distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(31 citation statements)
references
References 7 publications
0
31
0
Order By: Relevance
“…The first dissimilarity metric used was the Hausdorff distance [33]. Assuming two sets of points A and B, the Hausdorff distance h is described as:…”
Section: Ground Truthmentioning
confidence: 99%
“…The first dissimilarity metric used was the Hausdorff distance [33]. Assuming two sets of points A and B, the Hausdorff distance h is described as:…”
Section: Ground Truthmentioning
confidence: 99%
“…In this paper, we define network trajectories as a set of connected vertices: tx = [v1, ..., vn]. Figure 1 contains four network trajectories: tA = [16,17,18,19,20]; tB = [1,2,3,4,9,10]; tC = [16,17,18,19,20,15,10]; tD = [6,7,8,9,10].…”
Section: Definition 2 Network Trajectorymentioning
confidence: 99%
“…In our pseudocode and implementation, we use Dijkstra's single-source shortest-paths algorithm [4] taking a source node v and a graph G as input: distM ap[] = Dijkstra(G, v). It returns the shortest-path distance to all other nodes in G. In Figure 1, an example dist (3,8) would be a distance of 3, traversing the shortestpath 3-2-7-8 or 3-4-9-8.…”
Section: Definition 3 Shortest-path Distancementioning
confidence: 99%
See 1 more Smart Citation
“…This method can be used to measure the 'closeness' of two non-empty point sets which are subsets of a metric space. The method assigns a scalar score or distance to the two trajectories, which measures the similarity between the two trajectories (Chen et al, 2011). This distance is defined as: Table 2 shows the distances between the experimental trajectories and the simulated trajectories, for the four experimental subjects, at the 'POSITION' steps of the finite state machines (see Figure 7).…”
Section: Distances Between Trajectoriesmentioning
confidence: 99%