Hierarchical Information Quadtree: Efficient Spatial Temporal Image Search for Multimedia Stream
arXiv:1806.03483 · doi:10.1007/s11042-018-6284-y
Abstract
Massive amount of multimedia data that contain times- tamps and geographical information are being generated at an unprecedented scale in many emerging applications such as photo sharing web site and social networks applications. Due to their importance, a large body of work has focused on efficiently computing various spatial image queries. In this paper,we study the spatial temporal image query which considers three important constraints during the search including time recency, spatial proximity and visual relevance. A novel index structure, namely Hierarchical Information Quadtree(\hiq), to efficiently insert/delete spatial temporal images with high arrive rates. Base on \hiq an efficient algorithm is developed to support spatial temporal image query. We show via extensive experimentation with real spatial databases clearly demonstrate the efficiency of our methods.
arXiv commentPublished at Multimedia Tools and Applications. arXiv admin note: text overlap with arXiv:1805.02009
References in corpus (7)
- Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization
- Deep Adaptive Feature Embedding with Local Sample Distributions for Person Re-identification
- Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval
- What-and-Where to Match: Deep Spatially Multiplicative Integration Networks for Person Re-identification
- Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering
- Structured Deep Hashing with Convolutional Neural Networks for Fast Person Re-identification
- Hybrid Indexes to Expedite Spatial-Visual Search