Stroke Correspondence Construction Using Manifold Learning
No Thumbnail Available
Date
2011
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing Ltd.
Abstract
Stroke correspondence construction is a precondition for generating inbetween frames from a set of key frames. In our case, each stroke in a key frame is a vector represented as a Disk B‐Spline Curve (DBSC) which is a flexible and compact vector format. However, it is not easy to construct correspondences between multiple DBSC strokes effectively because of the following points: (1) with the use of shape descriptors, the dimensionality of the feature space is high; (2) the number of strokes in different key frames is usually large and different from each other and (3) the length of corresponding strokes can be very different. The first point makes matching difficult. The other two points imply ‘many to many’ and ‘part to whole’ correspondences between strokes. To solve these problems, this paper presents a DBSC stroke correspondence construction approach, which introduces a manifold learning technique to the matching process. Moreover, in order to handle the mapping between unequal numbers of strokes with different lengths, a stroke reconstruction algorithm is developed to convert the ‘many to many’ and ‘part to whole’ stroke correspondences to ‘one to one’ compound stroke correspondence.
Description
@article{10.1111:j.1467-8659.2011.01969.x,
journal = {Computer Graphics Forum},
title = {{Stroke Correspondence Construction Using Manifold Learning}},
author = {Liu, Dongquan and Chen, Quan and Yu, Jun and Gu, Huiqin and Tao, Dacheng and Seah, Hock Soon},
year = {2011},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2011.01969.x}
}