Fast stroke matching by angle quantization
نویسندگان
چکیده
Determining similarity of two point sequences (strokes) is a fundamental task in gestural interfaces. Because the length of each stroke is arbitrary, mapping to a fixed-dimension feature space is often done to allow for direct comparison. In this paper, we propose a new feature space based on angle quantization. For each adjacent pair of points in a stroke, the vector between them defines an angle relative to a fixed axis. The sequence of these angles can be mapped to a kdimensional feature space by quantizing the unit circle into k ranges, and taking a normalized count of the number of stroke angles in each range. The Euclidean distance between strokes in this feature space gives a measure of stroke similarity. The measure is scale invariant, and some degree of rotational invariance can be achieved with slight modification. Our method is shown to offer efficient and accurate gestural matching performance compared to traditional signal-processing and image-based methods.
منابع مشابه
The Relationship between Range of the ankle motion, Q angle and back stroke kicking on male Swimmers
The purpose of this research is to survey the relationship between range of the ankle motion and Q angle and back stroke kicking on male swimmers. 34 on available boy students swimmers were selected with mean and SD of age 23.68±2.28 years, weight 71.88±9.35 kg and height 176.11±5.52 cm in this study. First, Right and Left Leg Q angles (to supine position), Range of Dorsal flexion and plan...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملFinite - State Vector Quantization for Block - Matching Motion Estimation
Block-matching algorithms (BMA) are commonly used in image sequence coding for motion estimation. Even though the estimation of block motion vectors by an exhaustive search is optimal, the computational complexity precludes its usage in many real-time codec applications. In this paper, we present a novel vector quantizer (VQ) based architecture for BMA o ering sizeable reduction in the number o...
متن کاملTexture Synthesis using TSVQ and Target Re-synthesis
This paper presents a simple texture synthesis method that is fast, efficient, and optimized. Given an input texture, the algorithm will synthesize a texture image of specified size by matching output image pixel neighborhoods with input pixel neighborhoods. The pixel-neighborhood matching will be aided by the use of a TreeStructured Vector Quantization (TSVQ) method which will allow the algori...
متن کاملAdaptive Classified Pattern Matching Vector Quantization Approach For Compressing Images
In this paper, we propose a new, two-stage, adaptive classified pattern-matching algorithm based on residual vector quantization and variable bit rate encoding techniques as they have proved to be very efficient in progressive image transmission and compression rate. Both the intra-block and inter-block correlation properties have been exploited to enhance the compression rate. The innovative a...
متن کامل