WO2002091301A1 - Procede de generation de donnees d'image - Google Patents

Procede de generation de donnees d'image Download PDF

Info

Publication number
WO2002091301A1
WO2002091301A1 PCT/JP2001/003789 JP0103789W WO02091301A1 WO 2002091301 A1 WO2002091301 A1 WO 2002091301A1 JP 0103789 W JP0103789 W JP 0103789W WO 02091301 A1 WO02091301 A1 WO 02091301A1
Authority
WO
WIPO (PCT)
Prior art keywords
image data
block
division
pixel
blocks
Prior art date
Application number
PCT/JP2001/003789
Other languages
English (en)
Japanese (ja)
Inventor
Shinsuke Nishida
Original Assignee
Fourie, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fourie, Inc. filed Critical Fourie, Inc.
Priority to PCT/JP2001/003789 priority Critical patent/WO2002091301A1/fr
Priority to JP2002588480A priority patent/JPWO2002091301A1/ja
Publication of WO2002091301A1 publication Critical patent/WO2002091301A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00—Geometric image transformations in the plane of the image
    • G06T3/40—Scaling of whole images or parts thereof, e.g. expanding or contracting
    • G06T3/4023—Scaling of whole images or parts thereof, e.g. expanding or contracting based on decimating pixels or lines of pixels; based on inserting pixels or lines of pixels

Definitions

  • the present invention relates to a method for generating image data for reproducing an original image based on an original image represented by a two-dimensional pixel array in which a large number of pixels are arranged.
  • the present invention relates to a method for generating image data suitable for driving a large display device. Background technology
  • Wall-mounted display devices such as electronic bulletin boards and advertisement display boards are widely used as means for presenting information to an unspecified number of people on the street.
  • a large number of display elements for one pixel are arranged in a matrix to form a two-dimensional pixel array, and each display element is driven by electric power to change the display mode, thereby obtaining information.
  • Displaying For example, an electric bulletin board uses a single light bulb as a display element for one pixel, arranges the light bulbs vertically and horizontally, and emits light at a specific position to display characters and images. Having.
  • electronic bulletin boards using light emitting diodes instead of light bulbs have become widespread.
  • panel-type display elements As display elements that constitute individual pixels are also used.
  • This panel-type display element has a plurality of display surfaces that do not have the function of emitting light by themselves, and in fact, only one of them is presented.
  • a display surface to be presented can be selected by using a rotating mechanism such as a motor, and if a display surface to be presented is selected for each pixel, characters and images are displayed as a whole. Can be displayed.
  • a two-dimensional pixel array is formed by arranging a large number of display elements having a function of changing the display mode for one pixel by driving with electric power in a matrix, and information is displayed on the two-dimensional pixel array.
  • An object of the present invention is to provide a method for generating image data for reproducing the original image by the various display devices described above, based on the original image represented by a two-dimensional pixel array. And Disclosure of the invention
  • a plurality of division modes for dividing the two-dimensional pixel array into a plurality of blocks are defined. At this time, each division mode is set to have a different divisional power, and each division mode indicates a division level.
  • a division level definition stage that can be identified by level;
  • An address definition step for defining an address for indicating each block for each individual division mode
  • the specific division level As the image data for indicating an image in a specific block determined by a specific division level and a specific address, the specific division level, the specific address An image data defining step of defining unit image data having pixel values of the specific block.
  • the division level definition stage a plurality of division levels in which the details of the division gradually differ are defined, and the k-th division level and the (k + 1) -th division in which the one-step division is finer than this.
  • a plurality of blocks according to the division mode indicated by the (k + 1) -th division level are obtained.
  • the block obtained by the division mode indicated by the (k + 1) th division level is included in the block obtained by the division mode indicated by the kth division level.
  • a large number of blocks having a hierarchical structure according to a plurality of division levels are defined.
  • predetermined unit image data is extracted and extracted according to conditions for reproducing the original image.
  • An image data extraction step of outputting the obtained unit image data group as “image data for reproducing the original image” is further performed.
  • the condition for reproducing the original image is as follows: ⁇ If there is a plurality of unit image data indicating pixel values at the same position on the plane, the pixel value of the unit image data that is finer than the coarser unit image data is "Use" In the image data extraction stage, a plurality of sets of unit image data are extracted from the plurality of unit image data so that the original image can be reproduced under these conditions, and the extracted unit image data group is extracted. Is output as “image data for reproducing the original image”.
  • the process of determining whether or not to extract a plurality of unit image data as extraction candidates in order from the coarsely divided unit image data to the finely divided unit image data is referred to as “extraction”. If the image in the area indicated by the candidate unit image data is the same as the image reproduced by the already extracted unit image data, it will not be extracted, and if it is not the same, it will be extracted. '' The determination is performed based on the criteria.
  • the “pixel value of this specific unit image data” and “the block of this specific unit image data are included and the division is coarse by one step
  • the pixel value of the unit image data is compared with and the determination is made that if the rain person is the same, it is not extracted, and if it is not the same, it is extracted.
  • each unit image data of the first group of blocks and each unit image data of the second group of blocks correspond to each other.
  • an identification code is defined for each set of unit image data for the block group of the first group, and the defined identification code is extracted instead of each unit image data for the block group of the second group. It was made.
  • a tenth aspect of the present invention is the image data generation method according to the ninth aspect,
  • the address is defined by adding one of 00, 01, 10 and 11 to the lower part of the address.
  • the aspect ratio of the display screen is set to a part of a square pixel array composed of 22 n pixels so that the original image can be reproduced under this condition. Defines the effective area with the image and effectively indicates the image information within this effective area A plurality of sets of unit image data necessary for the above are extracted, and the extracted unit image data group is output as “plane image data for reproducing the original image”.
  • a fourteenth aspect of the present invention is the method for generating image data according to the first to thirteenth aspects
  • the division level, address, and pixel value are each represented by a bit, and the bit length of the division level is fixed, and the sum of the bit length of the address and the bit length of the pixel value is fixed.
  • the length can be recognized, and the bit length that composes the address can be recognized based on the division level.
  • a unit image data comprising at least a bit indicating an address and a bit indicating a pixel value, wherein information indicating a division level is expressed as a bit length of the bit indicating the address; Generation method.
  • the extracted unit image data is output in order from the coarsely divided unit image data to the finely divided unit image data.
  • the unit image data group is generated using the difference image from the image as the original image.
  • a nineteenth aspect of the present invention is the image data generation method according to the first to eighteenth aspects, wherein:
  • a predetermined background pixel value is replaced with a predetermined background pixel value instead of the pixel value of the representative pixel in the block. It is defined as a pixel value.
  • a twenty-fifth aspect of the present invention provides a program for executing the image data generation method according to the first to nineteenth aspects using a computer, and stores the program in a computer. It is recorded on a readable recording medium and can be distributed.
  • FIG. 1 is a diagram showing four types of division modes for dividing a two-dimensional pixel array into a plurality of blocks, and addresses defined for each block obtained in each division mode.
  • FIG. 2 is a diagram showing division levels and bit representations of addresses for each division mode.
  • FIG. 3 is a diagram showing a basic format of a unit image data generated by the image data generating method according to the present invention.
  • 4A to 4E are diagrams showing an original image and a state in which the original image is represented by a plurality of unit image data.
  • FIGS. 5A to 5F are other views showing the original image and the I-dog state expressed by a plurality of unit image data.
  • FIG. 9 is a diagram illustrating bit allocation of address / data for a division mode.
  • FIG. 7 is a diagram illustrating an example of a method of expressing an original image by mixing various division modes.
  • FIG. 8 is a diagram showing individual pixels constituting the original image.
  • 9A to 9D are diagrams showing block configurations in various division modes with respect to the two-dimensional pixel array forming the original image shown in FIG.
  • FIG. 11 is a diagram showing a first example of an original image to which the method of generating image data according to the present invention is applied.
  • FIGS. 12A to 12D are diagrams showing blocks in various division modes defined based on the original image shown in FIG.
  • FIG. 13 is a table showing information relating to blocks extracted to reproduce the original image shown in FIG. 11 from among the many blocks shown in FIGS. 12A to 12D.
  • FIG. 14 is a diagram illustrating a second example of an original image to which the image data generation method according to the present invention is applied.
  • FIGS. 15A to 15D are diagrams showing blocks in various division modes defined based on the original image shown in FIG.
  • FIG. 16 is a table showing information on blocks extracted to reproduce the original image shown in FIG. 14 from the many blocks shown in FIGS. 1558 to 15D.
  • FIG. 17 is a diagram illustrating a third example of an original image to which the method of generating image data according to the present invention is applied.
  • FIGS. 18A to 18D are diagrams showing blocks in various division modes defined based on the original image shown in FIG.
  • Figure 19 shows the original image shown in Figure 17 among the many blocks shown in Figure 18D. It is a figure showing a block which should be extracted in order to reproduce.
  • FIG. 20 is a table showing information on blocks extracted from the many blocks shown in FIGS. 18A to 18D in order to reproduce the original image shown in FIG.
  • FIG. 21 is a diagram for explaining the handling when the effective area E of the original image has a shape different from the square pixel array.
  • FIG. 22 is a diagram showing address information of a block for defining the effective area E shown in FIG.
  • FIG. 23A and FIG. 23B are diagrams showing an example of an original image constituting a moving image.
  • FIG. 24 is a diagram showing a difference image D of the original image shown in FIGS. 23A and 23B.
  • a method for generating image data according to the present invention generates image data for reproducing the original image based on an original image represented by a two-dimensional pixel array in which a large number of pixels having predetermined pixel values are arranged. It is intended to do so.
  • the image data generated by the method according to the present invention is particularly suitable for driving a display device having a large number of display elements constituting pixels arranged in a matrix.
  • each display element has a function of changing a display mode for one pixel by driving with electric power.
  • light bulbs and light emitting diodes are used as display elements in general electric light boards.
  • advertising display boards and the like that use a no- and flannel-type display element are also used.
  • This panel-type display element does not have a function to emit light by itself, and has a plurality of display surfaces, and in reality, only one of them is presented. Usually, it is possible to select the display surface to be presented using a rotating mechanism such as a motor.
  • the basic format of image data suitable for driving such a display device is disclosed in the above-mentioned International Publication No. WO97 / 36927.
  • the present invention proposes a new method for generating image data having a format disclosed in the above-mentioned publication based on an arbitrary original image. Therefore, first, the substance of this basic format will be described.
  • image information on the original image is represented as a set of image data in block units.
  • a plurality of division modes are defined for the two-dimensional pixel array constituting the original image, and an address for indicating each block is defined for each division mode.
  • FIG. 1 is a diagram showing four types of division modes in which a two-dimensional pixel array constituting an original image is divided into a plurality of blocks, and addresses defined for each block obtained in each individual division mode. Each division mode is indicated by a division level n.
  • this original image P is a two-dimensional image consisting of a total of 6 5 5 3 6 pixels composed by arranging 256 pixels vertically and 256 pixels horizontally. Let's say it consists of a pixel array.
  • the two-dimensional pixel array is divided into four blocks a, b, c, and d.
  • Each of the blocks a to d is composed of 1638.sup.4 pixels arranged in a matrix of 128.times.128 in all directions.
  • Each of the 16 blocks is composed of 409 x 6 pixels arranged in a matrix of 64 x 64 in all directions.
  • Each of the 64 blocks is composed of 102 4 pixels arranged in a matrix of 32 ⁇ 32 matrix ⁇ vertically and horizontally.
  • a plurality of division mode forces s for dividing the two-dimensional pixel array including the original image into a plurality of blocks are defined, and each division mode is defined by a division level n indicating the fineness of the division. Will be identified.
  • the k-th division level By further dividing one block obtained by the division mode indicated by the eye division level into a plurality of blocks, a plurality of block forces s ' can be obtained by the division mode indicated by the (k + 1) th division level Become like That is, the block obtained by the division mode indicated by the (k + 1) th division level is included in the block obtained by the division mode indicated by the kth division level, and as a whole, It will be many blocks force s definition having a hierarchical structure corresponding to a plurality of decomposition levels.
  • an address for indicating each block is defined for each division mode.
  • An address definition such as that indicated by an address obtained by adding one of 00, 01, 10 and 11 to the lower part of the address indicating 2 2 — "blocks obtained in the division mode indicated by
  • a block a (block occupying the same position as blocks e, f, g, h) obtained in the embodiment, with addresses 0, 0, 1, 10, and 11 added below the address "0 0" It has become.
  • which two bits should be added to the lower order is determined in the same way as the address definition for the four blocks a, b, c, and d.
  • the mutual position of the four blocks e, f, g, and h is equivalent to the mutual position of the four blocks a, b, c, and d, so the lower two bits of the address of the block e are The address of block a is set to "0 0", the lower 2 bits of the address of block f are set to "0 1", the same as the address of block b, and the lower 2 bits of the address of block g are the address of block c. And the lower 2 bits of the address of block h are the same as the address of block d.
  • the above-described address definition is performed. Is preferred. With such an address definition, by removing the lower two bits from the address of a specific block, the address of the block at the same position in the next lower division level can be obtained.
  • the number of bits required for such an address definition is indicated by 2 n bits as shown in FIG.
  • FIG. 2 is a diagram showing an example of a bit expression of a division level and an address in each of the above division modes.
  • the number of address bits required to indicate each block is different for each division level, as described above.
  • a display resolution as high as 1 G can be obtained.
  • the image information on the original image is represented as a set of image data in blocks, but the image information in one block has a format as shown in FIG. It is indicated by unit image data having.
  • the division level, address, and pixel value are listed in this order.
  • the bit length of the address portion is determined based on the division level as shown in FIG. 2, and the higher the division level, the longer the bit length of the address.
  • the division level is represented by 4 bits
  • the pixel value which is the last component of the format of FIG. 3 is a representative pixel value of a pixel constituting the original image in this block, and the corresponding block is displayed in a state corresponding to the representative pixel value. Indicates what to do.
  • one unit of image data described in the format of Fig. 3 is data composed of a specific division level, a specific address, and a specific pixel value, and is specified by a specific division level and a specific address. This indicates that pixels having a specific pixel value are spread all over the block.
  • a slash is inserted between each bit string.
  • the 7-bit command described above is represented as "0001/01 1" in this specification.
  • bit strings there is no slash between bit strings.
  • an arbitrary display device in which display elements corresponding to one pixel are arranged in a matrix can be used for an arbitrary display.
  • a controller that recognizes the address in the display device and performs control for turning on or off a predetermined light bulb is prepared. You need to keep it.
  • the format according to the present invention it is possible to represent an original image having the pattern shown in FIG. 4A with only nine sets of unit image data.
  • the second unit image data as shown in the lower section of FIG.
  • the images represented by these nine sets of unit image data are synthesized. can original image force s reproduction shown in FIG. 4 a.
  • the upper left 1Z4 part of the image shown in the upper part of FIG. It will be replaced by the upper left 1Z4 image shown in the upper row of 4C (the gray area surrounded by the solid line).
  • part of the other white part of the image shown in the upper part of FIG. 4B is replaced by the gray part of the upper part of FIG. 4D and the upper part of FIG. 4E.
  • the images are sequentially superimposed on each other in the order of FIG. 4B, FIG. 4C, FIG. 4D, and FIG. 4E.
  • the finally obtained composite image is the same as the original image shown in FIG. 4A.
  • the original image shown in FIG. 4A was efficiently reproduced by the nine sets of unit image data shown in FIGS. 4B to 4E.
  • the total number of bits required to represent the original image shown in FIG. By using the expression in the conventional general bitmap format, the total
  • the format according to the present invention is also effective when generating image data for giving an instruction to rewrite from one display mode to another display mode.
  • this change can be expressed by only two unit image data.
  • the division level n 1, such as "0001 / 00Z0". Are all "0".
  • the synthesis is performed with priority given to the pixel values of the unit image data that is finely divided (Fig. 5B and Fig. 5C show the synthesis based on each unit image data in the image shown in Fig. 5A). Went to show 1) dog state).
  • the information of the original image can be efficiently expressed as image data by appropriately combining the unit image data having different division levels.
  • the larger the division level n the longer the bit length required for the address.
  • the total bit length of each unit image data differs depending on the division level.
  • the bit length of the division level is fixed, and the bit length of the address and the bit length of the pixel value are not changed. The sum should be fixed length.
  • FIG. 6 shows the address / pixel for each division mode when the bit length of the division level is fixed at 4 bits and the sum of the address length and the data length for the pixel value is fixed at 32 bits.
  • FIG. 6 is a diagram illustrating bit assignment of values.
  • the bit allocation method of “fixing the sum of the address length and the pixel value data length” is the pattern recognition characteristic of human vision. It fits.
  • the pixel value data length “32 bits” secured at the division level 0 is sufficient for displaying a color image. For example, suppose that the pixel value of one pixel was represented as 256 gradation values for each of the three primary colors of RGB. In this case, the power s that makes it possible to express so-called full color (1,670,000 colors) using the three primary colors of RGB s , and the gradation expression of one color only needs to have 8-bit data.
  • the data length “2 bits” secured at the division level 15 can represent only four types of pixel values, but the area displayed using this division level 15 is the entire display area. It is a very small area compared to the screen, and even if you can select only four types of pixel value expression, there is no discomfort when performing pattern recognition by human vision ( ⁇ 3 (2) described later) See).
  • FIG. 7 is a diagram showing an example of an image expressed by mixing unit image data in various division modes.
  • the upper left area is division level 1 (data length: 30 bits)
  • the upper right area is division level 2 (data length: 28 bits)
  • the lower left area is division level 3 (data length: 30 bits).
  • the lower right area is displayed at division level 4 (data length: 24 bits).
  • the larger the block the longer the allocated data length is, and the more precise color expression is possible.
  • the smaller the block the shorter the allocated data length, It can be seen that the color expression is coarse. This characteristic is consistent with human visual pattern recognition. In other words, the human eye is sensitive to the color expression in a large area colored with the same color, but becomes insensitive to a small area with a small area. Expressions with short data lengths do not cause discomfort.
  • the unit image data of each division level shown in FIG. It consists of a bit sequence of bits.
  • the division level n is recognized by the first four bits, and the next 2 n bits from the beginning of the following 32 bits are the address. The remaining bits are recognized as bits indicating the pixel value.
  • only 4 bits are used to indicate the division level n, but since the information of this division level is important information that will affect the subsequent address and pixel value if misrecognized. However, in practice, it is preferable to add an error code or repeat the same information twice to express the word with redundancy.
  • the original image P 0 is reproduced.
  • the pixel located at the i-th row and j-th column in this two-dimensional pixel array is referred to as a pixel.
  • the pixel P (1, 1) at the upper left corner is a pixel having a pixel value Q (1, 1)
  • the pixel P (8, 8) at the lower right corner is a pixel value Q (8, 8) To Pixel.
  • the image data according to the present invention is composed of unit image data having the format shown in FIG. 3, and this one unit image data corresponds to one block. That is, one of the 85 blocks described above is specified by the division level address in the format shown in FIG. 3, and one unit of image data is There is no other data indicating the pixel value of.
  • the coarsest division mode in which the entire two-dimensional pixel array including the original image is regarded as one block to the finest division mode in which each pixel of the two-dimensional pixel array is regarded as one block.
  • the fineness of division s A plurality of different division modes may be defined. For example, if the two-dimensional pixel array including the original image is an eight-row, eight-column pixel array as shown in FIG.
  • the first issue is how to determine the pixel value of each block. For example, when generating the unit image data for the block B (0) shown in FIG.
  • the division level and the address can be uniquely determined (the division level is "00001", and the address is "none". ").
  • some algorithm must be defined.
  • the second problem is whether to use unit image data of any of the 85 blocks described above as image data for reproducing the original image P0.
  • image data described in the format according to the present invention generally has higher resolution of the original image than image data described in the bitmap format.
  • Image information can be expressed efficiently.
  • it is necessary to reproduce the original image with as few blocks as possible (in other words, with as few unit image data as possible). is there. For example, as an example of expressing the information of the original image shown in Fig.
  • Figs. 4B to 4E show examples using a total of 9 blocks (unit image data).
  • an original image consisting of a two-dimensional pixel array of 8 rows and 8 columns as in the example shown in Fig. 4A
  • nine sets are extracted from the total of 85 pieces, and are used as image data for reproducing the original image shown in FIG. 4A.
  • the combination of unit image data to reproduce the same original image is not necessarily one, but the final combination depends on which unit image data is to be extracted from a total of 85 unit image data.
  • the content of the image data obtained at the beginning differs.
  • the first problem described above that is, how to determine the pixel value of each block
  • one pixel on the original image included in each block is determined as a representative pixel for the block
  • the pixel value of the representative pixel for each block is determined as the pixel of the block. Value.
  • the pixels in the original image included in this block are all 64 pixels constituting the original image P0 shown in FIG.
  • One of the pixels is defined as a representative pixel
  • the pixel value of this representative pixel is defined as the pixel value of block B (0).
  • the representative pixel may be any one of the 64 pixels.
  • the pixel P (1, 1) shown in FIG. 8 is the representative pixel of the block B (0), and this representative pixel P (1, 1) ) Is defined as the pixel value of block B (0).
  • the pixels in the original image included in each block constitute a region obtained by dividing the original image P0 shown in FIG. Since there are 16 pixels, one of the 16 pixels is defined as a representative pixel for each block, and the pixel value of this representative pixel is defined as each of the blocks B (0 0) to B ( 1) It is defined as the pixel value of 1).
  • the pixel value of 1 For example, in the case of block B (0 0), 16 pixels P (1, 1) to P (1, 4), P (2, 1) to P (2, 4) shown in FIG. , P (3,1) to P (3,4), P (4,1) to P (4,4) are determined as representative pixels.
  • the representative pixel may be any one of the 16 pixels.
  • the representative pixel is selected based on the following criteria. That is, if the block address is "00", the pixel at the upper left corner is the representative pixel, and if the block address is "01", the pixel at the upper right corner is the representative pixel. If the block address is "10”, the pixel at the lower left corner is the representative pixel, and if the block address is "11", the pixel at the lower right corner is the representative pixel. And As a result, pixel P (1, 1) becomes the representative pixel of block B (00), and its pixel value Q (1, 1) becomes the pixel value of block B (00). Pixel P (1, 8) becomes the representative pixel of block B (01), and its pixel value Q (1, 8) becomes the pixel value of block B (01).
  • pixels? (8, 8) becomes the representative pixel of block B (1 1)
  • its pixel value Q (8, 8) becomes the pixel value of block B (1 1).
  • a predetermined pixel on the original image included in each block is determined as a representative pixel for the block, and the pixel value of the representative pixel for each block is It is defined as the pixel value of the block. In this case as well, it does not matter which pixel is selected as the representative pixel. In this case, if the last two digits of the block address are "00", the pixel at the upper left corner is set as the representative pixel. If it is "0 1", the pixel at the upper right corner is the representative pixel, and if it is "10", the pixel at the lower left corner is the representative pixel, and it is "1 1".
  • the representative pixel is selected based on the criterion that the pixel at the lower right corner is the representative pixel.
  • the last two digits of the address are "00"
  • the pixel P (1, 1) at the upper left corner in this block is the representative pixel.
  • the pixel value Q (1, 1) becomes the pixel value of block B (0000).
  • the last two digits of the address are "01”
  • the pixel P (1, 8) at the upper right corner in this block becomes the representative pixel
  • the pixel value Q (1, 8) becomes the pixel value of block B (01 01).
  • This is a table listing the division levels, addresses, and pixel values.
  • the unit plane image data corresponding to each block is data in which the division levels, addresses, and pixel values in this table are arranged as a bit string, as shown in the format of FIG.
  • the original image included in each block is A method in which one predetermined pixel is defined as a representative pixel for the block, and the pixel value of the representative pixel for each block is defined as the surface element value of the block.
  • the method of determining the representative pixel is effective in simplifying the calculation for obtaining the pixel value. For example, as a method of determining the pixel value of the block B (0) shown in FIG. 9A, the average value of the pixel values of the 64 pixels constituting the original image P0 in FIG.
  • the representative pixel selected by the method according to the present invention is not always a pixel representing a large number of pixels belonging to the block.
  • the representative pixel selected by the method according to the present invention is not always a pixel representing a large number of pixels belonging to the block.
  • only pixel P (1, 1) in the upper left corner shows a red color.
  • the pixel value of the block B (0) has the pixel value Q (red) and all the other 63 pixels have the pixel value Q (blue) indicating a blue color
  • the pixel value of the block B (0) has the majority of the pixels. It is more appropriate to adopt the pixel value Q (blue) from the original meaning.
  • the pixel value of the majority of pixels is used as the pixel value of block B (0).
  • Q (blue) force s adopted is that.
  • the pixel P (1, 1) at the upper left corner is selected as the representative pixel of the block B (0), so that the pixel value of the block B (0) is the pixel value Q (red). It turns out that. This is because the method of generating image data according to the present invention focuses on reducing the computational load.
  • the specific pixel value of each pixel included in the block is determined in order to emphasize the reduction of the calculation load. Instead, the pixel at a specific position in the block is uniquely selected as the representative pixel. Pixel Therefore, as in the example described above, there majority of pixels force in the block B (0)? Despite to a blue, a predetermined specific position, i.e., the upper left corner position Since the color was P (1, 1) red, Q (red) indicating the red color is selected as the pixel value of block B (0).
  • any pixel located in the block may be selected as the representative pixel.
  • the pixel at the upper left corner is set as the representative pixel
  • the pixel at the upper right corner is set. If the pixel is the representative pixel and it is "1 0”, the pixel at the lower left corner is the representative pixel and it is "1 1"
  • the representative pixel is selected based on the criterion that the pixel at the lower right corner is the representative pixel. The reason why the representative pixel is selected based on such criteria is nothing but to simplify the logical operation for selecting the representative pixel.
  • This is a block indicated by the address. Therefore, for example, in the case of block B (00) shown in Fig. 9B, the same two bits "00" as the last two digits "00" are repeated as many times as necessary at the end of the block address "00".
  • "00" may be repeated twice and added. In this case, the obtained address is "000000", and the pixel P (1, 1) at the position corresponding to the block B (000 000) indicated by this address is selected as the representative pixel.
  • the same two bits "10" as the last two digits "10” are added to the end of the address "10" of the block as many times as necessary.
  • "10” may be repeated twice and added.
  • the obtained address is “10101 0”
  • the pixel P (8, 1) at the position corresponding to the block B (1 01 0 10) indicated by this address is selected as the representative pixel. become.
  • a condition that “when a plurality of unit image data indicating pixel values at the same position on a plane exists, the pixel value of the unit image data that is finely divided than the unit image data that is coarsely divided” is used
  • multiple sets of unit image data are extracted from the multiple unit image data, and the extracted unit image data group is referred to as ⁇ an image for reproducing the original image. It is output as "data”.
  • ⁇ an image for reproducing the original image It is output as "data”.
  • a method of generating a group of unit image data for reproducing the original image P1 based on the original image P1 as shown in FIG. 11 will be considered.
  • FIGS. 12A to 12D are diagrams showing a total of 85 blocks filled with a color corresponding to each pixel value. The pixel value of each block is determined by selecting a representative pixel based on the above-described criteria.
  • a green pixel value is given by selecting one green pixel at the upper left corner of FIG. 11 as a representative pixel.
  • a green pixel value is given by selecting one green pixel at the upper left corner of FIG. 11 as a representative pixel.
  • the purple pixel value is given by selecting one purple pixel in the upper right corner of Fig. 11 as a representative pixel.
  • a green pixel value is given by selecting one green pixel in the lower left corner of Fig.
  • the process of “laying another paper on one paper” in the above example is executed as a bit data replacement process on an actual display device, so it is usually nsec or This is performed by high-speed processing in units of sec. Therefore, actually, the original image P1 is displayed on the screen of the display device at a speed that cannot be grasped by the naked eye.
  • the following image data extraction processing may be performed. That is, for a plurality of unit image data to be extracted, the process of determining whether to extract unit image data from coarsely divided unit image data to finely divided unit image data is sequentially described as “unit image to be extracted candidate”. If the image in the area indicated by the data is the same as the image reproduced by the already extracted unit image data, it will not be extracted, and if it is not the same, it will be extracted. '' What should be done is.
  • Such a determination is made based on “pixel values of unit image data that are extraction candidates” and “pixel values of unit image data that include the block of the unit image data and are coarsely divided by one stage”. It is sufficient to compare with and judge that if the rain people are the same, they are not extracted, and if they are not the same, they are extracted.
  • This image data extraction processing is performed from the total of 85 blocks (unit image data) shown in FIGS. 12A to 12D, from the seven blocks shown in the table of FIG.
  • An example of extracting the criterion (unit image data) will be specifically described.
  • the process of determining whether or not to extract should be performed in order from the coarsely divided unit image data to the finely divided unit image data.
  • the unit image data power s corresponding to the block B (0) indicated by the thick line in Fig. 12A is extracted unconditionally as data to be extracted (the division level is coarser). Since there is no unit image data, there is no image that has already been extracted, and of course, it is not the same as the image that has already been extracted.)
  • blocks B (0 0) to B (1 1) shown in FIG. The unit image data is determined, but blocks B (00) and B (10) are reproduced by the already extracted unit image data (unit image data corresponding to block B (0)). Since they are the same as the image (the image in the left half area of block B (0)) (all of them are images filled with green pixels), they will not be extracted.
  • blocks B (01) and B (1 1) indicated by bold lines in the figure are reproduced by the already extracted unit image data (unit image data corresponding to block B (0)). Since it is not the same as the image (the image in the right half area of block B (0)) (one is an image filled with green pixels, while the other is an image filled with purple pixels). These are extracted.
  • the unit image data is output in order from the coarsely divided unit image data to the finely divided unit image data. This is transmitted to the display unit of the unit image data group s , and when the reproducibility s ' of the original image is performed on the display unit, the synthesis process of the original image is gradually performed at such a speed that the naked eye can confirm it.
  • the unit image data is divided from coarsely divided unit image data to finely divided unit image data. This is because it is better to show them in order.
  • the original image P 2 shown in FIG. 14 is an image composed of an eight-row, eight-column two-dimensional pixel array 5 , only one pixel at the upper left corner is green, and other pixels are green. 63 This is an extreme pattern in which three pixels are purple. Also for such an original image P2, a total of 85 blocks can be defined, and a total of 85 unit image data can be defined.
  • FIGS. 15A to 15D are diagrams in which the 85 blocks in total are filled with a color corresponding to each pixel value. The pixel value of each block is determined by selecting a representative pixel based on the aforementioned criteria.
  • this criterion uniquely defines a pixel located at a specific position in each block as a representative pixel, and the pixel value of the representative pixel remains unchanged. Also, it is defined as the pixel value of the block. Therefore, the pixel value defined for each block is not always the pixel value of many pixels belonging to the block. In fact, regarding block B (0) shown in Fig. 15A, the pixel in the upper left corner became the representative pixel despite the fact that the majority of the pixels belonging to this block were purple, so block B (0) The pixel value of is green (Q), which indicates green. As described above, the reason why the representative pixel is uniquely selected based on the position in the block is to obtain the advantage of reducing the calculation load.
  • the processing for determining whether or not to extract in order from the coarsely divided unit image data to the finely divided unit image data is referred to as “the region indicated by the unit image data as the extraction candidate”. If the image in is not the same as the image reproduced by the already extracted unit image data, it will not be extracted, and if it is not the same, it will be extracted. '' Good.
  • the unit image data corresponding to the block B (0) indicated by the thick line in FIG. 15A is unconditionally determined as the data to be extracted and extracted.
  • the judgment power s is determined for the unit image data corresponding to the four blocks B (00) to B (11) shown in FIG. 15B, but the block B (00) has already been extracted. It is the same as the image reproduced by the unit image data (unit image data corresponding to block B (0)) (the image in the upper left quadrant of block B (0)). The image is full), and will not be extracted.
  • blocks B (01), B (1 0), and B (1 1) indicated by bold lines in the figure are not the same as the images reproduced by the already extracted unit image data. These are images filled with green pixels, while the other is filled with purple pixels.) Will be.
  • three blocks B (0001), B (00 10), and B (001 1) indicated by thick lines in the figure are determined to be blocks to be extracted.
  • the other 14 blocks are based on the four unit image data already extracted (unit image data corresponding to blocks B (0), B (0 1), B (1 0), and B (1 1)). Since it is the same as the image to be reproduced, it will not be extracted.
  • the judgment power s is determined for the unit image data corresponding to the 64 blocks B (000 000) to B (1 1 1 1 1 1) shown in FIG. 15D.
  • the first extracted block B (0) shown in Fig. 15A was an image far apart from the original image P2 shown in Fig. 14, but the 10 units shown in the table in Fig. 16
  • the original image P2 shown in FIG. 14 is reproduced without any trouble. Therefore, there is no problem if the representative pixel for each block is uniquely selected based on the position without considering the pixel value of each pixel.
  • FIG. 17 is an image consisting of a two-dimensional pixel array of 8 rows and 8 columns, as in the previous examples, but a green English letter “I” is added to the white background.
  • the pattern is as shown.
  • a total of 85 blocks Can be defined, and a total of 85 unit image data can be defined.
  • FIG. 18A to FIG. 18D are diagrams showing a total of 85 blocks filled with a color corresponding to each pixel value. The pixel value of each block is determined by selecting a representative pixel based on the above-described criteria.
  • the pixel values defined for each block do not necessarily reflect the pattern of the original image.
  • block B (0) shown in FIG. 18A and blocks B (00) to B (11) shown in FIG. 18B only a white background pattern appears.
  • the images indicated by the blocks defined after the upper division level (i + 2) are not necessarily the same.
  • the image represented by the block defined at one division level i and the image represented by the block defined at the next division level (i + 1) are completely identical. Therefore, it is not possible to omit the block definition for a higher division level.
  • the unit image data power s corresponding to the block B (0) indicated by a thick line in FIG. 18A is unconditionally determined and extracted as data to be extracted.
  • the unit image data corresponding to the four blocks B (00) to B (11) shown in FIG. 18B is determined, and all of these four blocks have already been extracted. Since it is the same as the image reproduced by the unit image data (unit image data corresponding to block B (0)), it will not be extracted.
  • a determination is made on the unit image data corresponding to the 16 blocks B (0000) to B (1111) shown in FIG. 18C.
  • the pattern When the original image is an image composed of an object such as a character, as in the original image P3 shown in FIG. 17, the pattern usually has the object placed on the background.
  • information on the image of the background portion can be omitted from the image data.
  • the information of the block B (0) shown in the uppermost column of the table in FIG. 20 is information indicating a white background, so that the unit image data corresponding to the block B (0) may be omitted. I don't care. That is, the unit image data corresponding to block B (0) is deleted from the table of FIG.
  • the display device handles it on the assumption that “the transmitted image data is the original image to be displayed on a specific background” (for example, 17), the original image P3 shown in FIG. 17 can be reproduced.
  • a front pixel one pixel in the upper left corner is selected 5 ′, and any pixel included in the block may be selected as the representative pixel.
  • one pixel at the upper right corner, lower left corner, or lower right corner may be selected as the representative pixel, or a pixel near the center of the block may be selected as the representative pixel.
  • one of the upper-left corner, upper-right corner, lower-left corner, or lower-right corner depends on the last two digits of the block address. If is used as the representative pixel, the arithmetic processing is greatly simplified.
  • one pixel on the original image included in the block is defined as a representative pixel as the pixel value of each block, and the pixel value of the representative pixel is defined as the pixel value of the block as it is.
  • the pixel value of the representative pixel is defined as the pixel value of the block as it is.
  • the pixel value for (0) is red. Therefore, at the moment when the display device displays the unit image data for the block B (0) shown in FIG. 9A, the entire display screen is displayed in red. Of course, the unit image data for blocks B (00), B (01), B (10), and B (1 1) shown in Fig. 9B is displayed. As the unit image data for the block shown in Fig. 9D and the block shown in Fig. 9D is displayed, the original original image will be displayed, but at least the unit image data for block B (0) will be displayed.
  • the whole screen will turn red for a moment. In this way, the whole screen is covered with a vivid color like red. This is not desirable depending on the display environment.
  • the entire screen s remains red, and depending on the display environment, it may be desirable to avoid such a situation as much as possible.
  • a background color such as white or black, which is generally displayed on the entire screen and does not cause any discomfort, should be determined in advance, and the background pixel value indicating this background color should be determined. I do.
  • a predetermined background pixel value is used instead of the pixel value of the representative pixel in the block. What is necessary is just to perform the process defined as the pixel value of the said block.
  • the blocks obtained by the coarse division mode in which the division level is 1 or less that is, blocks B (0) and 9B shown in FIG. 9A
  • the background pixel value for example, the pixel value indicating black
  • the display device displays the unit image data of block B (0)
  • the entire display screen has a black background color
  • the blocks B (00), B (0 1), and B (0) When displaying the unit image data of (10) and B (11), this black state will continue.
  • the original image power s is gradually displayed as the unit image data power s of the blocks shown in FIG.
  • the unit image data for blocks B (0), B (00), B (01), B (10), and B (1 1) is based on the original information transmission of the original image. Although it cannot play a role, it can play a presentation effect that the original image gradually appears from a black background color. Of course, such a background pixel value is forcibly given only to blocks obtained by the coarse division mode, so that the block shown in FIG. 9C and the block shown in FIG. The professionals obtained by the fine division mode It is possible to faithfully reproduce the original image by using the unit image data of the block.
  • Block containing block B (01 1 0): B (01) is selected as the comparison target, and it is determined that the pixel is not extracted if the pixel values of the rain block are the same, and it is extracted if the pixel values are not the same. .
  • B (01) is selected as the comparison target, and it is determined that the pixel is not extracted if the pixel values of the rain block are the same, and it is extracted if the pixel values are not the same. .
  • ⁇ Is the image in the area indicated by the unit image data that is an extraction candidate the same as the image reproduced by the already extracted unit image data?
  • images are the same in the present invention does not necessarily mean that the pixel values are completely the same, but that “the image can be regarded as the same by human senses”.
  • the same image does not necessarily need to be determined based on “matching colors”, and may be determined based on “matching brightness” in some cases.
  • the display device to which image data is to be transmitted is a device that can only display monochrome gradations, it is better to make decisions based on “brightness match” instead of “color match” on the original image. It is preferable from the viewpoint of reproducing the sound.
  • a large number of blocks having a hierarchical structure are defined.
  • one trunk B (0) extending from the root is divided into four branches B (00) to B (1 1), and each branch has four middle branches B (0000) to B (1 1).
  • the tree structure 5 is formed, which is divided into four branches B (0 00000) to B (1 1 1 1 1 1).
  • these blocks with a tree structure Of the first group located on the branch branched from the first group (in other words, the block group of the first group consisting of the first block and the blocks included in the first block among many blocks having a hierarchical structure)
  • the second group of blocks located on the branch branched from the second location in other words, from the block in the second block and the blocks contained in it, among many blocks having a hierarchical structure).
  • the unit image data of the block group of the first group matches the unit image data of the block group of the second group
  • the first group An identification code is defined for each set of unit image data for the block group, and this identification code is used instead of each unit image data for the block group of the second group. If to appear, it is efficient eliminates the need to extract overlapping the same data.
  • the same object is drawn with the same positional relationship in the upper right quadrant and the lower right quadrant of the original image shown in Fig. 8, and the block B (01) shown in Fig. 9B And the pattern in B (1 1) are exactly the same.
  • the pixel value given for block B (0 1) and the pixel value given for block B (1 1) are, of course, the same, and the finer division levels contained in these blocks
  • the same pixel value is given to the block B (0 100) and the block B (1 100), and the block B (01 01) is The same pixel value is given to block B (1 1 01), and the same pixel value is given to block B (01 1 0) and block B (1 1 10). 11) and block B (111) have the same pixel value.
  • the same applies to the block of the division level n 3 shown in FIG. 9D.
  • the block indicated by the address whose first two bits are s “01” and the block whose first two bits are indicated by the address “1 1” are the addresses 3 If the bits below are the same, the same pixel value will be given.
  • the block indicated by the address of the first two bits “0 1” (block B (01) and the block obtained in a finer division manner included therein) is defined as the first group of blocks, and the first two bits are assigned. If the block indicated by the address “1 1” (block B (1 1) and the block obtained by the finer division mode included therein) is the block group of the second group, the first group The difference between the set of unit image data for the block group of the group and the set of unit image data for the block group of the second group is only the first two bits of the address. Therefore, for example, an identification code such as “group (0 1)” is defined in the set of unit image data for the block group of the first group, and each unit for the block group of the second group is defined.
  • this identification code “group (01)” is extracted instead of image data, it is not necessary to extract the same data redundantly.
  • the unit image data indicated by the address having the leading 2-bit power s “11” does not need to be extracted. It suffices to extract the code that is “group (0 1)”.
  • information that clarifies which part has been replaced with which part is added to the finally extracted data (data transmitted to the display device). It is necessary to keep. That is, in the case of the above example, the unit image data indicated by the address of “the leading two bits s“ 1 1 ”is replaced with a set of unit image data indicated by the identification code“ group (0 1) ”. The information should be included in the unit image data that is ultimately extracted.
  • the display device that performs display processing using the unit image data thus extracted can also handle such identification code. It is necessary to prepare such a function.
  • the lower right quadrant area to be displayed using “unit image data whose first two bits are indicated by“ 1 1 ”” is identified by the identification code “group (01)”.
  • the display processing power that displays the same image as the image displayed in the upper right quadrant by the unit image data indicated (that is, the unit image data indicated by the address whose first two bits are “10”) You should be able to do it.
  • the above-mentioned method encodes the image displayed in the upper right quadrant with an identification code of “group (01)”, and places the “group ( It can be said that this method reduces the data capacity required for reproducing the original image by describing that the image strength indicated by the identification code “0 1)” is displayed. If a block definition with a tree structure is performed 5
  • the image indicated by the identification code “group (0 1)” is an image indicated by a block group located on a branch branched from the block B (01).
  • the image coded in this way is used only in one place (block B (11)).
  • block B (11) the same image exists in three or more places on the original image, It is possible to use coded images in multiple places.
  • an identification code is given to the image data indicating the one pattern part and the code is coded.
  • This is a method based on the basic idea that the identification code is used instead of the image data for the picture part in other places.
  • Such a method can be applied to two or more original images. That is, when generating the first image data for reproducing the first original image and the second image data for reproducing the second original image, a portion of the first original image is generated. If a part of the same pattern is included in a part of the second original image, an identification code is also given to the image data indicating the pattern part of the first original image, and the image data is coded. If this is done, it becomes possible to substitute this identification code for the same picture portion on the second original image instead of the image data.
  • the first group of blocks including the first block of the many blocks defined for the first original image and the blocks included therein, and the second group of the second original image Regarding a second block of a large number of defined blocks and a second group of blocks including blocks included therein, each unit image data of the first group of blocks, If the unit image data of the block group of the group matches the unit image data, an identification code is defined for the set of unit image data of the block group of the first group, and the second original image In the image data extraction stage, the identification code may be extracted instead of each unit image data of the block group of the second group.
  • this method can also be applied to three or more original images, and the coded part on the first original image can be used for all subsequent original images. It is possible.
  • a moving image as described later a plurality of original images are sequentially displayed along the time axis.
  • an identification code is assigned to a part of the original image displayed earlier in time. If the identification code is used to represent the same part on the original image to be displayed later using this identification code, it is very effective in reducing the total data amount for presenting a moving image. is there. (5) Omission of image data extraction stage
  • a predetermined unit image is selected from unit image data of all blocks obtained by all division modes defined in the division level definition stage according to the conditions for reproducing the original image.
  • an image data extracting step of extracting some unit image data necessary for reproducing the original image from the 85 sets of unit image data is performed based on a predetermined algorithm.
  • these 85 sets of unit image data are redundant data for reproducing the original image, and not all of these data are required for display.
  • client devices that receive web pages and display them on the screen are not limited to personal computers, but also cover a wide variety of game devices and mobile phones. Therefore, the display screen resolution of these client devices also varies, and some devices can only display low-resolution images even if high-resolution image information is transmitted. Alternatively, high-resolution image information may not be needed depending on the application, such as when recognizing the presence or absence of an object. In such a case, it is sufficient to select and transmit only the unit image data up to a certain division level.
  • the necessary unit image data can be selected each time according to the performance, application, communication environment, etc. of the client device. Distribution. (6) Support for original images of any size
  • Embodiments described so far which had been subjected to the creation of image data based on the original image constituted by a two-dimensional pixel array of 8 rows and 8 columns, generally vertical contact and laterally the 2 n respectively If the original image consists of a square pixel array with pixels arranged (for example, a pixel array of 16 rows and 16 columns, 32 rows and 32 columns, and 64 rows and 64 columns), the description has been given so far. mosquitoes that carry out the definition of exactly the same split level you Yopi ⁇ de-less as the embodiment? can.
  • the size of the original image does not always match the square element array in which 2 "pixels are arranged vertically and horizontally.
  • a square pixel array in which 2 n pixels are arranged vertically and horizontally is defined, and a part of this square pixel array (displaying the original image Image data to be displayed on a display screen with a vertical / horizontal aspect ratio of 1: 1.
  • E the effective area for displaying the original image. It is defined as E.
  • the method for generating image data according to the present invention can be applied to an original image having an arbitrary aspect ratio.
  • the effective area E shown in Fig. 21 can be defined by using this information.
  • some pixel value Q ( ⁇ ) indicating that the pixel is a pixel in the sky area EX is defined.
  • Q ( ⁇ ) indicating that the pixel is a pixel in the sky area EX
  • the representative pixel of block ⁇ (1 0) is the lower left corner, and the representative pixel of ⁇ (1 1) is the lower right corner).
  • the unit image data corresponding to blocks ⁇ (10) and ⁇ (11) is data indicating that no original image exists in this area.
  • the pixel values of these blocks are This is the actual pixel value of one pixel on the image. If the screen of the display device that reproduces the original image has the same size as the effective area ⁇ , the original image can be normally reproduced even if the representative pixel is determined by any of the methods described above. . However, if a display device with a screen that is wider in the vertical direction than the effective area ⁇ is used, the empty area ⁇ X will be displayed as a margin, so the representative pixel must be determined by the former method described above. For example, if the representative pixel is determined by the latter method described above, the margin part is the power to be displayed as a screen corresponding to the pixel value Q ( ⁇ ). The image will be presented.
  • the first method is to extract only unit image data corresponding to blocks that fall within the effective area E (blocks that do not enter the empty area Ex) when extracting unit image data.
  • the second method is a method in which information as shown in FIG. 22 is transmitted to the display device in advance, and the size of the effective area E is defined.
  • the display device performs a process of generating a reproduced image of the original image based on the received unit image data. At this time, a process may be performed such that a portion other than the effective area E is not displayed.
  • display elements existing in a portion other than the effective area E may be set to an OFF state in a hardware manner.
  • FIG. 22 shows the information indicating the effective area E.
  • information indicating the empty area EX may be prepared and transmitted to the display device side. In this case, the display device may perform a process of removing a portion of the empty region EX from the image reproduced by the received unit image data and displaying the image.
  • a still image is used as an original image and image data for reproducing the original image is generated
  • the present invention provides an image data for reproducing a moving image. It can also be used for generation. More specifically, a plurality of still images having a fixed presentation order may be prepared to compose a moving image, and a unit image data group may be generated using each still image as an original image. If the generated unit image data group is played back in still image units in order, a moving image can be played.
  • generating a unit image data group for each still image if the unit image data group is generated using the difference image from the preceding still image as the original image, the overall data amount is reduced. can do.
  • the original images Ml and M2 are displayed in this order.
  • a video is presented. This video is a video in which the green letter “I” displayed on a purple background moves to the left.
  • image data is generated using the moving image original image Ml as the first original image.
  • a difference image D of the original moving images Ml and M2 as shown in Fig. 24 is created.
  • This difference image D is an image in which the pixels at the same position in the original moving image Ml and M2 are compared, and only the pixels having a difference are defined as the pixel values of the original moving image M2. There is no difference and the pixel value indicating the background is defined. Then, using the difference image D as an original image, image data is created by the method of the present invention. However, for the background image part, the creation of image data may be omitted. Specifically, in the case of the difference image D shown in FIG. 24, it is sufficient that a unit image data group capable of indicating green pixels and purple pixels can be prepared.
  • the display device first displays the moving image original image Ml, and then displays the difference image D If the processing of rewriting only the image portion other than the background indicated by is performed, the presentation of a moving image becomes possible.
  • image data representing the original image in the initial state is created and transmitted to the display device, and thereafter, a difference image D representing only the changed portion is created and transmitted, whereby the power of change can be obtained. Since image data needs to be transmitted only when s' occurs, the total amount of data to be transmitted can be reduced. In addition, since the calculation for obtaining the difference image D can be performed by a simple comparison operation between bits, the calculation burden is reduced. (8) Application to comparison operation between images
  • the present invention is directed to a method for generating image data for reproducing the original image based on a predetermined original image.
  • the image data created by the method according to the present invention is a comparison operation between images. It can also be used for As described above, since the comparison operation between the unit image data can be performed by a simple bit comparison operation, high-speed operation is possible. This makes it possible to compare the size and color of an arbitrary object included in the image, and for example, it is possible to perform processing such as comparing the shapes of two products at high speed. If applied to image recognition, high-speed recognition processing becomes possible.
  • the product is photographed with the product placed in an environment with a background having a predetermined color, and only the unit image data for expressing pixels having a color other than the background color is extracted, the background is removed.
  • Image data indicating only products can be generated.
  • a code is added to the unit image data group indicating a specific object, the unit image data group expressing the specific object can be searched by this code, and the background image can be included. It is possible to construct an image database for the object images that do not exist.
  • the division level, address, and pixel value are each represented by a bit, and the bit length of the division level is fixed, and the bit length of the address and the bit length of the pixel value are represented.
  • the format of the unit image data with fixed length is the sum of However, in implementing the present invention, the format of the unit image data is arbitrary, and does not necessarily need to be the format shown in FIG. Each bit length can be arbitrarily set, and the bit itself indicating the division level can be omitted.
  • the bit portion indicating the address and the bit portion indicating the pixel value data in some way (for example, by sandwiching them with a separator consisting of a unique bit string)
  • Ad Even less length Ya data length of any length, it is possible force? Be distinctively recognize on the bit portion indicating a bit portion and a pixel value data indicating the address of the specific bit sequence. If the bit part indicating the address can be recognized, the division level can be recognized based on the bit length.
  • many methods are known for expressing addresses and data as a bit string by distinguishing them from each other according to various communication methods.
  • the format of unit image data is as follows. It may be something like this. INDUSTRIAL APPLICABILITY
  • the method for generating image data according to the present invention can be widely used for generating image data for driving various display devices. It can be used for generating image data suitable for driving a large-sized display device such as the like.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)

Abstract

On génère des données d'image reproduisant une image originale qui comprend un réseau de pixels 8 x 8. On définit quatre niveaux de division n = 0 à 3, on divise l'image originale en 22n blocs et la totalité de l'image en 85 blocs et on définit leurs adresses. On détermine un pixel prédéterminé de l'image originale inclus dans chaque bloc sous forme de pixel représentatif de ce bloc et on détermine la valeur de pixel de chaque pixel représentatif sous forme de valeur de pixel dudit bloc. On détermine une unité de données d'image représentative du niveau de division, une adresse et une valeur de pixel pour chacun des 85 blocs. Parmi les 85 unités de données d'image, on peut extraire une pluralité d'unités de données d'image pouvant reproduire l'image originale à la condition que lorsqu'une pluralité d'articles de données représentent une position identique, la valeur de pixel de donnée sur une division minute soit utilisée. Afin de juger si on peut extraire une unité de données d'image spécifique, on compare la valeur de pixel de l'unité de données d'image spécifique avec la valeur de pixel de l'unité de données d'image de division et on extrait les unités de données lorsqu'elles ne sont pas identiques.? ¿
PCT/JP2001/003789 2001-05-01 2001-05-01 Procede de generation de donnees d'image WO2002091301A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/JP2001/003789 WO2002091301A1 (fr) 2001-05-01 2001-05-01 Procede de generation de donnees d'image
JP2002588480A JPWO2002091301A1 (ja) 2001-05-01 2001-05-01 画像データの生成方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2001/003789 WO2002091301A1 (fr) 2001-05-01 2001-05-01 Procede de generation de donnees d'image

Publications (1)

Publication Number Publication Date
WO2002091301A1 true WO2002091301A1 (fr) 2002-11-14

Family

ID=11737290

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2001/003789 WO2002091301A1 (fr) 2001-05-01 2001-05-01 Procede de generation de donnees d'image

Country Status (2)

Country Link
JP (1) JPWO2002091301A1 (fr)
WO (1) WO2002091301A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006343380A (ja) * 2005-06-07 2006-12-21 Victor Co Of Japan Ltd 画像表示装置及び画像表示方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03161791A (ja) * 1989-11-20 1991-07-11 Nippon Telegr & Teleph Corp <Ntt> 表示用メモリ装置
WO1996010244A1 (fr) * 1994-09-27 1996-04-04 Shinsuke Nishida Affichage
WO1997036279A1 (fr) * 1996-03-26 1997-10-02 Fourie, Inc. Dispositif d'affichage
JPH1155662A (ja) * 1997-08-05 1999-02-26 Matsushita Electric Ind Co Ltd 画像処理装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03161791A (ja) * 1989-11-20 1991-07-11 Nippon Telegr & Teleph Corp <Ntt> 表示用メモリ装置
WO1996010244A1 (fr) * 1994-09-27 1996-04-04 Shinsuke Nishida Affichage
WO1997036279A1 (fr) * 1996-03-26 1997-10-02 Fourie, Inc. Dispositif d'affichage
JPH1155662A (ja) * 1997-08-05 1999-02-26 Matsushita Electric Ind Co Ltd 画像処理装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006343380A (ja) * 2005-06-07 2006-12-21 Victor Co Of Japan Ltd 画像表示装置及び画像表示方法
JP4639972B2 (ja) * 2005-06-07 2011-02-23 日本ビクター株式会社 画像表示装置及び画像表示方法

Also Published As

Publication number Publication date
JPWO2002091301A1 (ja) 2004-08-26

Similar Documents

Publication Publication Date Title
CN110892453B (zh) 使用图像/视频编解码器的点云和网格压缩
US5475812A (en) Method and system for independent control of multiple windows in a graphics display system
KR100989010B1 (ko) 그래픽 데이터 및 디지털 문서 프로세싱의 시각적표현들을 생성하는 시스템 및 방법
JP2886460B2 (ja) データ処理装置及びシステム
US7538778B2 (en) Method and system for dynamically allocating a frame buffer for efficient anti-aliasing
AU704617B2 (en) Method and apparatus for mapping texture
US7456904B2 (en) Method and apparatus for superimposing characters on video
US8385639B2 (en) Compressive coding device and visual display control device
JP2003067758A (ja) デジタル・ビデオ・パイプライン内で異なるグラフィックス形式を組み合わせるためのシステム
JPH06303423A (ja) 複合様式・複合信号源映像信号結合システム
WO2008026808A1 (fr) Procédé d&#39;agencement d&#39;un module de diode électroluminescente, procédé de conversion de données pour l&#39;affichage d&#39;une image mobile au moyen dudit module, et appareil de conversion de données
US7715642B1 (en) Bitmap image compressing
CN112200899A (zh) 一种采用实例化渲染实现模型业务交互的方法
WO2002091301A1 (fr) Procede de generation de donnees d&#39;image
JP3658942B2 (ja) 画像用データの符号化方法およびその符号化装置ならびに画像用データの復号化方法およびその復号化装置
JPH04248771A (ja) 情報隠蔽方法
Peterson et al. The Utah Raster Toolkit
JPH10134173A (ja) 画像データの生成および処理
US5164711A (en) System and method for generating graphical output
JPH0334777A (ja) 画像信号符号化装置、画像信号復号化装置および画像信号表示装置
JPH0722342B2 (ja) 色彩画像符号化方法
US6351264B1 (en) Method for computer image color shading painting or recreation
RU2405205C1 (ru) Способ порождения спрайта
JP4660128B2 (ja) 電光表示システム
JPH06180573A (ja) 画像形成方法

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU CA CN IN JP KR NO SG US ZA

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2002588480

Country of ref document: JP

122 Ep: pct application non-entry in european phase