Stroke correspondence construction using manifold learning

Liu, D; Chen, Q; Yu, J; Gu, H; Tao, D; Seah, HS

Stroke correspondence construction using manifold learning

Liu, D Chen, Q Yu, J Gu, H Tao, D

Seah, HS

Permalink

Publication Type:: Journal Article
Citation:: Computer Graphics Forum, 2011, 30 (8), pp. 2194 - 2207
Issue Date:: 2011-01-01

Closed Access

	Filename	Description	Size
	2011000196OK.pdf		2.75 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Liu, D	en_US
dc.contributor.author	Chen, Q	en_US
dc.contributor.author	Yu, J	en_US
dc.contributor.author	Gu, H	en_US
dc.contributor.author	Tao, D https://orcid.org/0000-0001-7225-5449	en_US
dc.contributor.author	Seah, HS	en_US
dc.date.issued	2011-01-01	en_US
dc.identifier.citation	Computer Graphics Forum, 2011, 30 (8), pp. 2194 - 2207	en_US
dc.identifier.issn	0167-7055	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15107
dc.description.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. © 2011 The Authors.	en_US
dc.relation.ispartof	Computer Graphics Forum	en_US
dc.relation.isbasedon	10.1111/j.1467-8659.2011.01969.x	en_US
dc.subject.classification	Software Engineering	en_US
dc.title	Stroke correspondence construction using manifold learning	en_US
dc.type	Journal Article
utslib.citation.volume	8	en_US
utslib.citation.volume	30	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access
pubs.issue	8	en_US
pubs.publication-status	Published	en_US
pubs.volume	30	en_US

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. © 2011 The Authors.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/15107