An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
TicTacToon: a paperless system for professional 2D animation
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
Computer-assisted cel animation: post-processing after inbetweening
Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A direct method for stereo correspondence based on singular value decomposition
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Efficient Shape Matching Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
DBSC-based animation enhanced with feature and motion: Research Articles
Computer Animation and Virtual Worlds - CASA 2006
Learning Distance Metrics with Contextual Constraints for Image Retrieval
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Information-theoretic metric learning
Proceedings of the 24th international conference on Machine learning
Adaptive control in cartoon data reusing
Computer Animation and Virtual Worlds - CASA 2007
Locally adaptive subspace and similarity metric learning for visual data clustering and retrieval
Computer Vision and Image Understanding
Multiple feature fusion by subspace learning
CIVR '08 Proceedings of the 2008 international conference on Content-based image and video retrieval
Geometric Mean for Subspace Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithm for local distance metric learning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Beyond distance measurement: constructing neighborhood similarity for video annotation
IEEE Transactions on Multimedia - Special section on communities and media computing
Kernel-based metric learning for semi-supervised clustering
Neurocomputing
Image ratio features for facial expression recognition application
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Color to Gray: Visual Cue Preservation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature level analysis for 3D facial expression recognition
Neurocomputing
Towards a Relevant and Diverse Search of Social Images
IEEE Transactions on Multimedia
Shape retrieval based on dynamic programming
IEEE Transactions on Image Processing
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
IEEE Transactions on Circuits and Systems for Video Technology
Non-Negative Patch Alignment Framework
IEEE Transactions on Neural Networks
Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
IEEE Transactions on Image Processing
Subspaces Indexing Model on Grassmann Manifold for Image Search
IEEE Transactions on Image Processing
Complex Object Correspondence Construction in Two-Dimensional Animation
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Multiview Hessian discriminative sparse coding for image annotation
Computer Vision and Image Understanding
| Hi-index | 0.01 |
Correspondence construction of characters in key frames is the prerequisite for cartoon animations' automatic inbetweening and coloring. Since each frame of an animation consists of multiple layers, characters are complicated 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 characters constructed by multiple contours. This paper proposes an automatic cartoon correspondence construction approach with iterative graph based transductive learning (Graph-TL) and distance metric learning (DML) estimation. In details, this new method defines correspondence construction as a many-to-many labeling problem, which assigns the points from one key frame into the points from another key frame. Then, to refine the correspondence construction, we adopt an iterative optimization scheme to alternatively carry out the Graph-TL and DML estimation. In addition, in this paper, we adopt the local shape descriptor for cartoon application, which can successfully achieve rotation and scale invariance in cartoon matching. Plenty of experimental results on our cartoon dataset, which is built upon industrial production suggest the effectiveness of the proposed methods for constructing correspondences of complicated characters.