Abstract
An approach to computer-supported cartooning is described that aims at optimizing the image-related working process by introducing computer-support in the drawing and painting stages of traditional cartoon production, in particular, allowing automatic coloring of a sequence of digitized images. This is achieved by using a shape-matching algorithm to evaluate the similarity of image regions and by performing an optimum region assignment to identify the corresponding ones and propagate the color information through the image sequence. In order to maintain the use of traditional drawing tools, the first step in the proposed system architecture is the processing of scanned animators' drawings to enhance their quality and extract meaningful information. Two different system modules allow either manual coloring of images or computer-assisted automatic painting of an image sequence. Additional modules allow the construction of a vector representation for the images, the generation of in-betweens, and the composing of each cartoon frame. The first stages of the system's architecture — image preprocessing, painting and vectorization — are presented. Special emphasis is placed on the fundamental ideas behind the computer-assisted painting and vectorization steps. The competitiveness of the approach, which requires no special hardware or high-performance workstation, is shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baecker RM (1969) Picture-driven animation. Proceedings of the Spring Joint Computer Conference. AFIPS Press, Montavale, NJ, pp 273–288
Burtnyk N, Wein M (1971) Computer generated key frame animation. J Soc Motion Pict Television Eng 80: 149–153
Burtnyk N, Wein M (1976) Interactive skeleton techniques for enhancing motion dynamics in key frame animation. Commun ACM 19: 564–569
Catmull E (1978) The problems of computer-assisted animation. ACM Comput Graph 12: 348–353
Durand CX (1991) The “TOON” project: requirements for a computerized 2D animation system. Comput Graphics 15: 285–293
Farin G (1990) Curves and surfaces for computer aided geometric design: a practical guide, 2nd edn. Academic Press, San Diego London
Gass SI (1975) Linear programming: methods and applications, 4th edn. McGraw-Hill, Kogakusha, Tokyo
Gonzalez RC, Wintz P (1987) Digital image processing, 2nd edn. Addison-Wesley, Reading, Mass
Haralick RM, Shapiro LG (1992) Computer and robot vision, vol 1. Addison-Wesley, Reading, Mass
Haralick RM, Sternberg SR, Zhuang X (1987) Image analysis using mathematical morphology. IEEE Trans Pattern Anal Mach Intell 9: 532–550
Heckbert PS (1990) A seed fill algorithm. In: Glassner AS (ed) Graphics gems. Academic Press, San Diego London, pp 275–277
Kochanek DHU, Bartels RH (1984) Interpolating splines with local tension, continuity and bias control. ACM Comput Graph 18: 33–41
Lane JM, Riesenfeld RF (1980) A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Trans Pattern Anal Mach Intell 2: 35–46
Lasseter J (1987) Principles of traditional animation applied to 3D computer animation. ACM Comput Graph 21: 35–44
Levoy M (1977) A color animation system based on the multiplane technique. ACM Comput Graph 11: 65–71
Leymarie F, Levine MD (1992) Fast raster scan distance propagation on the discrete rectangular lattice. CVGIP Image Understand 55: 84–94
Liu H-C, Srinath MD (1992) A string descriptor for matching partial shapes. In: Shapiro L, Rosenfeld A (eds) Computer vision and image processing. Academic Press, San Diego, pp 575–592
Niblack CW, Gibbons PB, Capson DW (1992) Generating skeletons and center lines from the distance transform. CVGIP: Graphic Models Image Process 54: 420–437
Pudet T (1992) Dessin à main levée et courbes de Bézier: comparaison des algorithmes de subdivision, modélisation des épaisseurs variables. PhD Thesis, Université de Paris Sud (XI), Centre d'Orsay, France. Available as Research Report 23, DEC Paris Research Laboratory, Paris.
Reeves WT (1981) Inbetweening for computer animation utilizing moving point constraints. ACM Comput Graph 15: 263–269
Schneider PJ (1990) An algorithm for automatically fitting digitized curves. In: Glassner AS (ed) Graphics gems. Academic Press, San Diego London, pp 612–625
Sederberg TW, Greenwood E (1992) A physically based approach to 2-D shape blending. ACM Comput Graph 26: 25–34
Sederberg TW, Gao P, Wang G, Mu H (1993) 2-D shape blending: an intrinsic solution to the vertex path problem. Proc SIGGRAPH '93 (Annual Conference Series). ACM SIGGRAPH, New York, pp 15–18
Stern G (1979) SoftCel — an application of raster scan graphics to conventional cel animation, ACM Comput Graph 13: 284–288
Thomas F, Johnston O (1981) Disney animation: the illusion of life. Abbeville Press, New York
Wagner RA, Fischer MJ (1974) The string-to-string correction problem. JACM 21: 168–173
Weiler K (1985) Edge-based data structures for solid modeling in curved-surface environments. IEEE Comput Graphics Appl 5: 21–40
Wertheimer M (1921) Untersuchungen zur Lehre von der Gestalt. Psychologische Forschung I
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Madeira, J.S., Stork, A. & Groß, M.H. An approach to computer-supported cartooning. The Visual Computer 12, 1–17 (1996). https://doi.org/10.1007/BF01782215
Issue Date:
DOI: https://doi.org/10.1007/BF01782215