Feature matching and affine transformation for 2D cell animation
This paper presents an application for feature matching and affine transformation in computer graphics. The study case considered is 2D cell animation, which is still a labor-intensive process in current cartoon film production. One key problem in automating 2D cell animation in inbetween frame generation. The objective of our work is to investigate how to automatically generate inbetweening from pairs of hand-drawn 2D key frames. Our technique first establishes the correspondence of feature points and then estimates the affine transformation between each pair of 2D key frames. The inbetween frames are then automatically generated by interpolation.
Key wordsInbetweening Key frames (2D) Cell animation, 2D Feature matching Affine transform
Unable to display preview. Download preview PDF.
- Bachelder IA, Ullman S (1992) Contour matching using local affine transformation. IEEE Proceedings of Computer Vision and Pattern Recognition, Champaign, Ill, 798–801Google Scholar
- Badler N (1987) Articulated figure animation IEEE Comput Graph Appl 7: 10–11Google Scholar
- Hilditch CJ (1969) Linear skeletons from square cupboards. Machine Intell 4: 403–420Google Scholar