JPS62151986A - Picture processor - Google Patents

Abstract

PURPOSE:To change the color of plural areas corresponding to the number of the set labels by using a commonly using memory which can be used both for a picture memory and a label information storing memory and suing a look up table capable of rewriting at a high speed. CONSTITUTION:The output D24 of the density and label commonly used memory 22 is connected to the address of the look up table 23 and the output of the look up table 23 is connected to a D/A converter 24 through a latch 27. The output of the D/A converter 24 is fed to a CRT and a picture is displayed. The density and label commonly used memory 22 and a main memory device 26 are made access from a microprocessor 25 through a bus 28. The look up table 23 is made access from the microprocessor 25 through a gate 29 and a bus 28.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to an image processing device for changing the color, density, etc. of an image displayed on a CRT screen.

(Prior art and its problems) Changing colors has traditionally been a common practice as one of image processing techniques. For example, by changing only the color data of areas corresponding to tree leaves in a landscape image from green to yellow, a new image that is different from the original image is generated. In order to perform this process, the red (RED) of each image pixel (pixel),
Each of the green (GREEN) and blue (BLUE) data may be replaced with different data. However, if it is attempted to rewrite the data of each image pixel each time the color is changed, the number of accesses to the image memory from processing nodes such as CPtJ will naturally increase. For this reason, color change processing by rewriting the image memory inevitably increases processing time. Therefore, frequent color change processing is not suitable for systems that require high-speed responsiveness, high resolution, or extremely large storage capacity of image memory, and therefore require specially configured hardware (for example, a processor dedicated to image processing). ), the hardware system ended up becoming more complex and the programming became more specialized.

Furthermore, in the process of changing the color by rewriting the image memory, once the image data is changed, the original data is erased. Therefore, it is not suitable for systems such as color change simulations where original colors and changed colors are often compared.

From this point of view, the inventors of the present application created the image processing device described below. FIG. 9 shows a block diagram of a part of the image processing apparatus.

■ is logical image memory, 2 is R (red), G (green), B
This is an image memory that is provided corresponding to (blue) and stores density information. 3 is a lookup table, 4 is D
/A converter. The logical image memory 1 and the image memory 2 are accessed by the microprocessor 5 via the bus 8.

6 is a main memory of this microprocessor 5. Above I)/A converter 4 output (video analog signal)
is sent to the CRT and an image is displayed. 2. Lookup table 3 is a type of arithmetic unit, and state 1. is capable of high-speed signal processing. It is composed of RAM. The data output from the image memory 2 and the logical image memory I are combined to form the address information of the look-up table 3. The capacity of the lookup table 3 is, for example, 256 bytes), and converts 256 types of information into separate information (8 bits). In this device, lookup table 3
You can change the color without changing the contents of the image memory 2 by changing the contents of the image memory 2. Also, by storing the information for switching the lookup table 3 in the logical image memory 1, By switching the table 3, it is possible to change the color of only a specific part of the image.The output of the lookup table 3 is sent to the CRT via the latch 7.The lookup table 3 is connected to the gate 9.
, the contents are set by the microprocessor 5 via the bus 8.

Now, in this conventional method, a logical image memory I is required in addition to the image memory, which has the disadvantage of increasing the scale of the system. Furthermore, a method for changing the color of multiple areas at the same time was not disclosed.

An object of the present invention has been made in view of the above-mentioned conventional problems, and it is an object of the present invention to provide a system that can quickly change the color of multiple areas in an image without having a special logical image memory. be.

(Means for solving the problem) By the way, in recent years, with the reduction in the price of image memory, it has become common to store image information in memory and perform image processing and output. The amount of information required per dot varies depending on the type of image. For example, an image such as a black and white print may require 1-bit information indicating whether it is white or black, and an image such as a traffic sign may require 3-4 bits of information since the number of colors is red, white, yellow, green, blue, etc. Although the number of colors increases in images such as animation cell pictures, the colors can be painted solidly, so information on shading is not necessary and the amount of information may be about 5 to 7 pits. However, approximately 18 bits are required to express natural images such as photographs and television images.

On the other hand, when considering image processing, it is desirable that the amount of information per dot in the image memory be a multiple of 8, since a typical microprocessor uses 8 or 16 bits as a unit of processing. For example, in a device that inputs a color natural image and processes the image, the color information is separated into R, G, and B and stored in the image memory.

A device can be considered in which each dot has a total amount of information of 24 bits (8 bits for each dot). When such a device stores various images as described above, there is a difference between the amount of information held by the image and the amount of information in the image memory, resulting in waste of capacity of the image memory.

Next, when changing the color of specific areas in an image, the number of areas varies depending on the case. For example, in an image of a kimono, you often want to change two colors: the base and the obi.
Animation cel drawings (J) It is often the case that you want to change the color at the same time for the number of types of paint used in that screen.
It is necessary to label regions, but the amount of information required for labeling varies depending on the subject of the image.

The above can be summarized as follows.

■ The amount of information per dot in an image varies depending on the object.

(2) It is desirable that the amount of information per dot in the image memory is a multiple of eight.

■The amount of information in the image label varies depending on the object.

The present invention has been made by focusing on the above points (■ to ■). To summarize the present invention, the present invention can be summarized as follows: A label for identifying the density data of each pixel making up an image and a pixel corresponding to an area where this density data is to be changed. A density label memory that stores data as a single piece of data having a predetermined data length set corresponding to the amount of information that an image has, and output data of this density label memory are introduced. a look-up table for changing and outputting the density data of pixels corresponding to the area where the data is to be changed; a display means for displaying an image based on the output of the look-up table; The image processing apparatus is characterized in that it includes a means for writing a label, and changes and colors an area of an image corresponding to a set label. That is, the present invention uses a density label dual-purpose memory that has the functions of both an image memory and a label information memory, thereby increasing memory usage efficiency.

(Function) In the present invention, the density label memory can store both image information and label information.

For example, the memory that also serves as a density label stores bits (m
, n is the vertical and horizontal resolution of the image, and k is an integer). When the image information is i bits, the label information is stored in the wasted part of the memory that also serves as a density label, that is, 8 -i bits). Store it inside. As a result, if the amount of information per dot in the image is small, the amount of information in the label can be increased, and the optimal combination of image and label information can be selected, making the density label memory more efficient. can be used.

(Example) Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

FIG. 1 shows an apparatus equipped with an 8-bit density label memory 22 for each of red (R), green (G), and blue (B) data. The output D24 of the concentration label memory 22 is connected to the address of the lookup table 23, and the output of the lookup table 23 is connected to D/D through the latch 27.
It is connected to the A converter 24. In this example, the output of the lookup table 23 is 8 bits each of R, G, and B (0 to 2
55).

The output (video analog signal) of the D/A converter 24 is sent to a CRT for image display. The concentration label memory 22 and the main memory 26 are accessed by the microprocessor 25 via the bus 28. Lookup table 23 is accessed by microprocessor 25 through gate 29 and bus 28.

Next, the processing of this device will be explained. First, an image is input into the density label memory 22 using means such as a scanner or a TV camera. At this stage, the density label memory 22 records R for each dot.
, G, and B each store 8 bits of information. However, as mentioned above, the amount of information required per dot is actually smaller than 8 dots, and varies depending on the type of image. For example, if you want to change the background and color of the obi of a kimono, it is sufficient to have 6 bits each of R, G, and B image information. Therefore, the upper six bits of the density label memory 22 are used for image information, and the lower two bits are used for storing label information. FIG. 2 shows an example in which 6 bits are used for image information and 2 bits are used for label information. In this case, the image information j per color is 0≦i<28, and the label information ρ is 0≦ρ<2
2, and the output of the density label memory 22 is 22×i×ρ. FIG. 3 shows an example of label information memory divided into areas. The label information memory contains the same values for R, G, and B, for example, σ=1 for the kimono area, (!-2 for the obi area, and ρ-0 for other areas). This data is written using a microprocessor.For example, a method for writing this data is to display a cursor on a CRT, write each numerical value corresponding to the cursor into the label information memory, and then move the cursor to the bottom of the kimono. Move over the area or over the band area,
There is a method of writing numerical values corresponding to the area into the label information memory.

Next, we will show how to actually change the color.

The output of the density label memory 22 is 22×i+ρ, where ρ-0 is the background, ρ-1 is the kimono area, and Q=2 is the obi area, so R, G, The address of each lookup table 23 for B is 22xi'+
When ρ′ (0≦i′<2′, 0≦ρ′〈22
), (Lookup table 2 with address '=1
By changing 3, only the color of the background of the kimono can be changed, and by changing the look-up table 23 having the address of ρ'-2, only the color of the obi can be changed.

FIG. 4 shows an example of the look-up table 23 for changing the background color (Q''-1) of a kimono to be brighter and the belt (ρ''-2) to be darker.

Next, an example of coloring animation cels will be shown.

The original drawing shall be a line drawing as shown in FIG. As in the kimono example, first, the scanner and TV are stored in the density label memory 22.
Using a camera or other means, the image is stored in memory 2 that also serves as a density label.
Enter 2. At this stage, the density label memory 22
(Eight bits of information each for RlG and B can be stored per dot.

However, in the case of line drawings, one bit is sufficient for the amount of information per dot. Therefore, the second-order 1 bit of the density label memory 22 is used for image information, and the lower 7 bits are used for storing label information. Creating image information of 1 bit each for R, G, and B from 8 bits of gray information for each R, G, and B. Since the original image is a black and white image, you can set an appropriate threshold and perform binarization. good.

FIG. 6 shows an example of the density label memory 22 in which the upper 1 bit is set for image information and the lower 7 bits are set for label information. In this case, the image information i for each color of R, G, 'B is i=0, ■, and 12-0 is, for example, a black line, i=
1 corresponds to the white background area. Also, label information ρ is 0≦e
<Can take a range of 27. As a result, the output of the density label memory 22 becomes 27×i+ρ. A microprocessor is used for the label information memory, and R, G
, B. Write the same value for each. A possible method for writing label information is to fill in the line drawings stored in the image information memory. FIG. 7 shows an example of label information memory divided into areas.

In this example, 13 areas are set.

Next, we will show how to actually color the image after performing the above processing. The output of the density label memory is 27×i+g,
Since the area with i=1 is the white part of the background, enter the label number of the area you want to color with ρ°'(0≦ρ''<127
) If the contents of the lookup table 23 for each R, G, and H whose address is represented by 27+ρ'' are set to the desired color, the area with the label ρ'' is colored. The output of the lookup table 23 is 8 bits each for RlG and B, so 22
Can display 4 different colors. Lookup table 2
The data to be written to 3 is only 1-byte numerical value each for R, G, and B, and it is very fast. Select ρ°° appropriately and R
,G.

B: By simply writing 3 bytes of color data into each lookup table 23, coloring can be done quickly and freely. FIG. 8 shows an example of the lookup table 23 that colors the regions with label numbers 1, 2.3 in light, blue, and green, respectively. Further, the data at addresses 9' to 27-1 in the lookup table 23 correspond to the line area, so if you want a black line, you can set them all to 0.

(Effects of the Invention) As is clear from the above description, the apparatus of the present invention uses a dual-purpose memory that can be used as both an image memory and a label information storage memory, so that it can process image shading information according to the type of input image. It is possible to increase the number of labels, increase the number of labels, use memory freely and efficiently, reduce the scale of the system, and create a low-cost image processing device. Furthermore, since a lookup table that can be rewritten at high speed is used, it is possible to quickly change the color of a plurality of areas according to the set number of labels.

Although this embodiment takes as an example a device that separates color information into the three primary colors of R, G, and H and stores them, the present invention can also be applied to a device that uses color separation for brightness, color difference, etc.

[Brief explanation of drawings]

FIG. 1 is a block diagram of a part of the image processing device according to the present invention, FIG. 2 is an explanatory diagram of a density label memory used in one embodiment of the image processing device shown in FIG. 1, and FIG. 4 is an explanatory diagram of the label information of one processed image in the density label memory, FIG. 4 is a characteristic diagram of the lookup table used in the above embodiment of the image processing apparatus of FIG. 1, and FIG. 6 is an explanatory diagram of another processed image. FIG. 6 is an explanatory diagram of the density label memory used in another embodiment of the image processing apparatus shown in FIG. 1. FIG. Fifth
FIG. 8 is a characteristic diagram of a lookup table used in the embodiment of FIG. 6, and FIG. 9 is a block diagram of a part of a conventional image processing apparatus. 1...Logical image memory, 2...Image memory, 3...
・Lookup table, 4...D/A converter, 5...processor,
6... Main memory section, 7 Latch circuit, 22... Label memory, 23... Lookup table, 24... D/A converter, 25... Processor, 2
6... Main memory section, 27... Latch circuit.

Claims (1)

[Claims] (1) A predetermined data length that is set corresponding to the amount of information that the image has, including the density data of each pixel that makes up the image and label data that identifies the pixels that correspond to the areas where this density data is to be changed. A density label memory that stores the data as one data having a density label, and a lookup table that changes and outputs the density data of pixels corresponding to the area where the density data is to be changed, and the output data of this density label memory is introduced. , comprising display means for displaying an image based on the output of the lookup table, and means for writing label information into the density label memory, and changing and coloring the image area corresponding to the set label. An image processing device characterized by: