Complex Object Correspondence Construction in Two-Dimensional Animation

  • Authors:
  • Jun Yu;Dongquan Liu;Dacheng Tao;Hock Soon Seah

  • Affiliations:
  • Department of Computer Science, Xiamen University, Xiamen, China;GameLab Annex II, School of Computer Engineering, Nanyang Technological University, Singapore,;Centre for Quantum Computation and Intelligent Systems, Faculty of Engineering and Information Technology, University of Technology, Sydney, Australia;GameLab Annex II, School of Computer Engineering, Nanyang Technological University, Singapore,

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.