JP2008131518A - Image processor, image processing method, and computer program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To execute synthetic operation processing of images under low load using a small scale circuit by reducing data quantity of wipe information used for applying the synthetic operation processing to each pixel. <P>SOLUTION: With respect to the wipe information for longitudinal wiping, as gray values of pixels on the same horizontal position are identical with one another, the wipe information is shared between the multiple pixels by having the wipe information of every pixel on a vertical direction on a screen. When the wiping processing is executed, the same wipe information is repeatedly used to the pixels on the same horizontal position. More specifically, every time the horizontal position of the processed pixel moves in a vertical direction, the wipe information is read out only once for a comparison operation with reference information, and operation results thereof are applied to each pixel on the same horizontal direction. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to an image processing apparatus and image processing method for processing still images and moving images, and a computer program, and more particularly to an image processing apparatus and a special effect such as combining a plurality of moving images and still images. The present invention relates to an image processing method and a computer program.

  More specifically, the present invention relates to an image processing apparatus that performs screen switching or scene switching processing for switching to another screen according to a screen transition technique such as “wipe” while giving temporal changes to the screen, and The present invention relates to an image processing method and a computer program, and more particularly, to an image processing apparatus, an image processing method, and a computer program for performing a composite operation on a plurality of images to be combined according to wipe information designating a calculation process for each pixel. .

  Techniques for performing special effects on images are widespread mainly in the broadcasting industry, for example. For example, when switching video output from a plurality of video cameras in a broadcasting station, screen switching is often performed using special effects (effects) such as wipe. Also, recently, when combining multiple digital images such as moving images and still images shot with a digital still camera or camcorder, it is possible to switch screens or switch scenes using special effects such as wipe. It has become common.

  Wipe is an effect that inserts the next image at the same time while erasing or extruding the previous image with a specific pattern (wipe pattern). For example, from the top to the bottom of the screen frame Alternatively, the previous display image is overwritten with the next display image from left to right. For example, as a wipe pattern for converting the image shown on the left in FIG. 10A to the image shown on the right in FIG. 10A, a “vertical wipe”, that is, a processing method for overwriting the image from the top to the bottom of the screen frame (see FIG. 10B). (See FIG. 10C). “There is a“ horizontal wipe ”, that is, a method of overwriting an image from the left to the right of the screen frame. Of course, the wiping process is not limited to the one shown in the figure, and there are various wiping methods other than dividing the screen into a plurality of areas and performing wiping expression with the same wiping pattern for each divided area.

  FIG. 11 shows a basic configuration of an image processing apparatus that realizes wipe expression by complementarily outputting image data before and after screen transition. In the illustrated example, the image signals before and after the screen transition are input synchronously from the terminals 101 and 102 so that their pixel positions (addresses) coincide with each other. The terminal 105 receives a wipe signal for designating, for each pixel position, which image data before and after the screen transition should be output. The gates 103 and 104 perform complementary processing on the respective pixel signals. Is given. Then, each image signal is superimposed by the adder 106 and a wiped video signal is output from the terminal 107 (see, for example, Patent Document 1).

  Gradient data expressing a desired wipe pattern such as a vertical wipe and a horizontal wipe is created as wipe information for designating calculation processing for each pixel. Then, the reference information that changes with time is compared with the wipe information, and the calculation and synthesis formula for the pixels of the respective image data before and after the screen transition is determined. In the apparatus example shown in FIG. 11, the reference value and the gradation value of the wipe information are compared for each pixel position, and from which image data the pixel signal should be output is determined according to the comparison result. In other words, the mask data can be configured based on the comparison result between the wipe information and the reference information, and the image data before and after the screen transition is cut out using this mask data and superimposed on these screens. The wipe expression can be realized by repeatedly executing the process while updating the reference information as time passes.

  The wipe information is composed of gradation data representing the arithmetic processing as shown in FIG. For example, when performing a vertical wipe, gradation data is created as the wipe information, and the gradation value gradually increases from the top to the bottom of the screen. When performing a horizontal wipe, the gradation is gradually increased from the left to the right of the screen. Gradient data with higher values is created as wipe information. On the other hand, the reference information is sequentially counted up as time passes. Then, mask data consisting of areas with lower wipe information than the reference information is created to cut out the image data before the screen transition, and mask data consisting of areas with higher wipe information than the reference information is created to make the screen transition The subsequent image data is cut out, and these cut out images are superimposed on the screen. By repeating such screen processing while changing the reference information every moment, a wipe effect is realized in which the image is switched from the top or gradually from left to right.

  The wipe information as shown in FIG. 12 can be dynamically generated from a mathematical expression. Therefore, a method of sequentially generating wipe information at the time of performing the wipe process is conceivable. In this case, there is a problem that an arithmetic circuit for processing a mathematical expression for generating more general wipe information is complicated and large in scale, and additionally requires a processing time. These problems are exacerbated by an increase in the data size of wipe information and diversification of wipe patterns to be used. Further, in order to simplify the arithmetic circuit for generating the wipe information, only processing specialized for a specific wipe effect can be performed.

  For this reason, a method is conceivable in which wipe information composed of gradation data or the like is created in advance and stored in a wipe information memory composed of a frame memory or the like.

  For example, wipe information stored in a wipe pattern memory consisting of a frame memory is read for each pixel, and calculation processing is determined for each pixel position based on a comparison result between the wipe information and reference information, before and after the screen transition. A video signal synthesizing apparatus that avoids abrupt screen transition and improves the quality of the wipe image has been proposed (for example, see Patent Document 2). .

  However, when a wipe information frame memory is provided, an increase in the data size of the wipe information necessitates an extra memory area as an image processing apparatus, leading to an increase in the cost of the apparatus, which is disadvantageous. If the wipe patterns to be used are diversified, the total data size of the wipe information that must be stored becomes larger, which becomes even more serious.

  In order to reduce the data size of wipe information, there is a method that uses a compression technique such as the run length method (the run length method has little color change between adjacent pixels, and values appear continuously. This is a method of encoding “the length in which the same color is continuous” by utilizing the redundancy of image data, and is often used in facsimile communication or the like). In this case, the data size when the wipe information data itself is held in the memory is reduced, and the data stored when performing the operation such as the wipe process is expanded as data for each pixel. use.

  For example, a wipe pattern generation device that obtains pattern data for soft wipe by performing data compression by representing a wipe pattern by polar coordinates and processing using a divider circuit, a multiplier circuit, and a limiter has been proposed. (For example, see Patent Document 3).

  Obviously, the data size of the wipe information can be reduced by using data compression. However, when performing the wipe process, it is necessary to separately provide an arithmetic circuit for performing a decompression process in accordance with the compression method, and an arithmetic circuit for a specific mathematical expression. It is also disadvantageous in terms of processing speed.

  As the circuit scale for generating wipe information increases, this alone increases the cost of the circuit portion of the image processing apparatus, and further increases the power consumption during the circuit operation. Miniaturization becomes difficult.

  Complicating the calculation for the wiping process extends the absolute processing time, so that the speed limitation on the system configuration acts in a disadvantageous direction.

Japanese Patent Laid-Open No. 5-30423 JP 2004-282448 A JP 10-65968 A

  An object of the present invention is to provide an excellent image processing apparatus, image processing method, and computer program capable of suitably giving special effects such as combining a plurality of moving images and still images.

  A further object of the present invention is to change the screen or scene to change to another screen according to a screen transition method such as “wipe” while giving temporal changes to the screen displayed on the television screen or the like. An object of the present invention is to provide an excellent image processing apparatus, image processing method, and computer program capable of suitably performing switching processing.

  A further object of the present invention is to provide an excellent image processing apparatus and image processing method capable of suitably performing a synthesis operation on a plurality of images to be synthesized according to wipe information designating an arithmetic process for each pixel, and a computer To provide a program.

  A further object of the present invention is to reduce the data size of the wipe information used to give a composite calculation process to each pixel when combining a plurality of images to give a special effect such as wipe, and to reduce the data size. An object of the present invention is to provide an excellent image processing apparatus, image processing method, and computer program capable of performing a composite calculation process with a low load using a circuit.

The present invention has been made in view of the above problems, and a first aspect thereof is an image processing apparatus for transferring an image displayed on a screen by a wipe effect,
A first image memory for storing image data before screen transition;
A second image memory for storing image data after screen transition;
A wipe information memory for designating calculation processing for each pixel;
Reference information generating means for generating reference information that changes over time;
A read control unit that reads pixel data from the first and second image memories for each pixel position and reads wipe information corresponding to the pixel position from the wipe information memory;
The wipe information and the reference information are compared, a pixel data calculation / synthesis formula is determined based on the comparison result, and the pixel data read from each of the first and second image memories according to the determined calculation / synthesis formula is obtained. An arithmetic unit to be combined;
An output unit that outputs an image composed of pixel data synthesized by the arithmetic unit;
Wipe information is composed of gradation data that expresses the calculation processing with grayscale values.
The wipe information memory shares one wipe information with a plurality of pixels having the same gradation value,
The first read control unit changes the address order or data read procedure for reading the wipe information from the wipe information memory, and uses the corresponding wipe information when reading the pixel data at each pixel position from each image memory. ,
An image processing apparatus characterized by this.

  When switching between a plurality of images such as a moving image and a still image, it is common to perform screen switching or scene switching using a special effect technique such as “wipe”.

  The image processing apparatus according to the present invention is a target of switching when switching a plurality of images while giving a special effect such as a wipe, and in addition to the plurality of images used for creating an output screen, according to the passage of time. Wipe information that specifies the calculation method for each pixel is used. In addition, in order to express temporal screen transition using wipe information, reference information whose value changes with time by a counter operation or the like is used. Then, at each pixel position, the reference information that changes over time is compared with the wipe information, the calculation composition formula for each pixel before and after the screen transition is determined, and the images to be switched are combined to be wiped. Processing is performed.

  Wipe information can be dynamically generated from mathematical formulas, but the arithmetic circuit for processing mathematical formulas for generating more general wipe information is complicated and large in scale, and additionally requires processing time. There's a problem. Therefore, a general method is to store the wipe information in a wipe information memory including a frame memory or the like.

  If the data size of the wipe information is increased, an extra memory area is required as an image processing apparatus, leading to an increase in the cost of the apparatus, which is disadvantageous. In order to reduce the wipe information, there is a method using a compression technique such as a run length method. However, when performing the wipe process, it is necessary to separately receive an arithmetic circuit for performing a decompression process in accordance with the compression method and an arithmetic circuit for a specific mathematical formula. It is also disadvantageous in terms of speed.

  Assuming that one wipe information per pixel is used, the data size of all wipe information is determined by the image size and the size per unit of the wipe information selected according to the contents of the wipe to be expressed. On the other hand, in the image processing apparatus according to the present invention, paying attention to the redundancy of the wipe information, one wipe information is given to a plurality of pixels in accordance with the content of the target image processing effect. The data size of the wipe information can be reduced by sharing one wipe information among the pixels. Then, when reading out the pixel data at each pixel position from each image memory, the reading control unit performs an address order or data reading procedure for reading the wipe information from the wipe information memory according to the content of the target image processing effect. Change it.

  For example, the wipe information for the vertical wipe has the same gray value between the pixels having the same horizontal position. Therefore, the wipe information for one pixel is common to the plurality of pixels by having the wipe information for one pixel in the vertical direction of the screen. Can be When performing the wiping process, the arithmetic unit may repeatedly use one piece of wipe information that is shared by the pixels at the same horizontal position on the screen. In other words, each time the horizontal position of the processing pixel moves in the vertical direction, the wipe information is read out once and compared with the reference information, and the calculation result is applied to all the pixels in the horizontal direction. .

  When the image processing apparatus uses the wipe information shared by the pixels in the horizontal direction, the control for performing the vertical wipe process is that one horizontal line from each image memory is used when the image is scanned by one line in the horizontal direction. While reading each pixel data on the line sequentially, the wipe information memory reads the wipe information at the horizontal position only once, and the read control unit only changes the speed at which the wipe information is read from the wipe information memory. There is no need to change the special processing or circuit for the processing in the subsequent calculation unit.

  Further, in the case of wipe information for horizontal wipe, since the gray value is the same between pixels having the same vertical position, the wipe information for one pixel is provided in the horizontal direction of the screen, and the wipe information is shared, The size can be reduced. When performing the wipe process, the calculation unit may use one common wipe information for each pixel at the same vertical position on the screen. That is, wipe information corresponding to each horizontal position on the screen is sequentially read out and compared with a reference value to determine a calculation method for the pixel. When the scanning of one horizontal line is completed and the horizontal position of the processing pixel moves in the vertical direction, similarly, wipe information corresponding to each horizontal position is sequentially read out and a comparison operation between this and the reference value is performed. A calculation method for the pixel is determined.

  When the image processing apparatus uses the wipe information shared by the pixels in the vertical direction, as a control for performing the horizontal wipe process, in the process of each horizontal scanning line, the read control unit wipes for each corresponding horizontal position. It is only necessary to switch so that the information is read again, and there is no need to change any special processing or circuit for the subsequent processing in the calculation unit 14.

  When the screen is divided into a plurality of areas and wipe processing is performed with the same wipe pattern for each divided area, the wipe information is shared by the divided areas, and the vertical or horizontal direction is used in the divided areas. By further sharing the wipe information, the data size can be greatly reduced. In such a case, when the calculation unit synthesizes the image data of each divided region, the read control unit repeatedly reads the wipe information in the wipe information memory and uses it for the comparison calculation with the reference value. Good.

In addition, according to a second aspect of the present invention, image processing for transitioning an image displayed on the screen from the first image before the screen transition to the second image after the screen transition is performed on the computer. A computer program described in a computer-readable format, the reference information generating procedure for generating reference information that changes with time for the computer;
Wipe information consisting of gradation data representing the calculation process corresponding to the pixel to be processed with gradation values is compared with reference information, and an arithmetic synthesis formula of pixel data is determined based on the comparison result, and the determined calculation Executing a calculation procedure for combining pixel data read from the first and second image memories in accordance with a combining formula;
The wipe information is shared by a plurality of pixels having the same gradation value,
In the calculation procedure, the wipe information is read out by changing the address order or the data reading procedure, and the corresponding wipe information is used when combining the pixel data at each pixel position.
This is a computer program characterized by the above.

  The computer program according to the second aspect of the present invention defines a computer program described in a computer-readable format so as to realize predetermined processing on the computer. In other words, by installing the computer program according to the second aspect of the present invention on the computer, a cooperative action is exhibited on the computer, and the same as the image processing apparatus according to the first aspect of the present invention. An effect can be obtained.

  According to the present invention, a screen change or a scene change that changes to another screen according to a screen transition technique such as “wipe” while giving a temporal change to a screen displayed on a television screen or the like. It is possible to provide an excellent image processing apparatus, image processing method, and computer program that can perform processing appropriately.

  In addition, according to the present invention, when a plurality of images are combined to give a special effect such as a wipe, the amount of wipe information used for applying a combination calculation process to each pixel is reduced, and a small scale is obtained. It is possible to provide an excellent image processing apparatus, image processing method, and computer program capable of performing image composition calculation processing with low load using a circuit.

  When the image processing apparatus according to the present invention divides the screen into a plurality of areas such as vertical wipes and horizontal wipes and performs the wipe expression with the same wipe pattern for each divided area, the wipe information is minimized. The screen is composed of divided units, and the screen is synthesized using the same wipe information in each divided region. In such a case, since one piece of wipe information is shared by a plurality of pixels, the data amount of the wipe information can be reduced as compared with the prior art having wipe information for each pixel, and a special circuit is used. Wipe expression can be realized without any problem.

  In the present invention, the wipe information is not compressed to reduce the amount of data. Therefore, when the wipe information is used, the data decompression process is not necessary, so that the wipe process can be performed with low addition. Since it is not necessary to add a particularly complicated processing circuit, even if the variation of the wipe expression is expanded to some extent, the processing speed of the entire system is not affected.

  Other objects, features, and advantages of the present invention will become apparent from more detailed description based on embodiments of the present invention described later and the accompanying drawings.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

  FIG. 1 schematically shows a functional configuration of an image processing apparatus 10 that performs a wipe process on two images. A plurality of images to be combined and wipe information for designating calculation processing for each pixel are stored in each frame memory in the storage unit 11. When the control of the synthesis is started by the control unit 12, the pixel data of the pixel position to be processed is read from the image 1 and the image 2 before and after the image transition by the read control unit 13, and the same from the frame memory. Wipe information at the pixel position is read and provided to the calculation unit 14. Further, the control unit 12 gives a reference value for determining the composition calculation to the calculation unit 14. The reference value changes with time by a counter operation or the like.

  The calculation unit 14 performs calculation on the image 1 and the image 2 in accordance with the given reference value and wipe information, obtains a calculation value of the pixel, and outputs the calculated value to the output unit 15.

  Specifically, the pixel data used for the wipe is complementarily output from the image 1 and the image 2 based on the magnitude comparison result between the wipe information and the reference information that changes every moment at each pixel position. As a result, the image areas obtained by cutting out the image 1 and the image 2 before and after the screen transition are superimposed on the screen, and the ratio of the image areas of the image 1 and the image 2 on the screen is changed over time. Wipe processing can be performed.

  For example, the image data value of image 1 is p1, and the image data value of image 2 is p2. Assuming that the wipe information w has a size of 8 bits per pixel, the reference value r also has a value of 8 bits, and pixel data for each pixel position is one of the image 1 and the image 2 as an example of determining the calculation. Consider the following example of complementary output from

When w> r: arithmetic expression: pout = p1
When w ≦ r: Operational expression: pout = p2

  When the reference value r is changed over time, the output pout can be changed from the above equation without changing the wipe information side, and the wipe, that is, the screen transition can be expressed. When performing the wipe expression using the wipe information in this way, a comparison operation with a reference value is performed for each pixel, and an output pixel is selected from one of the image data before and after the screen transition.

  The wipe information is gradation data whose density changes from the top to the bottom as shown in FIG. 12A. When the reference value r is counted up, the reference value r is larger than the density level of the wipe information. This area gradually expands from the top to the bottom of the screen. Accordingly, the process of overwriting the original image with the image after the screen transition proceeds from the top to the bottom of the screen, so that the wipe effect can be obtained.

  FIG. 2A shows a state in which the vertical wipe is realized by using the wipe information including the gradation data shown in FIG. 12A and increasing the reference value r with the passage of time. For example, for wipe information composed of gradation data of 256 gradations, an operation is performed in which the initial value of the reference value is set to 0, and the reference value is incremented by +1 per fixed time, and added up to 255 and added to the calculating unit In the case of going forward, the first screen output is the image 1 (p1), but the vertical wipe expression is such that the image 2 (p2) appears from the top. The time required for the screen transition at this time is (a time interval in which the reference value is +1) × 255.

  Further, the wipe information is gradation data whose density changes from the left to the right as shown in FIG. 12B. When the reference value r is counted up, the reference value r is greater than the density level of the wipe information. The larger area gradually increases from the top to the bottom of the screen. Accordingly, the process of overwriting the original image with the image after the screen transition proceeds from the top to the bottom of the screen, so that the wipe effect can be obtained.

  FIG. 2B shows how the vertical wipe is realized by using the wipe information composed of the gradation data shown in FIG. 12B and increasing the reference value r with the passage of time. For example, for wipe information composed of gradation data of 256 gradations, an operation is performed in which the initial value of the reference value is set to 0, and the reference value is incremented by +1 per fixed time, and added up to 255 and added to the operation unit 14 In the case of going forward, the first screen output is the image 1 (p1), but the vertical wipe expression is such that the image 2 (p2) appears from the top. The time required for the screen transition at this time is (a time interval in which the reference value is +1) × 255.

  Here, assuming that one wipe information per pixel (that is, having wipe information for each pixel), the size per unit of wipe information selected according to the image size and the content of the wipe to be expressed (wipe pattern) Determines the data size of all wipe information.

  In this embodiment, in order to reduce this wipe information, one wipe information is given to a plurality of pixels from the correspondence of one wipe information per pixel (that is, one wipe information is shared by a plurality of pixels). ). Here, a simple reduction method that does not affect the movement of the wipe that is desired to be expressed is not provided by simply wiping several pixels and providing wipe information for the pixel.

  For example, when the vertical wipe process is performed, the pixels displayed in the horizontal line on the screen are always the same screen (that is, read from one frame memory). In the case of the wipe information for vertical wipe as shown in FIG. 12A, it is composed of gradation data in which the gradation value gradually increases from the top to the bottom of the screen, and the gradation value is between pixels having the same horizontal position. Since they are the same, it is not necessary to have wipe information for each pixel in the horizontal direction. Therefore, as shown in FIG. 3, it is possible to reduce the data size by having wipe information for one pixel in the vertical direction of the screen and making the wipe information common to the pixels in the horizontal direction.

  The wipe information for vertical wipe shown in FIG. 3 is only for the number of pixels in the vertical direction of the screen, so that the data size is greatly reduced. For example, consider a case where an image processing apparatus that handles a screen having a pixel size of 720 × 480 corresponding to a general DV format for home digital video and the like realizes the vertical wipe expression as shown in FIG. Assuming that there is wipe information consisting of 1 byte per pixel, the wipe information for the entire screen has a size of 720 × 480 = 345,600 bytes. On the other hand, as described above, when the wipe information is shared among a plurality of pixels having the same horizontal position in consideration of the redundancy in the horizontal direction of the wipe information (see FIG. 3), the wipe information is the pixel 1 The size is 480 bytes corresponding to the column, and the data size can be reduced to 1/720.

  When the wipe information is made common to the pixels in the horizontal direction as described above, the calculation unit 14 may use the same wipe information for each pixel at the same horizontal position on the screen. For example, when screen output is performed by horizontal scanning, wipe information is read out at each horizontal position on the screen, and this is compared with a reference value once, and the result is sequentially applied to all horizontal pixel positions. Apply. Then, every time the scanning of one horizontal line is completed and the horizontal position of the processing pixel moves in the vertical direction, the wipe information is read out once and compared with the reference information, and the result of the calculation is calculated in the horizontal direction. Apply to all pixels. By repeatedly performing such processing in the vertical direction of the screen, it is possible to realize the same wipe processing as in the case where the entire screen has wipe information and the reference value r and the wipe information w are compared for each pixel. .

  When the image processing apparatus uses wipe information shared by pixels in the horizontal direction (see FIG. 3), the control for performing the vertical wipe process is to scan the image for only one line in the horizontal direction. While each pixel data on the same horizontal line is sequentially read from the image 1 and the image 2 stored in the storage unit 11, the wipe information at the horizontal position is read only once from the wipe information memory. The data reading control unit 13 only changes the reading speed from the storage unit 11, and there is no need to change any special processing or circuit for the processing in the subsequent calculation unit 14.

  Next, consider the case of performing the horizontal wipe process. In the horizontal wipe, the pixels displayed on the vertical line of the screen are always the same screen (that is, read from one frame memory). In the case of the wipe information for the horizontal wipe, as shown in FIG. 12B, the gray value is gradually increased from the left to the right of the screen, and the gray value between the pixels having the same vertical position. Therefore, it is not necessary to have wipe information for each pixel in the vertical direction. Therefore, as shown in FIG. 4, it is possible to have wipe information for one pixel in the horizontal direction of the screen and to share the wipe information, thereby reducing the data size.

  Since the wipe information for the horizontal wipe is only the number of pixels in the horizontal direction of the screen, the data size is greatly reduced. For example, in the case of realizing a horizontal wipe expression in an image processing apparatus that handles a screen having a pixel size of 720 × 480 corresponding to a general DV format in home digital video etc., from 1 byte per pixel. , Wipe information for the entire screen has a size of 720 × 480 = 345,600 bytes. On the other hand, as described above, if wipe information is shared by a plurality of pixels having the same vertical position in consideration of the redundancy in the vertical direction of the wipe information, the wipe information is 720 bytes corresponding to one row of pixels. The data size can be reduced to 1/480.

  When the wipe information is made common to the pixels in the vertical direction in this way, the calculation unit 14 may make the same wipe information common to the pixels having the same vertical position on the screen. For example, when screen output is performed by horizontal scanning, the wipe information of the corresponding pixel at each horizontal position on the screen is sequentially read out and compared with a reference value to determine the calculation method for the pixel. When the scanning of one horizontal line is finished and the horizontal position of the processing pixel moves in the vertical direction, similarly, wipe information of the corresponding pixel at each horizontal position is sequentially read out and a comparison operation between this and the reference value is performed. In line, the calculation method for the pixel is determined. By repeatedly performing such processing in the vertical direction of the screen, it is possible to realize the same wipe processing as in the case where the entire screen has wipe information and the reference value r and the wipe information w are compared for each pixel. .

  When the image processing apparatus uses the wipe information shared by the pixels in the vertical direction, the control for performing the horizontal wipe process is performed when the reading pixel position in the vertical direction is moved in the data reading control unit 13 ( In the processing of each horizontal scanning line, it is only necessary to switch so that the wipe information is read again for each corresponding horizontal position, and there is no need to change any special processing or circuit for the processing in the subsequent calculation unit 14.

  So far, the method for reducing the data size of the wipe information has been described by taking a relatively simple wipe pattern in the vertical direction and the horizontal direction as an example. In addition to these, the wipe process includes a method in which the screen is divided into a plurality of areas, and the wipe is expressed in the same vertical or horizontal wipe pattern for each divided area. In such a case, it is possible to greatly reduce the data size by sharing the wipe information in a plurality of divided areas and further sharing the wipe information in the vertical direction or the horizontal direction in the divided areas.

  FIG. 5 shows a state where the screen is divided into four in the horizontal direction, and the horizontal wipe is performed with the same wipe pattern for each divided area. Assuming that one wipe information per pixel (that is, having wipe information for each pixel), the wipe information for the entire screen has a wipe pattern for performing the same horizontal wipe for each divided region as shown in FIG. 6A. . In a screen having a pixel size of 720 × 480 corresponding to the DV format, the wipe information for the entire screen has a size of 720 × 480 = 345,600 bytes. On the other hand, when wipe information is shared by a plurality of divided areas, as shown in FIG. 6B, it is only necessary to have one wipe information per pixel having a data size corresponding to a quarter of the screen. The data size of information is reduced by a factor of four. Further, in the divided area, the wipe information is composed of gradation data in which the gradation value gradually increases from the left to the right of the area, and the gradation value is the same between the pixels having the same vertical position. In the vertical direction, it is not necessary to have wipe information for each pixel. Therefore, as shown in FIG. 6C, it is possible to reduce the data size by having wipe information for one pixel in the horizontal direction for one divided area and making the wipe information common to all divided areas. In this case, the necessary wipe information has a size of 180 (= 720 ÷ 4) bytes corresponding to one row of pixels in one divided area, and the data size is reduced to 1/120 (= 480 × 4). be able to.

  In this way, when the wipe information is made common to the pixels in the vertical direction with respect to the divided areas, when the calculation unit 14 processes each divided area of the screen, the vertical direction is applied to each pixel at the same vertical position in the area. The wipe information having the same relative position may be read out and compared with the reference value. For example, when screen output is performed by horizontal scanning, wipe information of a pixel corresponding to the relative position in the horizontal direction of the divided region is sequentially read out and compared with a reference value to determine a calculation method for the pixel. . When one divided area is scanned and the next divided area is reached, similarly, the wipe information of the pixel corresponding to the relative position in the horizontal direction of the divided area is sequentially read out and a comparison operation between this and the reference value is performed. To determine the calculation method for the pixel. Similarly, when the horizontal position of the processing pixel moves in the vertical direction, similarly, in each divided area, the wipe information of the pixel corresponding to the relative position in the horizontal direction of the divided area is sequentially read, and a comparison operation between this and the reference value is performed. In line, the calculation method for the pixel is determined. If such processing is repeatedly performed in the vertical direction of the screen, it is possible to realize the same wiping processing as in the case where the entire screen has wiping information and the reference value r and the wiping information w are compared for each pixel.

  Of course, as shown in FIG. 5, the screen is divided without being limited to a wipe pattern in which the screen is divided only in either the vertical or horizontal direction and the same screen is displayed in the vertical or horizontal direction. In the case where the wipe expression is performed using the same wipe pattern in each divided area, the data size can be reduced by sharing the wipe information in the plurality of divided areas.

  FIG. 7 shows a state in which the screen is divided into four (that is, 4 × 4 divisions) in the vertical and horizontal directions, and the horizontal wipe is performed with the same wipe pattern for each divided area. Assuming that one wipe information per pixel is used, the wipe information for the entire screen that realizes the illustrated wipe pattern is as shown in FIG. 8A. When the wipe information is composed of such gradation data, the wipe information cannot be shared in both the vertical and horizontal directions, but the minimum repeat unit of the wipe information is as shown in FIG. 8B. Therefore, when the wipe information is read, the data size is reduced to 1/8 by repeating the horizontal and vertical readings in units of blocks.

  In addition, even when the wipe information cannot be shared in both the horizontal and vertical directions, there are cases where the wipe information can be shared in a divided area having a certain vertical and horizontal size, considering the wipe expression. Conceivable.

  FIG. 9A shows a state where a wipe expression is realized in which the entire screen is divided into 8 × 8 = 64 areas and the screen is switched in units of the divided areas at regular intervals. The wipe information of the entire screen for realizing the illustrated wipe pattern is as shown in FIG. 9B. However, paying attention to the screen transition in units of divided areas, if the screen is composed of 720 × 480 pixels, the wipe information is constant for each size of 80 divided by 80 × 60 pixels. Therefore, the wipe information in this case can be reduced to an 8 × 8 data size as shown in FIG. 9C.

In the description so far, since the data unit for one pixel of the wipe information is 1 byte, that is, 8 bits, the expression in which the screen temporally transitions in the wipe process is 255 (= 2 ⁸ ) gradations. Depending on the image size and switching time, finer control may be required for smooth expression. In this case, the data size of this wipe information unit should be larger than 1 byte. Can do.

  For example, if a wipe expression in which an image of 720 pixels in width is transitioned at 1 pixel / V is required, it takes only 7205, and therefore it is possible if the number of bits of wipe information is 10 bits (1024> 720).

  The present invention has been described in detail above with reference to specific embodiments. However, it is obvious that those skilled in the art can make modifications and substitutions of the embodiment without departing from the gist of the present invention.

  The wipe processing according to the present invention is a system that handles a plurality of still images and moving images from a video system that switches video output from a plurality of video cameras in a broadcasting station to a digital still camera and camcorder used in the home. Can be widely applied to.

  In this specification, the case where the wipe expression is performed by outputting the pixel data complementarily from one of the images before and after the screen transition according to the comparison result of the reference value and the wipe information is taken as an example. It is not limited to. For example, the pixel data of each image may be mixed at a ratio according to the comparison result between the reference value and the wipe information, or another synthesis method may be applied.

  In short, the present invention has been disclosed in the form of exemplification, and the description of the present specification should not be interpreted in a limited manner. In order to determine the gist of the present invention, the claims should be taken into consideration.

FIG. 1 is a diagram schematically illustrating a functional configuration of an image processing apparatus 10 that performs a wipe process on two images. FIG. 2A is a diagram illustrating a state in which vertical wipe is realized by using the wipe information including the gradation data illustrated in FIG. 12A and increasing the reference value r with time. FIG. 2B is a diagram illustrating a state in which the horizontal wipe is realized by using the wipe information including the gradation data illustrated in FIG. 12B and increasing the reference value r with time. FIG. 3 shows the wipe information for the vertical wipe of the entire screen consisting of one wipe information per pixel, wipe information for one pixel in the vertical direction of the screen, and common wipe information for the pixels in the horizontal direction. It is the figure which showed a mode that size was reduced. FIG. 4 shows the wipe information for the horizontal wipe of the entire screen consisting of one wipe information per pixel, wipe information for one pixel in the vertical direction of the screen, and the wipe information is shared by the pixels in the vertical direction, It is the figure which showed a mode that size was reduced. FIG. 5 is a diagram illustrating a state in which the screen is divided into four in the horizontal direction, and the horizontal wipe is performed with the same wipe pattern for each divided region. FIG. 6A is a diagram illustrating wipe information for the entire screen including one wipe information per pixel used in the wipe process illustrated in FIG. 5. FIG. 6B is a diagram illustrating a state in which the wipe information of the entire screen illustrated in FIG. 6A is shared by the divided areas to reduce the data size. FIG. 6C is a diagram showing a state in which the data size is reduced by sharing the wipe information of the divided area shown in FIG. 6B with vertical gaso. FIG. 7 is a diagram illustrating a state in which the screen is divided into four parts in the vertical and horizontal directions (that is, 4 × 4 divisions) and the horizontal wipe is performed with the same wipe pattern for each divided area. FIG. 8A is a diagram showing wipe information of the entire screen used for the wipe process shown in FIG. FIG. 8B is a diagram showing a minimum repeating unit of the wipe information shown in FIG. 8A. FIG. 9A is a diagram showing a state of realizing a wipe expression in which the entire screen is divided into 8 × 8 = 64 areas and the screen is switched in units of the divided areas at regular intervals. FIG. 9B is a diagram showing wipe information of the entire screen used for the wipe process shown in FIG. 9A. FIG. 9C is a diagram illustrating a state in which the wipe information illustrated in FIG. 9B is reduced in data size by focusing on the screen transition in units of divided areas. FIG. 10A is a diagram illustrating image data before and after screen transition due to the wipe effect. FIG. 10B is a diagram illustrating a state where a screen transition is caused by a vertical wipe. FIG. 10C is a diagram illustrating a state where a screen transition is caused by a horizontal wipe. FIG. 11 is a diagram illustrating a basic configuration of an image processing apparatus that realizes wipe expression. FIG. 12A is a diagram illustrating a configuration example of wipe information for vertical wipe. FIG. 12B is a diagram illustrating a configuration example of wipe information for horizontal wipe.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 ... Image processing apparatus 11 ... Memory | storage part 12 ... Control part 13 ... Read-out control part 14 ... Calculation part 15 ... Output part

Claims (9)

An image processing apparatus for transitioning an image displayed on a screen by a wipe effect,
A first image memory for storing image data before screen transition;
A second image memory for storing image data after the screen transition;
A wipe information memory for designating calculation processing for each pixel;
Reference information generating means for generating reference information that changes over time;
A read control unit that reads pixel data from the first and second image memories for each pixel position and reads wipe information corresponding to the pixel position from the wipe information memory;
The wipe information and the reference information are compared, a pixel data calculation / synthesis formula is determined based on the comparison result, and the pixel data read from each of the first and second image memories according to the determined calculation / synthesis formula is obtained. An arithmetic unit to be combined;
An output unit that outputs an image composed of pixel data synthesized by the arithmetic unit;
Wipe information is composed of gradation data that expresses the calculation processing with grayscale values.
The wipe information memory stores wipe information shared by a plurality of pixels having the same gradation value,
The read control unit changes the address order or data read procedure for reading wipe information from the wipe information memory, and uses the corresponding wipe information when reading pixel data at each pixel position from each image memory. ,
An image processing apparatus. The wipe information memory stores wipe information for a vertical wipe in which wipe information is shared by a plurality of pixels by having wipe information for one pixel in the vertical direction of the screen,
The readout control unit reads the wipe information at the horizontal position from the wipe information memory only once while sequentially reading each pixel data on one horizontal line from each image memory when performing vertical wipe.
The image processing apparatus according to claim 1. The wipe information memory stores wipe information for horizontal wipes, which has wipe information for one pixel in the horizontal direction of the screen, and common wipe information for a plurality of pixels,
When the horizontal wipe is performed, the read control unit performs switching so that the wipe information is read again for each corresponding horizontal position in the processing of each horizontal scanning line.
The image processing apparatus according to claim 1. When performing the wipe process with the same wipe pattern for each divided area by dividing the screen into a plurality of areas,
The wipe information memory stores wipe information for one divided area,
The read control unit repeatedly reads the wipe information in the wipe information memory when the arithmetic unit synthesizes the image data of each divided region.
The image processing apparatus according to claim 1. An image processing method for transitioning an image displayed on a screen from a first image before screen transition to a second image after screen transition by a wipe effect,
A reference information generation step for generating reference information that changes over time;
Wipe information consisting of gradation data representing the calculation processing corresponding to the pixel to be processed with gradation values is compared with reference information, and an arithmetic synthesis formula of pixel data is determined based on the comparison result, and the determined calculation A calculation step of combining pixel data respectively read from the first and second image memories according to a combining formula;
The wipe information is shared by a plurality of pixels having the same gradation value,
In the calculation step, the wipe information is read out by changing the address order or the data reading procedure, and the corresponding wipe information is used when combining the pixel data at each pixel position.
An image processing method. The wipe information for vertical wipe is shared by multiple pixels by having wipe information for one pixel in the vertical direction of the screen.
In the calculation procedure, when performing vertical wipe, the wipe information at the horizontal position is read only once from the wipe information memory while sequentially reading each pixel data on one horizontal line from each image memory.
An image processing method according to claim 5. The wipe information for the horizontal wipe is shared by a plurality of pixels by having wipe information for one pixel in the horizontal direction of the screen.
In the calculation procedure, when performing horizontal wipe, switching is performed so that the wipe information is read again for each corresponding horizontal position in the processing of each horizontal scanning line.
An image processing method according to claim 5. Using the wipe information for one divided area to divide the screen into a plurality of areas and perform the wipe process with the same wipe pattern for each divided area,
In the calculation procedure, the wipe information is repeatedly read when combining the image data of each divided region.
An image processing method according to claim 5. A computer described in a computer-readable format so as to execute on the computer image processing for transitioning the image displayed on the screen from the first image before the screen transition to the second image after the screen transition by the wipe effect A reference information generating procedure for generating reference information that changes over time for the computer;
Wipe information consisting of gradation data representing the calculation processing corresponding to the pixel to be processed with gradation values is compared with reference information, and an arithmetic synthesis formula of pixel data is determined based on the comparison result, and the determined calculation Executing a calculation procedure for combining pixel data read from the first and second image memories in accordance with a combining formula;
The wipe information is shared by a plurality of pixels having the same gradation value,
In the calculation procedure, the wipe information is read out by changing the address order or the data reading procedure, and the corresponding wipe information is used when combining the pixel data at each pixel position.
A computer program characterized by the above.