Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Digital Image Processing
General match: a subsequence matching method in time-series databases based on generalized windows
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping
IEEE Transactions on Knowledge and Data Engineering
Rotation invariant indexing of shapes and line drawings
Proceedings of the 14th ACM international conference on Information and knowledge management
Digital Image Processing: PIKS Scientific Inside
Digital Image Processing: PIKS Scientific Inside
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Noise Control Boundary Image Matching Using Time-Series Moving Average Transform
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
The VLDB Journal — The International Journal on Very Large Data Bases
Scaling-invariant boundary image matching using time-series matching techniques
Data & Knowledge Engineering
A new approach for processing ranked subsequence matching based on ranked union
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
| Hi-index | 0.00 |
Supporting the rotation invariance is crucial to provide more intuitive matching results in boundary image matching. Computing the rotation-invariant distance, however, is a very time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. To solve this problem, we propose a novel notion of envelopebased lower bound, and using the lower bound we reduce the number of distance computations dramatically. We first present a single envelope approach that constructs a single envelope from a query sequence and obtains a lower bound of the rotation-invariant distance using the envelope. This single envelope approach, however, may cause bad performance since it may incur a smaller lower bound due to considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using it we generalize the single envelope lower bound to the multi-envelope lower bound. Experimental results show that our envelope-based solutions outperform existing solutions by one to three orders of magnitude.