ACM Home Page
Please provide us with feedback. Feedback
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
Full text PdfPdf (363 KB)
Source Geographic Information Systems archive
Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems table of contents
Arlington, Virginia, USA
SESSION: Computational geometry table of contents
Pages: 11 - 18  
Year of Publication: 2006
ISBN:1-59593-529-0
Authors
Bart Kuijpers  Hasselt University & Transnational University of Limburg, Belgium
Bart Moelans  Hasselt University & Transnational University of Limburg, Belgium
Nico Van de Weghe  Ghent University, Ghent, Belgium
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 43,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1183471.1183475
What is a DOI?

ABSTRACT

We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the algorithm first computes their generalized polygons, that consist of almost equally long line segments and that approximate the length of the given polylines within an $varepsilon$-error margin. Next, the algorithm determines the double-cross matrices of the generalized polylines and the difference between these matrices is used as a measure of dissimilarity between the given polylines. We prove termination of our algorithm and show that its sequential time complexity is bounded by $Oleft((fracmax(N_1,N_2)varepsilon)^2right)$, where $N_1$ and $N_2$ are the number of vertices of the given polylines. We apply our method to query-by-sketch, indexing of polyline databases, and classification of terrain features and show experimental results for each of these applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
F.L. Bookstein. Size and shape spaces for landmark data in two dimensions. Statistical Science, 1:181--242, 1986.
 
2
N. Van de Weghe. Representing and Reasoning about Moving Objects: A Qualitative Approach. PhD thesis, Ghent University (Belgium), 2004.
 
3
N. Van de Weghe, A. G. Cohn, and Ph. De Maeyer. A qualitative representation of trajectory pairs. In R. López de Mántaras and L. Saitta, editors, em Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI'04), pages 1103--1104, 2004.
 
4
N. Van de Weghe, A.G. Cohn, G. de Tré, and Ph. De Maeyer. A qualitative trajectory calculus as a basis for representing moving objects in geographical information systems. To appear in Control and Cybernetics, 2006.
 
5
N Van de Weghe, A.G. Cohn, Ph. De Maeyer, and F. Witlox. Representing moving objects in computer based expert systems: the overtake event example. Expert Systems with Applications, 29(4):977--983, 2005.
 
6
N. Van de Weghe and Ph. De Maeyer. Conceptual neighbourhood diagrams for representing moving objects. In J. Akoka et al., editor, ER (Workshops), volume 3770 of em Lecture Notes in Computer Science, pages 228--238, 2005.
 
7
N. Van de Weghe, G. De Tré, B. Kuijpers, and Ph. De Maeyer. The double-cross and the generalization concept as a basis for representing and comparing shapes of polylines. In R. Meersman et al., editor, Proceedings of the 1st International Workshop on Semantic-based Geographical Information Systems (SeBGIS'05), volume 3762 of Lecture Notes in Computer Science, pages 1087--1096. Springer, 2005.
 
8
I. Dryden and K.V. Mardia. Statistical Shape Analysis. Wiley, 1998.
 
9
M. Egenhofer. Query Processing in Spatial-Query-by-Sketch. Journal of Visual Languages and Computing, 8(4):403--424, 1997.
 
10
M. Erwig and M. Schneider. A visual language for the evolution of spatial relationships and its translation into a spatio-temporal calculus. Journal of Visual Languages and Computing, 14(2):181--211, 2003.
 
11
 
12
 
13
 
14
B. Gottfried. Tripartite line tracks qualitative curvature information. In Kuhn et al., editor, Proceedings of the International Conference on Spatial Information Theory (COSIT'03), volume 2825 of em Lecture Notes in Computer Science, pages 101--117. Springer, 2003.
 
15
E. Jungert. Symbolic spatial reasoning on object shapes for qualitative matching. In Proceedings of the International Conference on Spatial Information Theory (COSIT'93), pages 444--462, 1993.
 
16
J.T. Kent and K.V. Mardia. Shape, procrustes tangent projections and bilateral symmetry. Biometrika, 88:469--485, 2001.
 
17
L. Kulik and M. Egenhofer. Linearized terrain: Languages for silhouette representations. In Kuhn et al., editor, Proceedings of the International Conference on Spatial Information Theory (COSIT'03), volume 2825 of em Lecture Notes in Computer Science, pages 118--135. Springer, 2003.
 
18
 
19
 
20
R.C. Meathrel. A General Theory of Boundary-Based Qualitative Representation of 2D Shape. Phd thesis, University of Exeter (UK), 2001.
 
21
 
22
Chr. Schlieder. Geographic Objects with Indeterminate Boundaries, chapter Qualitative shape representation, pages 123--140. Taylor & Francis, 1996.
 
23
K. Zimmermann and Chr. Freksa. Qualitative spatial reasoning using orientation, distance, and path knowledge. Appl. Intell., 6(1):49--58, 1996.


Collaborative Colleagues:
Bart Kuijpers: colleagues
Bart Moelans: colleagues
Nico Van de Weghe: colleagues