Complex Object Correspondence Construction in Two-Dimensional Animation

被引:95
作者
Yu, Jun [1 ]
Liu, Dongquan [2 ]
Tao, Dacheng [3 ]
Seah, Hock Soon [2 ]
机构
[1] Xiamen Univ, Dept Comp Sci, Xiamen 361005, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Engn, GameLab Annex 2, Singapore 636798, Singapore
[3] Univ Technol Sydney, Fac Engn & Informat Technol, Ctr Quantum Computat & Intelligent Syst, Sydney, NSW 2007, Australia
基金
新加坡国家研究基金会; 澳大利亚研究理事会;
关键词
Computer-assisted 2-D animation systems; correspondence construction; pairwise constraints; patch alignment; DIMENSIONALITY REDUCTION; SHAPE;
D O I
10.1109/TIP.2011.2158225
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Correspondence construction of objects in key frames is the precondition for inbetweening and coloring in 2-D computer-assisted animation production. Since each frame of an animation consists of multiple layers, objects are complex in terms of shape and structure. Therefore, existing shape-matching algorithms specifically designed for simple structures such as a single closed contour cannot perform well on objects constructed by multiple contours with an open shape. This paper introduces a semisupervised patch alignment framework for complex object correspondence construction. In particular, the new framework constructs local patches for each point on an object and aligns these patches in a new feature space, in which correspondences between objects can be detected by the subsequent clustering. For local patch construction, pairwise constraints, which indicate the corresponding points (must link) or unfitting points (cannot link), are introduced by users to improve the performance of correspondence construction. This kind of input is convenient for animation software users via user-friendly interfaces. A dozen of experimental results on our cartoon data set that is built on industrial production suggest the effectiveness of the proposed framework for constructing correspondences of complex objects. As an extension of our framework, additional shape retrieval experiments on MPEG-7 data set show that its performance is comparable with that of a prominent algorithm published in T-PAMI 2009.
引用
收藏
页码:3257 / 3269
页数:13
相关论文
共 47 条
[1]  
[Anonymous], 2003, P ADV NEURAL INFORM
[2]  
[Anonymous], 2002, Principal components analysis
[3]  
[Anonymous], 2003, P 20 INT C MACH LEAR
[4]  
[Anonymous], 2009, Introduction to semi-supervised learning
[5]   Metric learning for semi-supervised clustering using pairwise constraints and the geometrical structure of data [J].
Baghshah, Mahdieh Soleymani ;
Shouraki, Saeed Bagheri .
INTELLIGENT DATA ANALYSIS, 2009, 13 (06) :887-899
[6]   Learning Context-Sensitive Shape Similarity by Graph Transduction [J].
Bai, Xiang ;
Yang, Xingwei ;
Latecki, Longin Jan ;
Liu, Wenyu ;
Tu, Zhuowen .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (05) :861-874
[7]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[8]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[9]   Shape matching and object recognition using shape contexts [J].
Belongie, S ;
Malik, J ;
Puzicha, J .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (04) :509-522
[10]   Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction [J].
Bian, Wei ;
Tao, Dacheng .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) :1037-1050