An Envelope-Based Approach to Rotation-Invariant Boundary Image Matching

(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to take this opportunity to correct this in this online version, which should be considered the official version of this work.) Boundary image matching identifies similar boundary images using their corresponding time-series, and supporting the rotation invariance is crucial to provide more intuitive matching results. Computing the rotation-invariant distance between image time-series, however, is a very time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. To solve this problem, in this paper we use a novel notion of envelope-based lower bound proposed by Keogh et al. [12] to reduce the number of distance computations dramatically. With the help of Keogh et al.’s prior work [11, 12], we first explain how to construct a single envelope from a query seq...

• Type: Journal
• Year: 2011
• Where: DAWAK
• Authors: Sang-Pil Kim, Yang-Sae Moon, Sun-Kyong Hong
• Keywords: DAWAK 2011, Image Time, Information Technology, Query Sequence, Rotation Invariance