JP5331432B2 - Image processing apparatus and image processing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To solve such a problem that sometimes an image for display is difficult to be displayed with a good responsiveness in accordance with an image change request from a user. <P>SOLUTION: Regions of absolute minimum including regions from x0 to x1 being not overlapped with an image 160 stored until now out of images 162 to be stored newly in a buffer memory are decoded, regions from x2 to x3 being unnecessary any longer out of images 160 already stored are overwritten (S70). Next, repeat images 166 in which intermediate images 164 made as the above are repeated in the horizontal direction are made temporarily (S72). When coordinates of boundaries of the intermediate images in the repeat images 166 are made 0, regions from -(x1 to x0) to (x2 to x1) are taken out, and they are stored newly in a buffer for decode (S74). <P>COPYRIGHT: (C)2010,JPO&amp;INPIT

Description

  The present invention relates to an image processing technique for enlarging / reducing an image displayed on a display, or moving the image vertically and horizontally.

Home entertainment systems have been proposed that not only execute game programs, but also play video. In this home entertainment system, the GPU generates a three-dimensional image using polygons (see, for example, Patent Document 1).

On the other hand, a technique for enlarging / reducing a display image and moving up / down / left / right using a plurality of resolution tile images generated from a digital image such as a high-definition photograph has been proposed. In this image processing technique, an original image size is reduced in a plurality of stages to generate images with different resolutions, and images in each layer are divided into one or a plurality of tile images to represent the original image in a hierarchical structure. Usually, the image with the lowest resolution is composed of one tile image, and the original image with the highest resolution is composed of the largest number of tile images. The image processing apparatus quickly performs enlarged display or reduced display by switching the tile image being used to a tile image of a different hierarchy at the time of enlargement processing or reduction processing of the display image.
US Pat. No. 6,563,999

  In such an image processing apparatus, when the user requests to move the display area or to enlarge or reduce the image (hereinafter collectively referred to as “image change”), processing such as reading of the tile image data and decoding is performed. Therefore, it may take time that cannot be overlooked before a new image is output.

  The present invention has been made in view of such a problem, and an object thereof is to provide an image processing technique excellent in responsiveness to an image change request from a user.

  One embodiment of the present invention relates to an image processing apparatus. This image processing apparatus is an image processing apparatus that displays an area in an image on a display in accordance with a user's request. The decoding section reads out and decodes compressed image data of a necessary area from a memory based on the request, and the decoding section decodes the image processing apparatus. And a display image processing unit that reads at least a part of the image stored in the buffer memory and draws a display area, and the decoding unit stores the new image in the buffer memory. In this case, an overlapping area acquisition unit that identifies an overlapping area between the previously stored image and the new image, and a partial area decoding that decodes compressed image data of the area including the partial area excluding the overlapping area of the new image Part and the overlapping area of the images stored so far and the partial area decoded by the partial area decoding unit Characterized in that it comprises a decoding image storage unit for storing in the buffer memory.

  Another embodiment of the present invention relates to an image processing method. This image processing method is an image processing method for displaying an area in an image on a display in accordance with a user's request. When the compressed image data of a necessary area is newly decoded and stored in a buffer memory based on the request, A step of identifying an overlapping area between the image stored up to and the new image, a step of reading out the compressed image data of the area including the partial area excluding the overlapping area from the new image, and decoding the compressed image data, A step of connecting the overlapping area of the stored image and the newly decoded partial area area to store in the buffer memory, and a step of reading at least a part of the image stored in the buffer memory and drawing an area to be displayed It is characterized by including these.

  It should be noted that any combination of the above-described constituent elements and a representation of the present invention converted between a method, an apparatus, a system, a computer program, etc. are also effective as an aspect of the present invention.

  According to the present invention, it is possible to provide an image processing apparatus having excellent responsiveness to an image change request from a user.

  FIG. 1 shows a use environment of an image processing system 1 according to an embodiment of the present invention. The image processing system 1 includes an image processing device 10 that executes image processing software, and a display device 12 that outputs a processing result by the image processing device 10. The display device 12 may be a television having a display that outputs an image and a speaker that outputs sound. The display device 12 may be connected to the image processing device 10 by a wired cable, or may be wirelessly connected by a wireless local area network (LAN) or the like. In the image processing system 1, the image processing apparatus 10 may be connected to an external network such as the Internet via the cable 14 to download and acquire hierarchical compressed image data. The image processing apparatus 10 may be connected to an external network by wireless communication.

  The image processing device 10 may be a game device, for example, and may implement an image processing function by loading an application program for image processing. The image processing apparatus 10 may be a personal computer, and may implement an image processing function by loading an image processing application program.

  In response to a request from the user, the image processing apparatus 10 performs a process of changing the display image, such as an enlargement / reduction process of an image displayed on the display of the display device 12 or a movement process in the vertical and horizontal directions. When the user operates the input device while viewing the image displayed on the display, the input device transmits a display image change request signal to the image processing device 10.

  FIG. 2 shows an external configuration of the input device 20. The input device 20 includes a cross key 21, analog sticks 27a and 27b, and four types of operation buttons 26 as operation means that can be operated by the user. The four types of operation buttons 26 include a circle button 22, a x button 23, a square button 24, and a triangle button 25.

  In the image processing system 1, a function for inputting a display image enlargement / reduction request and a vertical / left / right scroll request is assigned to the operation unit of the input device 20. For example, the input function of the display image enlargement / reduction request is assigned to the right analog stick 27b. The user can input a display image reduction request by pulling the analog stick 27b forward, and can input a display image enlargement request by pressing the analog stick 27b from the front. The input function of the display area movement request is assigned to the cross key 21. The user can input a movement request in the direction in which the cross key 21 is pressed by pressing the cross key 21. Note that the image change request input function may be assigned to another operation means, for example, the scroll request input function may be assigned to the analog stick 27a.

  The input device 20 has a function of transmitting the input image change request signal to the image processing device 10, and is configured to be able to perform wireless communication with the image processing device 10 in the present embodiment. The input device 20 and the image processing device 10 may establish a wireless connection using a Bluetooth (registered trademark) protocol, an IEEE802.11 protocol, or the like. The input device 20 may be connected to the image processing apparatus 10 via a cable and transmit an image change request signal to the image processing apparatus 10.

  FIG. 3 shows a hierarchical structure of image data used in the present embodiment. The image data has a hierarchical structure including a 0th hierarchy 30, a first hierarchy 32, a second hierarchy 34, and a third hierarchy 36 in the depth (Z-axis) direction. Although only four layers are shown in the figure, the number of layers is not limited to this. Hereinafter, image data having such a hierarchical structure is referred to as “hierarchical data”.

  The hierarchical data shown in FIG. 3 has a hierarchical structure of a quadtree, and each hierarchy is composed of one or more tile images 38. All the tile images 38 are formed in the same size having the same number of pixels, and have, for example, 256 × 256 pixels. The image data of each layer expresses one image at different resolutions, and the original image of the third layer 36 having the highest resolution is reduced in a plurality of stages to obtain the second layer 34, the first layer 32, the 0th layer. Image data of the hierarchy 30 is generated. For example, the resolution of the Nth layer (N is an integer greater than or equal to 0) may be ½ of the resolution of the (N + 1) th layer in both the left and right (X axis) direction and the up and down (Y axis) direction.

  In the image processing apparatus 10, the hierarchical data is held in the storage device in a compressed state in a predetermined compression format, and is read from the storage device and decoded before being displayed on the display. The image processing apparatus 10 according to the present embodiment has a decoding function corresponding to a plurality of types of compression formats, and can decode, for example, compressed data in the S3TC format, JPEG format, and JPEG2000 format. In the hierarchical data, the compression processing may be performed in units of tile images, or may be performed in units of a plurality of tile images included in the same layer or a plurality of layers.

  As shown in FIG. 3, the hierarchical structure of the hierarchical data is set with the horizontal direction as the X axis, the vertical direction as the Y axis, and the depth direction as the Z axis, thereby constructing a virtual three-dimensional space. When the image processing device 10 derives the change amount of the display image from the image change request signal supplied from the input device 20, the image processing device 10 derives the coordinates (frame coordinates) of the four corners of the frame in the virtual space using the change amount. The frame coordinates in the virtual space are used for loading to a main memory and display image generation processing described later. Instead of the frame coordinates in the virtual space, the image processing apparatus 10 may derive information for specifying the hierarchy and texture coordinates (UV coordinates) in the hierarchy. Hereinafter, the combination of the hierarchy specifying information and the texture coordinates is also referred to as frame coordinates.

  FIG. 4 shows the configuration of the image processing apparatus 10. The image processing apparatus 10 includes a wireless interface 40, a switch 42, a display processing unit 44, a hard disk drive 50, a recording medium mounting unit 52, a disk drive 54, a main memory 60, a buffer memory 70, and a control unit 100. . The display processing unit 44 has a frame memory that buffers data to be displayed on the display of the display device 12.

  The switch 42 is an Ethernet switch (Ethernet is a registered trademark), and is a device that transmits and receives data by connecting to an external device in a wired or wireless manner. The switch 42 may be connected to an external network via the cable 14 and receive the compressed image data layered from the image server. The switch 42 is connected to the wireless interface 40, and the wireless interface 40 is connected to the input device 20 using a predetermined wireless communication protocol. An image change request signal input from the user in the input device 20 is supplied to the control unit 100 via the wireless interface 40 and the switch 42.

  The hard disk drive 50 functions as a storage device that stores data. The compressed image data received via the switch 42 is stored in the hard disk drive 50. When a removable recording medium such as a memory card is mounted, the recording medium mounting unit 52 reads data from the removable recording medium. When a read-only ROM disk is loaded, the disk drive 54 drives and recognizes the ROM disk to read data. The ROM disk may be an optical disk or a magneto-optical disk. The compressed image data may be stored in these recording media.

  The control unit 100 includes a multi-core CPU, and includes one general-purpose processor core and a plurality of simple processor cores in one CPU. The general-purpose processor core is called a PPU (Power Processing Unit), and the remaining processor cores are called a SPU (Synergistic-Processing Unit).

  The control unit 100 includes a memory controller connected to the main memory 60 and the buffer memory 70. The PPU has a register, has a main processor as an operation execution subject, and efficiently assigns a task as a basic processing unit in an application to be executed to each SPU. Note that the PPU itself may execute the task. The SPU has a register, and includes a sub-processor as an operation execution subject and a local memory as a local storage area. The local memory may be used as the buffer memory 70.

  The main memory 60 and the buffer memory 70 are storage devices and are configured as a RAM (Random Access Memory). The SPU has a dedicated DMA (Direct Memory Access) controller as a control unit, can transfer data between the main memory 60 and the buffer memory 70 at high speed, and the frame memory and the buffer memory 70 in the display processing unit 44 can be transferred. High-speed data transfer can be realized. The control unit 100 according to the present embodiment realizes a high-speed image processing function by operating a plurality of SPUs in parallel. The display processing unit 44 is connected to the display device 12 and outputs an image processing result according to a request from the user.

  The image processing apparatus 10 according to the present embodiment uses a part of compressed image data determined according to a rule described later in order to smoothly change a display image when performing a display image enlargement / reduction process or a display area movement process. Is loaded from the hard disk drive 50 into the main memory 60. Further, a part of the compressed image data loaded in the main memory 60 is decoded and stored in the buffer memory 70. This makes it possible to instantaneously switch an image used for generating a display image at a necessary later timing.

  FIG. 5 schematically shows the flow of image data in the present embodiment. First, the hierarchical data is stored in the hard disk drive 50. Instead of the hard disk drive 50, a recording medium mounted on the recording medium mounting unit 52 or the disk drive 54 may be held. Alternatively, the hierarchical data may be downloaded from an image server connected by the image processing apparatus 10 via a network. As described above, the hierarchical data here is subjected to fixed length compression in the S3TC format or the like, or variable length compression in the JPEG format or the like.

  Among the hierarchical data, a part of the image data is loaded into the main memory 60 in a compressed state (S10). The area to be loaded here is a predetermined rule such as the vicinity of the current display image in the virtual space, the area of the image, the area where a display request is predicted to be frequently made based on the user's browsing history, etc. Determined by. The loading is performed not only when an image change request is made, but also at any given time interval, for example. This prevents the load process from being concentrated at one time.

  The compressed image data to be loaded is a block unit having a substantially constant size. Therefore, the hierarchical data held by the hard disk drive 50 is divided into blocks according to a predetermined rule. By doing so, data management in the main memory 60 can be performed efficiently. That is, even if the compressed image data is variable-length compressed, the data size to be loaded is almost equal in units of blocks (hereinafter referred to as “image blocks”). A new load is completed by overwriting any of the stored blocks. As a result, fragmentation is unlikely to occur, the memory can be used efficiently, and address management is facilitated.

  Next, among the compressed image data stored in the main memory 60, the image data of the region necessary for display or the image of the region predicted to be necessary is decoded and stored in the buffer memory 70 (S12). The buffer memory 70 includes at least two buffer areas 72 and 74. The size of each buffer area 72, 74 is set larger than the size of the frame memory 90. When an image change request signal is input from the input device 20, the buffer area 72 is used for a certain amount of change request. , 74, the display image can be generated.

  One of the buffer areas 72 and 74 is used for holding an image used for generating a display image, and the other is used for preparing an image predicted to be necessary thereafter. Hereinafter, the former is referred to as “display buffer”, and the latter is referred to as “decoding buffer”. In the example of FIG. 5, it is assumed that the buffer area 72 is a display buffer, the buffer area 74 is a decoding buffer, and the display area 68 is displayed. The image stored in the decoding buffer by the prefetching process may be an image in the same hierarchy as the image stored in the display buffer, or may be an image in a different hierarchy having a different scale.

  Next, the image in the display area 68 among the images stored in the buffer area 72, which is a display buffer, is drawn in the frame memory 90 (S14). During this time, the image in the new area is decoded as necessary and stored in the buffer area 74. The display buffer and the decoding buffer are switched according to the timing of completion of storage, the change amount of the display area 68, and the like (S16). Thereby, a display image can be smoothly switched with respect to a movement of a display area, a change of a scale ratio, or the like.

  Further, in the present embodiment, when an image of a new area is to be stored in the decoding buffer, if there is an area overlapping with the decoded image stored so far, the area is used. Minimize new decoding area. A specific method will be described in detail later.

  FIG. 6 shows the configuration of the control unit 100 in detail. The control unit 100 includes an input information acquisition unit 102 that acquires information input by the user from the input device 20, a compressed data division unit 104 that divides hierarchical data into image blocks, and a load block determination unit that determines an image block to be newly loaded. 106 includes a load unit 108 for loading necessary image blocks from the hard disk drive 50. The control unit 100 further includes a display image processing unit 114 that draws a display image, a prefetch processing unit 110 that performs prefetch processing, and a decoding unit 112 that decodes compressed image data.

  In FIG. 6, each element described as a functional block for performing various processes can be configured by a CPU (Central Processing Unit), a memory, and other LSIs in terms of hardware, and in terms of software, a memory This is realized by a program loaded on the computer. As described above, the control unit 100 includes one PPU and a plurality of SPUs, and each functional block can be configured by the PPU and the SPU individually or in cooperation. Therefore, it is understood by those skilled in the art that these functional blocks can be realized in various forms by hardware only, software only, or a combination thereof, and is not limited to any one.

  The input information acquisition unit 102 acquires instruction contents such as start / end of image display, movement of a display area, enlargement and reduction of a display image, which are input by the user to the input device 20.

  The compressed data dividing unit 104 reads the hierarchical data from the hard disk drive 50, etc., generates an image block by dividing it according to a predetermined rule described later, and stores the image block in the hard disk drive 50. For example, when the user selects any one of the hierarchical data stored in the hard disk drive 50 with respect to the input device 20, the information is acquired from the input information acquisition unit 102, and the division process is started.

  On the other hand, the compressed data dividing unit 104 may not be in the same device as other functions of the control unit 100, and may be divided at the stage of generating hierarchical data. Although a specific division method will be described in detail later, the block division method performed by the compressed data division unit 104 may be different depending on the hardware performance such as the speed of the hard disk drive 50 and the capacity of the main memory 60. Therefore, the compressed data dividing unit 104 is set in advance so as to perform optimal block division according to the hardware performance of the image processing apparatus 10.

  The load block determination unit 106 checks whether there is an image block to be newly loaded from the hard disk drive 50 to the main memory 60 and determines the next image block to be loaded, and issues a load request to the load unit 108. The load block determination unit 106 performs the above confirmation and determination processing at a predetermined time interval, for example, when the load unit 108 is not performing the load process, for example, when a user makes an image change request. . The load unit 108 performs actual load processing in accordance with a request from the load block determination unit 106.

  When the user makes a display image change request, if the image block including the image area to be changed is not stored in the main memory 60, the image block is loaded from the hard disk drive 50, the necessary area is decoded, and the display image is displayed. It is necessary to perform processing such as drawing at once. In this case, it is conceivable that the load process becomes a bottleneck, and the responsiveness to the user request is impaired. In this embodiment, (1) image blocks are loaded so as to cover regions that are likely to be displayed in the future, and (2) loading is performed as needed so that the loading process is not concentrated at one time. Load under policy. As a result, the load process is less likely to interfere with the display image changing process. The procedure for determining the image block to be loaded will be described in detail later.

  The prefetch processing unit 110 predicts an image area that will be required for drawing a display image in the future in accordance with the frame coordinates of the current display image and the display image change request information input by the user, and decodes the information. 112. However, immediately after the start of image display, or when the image to be changed cannot be drawn with the image already stored in the buffer memory 70, information on a predetermined area including an image necessary for drawing the display image at that time is not predicted. Is supplied to the decoding unit 112. Based on the image area information acquired from the prefetch processing unit 110, the decoding unit 112 reads and decodes a part of the compressed image data from the main memory 60, and stores the decoded data in the decoding buffer or the display buffer.

  The display image processing unit 114 determines the frame coordinates of a new display image according to the display image change request input by the user, reads the corresponding image data from the display buffer of the buffer memory 70, and the frame memory 90 of the display processing unit 44. To draw.

  Next, a method for dividing hierarchical data into image blocks will be described. FIG. 7 shows the configuration of the compressed data dividing unit 104 in detail. The compressed data dividing unit 104 includes an identification number assigning unit 120 and an image block generating unit 122. The identification number assigning unit 120 assigns identification numbers in order from 0 to the tile images of each layer constituting the hierarchical data in a predetermined order. The image block generation unit 122 collects tile images in order of identification numbers until immediately before the total data size exceeds a predetermined size, and generates an image block.

  FIG. 8 schematically shows an image of each hierarchy in the hierarchy data. Similarly to FIG. 3, the hierarchical data is composed of images of the 0th hierarchy 30a, the first hierarchy 32a, the second hierarchy 34a, and the third hierarchy 36a. A tile image is one of the sections separated by a solid line in the images of each layer. The identification number assigning unit 120 assigns an identification number to each tile image as shown in FIG. For example, the image of the 0th hierarchy 30a is composed of one tile image, and the identification number is “0”. The first hierarchy 32a, the second hierarchy 34a, and the third hierarchy 36a assign identification numbers “1” and “2”, “3” to “8”, and “9” to “44” to each tile image, respectively. . In the example of FIG. 8, the order of assigning the identification numbers is shown as a raster order, but other orders may be used as will be described later.

  FIG. 9 schematically shows how the image block generator 122 combines the hierarchical data of FIG. 8 into image blocks. As described above, the image block generation unit 122 divides the tile image from the smaller identification number so that the image block is configured by the maximum number of tile images not exceeding a predetermined data size. In this figure, the “predetermined data size” at this time is represented by a “basic block size” in a range of arrows.

  In the example in the figure, tile images with identification numbers “0” to “5” are grouped into image blocks 2, tile images with “6” to “8” are grouped into image blocks 4, and so on. The tile image from “41” to “44” is the final image block 6. Each image block is identified by the identification number of the leading tile image and the number of tile images included. Therefore, the image block 2 has identification information “(0, 6)”, the image block 4 has identification information “(6, 3)”, and the image block 6 has “(41, 4)”. When the identification information is defined in this way, it can be easily determined whether or not a certain tile image is included in a certain image block. That is, regardless of the block division method, it is possible to specify the tile image included in the image block only by confirming the range of the identification number.

  The image block identification information is stored in the hard disk drive 50 in association with the storage area information of the corresponding compressed image data in the hard disk drive 50. In this way, if the compressed image data is divided into image blocks of approximately the same size, as described above, even if the loaded image block is stored in a continuous area in the main memory 60, one image block is thereafter stored. The image data can be stored by overwriting with the image block loaded in the memory block, the occurrence of fragmentation can be suppressed, and the main memory 60 can be used efficiently.

  When image block delimiters are set in the order of identification numbers as described above, how the original image is divided differs greatly depending on the order in which identification numbers are assigned to tile images. Several examples will be described below. FIG. 10 is an example of an original image for explaining the block division method in the present embodiment. Note that FIGS. 10 to 14 show gray scales, but they may actually be full color. The original image 200 has, for example, 92323 × 34630 pixels and is divided into 361 × 136 tile images.

  FIGS. 11 to 14 show a state in which the original image 200 of FIG. 10 is divided in the order in which various identification numbers are assigned with the basic block size being 1 Mbyte. Each image has different gray scales for each image block so that the boundaries of the image blocks can be easily understood. FIG. 11 shows a state of division when identification numbers are assigned to tile images in raster order as shown in FIG. The raster order divided image 202 is divided into image blocks in a form in which tile images are grouped in the horizontal direction. The width 206 shown in the enlarged image 204 is the length of the image block in the vertical direction. The length in the horizontal direction varies depending on the data size after compression of the tile image included in the image block, and one image block may span a plurality of tile images.

  If the identification numbers are given in the order as shown in FIG. 11, the process of the assignment itself is easy. Further, when blocks are divided in this way, information held by one image block increases in the horizontal direction. Therefore, when the display area is often moved in the horizontal direction due to the contents of the image, an image block that can cover the moved display area can be stored in the main memory 60 with a small number of loads. On the other hand, if there is no such characteristic in the movement of the display area, it is necessary to load a large number of image blocks in order to generate one display image, and a lot of useless information at a location far from the display image is captured. Become inefficient.

  FIG. 12 shows a state of division when identification numbers are assigned to tile images in the order of “Z”. Here, the “Z-shaped” order is incremented alternately in the horizontal direction (X direction) and the vertical direction (Y direction) of the image as shown in the scanning order 214 of the identification number assignment example 212 in FIG. Is in order. Then, an identification number is given like the number described in the figure. When the image blocks are grouped in this order, they are divided into image blocks such as a Z-shaped forward divided image 208. In the enlarged image 210, one image block has a shape like an image block 216.

  That is, in this method, since an identification number is assigned so that a certain tile image is enlarged by the same amount in the horizontal direction and the vertical direction starting from a certain tile image, the image block 216 in this case has a shape close to a square. The detailed shape and size depend on the data size after compression of the tile image included in each image block. When the block is divided as shown in FIG. 12, the information possessed by one image block has better spatial locality, and the image block necessary for generating the display image and the image in the vicinity thereof is different from the case of FIG. Less. Furthermore, it is difficult to load useless area information, and the use efficiency of the main memory 60 is improved.

  FIG. 13 shows a state of division when identification numbers are assigned to tile images in the order of square macro tiles. Here, the “macro tile” is a rectangle composed of a plurality of tile images, and the number of tile images included vertically and horizontally is set in advance. Note that the example of FIG. 12 can be considered to recursively form macro tiles composed of 2 × 2 tile images. In the case of FIG. 13, as shown in the macro tile 222, a square composed of 8 × 8 tile images is defined as one macro tile. Then, identification numbers are assigned within the macro tile 222 in the direction of the arrow, that is, in raster order. As a result, an identification number is assigned to each tile image like the numbers described in the figure. When the identification number has been assigned to one macro tile, the same assignment is performed on all macro tiles in raster order.

  When the image blocks are grouped in this order, they are divided into image blocks such as a square macrotile order divided image 218. That is, the image block in this case has a shape in which macroblocks are grouped in the horizontal direction. In the enlarged image 220, the length of one side of the macro tile 222, or an integral multiple thereof, is the length of the image block in the vertical direction. The length in the horizontal direction varies depending on the data size after compression of the tile image included in each image block. When the blocks are divided as shown in FIG. 13, as in the case of FIG. 12, the number of image blocks necessary for generating a display image and an image in the vicinity of the display image is suppressed, and the load efficiency is improved.

  FIG. 14 shows a state of division when identification numbers are assigned to tile images in the order of strip-like macro tiles. The strip-shaped macro tile is a macro tile in which only the number of tile images included in the horizontal direction is set and the vertical direction is unlimited. In the case of FIG. 14, as shown in the macro tile 230, the horizontal direction is composed of 16 tile images. Then, identification numbers are assigned within the macro tile 230 in the direction of the arrow, that is, in raster order. Thereby, an identification number is given to each tile image like the number described in FIG. When the identification number is assigned to the lower end of the original image, the same assignment is performed on all the macro tiles in raster order, such as the macro tile located to the right of the original image.

  When the image blocks are grouped in this order, they are divided into image blocks such as a strip-like macrotile order divided image 224. In other words, the image block in this case has a shape in which a vertical row of macro tiles is divided in the middle according to the compressed data size of the tile image. In some cases, it may span multiple rows of macro tiles. In the enlarged image 226, the width 228 of the macro tile or an integral multiple thereof is the width in the horizontal direction of the image block. The detailed shape of the boundary line at the image block delimiter also changes in accordance with the data size of the tile image after compression. When the blocks are divided as shown in FIG. 14, the number of image blocks necessary for generating the display image and the image in the vicinity thereof is suppressed as in the case of FIGS. 12 and 13, and the loading efficiency is improved.

  As described above, the shape, size, and contained information of the image block differ greatly depending on the order of assigning the identification numbers and the basic block size. Therefore, a condition that enables the most efficient data capture is determined according to the content and genre of the image, for example, whether it is a landscape photograph or a character image such as a newspaper, and is selected according to the actual image. You may do it. Further, as described above, an optimal method may be selected depending on the hardware configuration.

  Since the image block obtained as a result of dividing the image as described above is a collection of tile images with a substantially uniform data size, the area is the data size after compression of the tile image configured as described above. Dependent. In the original image 200 of FIG. 10, the upper half of the image is an empty region and the color is relatively uniform, so that there are few high frequency components and the compression rate is high. On the other hand, the color change is large near the center of the original image 200 because there are buildings, and the compression rate is low because there are many high-frequency components. Accordingly, the compressed data size of the upper half tile image of the original image 200 tends to be smaller than the data size near the center.

  Taking this into consideration, for example, when viewing the strip-like macrotile ordered divided image 124 of FIG. 14, the area of the upper half image block tends to be larger than the image block near the center. The same applies to other divided images. That is, in the present embodiment, the area of the image is not simply divided evenly, but is divided according to the data size. By doing so, in a region where the data size per unit area is small, compressed data of a large area can be stored in the main memory 60 by one load, and the number of blocks to be managed in the memory is reduced. Management is easy and load efficiency is improved.

  In the example of the Z-shaped forward-divided image 208 shown in FIG. 12, the image block is made closer to a square by assigning an identification number to the Z-shape, and the spatial locality is improved. In the example shown in the figure, when a tile image to which an identification number has been assigned reaches a square having a predetermined size, an identification number is assigned from a new starting point. And arranged in a matrix. For this reason, the boundary lines of the image blocks have a lattice shape that is approximately orthogonal to each other. On the other hand, you may devise so that the boundary line of an image block may not become a grid | lattice form.

  FIG. 15 schematically shows the relationship between the image block and the drawing area of the display image when the boundary lines of the image block are configured in a grid pattern. In one area 132 of the original image, the image block 134a is in a matrix form of three horizontal and two vertical, and the boundary line is a grid. When block division is performed in this way, when the drawing area 136a is located at a position including the intersection of the grid as shown in the figure, four image blocks are required for drawing.

  FIG. 16 schematically shows the relationship between the image block and the drawing area of the display image when the boundary line of the image block has a T-junction shape. In one area 238 of the original image, the image block 134b is arranged so that the vertical boundary line is shifted by the row, and as a result, the boundary line has a T-shaped shape. When block division is performed in this way, even if the drawing area 136b crosses the boundary as shown in the figure, the maximum number of image blocks required for drawing is three, and the load efficiency is improved compared to the case of FIG. . In order to arrange the image blocks in this way, for example, the starting points for assigning the identification numbers are not arranged in a matrix but may be shifted by rows.

  All the block division methods described so far are for images in the same hierarchy. On the other hand, by assigning identification numbers so as to extend over a plurality of hierarchies, information on tile images of a plurality of hierarchies may be included in one image block. In this way, it is possible to reduce the number of times of loading not only for the movement of the display area on the image of the same hierarchy but also for the enlargement and reduction of the display image.

  At this time, the tile images of a plurality of layers may be simply compressed in the same manner and then combined as an image block, or one image is used as the other image by utilizing the redundancy of the same images having different resolutions. May be restored and the compression rate may be increased. In the present embodiment, since information included in one image block is always loaded as a set, such a method is possible. For example, a differential image between an image obtained by enlarging a low resolution image to a magnification of the high resolution image and an actual high resolution image is compressed and included in the image block together with the compressed data of the low resolution image. In this case, the image blocks are grouped in the order of the low resolution image and the difference image, and when the maximum data size does not exceed the basic block size, the next image block is formed.

  FIG. 17 is a diagram for explaining a method of compressing a high-resolution image as a difference image from an enlarged image of a low-resolution image. This process is performed by the compressed data dividing unit 104, but may be performed separately from other processes related to image display at the stage of generating hierarchical data. First, the original images of the second hierarchy 34 and the third hierarchy 36 in the hierarchy data 139 are read out (S20, S22). In this example, as shown in the figure, the third layer image 36b is an image obtained by doubling the second layer image 34b vertically and horizontally. Among these images, some of the tile images of the second layer image 34b are compressed as usual (S24). Next, instead of compressing the corresponding tile image of the third hierarchical image 36b, a differential image between the tile image and an image obtained by enlarging the tile image of the second hierarchical image 34b by 2 × 2 is compressed (S26). .

  At this time, the tile image to be compressed in the second layer image 34b is a tile image of an area obtained by dividing the original image so as to have approximately the same data size, as illustrated in FIGS. . Alternatively, a predetermined number of tile images may be used, and the data size may be adjusted to be uniform at the stage of forming the image block as described above.

  As a result, compressed data 140 of the second layer image 34b and compressed data 142 of the difference image are generated. In the figure, the compressed data is also represented by an image for easy understanding, and the compressed data 142 of the difference image is a shaded image to indicate that it is a difference. These compressed data are included in one image block 144. In this example, only one combination of the second layer image 34b and the third layer image 36b is shown in the image block 144, but images of three or more layers may be included in the same manner. That is, the lowest resolution image is compressed as it is, and the high resolution image is expressed by a difference image from the image in the upper layer. A plurality of sets of compressed data having such dependency relationships may be included in the image block 144.

  The image block 144 generated in this way is stored in the hard disk drive 50. Then, the load unit 108 loads the main memory 60 as necessary. Thereafter, the data is decoded by the decoding unit 112 according to the determination of the prefetch processing unit 110 or the like. At this time, the compressed data 140 of the second layer image 34b is decoded by a normal process to become the second layer image 34b (S28). On the other hand, the compressed data 142 of the difference image is first decoded as usual (S30), and then the decoded second layer image 34b is added to the image enlarged by 2 × 2 (S32, S34), so that the third layer An image 36b is obtained.

  In the above example, the difference image from the enlarged image of the low resolution image is compressed as the data of the high resolution image, but conversely, the low resolution image may be created using the high resolution image. For example, after the high resolution image is wavelet compressed and stored in the hard disk drive 50 and loaded into the main memory 60 as necessary, the decoding unit 112 generates a low pass image of the compressed image of the high resolution image. A low-resolution image may be used. Similarly, a high-resolution image may be JPEG-compressed and the high-frequency component may be cut to form a low-resolution image. Alternatively, the differential image between the low-resolution image thus generated and the original low-resolution image is compressed and included in the same image block, and the low-resolution image is restored by adding the differential image in the same manner as described above. May be. Alternatively, one pixel may be obtained from a 2 × 2 pixel group using a pyramid filter. By these methods, it is possible to shorten the load time to the main memory 60 and to effectively use the area of the main memory 60.

  Next, a method for determining and loading an image block to be loaded into the main memory 60 from the image block stored in the hard disk drive 50 will be described. FIG. 18 is a flowchart showing a processing procedure for determining an image block to be loaded and performing loading. This process is performed as needed at predetermined time intervals, for example. First, the load block determination unit 106 checks whether or not the load unit 108 is currently loading (S40). If it is being loaded, the process is terminated (Y in S40).

  If it is not being loaded (N in S40), it is determined whether or not there is data corresponding to the main memory 60 for an area on the image to be described later (S42). For this purpose, for example, a table in which the identification information of the image block stored in the main memory 60, that is, the information including the identification number of the leading tile image and the number of tile images, and the leading address thereof are associated with each other is stored in the main memory. 60. The presence or absence of data can be determined by searching the table based on the identification number of the necessary tile image. Here, the determination target region may be one tile image or may include a plurality of tile images. Such an area is called a “necessary area”.

  If there is an area that is not loaded in the main memory 60 among the necessary areas (Y in S44), the image block including the area is identified from the identification number of the tile image included in the area and the identification information of the image block. Then, it is determined as a load target (S46). If it is necessary to load a plurality of image blocks at this time, an image block having a high priority is determined as a load target according to a predetermined rule. That is, in one loading process, many image blocks are not loaded at once.

  The more image blocks that are loaded at a time, the longer the time required for loading. However, if the user makes a display image change request during that time, the required area changes and the loading process at that time is wasted. there is a possibility. In order to avoid such a situation, the load block determination unit 106 determines image blocks to be loaded at any time, and limits the number of image blocks to be loaded at one time or within a predetermined number.

  When the load block determination unit 106 determines the load target, the load unit 108 reads the image block to be loaded from the hard disk drive 50 based on the table in which the identification information of the image block and the storage area are associated with each other, and the main memory 60 (S48). If all the necessary areas are stored in the main memory 60 in S44, the process is terminated (N in S44).

  FIG. 19 is a conceptual diagram when determining a necessary area which is a target for determining whether or not data of a necessary area is stored in the main memory 60 in S42. It is desirable that the main memory 60 is basically loaded with compressed data of an image around the currently displayed area. Here, the “periphery” may include the periphery in the vertical and horizontal (X-axis, Y-axis) directions and the depth (Z-axis) direction of the hierarchical structure in an image of the same hierarchy. The periphery in the Z-axis direction means a display image and an enlarged image and a reduced image including the vicinity thereof.

  FIG. 19 shows a part of images of the (n−1) -th layer, the n-th layer, and the (n + 1) -th layer from the top, and a tile image is shown in each image. The image shown in each layer displays the same part on the center line 154. If the region 150 near the center of the n-th layer image is the currently displayed region, the necessary region is, for example, a region including black circles 152a, 152b, and 152c. That is, in the image of the nth layer, which is the layer of the display image, the center (point of the center line 154) and the four corner points in the display image region 150, and the rectangular sides obtained by extending the region 150 vertically and horizontally A tile image including a point and four corner points is set as a necessary area.

  On the other hand, in the images of the (n−1) -th layer and the (n + 1) -th layer that are adjacent to the display image, a tile image including the point of the center line 154 and the four corners of a rectangle of a predetermined size centering on the center line 154 is required. This is an area. The rectangle in this case may be a size corresponding to the size of the rectangle of the display image. If an image block including such a point is always loaded into the main memory 60 even if the display area moves, decoding and drawing can be performed smoothly, and the response to an image change request by the user is improved.

  The points shown in FIG. 19 are merely examples, and the number may be increased or decreased or the arrangement shape may be changed depending on the content of the image, the processing performance of the image processing apparatus 10, the capacity of the main memory 60, and the like. In addition, areas that are important in the content of the image, areas that have been displayed with high frequency in the past, and areas that seem to match the user's preferences from the display history of the same user are preferentially loaded regardless of changes in the displayed image. You may make it do. Here, the “important area” is, for example, a display area such as the vicinity of a face in the case of an image of a person and a feature product in the case of an electronic flyer. The user's preference is a column that the user often browses if the image is a newspaper page. Such a region is loaded with a high priority even when it is necessary to load a plurality of image blocks in S46 of FIG. Alternatively, it may be loaded when image display is started.

  In addition to the priorities in S46 of FIG. 18, for example, the following rules may be prepared. First, priority is given to image blocks in another layer, that is, an enlarged image and a reduced image, over image blocks in the same layer as the display image. This is because, in the case of movement of the display area in the same hierarchy, there is a high possibility of being covered by the decoded images stored in the two buffer areas 72 and 74 in the buffer memory 70, whereas in the movement between the hierarchy, the buffer memory 70 This is because there is a high possibility that all the decoded images must be updated. However, the buffer memory 70 may be sufficient in the case of reciprocating between two layers.

  Further, priority is given to an image block of a reduced image, ie, a reduced image, over an image block of a deep image, ie, an enlarged image. This is because even if the enlarged image cannot be loaded or decoded in time, provisional correspondence is easy by enlarging the reduced image, but the reverse is difficult.

  FIG. 20 is a diagram for explaining prefetch processing performed by the prefetch processing unit 110. FIG. 20 shows the structure of hierarchical data, and each hierarchy is expressed as L0 (0th hierarchy), L1 (1st hierarchy), L2 (2nd hierarchy), and L3 (3rd hierarchy). An arrow 80 indicates that an image change request from the user requests reduction of the display image and straddles L2. In the image processing apparatus 10 according to the present embodiment, the positions in the depth direction of L1 and L2 where the original image data exists are set as the prefetch boundary in the depth direction, and the image change request from the input device 20 is the prefetch boundary. The prefetching process is started at a timing exceeding.

  When the scale factor of the display image is in the vicinity of L2, a display image is created using an image of L2 (second layer). Specifically, when the scale of the image to be displayed is between the switching boundary 82 between the L1 image and the L2 image and the switching boundary 84 between the L2 image and the L3 image, the L2 image is reduced. Enlarge and generate a display image. Therefore, when image reduction processing is requested as indicated by the arrow 80, the L2 enlarged image is converted into a reduced image and displayed. The image processing apparatus 10 according to the present embodiment identifies a future necessary image predicted from the image change request, reads out the image from the main memory 60, and decodes it. In the example of FIG. 20, when the requested scale ratio due to the image change request crosses L2, the image of L1 in the reduction direction is pre-read from the main memory 60, decoded, and written to the buffer memory 70.

  The same process is performed for prefetch processing in the vertical and horizontal directions in the same hierarchy. Specifically, a prefetch boundary is set for the image data stored in the buffer memory 70, and the prefetch process is started when the display position by the image change request crosses the prefetch boundary.

  FIG. 21 is a flowchart showing a processing procedure when the prefetch processing unit 110 and the decoding unit 112 decode an image. First, based on the image change request signal from the input device 20, a required display image change amount is derived (S50). The change amount of the display image is the amount of movement in the vertical and horizontal directions and the amount of movement in the depth direction. Next, the frame coordinates of the four corners of the display area of the movement destination are determined from the frame coordinates of the four corners of the display area in the hierarchical structure based on the derived change amount (S52).

  Then, it is determined whether the image area for displaying the area specified by the determined frame coordinates of the four corners has already been decoded and stored in either the buffer area 72 or the buffer area 74 of the buffer memory 70 (S54). If the necessary image area already exists in the buffer area 72 or the buffer area 74 (Y in S54), it is determined whether the required scale ratio exceeds the prefetch boundary (S56). If the prefetch boundary is not exceeded, the buffer memory 70 ends the process as it is.

  When the image area for displaying the area specified by the frame coordinates of the four corners determined in S52 does not exist in the buffer memory 70 (N in S54), and when the required scale ratio exceeds the prefetch boundary ( In S56, Y), the prefetch processing unit 110 instructs the decoding unit 112 to decode a necessary image area. The decoding unit 112 acquires the data of the designated image area from the main memory 60, decodes it, and stores it in the buffer area 72 or the buffer area 74 (S60). Accordingly, a necessary image area can be developed in the buffer memory 70 before the display image processing unit 114 generates the display image.

  When a part of the image stored in the display buffer is displayed, the next required image in the decoding buffer is, for example, when the display area crosses the prefetch boundary when moving within the same hierarchy, It is an image in which the display area is included at the end on the start point side in the movement direction. In this case, the images stored in the buffer area 72 and the buffer area 74 have at least an overlap area corresponding to the size of the display image, and the overlap area further increases depending on the setting position of the prefetch boundary. The range of an image to be newly decoded when the prefetch boundary is exceeded is set in advance according to the processing speed or the like. Or you may change with the content of an image.

  When the decoding buffer is used as described above, a newly stored image and a part of the image stored in the decoding buffer may overlap. Utilizing such a property, in the present embodiment, the area to be newly decoded is reduced by the following process, thereby reducing the load of the decoding process.

  FIG. 22 shows a functional block of the decoding unit 112 in the decoding buffer of the buffer memory 70 in a case where an image to be newly stored has an overlapping portion with an image stored so far. The decoding unit 112 includes an overlapping region acquisition unit 170 that identifies an overlapping region, a partial region decoding unit 172 that newly decodes a non-overlapping region and overwrites a part of the image that has been stored so far. A repeat image generation unit 174 that generates an image in which the overwritten images are repeatedly arranged, and a decoded image storage unit 176 that extracts a part of the arranged images and stores them as a final decoded image in a decoding buffer.

  FIG. 23 schematically shows a procedure in which the decoding unit 112 in FIG. 22 stores an image in the decoding buffer. As described above, when the display area exceeds the prefetch boundary in the image stored in the display buffer, a new image needs to be stored in the decoding buffer. The image already stored in the decoding buffer at this time is the image 160 in the upper left of the figure. On the other hand, it is assumed that the image to be newly stored is the image 162 in the upper right of the figure. In other words, the figure shows the situation where the display area has moved to the left, and the "star" figure on the left is expected to be displayed from the original "circle" or "triangle" figure. .

  For the reasons described above, the image 160 and the image 162 have overlapping areas. In the example shown in the drawing, the region from x1 to x2 overlaps with the image 160 in the image 162 composed of regions from x0 to x2 in the horizontal direction (X axis). In such a case, in the stored image 160, the overlapping area from x1 to x2 is used as it is as a part of the image to be newly stored.

  Specifically, the partial region decoding unit 172 decodes only the region from x0 to x1 that does not overlap with the image 160 in the image 162 to be newly stored, and is no longer necessary in the stored image 160. The area from x2 to x3 that is not present is overwritten (S70). However, depending on the arrangement of the compression units, for example, when compression is performed in units of tile images, it may not be possible to decode only the non-overlapping regions from x0 to x1. In this case, after decoding the minimum area that can be decoded including the area, only the area from x0 to x1 is extracted and the area from x2 to x3 is overwritten.

  In order to perform the process of S70, the buffer areas 72 and 74 of the buffer memory 70 are provided with areas for storing the lower left coordinates of the currently stored image. Then, the overlapping area acquisition unit 170 identifies the overlapping area by comparing with the lower left coordinates of the area to be newly stored. If a load of a predetermined value or more is applied to the process of specifying the overlapping area before decoding, only the non-overlapping area may be overwritten after decoding all the images 162 to be newly stored.

  Next, the repeat image generation unit 174 temporarily creates a repeat image 166 obtained by repeating the intermediate image 164 thus formed in the horizontal direction (S72). An image obtained by repeating unit images in the vertical and horizontal directions can be generated by a technique generally used in image processing. When the decoded image storage unit 176 sets the coordinate of the boundary of the intermediate image to 0 in the repeat image 166, the area from − (x1−x0) to x2−x1 is extracted and newly stored in the decoding buffer (S74). ). As a result, the image 162 to be newly stored is stored in the decoding buffer. Although the example in the figure focuses on the movement only in the horizontal direction, if only the area other than the overlapping area is decoded by performing the same process for both the movement in the vertical direction and the movement in both the vertical direction and the horizontal direction, Get better. However, in the case of both vertical and horizontal movements, the repeat image 166 is an image obtained by repeating the intermediate image 164 twice in the vertical and horizontal directions.

  In this way, since the pre-read area can be stored in the decoding image with only the minimum necessary decoding, the latency of the image display by the decoding process can be suppressed. The image stored in the decoding buffer may be the intermediate image 164. In this case, the display image processing unit 114 reads the intermediate image 164 from the decoding buffer in accordance with an instruction input from the user, performs the above-described processing of S72 and S74, and displays the image 162 to be newly stored in the display processing unit 44. Drawing in the frame memory 90.

  The above is the decoding method in the prefetch process for the movement of the display area in the same hierarchy. On the other hand, there is a high possibility that a request for enlargement or reduction without changing the displayed center point is made. If the change is in one of the enlargement direction and the reduction direction, a new image is sequentially stored in the decoding image when the prefetch boundary is exceeded, but the two prefetch boundaries are exceeded. When a request to return to the original scale ratio is made, it is not necessary to store a new image in the decoding image, and the stored image can be used as it is.

  Therefore, the buffer areas 72 and 74 of the buffer memory 70 may be further provided with areas for storing the layer numbers of the currently stored images. When the prefetch boundary set in the depth direction of the hierarchy is exceeded, if the hierarchy to be stored in the decoding buffer is the same as the stored hierarchy, the stored image is left as it is without performing the decoding process. Leave it in a state. As a result, even when the display image is enlarged or reduced, the number of decoding processes can be minimized, and the processing load and latency can be reduced.

  According to the embodiment described above, in the image processing apparatus for displaying at least a part of the compressed image in response to a request from the user, the data is transferred from the hard disk drive storing the compressed data to the main memory. Load part. By decoding and displaying the data loaded in the main memory, when a display image change request is made from the user, the time required to read out the necessary data from the hard disk drive can be saved and the responsiveness can be improved. Further, by adopting an aspect in which only a part of the data is loaded, even an image having a size larger than the capacity of the main memory can be set as a display target, and restrictions on an image that can be handled are reduced.

  Further, the image data is divided into blocks with approximately the same data size and stored in the hard disk drive, and loading to the main memory is performed in units of blocks. As a result, even if the loaded blocks are sequentially stored in a continuous area of the main memory, fragmentation does not occur when a new block is loaded, the main memory can be used effectively, and address management becomes easy. .

  Further, when the image data is divided into blocks, information included in each block is given spatial locality. Specifically, the tile image included in one block is added so that the tile image of the starting point is expanded in the horizontal and vertical directions in the same manner, and the area of one block is immediately before reaching a predetermined data size. By determining, the block is shaped like a square. Alternatively, in a square or strip-shaped section set in advance, a tile image is added in the raster order to obtain a shape close to a rectangle having a predetermined width. In this way, the number of blocks necessary for display can be suppressed, the number of loads can be reduced, and data necessary for decoding can be easily read from the main memory. For the same reason, the blocks may be divided so that the boundary between the blocks becomes a T-junction.

  Also, loading of the block into the main memory is performed as needed at predetermined time intervals, etc. even at timings other than when the display image is changed. At this time, starting from the current display image, a point that is a peripheral region in terms of position and hierarchy is determined according to a predetermined rule, and an unloaded block including the point is loaded as needed. Furthermore, areas that are important in image content and areas that have a display probability that can be predicted for each user based on the display history are higher than a predetermined threshold value are preferentially loaded. This makes it possible to reduce the possibility of a situation in which data must be loaded from the hard disk drive or downloaded over the network immediately after a display image change request from the user, and a large number of blocks need to be loaded at one time. And the occurrence of latency due to the load process can be suppressed.

  Further, at the time of block division, the same area portion of images in different layers is included in one block. At this time, by using the redundancy of these images, the information held by the other image among the information necessary for restoring one image is not held twice in the block. For example, if a difference image between a low resolution image and an enlarged image obtained by enlarging the low resolution image and a high resolution image is included in one block and compressed, the high resolution image can be restored. In this embodiment, as described above, since the data is loaded into the main memory in units of blocks, the redundancy between images can be used in this way. By doing so, the data compression rate is increased and the main memory can be used effectively.

  Further, by preparing two buffers, a display buffer and a decoding buffer, as buffer areas for storing decoded images, an area that can be predicted to be displayed in the future is decoded in advance and stored in the decoding buffer. . In this case, when a new image is to be stored in the decoding buffer, an area overlapping with the previously stored image is used as it is. Specifically, an intermediate image is generated by overwriting a non-overlapping area of a stored image with a new image area, and a decoding process is performed by extracting a necessary portion from a repeat image formed by repeating the intermediate image. A new image can be easily stored at a minimum.

  In addition, by configuring the buffer area as described above, moving the display area within the same hierarchy reduces the processing load, so it is easy to maintain a certain level of responsiveness to the user's display image change request. It is. Therefore, by preferentially loading data of a layer different from that of the display image into the main memory, the overall response is improved in combination with the buffer memory. These forms can be realized without making the configuration of the apparatus complicated or large-scale.

  The present invention has been described based on the embodiments. Those skilled in the art will understand that the above-described embodiment is an exemplification, and that various modifications can be made to combinations of the respective constituent elements and processing processes, and such modifications are also within the scope of the present invention. is there.

It is a figure which shows the use environment of the image processing system concerning embodiment of this invention. It is a figure which shows the external appearance structure of the input device applicable to the image processing system of FIG. It is a figure which shows the hierarchical structure of the image data used in this Embodiment. It is a figure which shows the structure of the image processing apparatus in this Embodiment. 3 schematically shows the flow of image data in the present embodiment. It is a figure which shows the structure of the control part in this Embodiment in detail. It is a figure which shows the structure of the compression data division part in this Embodiment in detail. It is a figure which shows typically the image of each hierarchy in the hierarchy data of this Embodiment. It is a figure which shows typically a mode that the image block production | generation part in this Embodiment puts the hierarchical data of FIG. 8 into an image block. It is a figure which shows the example of the original image for demonstrating the block division | segmentation method in this Embodiment. It is a figure which shows the mode of a division | segmentation when an identification number is provided with respect to the tile image in the raster order in this Embodiment. It is a figure which shows the mode of a division | segmentation at the time of giving an identification number to a tile image in order of "Z form" in this Embodiment. It is a figure which shows the mode of a division | segmentation at the time of giving an identification number to a tile image in order of a square macro tile in this Embodiment. It is a figure which shows the mode of a division | segmentation when an identification number is provided to the tile image in the strip-like macro tile order in this Embodiment. It is a figure which shows typically the relationship between the drawing area of an image block and a display image when the boundary line of an image block is comprised by the grid | lattice form. It is a figure which shows typically the relationship between the drawing area of an image block and a display image when the boundary line of an image block is made into a T-junction shape in this Embodiment. It is a figure for demonstrating the method to compress a high resolution image as a difference image with the enlarged image of a low resolution image in this Embodiment. It is a flowchart which shows the process sequence which determines the image block which should be loaded in this Embodiment, and implements loading. It is a conceptual diagram when determining the required area | region which is the object which determines whether it is stored in main memory in S42 of FIG. It is a figure for demonstrating the prefetch process which a prefetch process part performs in this Embodiment. It is a flowchart which shows the process sequence at the time of a prefetch process part and a decoding part decoding an image in this Embodiment. It is a figure which shows the functional block of a decoding part when the image which should be newly stored in the decoding buffer of the buffer memory of this Embodiment has an overlap part with the image stored so far. It is a figure which shows typically the procedure in which the decoding part of FIG. 22 stores an image in the decoding buffer.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1 Image processing system, 10 Image processing apparatus, 12 Display apparatus, 20 Input apparatus, 30 0th hierarchy, 32 1st hierarchy, 34 2nd hierarchy, 36 3rd hierarchy, 38 tile image, 44 Display processing part, 50 Hard disk drive , 60 main memory, 70 buffer memory, 72 buffer area, 74 buffer area, 90 frame memory, 100 control unit, 102 input information acquisition unit, 104 compressed data division unit, 106 load block determination unit, 108 load unit, 110 prefetch processing , 112 decoding unit, 114 display image processing unit, 120 identification number assigning unit, 122 image block generation unit, 170 overlapping region acquisition unit, 172 partial region decoding unit, 174 repeat image generation unit, 176 decoded image storage unit.

Claims (4)

An image processing apparatus for displaying an area in an image on a display according to a user request,
A decoding unit that reads and decodes compressed image data of a necessary area from a memory based on the request;
A buffer memory for storing an image decoded by the decoding unit;
A display image processing unit that reads at least a part of the image stored in the buffer memory and draws a display area;
With
The decoding unit, when storing a new image in the buffer memory, an overlapping region acquisition unit for specifying an overlapping region between the image stored until then and the new image;
The compressed image data of the area including the partial area excluding the overlapping area in the new image is decoded, and the area other than the overlapping area among the images stored in the buffer memory is newly decoded. A partial area decoding unit for generating an intermediate image overwritten with the partial area;
A repeat image generating unit that generates a repeat image in which the intermediate images generated by the partial region decoding unit are repeatedly arranged;
Decoded image storage that connects the overlapping area and the partial area and stores them in the buffer memory by extracting an area composed of the overlapping area and the partial area from among the repeat images generated by the repeat image generation unit And
An image processing apparatus comprising: The buffer memory is required next to a display buffer area for storing an image for rendering a currently displayed area and an image stored in the display buffer area predicted based on the request. Includes a decoding buffer area for newly decoding and storing images,
The decoded image storage unit connects the overlapped area of the image stored in the decoding buffer area and the newly decoded partial area, and stores them in the decoding buffer area. The image processing apparatus according to claim 1. An image processing method for displaying an area in an image on a display according to a user request,
When newly decoding compressed image data of a necessary area based on the request and storing it in the buffer memory, identifying an overlapping area between the image stored so far and the new image;
Reading and decoding compressed image data of a region including a partial region excluding the overlapping region of the new image from a main memory; and
A step of generating an intermediate image in which an area other than the overlapping area of the image previously stored in the buffer memory is overwritten with the newly decoded partial area;
Generating a repeat image in which the intermediate images are repeatedly arranged;
Extracting the region composed of the overlap region and the partial region from the repeat image, connecting the overlap region and the partial region, and storing them in the buffer memory;
Reading at least a portion of the image stored in the buffer memory and rendering a region to be displayed;
An image processing method comprising: A computer program for realizing a function of causing a computer to display a region in an image on a display according to a user request,
A function to specify an overlapping area between the image stored so far and the new image when newly decoding the compressed image data of the necessary area based on the request and storing it in the buffer memory;
A function of reading and decoding compressed image data of a region including a partial region excluding the overlapping region of the new image from a main memory;
A function for generating an intermediate image in which an area other than the overlapping area of the image stored in the buffer memory is overwritten with the newly decoded partial area;
A function of generating a repeat image in which the intermediate images are repeatedly arranged;
A function of connecting the overlapping area and the partial area by extracting the area composed of the overlapping area and the partial area from the repeat image, and storing it in the buffer memory;
A function of reading at least a part of an image stored in the buffer memory and drawing an area to be displayed;
A computer program that causes a computer to realize