Scalable top-k spatial image search on road networks

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A top-k spatial image search on road networks returns k images based on both their spatial proximity as well as the relevancy of image contents. Existing solutions for the top-k text query are not suitable to this problem since they are not sufficiently scalable to cope with hundreds of query keywords and cannot support very large road networks. In this paper, we model the problem as a top-k aggregation problem. We first propose a new separate index approach that is based on the visual vocabulary tree image index and the G-tree road network index and then propose a query processing method called an external combined algorithm(CA) method. Our experimental results demonstrate that our approach outperforms the state-of-the-art hybrid method more than one order of magnitude improvement.

Cite

CITATION STYLE

APA

Zhao, P., Kuang, X., Sheng, V. S., Xu, J., Wu, J., & Cui, Z. (2015). Scalable top-k spatial image search on road networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9050, pp. 379–396). Springer Verlag. https://doi.org/10.1007/978-3-319-18123-3_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free