Computer graphics processing and selective visual display system – Computer graphics processing – Animation
Reexamination Certificate
2001-12-10
2003-07-22
Nguyen, Phu K. (Department: 2671)
Computer graphics processing and selective visual display system
Computer graphics processing
Animation
Reexamination Certificate
active
06597361
ABSTRACT:
Method of Processing Animation by Interpolation Between Key Frames with Small Data Quantity
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to an animation processing method for recording or transmitting data of an animation previously created by the technique of computer graphics or the like, and more particularly, it relates to a method of compressing key frame information for displaying an animation by generating intermediate frames between pieces of key frame information by interpolation on the basis of images on frames (key frames) serving as keys in a time series, reducing the quantity of data for recording or transmission, and regenerating the animation in real time.
2. Description of the Background Art
Moving image data such as those forming an animation consist of an extremely large number of images called frames. In order to record information of the respective frames as such, an enormous data capacity is necessary. Thus, there has been proposed the so-called video compression for compressing the data of such video information with minimum reduction of the information quantity and recording or transmitting the same.
In case of inputting dynamic images from a camera or outputting the same onto a display, the so-called raster scan technique is generally employed. The raster scan technique is adapted to decompose each frame into a plurality of horizontal scan lines, for successively scanning the respective scan lines downward from above and rightward from the left. Therefore, the technique of video compression is generally directed to raster scan images.
An animation created by the technique of computer graphics is also converted to scan line information by the raster scan technique when displayed. In case of recording data of such an animation, a method of compressing a plurality of raster scan images is employed for recording the same in general. For example, Japanese Patent Laying-Open No. 61-198877 (1986) discloses a data compression technique of improving compressibility through conditions specific to a computer animation, for compressing scan line information by the raster scan technique.
On the other hand, techniques of creating animations by computer graphics include that called key frame animation. In this key frame animation, an animation is grasped as a set of a plurality of temporally changing “objects”. In case of creating an animation, not all frames but only frames (called “key frames”) forming key points of the motion are created. Then, objects of frames (called “intermediate frames”) other than the key frames are automatically created by interpolative calculation of objects contained in the key frames. This interpolation method is disclosed in Japanese Patent Laying-Open No. 60-191366 (1985).
The animation created by this key frame technique can be regenerated from information related not to all frames but to only partial key frames. Therefore, the data quantity is advantageously remarkably reduced as compared with the case of creating information of all frames and recording the animation. Thus, the capacity of a necessary storage medium can be reduced and the transmission time can also be reduced, for example.
In order to automatically create intermediate frames from information of key frames by interpolation, required is information as to which object changes to what object. Therefore, the aforementioned Japanese Patent Laying-Open No. 60-191366 discloses a technique of mapping of objects. Data related to such mapping must also be recorded/transmitted along with the information of key frames.
FIGS. 1A
to
1
D show four key frames of a certain animation along a time series. Description is now made on how to record information on objects contained in the key frames of the animation shown in
FIGS. 1A
to
1
D in the prior art.
Referring to
FIGS. 1A
to
1
D, objects A
0
to A
2
, B
0
to B
3
, E
2
and E
3
are painted polygons. On the other hand, objects C
1
, C
2
and D
1
to D
3
are curves. It is assumed that the key frames shown in
FIGS. 1A
to
1
D are presented at times t
0
, t
1
, t
2
and t
3
in the animation respectively.
As understood from
FIGS. 1A
to
1
D, the objects A
0
, A
1
and A
2
show changes of a single object. This object is referred to as an object A. Similarly, the objects B
0
to B
3
show changes of a single object B. The objects E
2
and E
3
show changes of a single object E. The objects C
1
and C
2
show changes of a single object C, and the objects D
1
to D
3
show changes of another single object D respectively.
In order to record information on objects contained in key frames, it is necessary to previously prepare data (state information) indicating in what states respective objects are in respective frames, as disclosed in Japanese Patent Laying-Open No. 5-101160 (1993), for example, as shown in
FIG. 2
in the form of a table, for example. The full text of Japanese Patent Laying-Open Gazette No. 5-101160 is invoked here by reference.
Referring to
FIG. 2
, the respective columns indicate the key frames correpsonding to the respective times, and the respective rows correspond to the objects appearing in the animation. The respective elements in the table shown in
FIG. 2
indicate state information of the respective objects in the key frames. For convenience of illustration, it is assumed that symbols A
0
to A
2
, B
0
to B
3
, C
1
, C
2
, D
1
to D
3
, E
2
and E
3
denoting the respective objects also indicate the state information of the objects A to E at the respective times. In the table shown in
FIG. 2
, further, blank spaces show that the objects do not appear on the screen at the times.
Graphics appearing in the animation are assumed as the objects A to E in this case. However, the objects may be in various formats other than graphics. In addition to graphics such as lines, polygons, circles and stereoscopic figures, the objects may be characters, volumes of sounds or music, parameters of picture quality, positions and sizes of display windows, thicknesses of lines, colors, positions of light sources, positions of viewpoints and the like.
In order to provide sound effects in a certain key frame, for example, the sound effects are introduced into this key frame as objects. In order to change the position or size of a window for displaying the animation in a certain key frame, window parameters therefor are introduced into the key frame. Thus, all various numeric parameters employed in the animation can be treated as “objects” in this specification, particularly as state values indicating the states of the objects.
When the data shown in
FIG. 2
in the form of a table are previously prepared, images of an intermediate frame at an arbitrary time can be calculated by interpolating state information of objects described in key frame information on key frames around the time such as a pair of or a plurality of preceding and succeeding frames. This interpolation method is disclosed in Japanese Patent Laying-Open No. 61-191366. Well-known techniques of interpolative calculation include an interpolation method employing linear interpolation or curve approximation of spline curves or the like.
FIGS. 5A
to
5
D show another exemplary animation related to the so-called business presentation. These figures show key frames respectively. Referring to
FIGS. 5A
to
5
D, objects F
0
to F
3
, forming an object F which is the background image, remain in the same state in all key frames. Objects G
1
to G
3
, forming an object G consisting of characters “presentation”, remain in the same state in the three key frames shown in
FIGS. 5B
to
5
D. Objects H
2
and H
3
, forming an object H consisting of characters “item 1”, are with colored and white background images respectively. An object I
3
, forming an object I consisting of characters “item 2”, is displayed only in the key frame shown in
FIG. 5D
, with a colored background image.
FIG. 6
shows key frame information for regenerating the animation shown in
FIGS. 5A
to
5
D in the form of a table similarly to FIG.
2
. The rela
Nishihata Minoru
Takakura Masaki
Birch & Stewart Kolasch & Birch, LLP
Nguyen Phu K.
Sharp Kabushiki Kaisha
LandOfFree
Method of processing animation by interpolation between key... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of processing animation by interpolation between key..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of processing animation by interpolation between key... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3105148