Digital image processing (2nd ed.)
Digital image processing (2nd ed.)
Introduction to numerical analysis: 2nd edition
Introduction to numerical analysis: 2nd edition
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Computational strategies for object recognition
ACM Computing Surveys (CSUR)
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Fast time-series searching with scaling and shifting
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Querying Time Series Data Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Duality-Based Subsequence Matching in Time-Series Databases
Proceedings of the 17th International Conference on Data Engineering
Leaf Image Retrieval with Shape Features
VISUAL '00 Proceedings of the 4th International Conference on Advances in Visual Information Systems
Haar Wavelets for Efficient Similarity Search of Time-Series: With and Without Time Warping
IEEE Transactions on Knowledge and Data Engineering
On Similarity-Based Queries for Time Series Data
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient contour-based shape representation and matching
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases
Data Mining and Knowledge Discovery
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Generic Scheme for Color Image Retrieval Based on the Multivariate Wald-Wolfowitz Test
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
Pattern Recognition Letters
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Digital Image Processing: PIKS Scientific Inside
Digital Image Processing: PIKS Scientific Inside
A novel filtration method in biological sequence databases
Pattern Recognition Letters
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient moving average transform-based subsequence matching algorithms in time-series databases
Information Sciences: an International Journal
Ranked subsequence matching in time-series databases
VLDB '07 Proceedings of the 33rd 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 Panda framework for comparing patterns
Data & Knowledge Engineering
Multiscale Representations for Fast Pattern Matching in Stream Time Series
IEEE Transactions on Knowledge and Data Engineering
Privately detecting bursts in streaming, distributed time series data
Data & Knowledge Engineering
Periodic Pattern Analysis in Time Series Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Similar Document Detection with Limited Information Disclosure
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient anomaly monitoring over moving object trajectory streams
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining closed patterns in multi-sequence time-series databases
Data & Knowledge Engineering
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
Distortion-free predictive streaming time-series matching
Information Sciences: an International Journal
Fast recognition of asian characters based on database methodologies
BNCOD'07 Proceedings of the 24th British national conference on Databases
Fast Best-Match Shape Searching in Rotation-Invariant Metric Spaces
IEEE Transactions on Multimedia
Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler distance
IEEE Transactions on Image Processing
An envelope-based approach to rotation-invariant boundary image matching
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
| Hi-index | 0.00 |
In this paper we address the scaling-invariant problem in boundary image matching. Supporting the invariant property against the horizontal or vertical image scaling is very important in boundary image matching to get more intuitive and more accurate matching results. We note that supporting the scaling-invariance is a challenging problem since the number of possible scaling factors is infinite. In this paper we solve this scaling-invariant problem in the time-series domain instead of the image domain. We first define the scaling distance between boundary images and present an interpolation-based method to compute that distance in the time-series domain. We then propose the notion of scaling-invariant distance between boundary images, which is the minimum distance among all possible scaling distances of two images. We use this scaling-invariant distance as the similarity measure in scaling-invariant boundary image matching. Computing the scaling-invariant distance, however, is very difficult or almost impossible, and we instead present how to compute its upper and lower bounds on the given scaling range. Using these lower and upper bounds we also propose divide-and-conquer algorithms to determine the scaling-invariant similarity between boundary images. Finally, we propose sequential and index-based matching methods, respectively, that perform the scaling-invariant boundary image matching correctly. Experimental results show that our scaling-invariant matching gets more intuitive results than the previous (scaling-variant) matching. In addition, compared with the simple sequential scan, our index-based matching method improves performance by one or two orders of magnitude.