JPS60111291A - Data generation processing for color lookup table animation - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION (1) Description of the field to which the invention pertains The present invention relates to a data generation processing method for a color lookup table video, particularly in a graphic display, without changing the contents of an image memory. The present invention relates to a data generation processing method for easily displaying a moving image by rewriting only the contents of (hereinafter, the object to be displayed will be referred to as a color LUT moving image or a CLUT moving image).

(2) Description of conventional technology Conventionally, in this type of video display, the first
In the system shown in the figure, only a very simple moving image using the data shown in Figs. 2 and 3 could be displayed.

FIG. 1 is an example of a system configuration for displaying a CLUT video. Note that 1 is the main processor, 2 is the image memory, and 3 is the main processor.
is a color lookup table (abbreviated as CLUT), 4
T137 is a secondary storage such as a magnetic disk, 38 is a host computer, and 39 is a communication line connecting the host computer and the main processor 1. Here CLUT3
The operation is based on the data of each pixel (hereinafter referred to as pixel value) read out from the image memory 2 in a raster scanning manner in accordance with the video synchronization signal, and the address indicated by the pixel value (hereinafter referred to as the entry address of CLUT). Converts to the color value given in the register (called the entry address). The register of the CLUT 3, that is, the color value table (generally, the brightness of each element of G and B is expressed by 2 to 8 bLtR) can be changed programmably from the main processor 1. Further, the color value table is changed during the retrace period when displaying on the CRT 4.

In order to display a CLUT video on such a device, it is necessary to prepare composite image data as exemplified in FIG. 2 and CLUT data as exemplified in FIG. 3. Here, FIGS. 2 and 3 are CLUT video data for displaying a video in which a white disc (ball) moves from right to left on a black background. That is, in the composite image shown in Figure 2, the positions of the background and the disk at each time are set to different values (1410, kl
・・・It is drawn using a gradient. Also, in Figure 3,
It shows which color the CLUT 3 assigns at each time to the entry address represented by each value (no, E+, . . . El). Display is performed as follows. First, the host computer 38 in FIG.
Composite image data and C using PUI and image memory 2
Generate LUT data. Next, the generated composite image is sent to the image memory 2 via the communication line 39 or the secondary storage 37.
Write to. Furthermore, CLUT data is written to CLUT3 using the CPU at time intervals determined by the times shown in FIG.

For example, time T. (initial state), the colors in the first row of Figure 3 are assigned to each entry address of CLtJT 3 (Eo 1E,
...gs), and when time t''=T, -T has passed, change the contents of CLUT3 by writing the second row's color to CLUT3 in the same way. .If the color data determined at times T3, T3, and T4 are written to CLUT3 using the same procedure, the fourth
It can be displayed as a moving image on CB and T4 as shown in the figure (α> - <g>. Here, CLUT3 on the CPU
The rewriting speed is about a few μs per entry address even in a system using normal elements;
The greatest advantage of CLUT videos is that even video images of 30 frames per second can be easily displayed in real time.

One way to create composite image data is to simply superimpose the images of each frame. That is, in the examples of FIGS. 2 and 3, the image IIJ of the first frame (To) of the first plane 1/-yK of the image memory 2, and the second frame (T
It is also possible to create a composite image, such as an image of , ). However, in this case, image data with a depth of 5 bits must be created to express a moving image of only 5 frames, and there is a drawback that moving image data with a large number of colors or frames cannot be created. However, in this example, as shown in Figure 2, the composite image can actually be expressed using only the pixel values of 6111i1, so "f@6 #
It can be seen that 3 bits is sufficient for 2.6.

In this way, composite images originally require C bits/
If pixels are required, a data area of CxN bits/pixel will be required to express N frames, but in reality, as mentioned above, there is a tendency for frames with moving figures to not overlap. Due to this property, it can be expressed using a much smaller number of bits than NxC bits. However, in order to ensure that the figures do not overlap between frames, it is necessary to investigate the spatial arrangement, which could not be determined simply by mathematical logic. Therefore, in the past, the only way to investigate this was to create the composite image interactively and verify it on a desk because humans had to make intuitive judgments. That is,
The drawback is that the moving images that can be created using these methods are limited to extremely simple ones, as shown in the example of FIG. In particular, when moving figures overlap or when the shapes of figures are complex, it is difficult to create the composite image data and CLUT data, and in fact, it is almost impossible.

(8) Purpose of the Invention The present invention is a method for automatically generating composite image data and CLUT data from arbitrary moving image data, and is characterized by examining attributes related to color changes of pixels and merging pixels with the same attributes. The purpose of this method is to solve the above-mentioned drawback that the number of videos that can be created is limited, and to widen the range of moving images that can be displayed with CLUT videos, thereby making CLUT videos easier to use.

(Explanation of structure and operation of the invention FIG. 5 is an example of an original image for explaining the present invention in detail. This example will be used below to explain the generation of composite image data and CLUT data according to the present invention. The generation will be explained. Figures 5 (cL), (b), and (C) are examples in which a disk consisting of one color moves slowly from right to left. .12.13 represents the disk, and 5.7.9 represents the background, respectively.

In the following explanation, disk 6.8.10 will be referred to as the motive form.

In the example shown in FIG. 5, the motive form 6 and the motive form 8 overlap υ, and the motive form 8 and the motive form 10 move so as to overlap.

Furthermore, the color of the motive form 6.8.10 is white, and the color of the background 5.7.9 is black.

Figure 6 is a picture drawn by overlapping Figures 5 (α), (b), and (C). In the figure, 14 to 19 indicate regions formed by overlapping motive forms 6, 8, and 10. In Fig. 6, each area 14 to 1
9 are pixel values B14, BIB..., E, respectively.
.

, and all of them are different, the image 20 in FIG. 6 becomes a composite image of the original images 11, 12, and 13 in FIG. 5. A method for creating the composite image 20 of FIG. 6 will be described below.

FIG. 12 shows an example of the configuration of the host computer 38 on which the present invention is executed. 40 in the figure is C that performs calculations and judgments.
PU, 41 is original image data, composite image data! ,CLUT
42 is a large capacity memory such as a magnetic disk for secondary storage where original image data and composite image data are placed; 43 is a communication interface for sending the completed data to a display system, etc.; be.

Here, it is assumed that the moving image serving as the original image is created in another system and transferred through the secondary storage 42, but it is also possible to use the communication interface 43 or generate it in the CPU 40. An explanation will be given below using a configuration example.

First, a case where the original image is directly used for reference will be explained. First, the original image i1!11.12.13 is read out from the secondary storage 42 and stored in the image memory 44 in the memory area 41.
write to. Here, original images 11, 12, and 13 are stored in image memory +o, respectively.

Assume that data is written to +1 and +2, and a composite image is created in image memory≠3.

Next, image memories 0.4P1 and +2 are simultaneously scanned to read out their contents. In the following description, it is assumed that reading is performed horizontally from the upper left in a television scanning manner. For example, at the first point, the combination is (black, black, black) = (+O color, ≠ color 1, color N2), and at the middle point, (white, black, black) = (+' o color, 4L-1 color, ≠2
color), and so on, 3 color data at each point (in the case of 3 frames>
1 can be read. Therefore, the pixel value of the composite image at the same position (hereinafter referred to as the same point) as the point read from this color data set (for example, (black, black, black)) is determined as follows.

That is, the table memory 45 is cleared in advance.

Table memory 0 (45) can store color data in each item, and can describe a set of color data read out in the row direction. In this example, table memory≠0 uses up to the third column, and the first column contains image memory.

, the second and third columns have image memory + and 1, respectively.
, Na2 colors are written. The CPU 4Q compares the read color data set with the data in each row of the table memory +0 to find a match.

If there is no matching set, the read color data set is added to a blank row of the table memo 1J410, and the added row number is written as a pixel value at the same point in the image memory 萱3. If there is a matching set, the Q number of the set is written as a pixel value at the same point in the image memory +3.

When the scanning of the entire screen is completed in this way, the target composite image 20. is stored in the image memory +3. Table memory +0
A rewrite data for CLUT rewriting is created. FIG. 13 shows the created data 46 for rewriting the C and LUT.

Regarding the usage of the table memory +0 row,
It goes without saying that efficiency can be improved by using row numbers in ascending order, rather than selecting them at random.

FIG. 14 is a flowchart of the above processing. When creating a composite image, in addition to directly using the original image as described above, there is also a method of first converting the original image into a label image (7) and then performing similar processing on the label image. In this case, there is an advantage that the data item on the table memory is not color data, but simply a label number.

Specific examples of the two methods using label images will be further explained below using original image 1 #11, 12, and 13.

First, create a label image from each original image 11, 12, 13,
, L, , L, respectively. Label image.

is calculated from the original image 11 using the illustrated information 21 in FIG. 7 as follows. First, place the original image 11 in the image memory 44,
This is scanned by rask to read the color value of each pixel. In order to check whether the read color value is new or not, the information 21 shown in FIG. 7 is prepared in the table memory 45, and the CPU 40 checks whether the read color value already exists in the information 21. If it is not present in the information 21, the color value and the corresponding label are registered in the information 21 and a label is given to the pixel in the image memory 44. On the other hand, if there is a color value read into the information 21, a label associated with the information 21 is written to the pixel. In this way, as shown in FIG. 8, the label image 22 of the original image 11 and the label color value correspondence 1i? Report 23 is observed. Similarly, original image 1.21
．． 13 as well, a label image flt24.26 and label color value correspondence information 25.27 can be included.

Here, the label images 22, 24, and 26 may be created using a conventional label image method that takes into account connectivity of figures. However, in that case, a process that associates each label with the color value of the original image is required in the next process.

Next, these label images 22, 24, and 26 are combined to form a composite image, which is performed in the same manner as described above as follows. First, the label images 22, 24, and 26 are written in the image memory 44 (s0, n1, +2), and the label combination information 28 shown in FIG. 9 is prepared in the table memory 45 (s00). 24: Scan 26 at the same time. Therefore, the combination of labels read at each pixel position is examined, for example, to find out that ('a, "?, 'a) exists as one corresponding to the area 14. The label introduction information 28 is obtained by rask scanning. While doing so, record these 9 label combinations.

However, if the same combinations are not recorded, combination information such as information 29 in FIG. 9 will finally be obtained. At this time, by writing combination numbers C8 to C6 shown in the information 29 at each pixel position for the combinations obtained according to the rask scan, the composite surface @20 shown in FIG. 6 is obtained.

However, in each area 14 to 19, C, , C
, , C6, C3, C, , C, numbers are given to each pixel. Also, the combination numbers C1 to C6 may be any numerical value as long as they are not the same, but it is clear that if they are numbered condensed, for example from "1" to "6", a composite image can be represented efficiently. . The above processing has been described above. - It is similar to the method of directly handling one image, and processing can be considered by replacing color data with label values.

In addition to the method of simultaneously using the label images 11, 12, and 13 as described above, methods for creating the composite image 20 include:
It is also possible to sequentially create composite images using label images one by one.

FIG. 10 shows composite images 30, 32, and 34 and label combination information 3 obtained at each time point in a mode of sequentially creating composite images.
1.33.35.

Here, 30 is the first composite image, and the label image 11 is used as is. Further, 32 is a second composite image, and the composite image 3o and the label image 12 are written to 0 and +1 of the image memory 44, respectively, and the composite image 3o is simply regarded as a label image, similar to the generation mode of the composite image described above. Then, the composite image 32 is created in the third part of the image memory 44. However, this case differs from the previous example in that the target hexagonal images are two images +O and +1 in the image memory 44. Next, a composite image 34 is created by subjecting the obtained composite image 32 and label image l#13 to the same processing.

In these processes, label combination information 33 and 35 are created in the table memory 45 at each time point.

Here, combination numbers C7 and C8 of information 31, C9, cio, C11, C12 of information 33, C13 to C of information 35
18 can be considered to be the line number in which each label combination is stored. On the other hand, for C7 and C8 in the information 33 or C9, Cl01C1i, and C12 in the information 35, this combination number is treated as it is as a label value, and is used as data for each row of the label combination. Therefore, information 31.3
3, -35 is used to create the label combination information 29 as follows:
can be produced. That is, the line number of the combination of labels in the information 33 corresponding to the labels C9 and Cl01CILC12 in the information 35 is searched and replaced.

For example, C9 of information 35 is the label combination (C9 of information 33).
7, 17), the line corresponding to the combination number C13 of information 35 is (C91, i<g) → (C7, J, 7, L9
) becomes. Similarly, C7 above is labeled 1 according to information 31.
5, the final label combination d of C13
(25,)7,! 9) Can be stopped. other C14
The same applies to ~018. The label combination information obtained in this way is the combination number 013 to C18'i.
By associating them with C1 to C6, they match the information 29.

Next, CL for displaying the composite image 20 as a moving image.
The creation of UT data will be explained. This includes label combination information 29 and label color value correspondence information 23.25.
27 is used. In other words, when the color values given in the label color value correspondence information 23, 25, and 27 are assigned to each label (15, 16, ..., Llo) in the label combination information 29, the CLUT data information in FIG. 11 is obtained. 36 can be obtained. In the information 36, the combination number is CI
, represents the entry address of UT3. Therefore, in order to display each frame of the moving image, it is only necessary to write a vertical color value for each entry address in CLUT3.

For example, to display original image 12 (second frame),
According to the color value data in the shaded part of the second column of information 36,
1 for C,,C,,C,(=G=B=0.0,C3,C
,,C', is J? ,=G=13=1.0 as CL
Write to UT3. In this way, in the composite image 20 of FIG. 6, areas 14, 15, and 19 are black, and areas 16, 17, and
becomes white, and the second frame can be displayed. Note that the information 36 and the information 46 in FIG. 13 are essentially the same, which clearly shows that the same results can be obtained in the three specific embodiments described above.

The present invention has been explained above using a very simple example, but
It can be easily inferred that the number of colors of the original image, the number of frames, the degree of overlapping of motive forms, etc. can be arbitrary. In that case, the manner in which the image memory and table memory are used in the above-described specific example may be different, but this will be omitted because it can be easily realized. Furthermore, when creating a composite image, it goes without saying that similar processing is possible even if each original image is directly output from a graphic generator. Furthermore, the method of expressing each information used in the above explanation was chosen to suit the explanation, and any means can be used to embody it on a 6D computer or the like.

(6) Description of Effects As explained above, according to the present invention, it is possible to automatically generate data necessary for executing a GLUT video from any plurality of original images by a computer, and through automation, This has the advantage of reducing the amount of work and making it possible to target complex videos that were previously impossible.

[Brief explanation of the drawing]

Figure 1 is an example of a system configuration of a graphic display that executes a CLUT video, Figure 2 is an example of a composite image that explains a CLUT video, and Figure 3 is CLUT data for displaying Figure 2 as a motion. For example, Figure 4 shows the second,
Fig. 3 is an example of a 2CL and UT video displayed, Fig. 5 is an example of an original image for explaining the present invention in detail, and Fig. 6 is an example of the three original images shown in Fig. 5 superimposed. Figure 7 is an example of information for converting an original image into a label image, and Figure 8 is a diagram showing the label image and color value label correspondence information of the original image in Figure 5. , FIG. 9 shows label combination information used when creating a composite image for the example shown in FIG. 5, FIG. CLUT data information for displaying the moving image shown in the figure in the composite image shown in Fig. 6, Fig. 12 is an example of the configuration of the host computer shown in Fig. 1, Fig. 13 is information corresponding to Fig. 11, The figure shows an example process 70-chart for creating a rewrite data for CLUT rewriting. In the figure, 1 is the main processor, 2 is the image memory, and 3 is the C
4 is a CRT, 37 is a secondary storage, 38 is a host computer, and 41 is a memory area. Patent Applicant Nippon Telegraph and Telephone Public Corporation Patent Attorney Su 1) Guang (C) #5 [21 No. 61!1 Figure 7 Figure 8 Figure 9 111fJ

Claims (1)

[Claims] (1) Color lookup table video (hereinafter referred to as blade 5)
In a system that displays a video by rewriting a color lookup table (hereinafter abbreviated as CLUT) corresponding to a LI The superimposed images are mapped onto an image plane to create image data for one color LUT video (hereinafter referred to as a composite image).
In order to form on the image plane, the time-series change in color of each point to be mapped is examined, a set of points with the same color change over time is determined to be one region, and the entire screen is The composite image is generated by the means for distinguishing and dividing by the area, and the CLUT is
1. A data generation processing method for a color lookup table video, characterized by generating data for rewriting (referred to as CLUT data). (2) In the method for generating the above-mentioned composite image and CLUT data, in determining the time-series change in color, (CL) Then, it is determined that pixels with the same color information are in the same area, a number called a label is assigned to each area, and the label image is obtained by processing the label as the pixel value of the pixel in the area (α ); (b) scanning the plurality of label images pixel by pixel;
Examine how labels are combined for pixels at the same coordinates, determine that pixels whose coordinates have the same label combinations are in the same area, number each area, and use this number as the pixel value of that area. (b) for obtaining the composite image; and (C) converting the label combination of the means <b) into change data of (,'LUT) for each pixel value of the composite image; Claim (1) characterized in that a time-series change in the color region is determined by using a combination of the means (C) for obtaining the CLUT data.
Data generation processing method for color look amplifier table video described in . (8) In the method of generating the above-mentioned composite image and CLUT data, in determining the time-series change in color, (cL) For each original image from each original image data of multiple screens, Then, it is determined that pixels with the same color information are in the same area, a number called a label is assigned to each area, and the label image is obtained by processing the label as the pixel value of the pixel in the area (α ), and (b) the first composite image is the first label image, and the final second composite image is a first composite image using the (K-1)th composite image and the first label image. It is generated by repeating the procedure for obtaining the first composite image for all label images, and in the procedure for obtaining the first composite image, the
-1) The method of combining the pixel values of the composite image and the pixel values of the iK label image is examined, and it is determined that the same combination is the same region, and a new number is assigned to each region. Obtaining the composite image using means for obtaining a first composite image with the pixel values of the area as the pixel values, and determining and storing which combination of labels corresponds to the pixel values of the first composite image; (C) the means of (c) for converting the combination of labels of the means of (b) into CLUT change data for each pixel value of the composite image to obtain the CI, UT data; 2. A data generation processing method for a color look-up table moving image according to claim 1, characterized in that a time-series change in the color region is determined by using a combination of the following.