JP2004072555A - Image processor, image processing method, recording medium and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To suppress an image information amount after compressing an image, small and to improve image quality in a particular range of the image. <P>SOLUTION: A position designating part 72 respectively calculates minimum values of an X axis and a Y axis among coordinates of an object desired to be segmented to determine them as (▵x, ▵y) and supplies them as grid moving information 92 to an encoder 71 and a storage part 73. The encoder 71 acquires image information, also acquires the grid moving information 92 from the position designating part 72, encodes the image information on the basis of the image information and the grid moving information 92 and stores encoded image information 91 generated by encoding in the storage part 73. The encoded image information 91 and the grid moving information 92 are stored in the storage part 73, and one piece of the grid moving information 92 is associated with one piece of the encoded image information 91. The present invention is applicable to a personal computer. <P>COPYRIGHT: (C)2004,JPO

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to an image processing apparatus and method, a recording medium, and a program, and more particularly, to an image processing method capable of suppressing the amount of image information after compressing an image and improving the image quality of a specific range of the image. The present invention relates to a processing device and method, a recording medium, and a program.
[0002]
[Prior art]
In recent years, JPEG (Joint Photographic Expert Group) 2000 has been proposed as one of the methods for compressing images. JPEG2000 can divide one image 1 whose vertical size is X and horizontal size is Y as shown in FIG. 1 into a plurality of tiles and compress each tile. Image encoding method. In the case of the example of FIG. 1, the image 1 includes an object 10, an object 11, an object 12, and an object 13.
[0003]
Next, an example of dividing the image 1 of FIG. 1 will be described with reference to FIG. In the example of FIG. 2, the image 1 is vertically divided into six parts and horizontally into six parts, and divided into 36 tiles. A tile means an area divided along a grid. In FIG. 2, the numbers of the vertical columns of the tiles are 1 to 6, the numbers of the horizontal rows are A to F, the tile at the top left is called a tile A1, and the tiles A2, The tiles are referred to as tile A3, tile A4, tile A5, and tile A6. The area below the tile A1 is referred to as a tile B1, a tile C1, a tile D1, a tile E1, and a tile F1 in that order.
[0004]
In this manner, the image can be divided and compressed for each tile.
[0005]
[Problems to be solved by the invention]
However, when an image is created by cutting out only the portion of the object 10 which is an elliptical object from the image 1, the size of the object 10 is small enough to fit in two tiles. In the tile division as shown in FIG. 2, six tile images “B3, B4, B5, C3, C4, and C5” are required, and the amount of image information cannot be reduced efficiently. there were.
[0006]
The present invention has been made in view of such a situation, and it is an object of the present invention to reduce the amount of image information after compressing an image and improve the image quality of a specific range of the image.
[0007]
[Means for Solving the Problems]
An image processing apparatus according to an aspect of the present invention includes an acquiring unit that acquires position information that specifies an image of a specific region in an image of a predetermined frame, and movement information that moves a grid based on the position information acquired by the acquiring unit. Generating means for generating the image, a synthesizing means for dividing an area of the image of the predetermined frame based on the movement information generated by the generating means, and re-synthesizing the image of the predetermined frame. Compression means for dividing into a plurality of tiles and compressing the tiles.
[0008]
The compression means can divide the image of the predetermined frame into tiles of different sizes depending on the area, and compress the tile.
[0009]
The compression means can compress tiles including a specific range of images using a different algorithm from tiles not including a specific range of images.
[0010]
The compression means may compress tiles including a specific range of images at a different resolution than tiles not including the specific range.
[0011]
The image processing method according to the present invention includes: an acquiring step of acquiring position information specifying an image of a specific region in an image of a predetermined frame; and moving a grid based on the position information acquired by the processing of the acquiring step. A generation step of generating movement information; a synthesis step of dividing and re-synthesizing a region of an image of a predetermined frame based on the movement information generated by the processing of the generation step; Compression step of dividing an image of a predetermined frame into a plurality of tiles and compressing the divided tiles.
[0012]
The program recorded on the recording medium of the present invention is based on an acquisition step of acquiring position information specifying an image of a specific area in an image of a predetermined frame, and the position information acquired by the processing of the acquisition step. A generation step of generating movement information for moving a grid, a synthesis step of dividing an image area of a predetermined frame based on the movement information generated by the processing of the generation step, and re-synthesizing the area, and a processing of the synthesis step And a compression step of dividing the image of the predetermined frame recombined by the above into a plurality of tiles and compressing the tiles.
[0013]
The program according to the present invention includes an acquisition step of acquiring position information specifying an image of a specific area in an image of a predetermined frame, and movement information for moving a grid based on the position information acquired by the processing of the acquisition step. A dividing step of dividing a region of the image of the predetermined frame based on the movement information generated by the processing of the generating step, and re-synthesizing the image area; A computer is configured to execute a process including a compression step of dividing an image of the frame into a plurality of tiles and compressing the image.
[0014]
In the image processing apparatus and method, the recording medium, and the program according to the present invention, position information specifying an image of a specific area in an image of a predetermined frame is acquired, and a grid is moved based on the acquired position information. Based on the generated movement information, the region of the image of the predetermined frame is divided and recombined, and the recombined image of the predetermined frame is divided into a plurality of tiles and compressed. You.
[0015]
BEST MODE FOR CARRYING OUT THE INVENTION
FIG. 3 is a block diagram illustrating a configuration example of an image conversion device 50 to which the present invention has been applied. The image conversion device 50 includes an encoder 71, a position designation unit 72, and a storage unit 73.
[0016]
The position designating section 72 is a grid movement information for designating a position with respect to position information (for example, information corresponding to a position input from a mouse or the like by a user) supplied based on a user command. 92 is generated. For example, if an object 10 shown in FIG. 4 described later is specified by a user as an ROI (Region of Interest) (an image to be cut out, that is, a region of interest), the position specifying unit 72 generates ROI movement information for the entire image. I do. A tile is composed of a plurality of grids.
[0017]
Specifically, the position specifying unit 72 sets the upper left vertex of the image 1 of the predetermined frame shown in FIG. 4 (the same image as the image 1 shown in FIG. An axis is set, a y-axis is set in the vertical direction, and the coordinates of all pixels in the image 1 are represented in the form of (x, y). At this time, 0 ≦ x ≦ X and 0 ≦ y ≦ Y. Here, among the coordinates of the ROI (the object 10 in the case of the example of FIG. 4) to be cut out specified by the user, the minimum values for the x-axis and the y-axis are obtained as reference coordinates, and the values are shown in FIG. (Δx, Δy). This (Δx, Δy) becomes grid movement information. The position designation unit 72 supplies the grid movement information 92 ((Δx, Δy)) to the encoder 71. In addition, as shown in FIG. 5, the position specifying unit 72 supplies the grid movement information 92 ((Δx, Δy)) to the storage unit 73 and stores it.
[0018]
In the example of FIG. 5, the file name corresponding to image 1 is test0, and the grid movement information is (Δx, Δy) = (20, 10). Image0 is the name of another file, and its grid movement information is (5, 7). As shown in FIG. 5, the grid movement information 92 corresponds to the encoded image information 91 on a one-to-one basis.
[0019]
The encoder 71 encodes an image obtained by converting the supplied image information (image data) using grid movement information 92 (grid movement information 92 supplied from the position designation unit 72) using the JPEG2000 method, and encodes the image. The image information 91 is supplied to the storage unit 72 and stored therein. The details of the conversion will be described later with reference to FIGS. The image information may be input from a camera or the like, or may be information obtained by reproducing image data stored in a hard disk (not shown) or the like.
[0020]
Returning to FIG. 3, the storage unit 73 stores grid movement information 92 supplied from the position designation unit 72 in addition to the encoded image information 92 supplied from the encoder 71. One piece of encoded image information 91 corresponds to one piece of grid movement information 92.
[0021]
In the example of FIG. 4, the region of interest (ROI) in the image 1 is designated as the object 10, but a predetermined region (specific range) in the image 1 may be designated by a rectangle. Further, for example, when images are continuous (or in the case of a moving image) like a video taken by a video camera, the range may be specified again for each image or each time a scene change occurs. Of course, a specific range common to all the images 1 may be specified.
[0022]
Further, for example, when a video of a caster reading news in a studio is flowing, the background image of the caster hardly changes, and only the image around the caster's face changes with the passage of time. In such a case, it is also possible to automatically select a range in which the value greatly changes as a region of interest (specific range) while obtaining a difference from the previous image. This is based on the assumption that important information is included in a portion where movement is severe, but it is possible to effectively compress an image depending on the type of the image.
[0023]
Next, the processing in the image conversion device 50 will be described with reference to the flowcharts in FIGS. This process is started when the user instructs compression of the image 1 in FIG.
[0024]
In step S1, the position specifying unit 72 obtains position information specifying a ROI based on an instruction from a user.
[0025]
In step S2, the position specifying unit 72 calculates the grid movement information 92 from the position information. For example, when the user specifies the object 10 in FIG. 4 as the ROI, the position specifying unit 72 obtains the reference coordinates of the ROI as the minimum value of the ROI. In the case of the example of FIG. 4, the grid movement information 92 is obtained, for example, as (Δx, Δy) = (20, 10). The grid movement information 92 is supplied to the encoder 71.
[0026]
In step S3, the encoder 71 initializes y = 0.
[0027]
In step S4, the encoder 71 initializes x = 0.
[0028]
In step S5, the encoder 71 determines whether Δx ≦ x and Δy ≦ y. In the case of this example, since y = 0 and x = 0 and (Δx, Δy) = (20, 10) by the processing of steps S3 and S4, neither Δx ≦ x nor Δy ≦ y . Therefore, the determination is NO.
[0029]
If it is determined in step S5 that Δx ≦ x and Δy ≦ y are not satisfied, the process proceeds to step S7, and the encoder 71 determines whether Δx ≦ x. In the case of the present example, x is set to 0 by the processing of step S4, and since (Δx, Δy) = (20, 10), it is determined to be NO.
[0030]
If it is determined in step S7 that Δx ≦ x is not satisfied, the process proceeds to step S9, and the encoder 71 determines whether Δy ≦ y. In the case of the present example, y is set to 0 by the processing in step S3, and since (Δx, Δy) = (20, 10), the determination is NO.
[0031]
If it is determined in step S9 that Δy ≦ y is not satisfied, the process proceeds to step S11, and the encoder 71 sets m = x + X−Δx and n = y + Y−Δy. For example, assuming that X = 50 and Y = 35, in the present example, (x, y) = (0, 0) and (Δx, Δy) = (20, 10). n) = (50-20, 35-10), that is, (m, n) = (30, 25).
[0032]
After step S11, the process proceeds to step S12, where the encoder 71 outputs the pixel at the coordinates (x, y) as the pixel at the coordinates (m, n). In the case of the present example, pixel information of (x, y) = (0, 0) is output as pixel information of coordinates (m, n) = (30, 25).
[0033]
That is, in the process of step S11, if neither Δx ≦ x nor Δy ≦ y (steps S5, S7, and S9 are all NO), the pixel at the coordinates (x, y) is set to the coordinates (x + X− Δx, y + Y−Δy).
[0034]
In step S13, the encoder 71 determines whether x <X. For example, if X = 50, in the present example, since x = 0, it is determined to be YES. If it is determined in step S13 that x <X, the process proceeds to step S14, where x = x + 1 is set. That is, (x, y) = (1, 0), and the process returns to step S5.
[0035]
Again, in step S5, the encoder 71 determines whether Δx ≦ x and Δy ≦ y. In the case of the present example, since (x, y) = (1, 0) and (Δx, Δy) = (20, 10) by the process of step S14, the determination is NO. After that, the same processing is repeated, and by the processing of step S14, x is added one by one (x = x + 1), and the same processing is repeated until x = 21. If x = 21 is set by the processing in step S14, it is determined in step S7 that Δx ≦ x.
[0036]
Thereafter, the process proceeds to step S8, and the encoder 71 sets (m, n) = (x, y + Y−Δy). In the case of the present example, since x = 21 is set (step S14), (x, y) = (21, 0), and (m, n) = (21, 0 + 50-10), that is, (m , N) = (21, 40). After the process of step S9, the process proceeds to step S12, and the pixel at the coordinates (x, y) = (21, 0) is output as the pixel at the coordinates (m, n) = (21, 40).
[0037]
That is, in the process of step S8, if Δx ≦ x and not Δy ≦ y (NO in step S5 and YES in step S7), the pixel at the coordinates (x, y) is set to the coordinates (x, y). y + Y−Δy).
[0038]
After the process in step S12, the process proceeds to step S13, and the encoder 71 again determines whether x <X. In the case of the present example, since x = 21, it is determined as YES, the process proceeds to step S14, and the same process is repeated until x = 50. As a result, the process proceeds from x = 0 to x = 50 at y = 0, and all pixels on the horizontal axis at y = 0 are output.
[0039]
If x = 50 is set in step S14, the same processing as the above-described processing is repeated until step S12, and in step S13, it is determined that x <X is not satisfied (since x = 50 and X = 50 ). If it is determined in step S13 that x <X, the process proceeds to step S15, and the encoder 71 determines whether y <Y. In the case of the present example, since Y = 35 and y = 0, it is determined to be YES. If it is determined in step S15 that y <Y, the process proceeds to step S16, where y = y + 1 is set (1 is added to y). That is, (x, y) = (50, 1), and the process returns to step S4.
[0040]
Thereafter, in step S4, the encoder 71 sets x = 0. Hereinafter, the same process is repeated, and when x = 50 again (y = 1 in this example), y = y + 1 is set in step S15, and y = 2. Hereinafter, the same process is repeated until y = 11 in the process of step S16. When y = 11 is set by the processing in step S16, it is determined in step S9 that Δy ≦ y.
[0041]
If it is determined in step S9 that Δy ≦ y, the process proceeds to step S10, and the encoder 71 sets (m, n) = (x + X−Δx, y). For example, if y = 11 and x = 0, (m, n) = (0 + 50−20, 11), that is, (m, n) = (30, 11). Thereafter, the process proceeds to step S12, and the same process is repeated. When x = 21 (y = 11), the process proceeds to step S5, where it is determined that Δx ≦ x and Δy ≦ y, The process proceeds to step S6.
[0042]
That is, in the process of step S10, when Δy ≦ y instead of Δx ≦ x (NO in steps S5 and S7 and YES in step S9), the pixel at the coordinates (x, y) is determined. It means to move to the coordinates (x + X-Δx, y).
[0043]
In step S6, the encoder 71 sets (m, n) = (x−Δx, y−Δy). In the case of the present example, since (x, y) = (21, 11), (m, n) = (21-20, 11-10), and (m, n) = (1, 1). Become. Thereafter, the process proceeds to step S12, and the pixel at the coordinates (x, y) = (21, 11) is output as the pixel at the coordinates (1, 1).
[0044]
That is, in the process of step S6, when Δx ≦ x and Δy ≦ y (determined as YES in step S5), the pixel of the coordinates (x, y) is set to the coordinates (x−Δx, y). −Δy).
[0045]
Thereafter, the processing is repeated until y = 35 in the processing of step S16. If y = 35 in step S45, the process returns to step 3 to set x = 0, and the same process is repeated again by the process in step S14 until x = 50. When x = 50 and y = 35, it is determined that x <X is not satisfied in step S13, and it is determined that y <Y is not satisfied in step S15.
[0046]
If it is determined in step S15 that y <Y is not satisfied, the process proceeds to step S17, and the encoder 71 encodes the image information including the pixels output in the process of step S12. Specifically, the image shown in FIG. 4 is re-synthesized as the image shown in FIG. 8 by repeatedly performing the processing of steps S5 to S16. That is, based on the grid movement information 92, the position of the grid with respect to the original image is relatively moved, and the moved grid becomes the reference position with respect to the image frame (the position with respect to the image frame is 1, each region of the image is divided and recombined (rearranged). As shown in FIG. 8, the position of the grid with respect to the image frame is not shifted, but since the divided areas of the image are rearranged, the range divided into each tile of the image is the case of FIG. Will be different.
[0047]
The encoder 71 encodes the image 1 shown in FIG. 8 for each tile. Thus, the object 10 is composed of only two tiles, and can be efficiently compressed.
[0048]
As shown in FIG. 8, as a result of moving image 1 of FIG. 4 based on grid movement information 92 ((x, y) = (20, 10)), 0 ≦ x ≦ Δx, A region R1 in a range of 0 ≦ y ≦ Δy, a region R2 in a range of Δx <x ≦ X and a range of 0 ≦ y ≦ Δy, and a region R3 in a range of 0 ≦ x ≦ Δx and Δy ≦ y ≦ Y Alternatively, the region R4 in the range of Δx <x ≦ X and Δy ≦ y ≦ Y is a region in the range of x−Δx <x ≦ X and Y−Δy <y ≦ Y in FIG. A region in the range of x ≦ X−Δx and Y−Δy <y ≦ Y, a region in the range of X−Δx <x ≦ X and 0 ≦ y ≦ Y−Δy, or 0 ≦ x ≦ X− It has been moved to an area in the range of Δx and 0 ≦ y ≦ Y−Δy. Therefore, the object 13 is divided into an object 13K and an object 13J.
[0049]
Returning to FIG. 7, in step S18, the encoder 71 outputs the encoded image 1 to the storage unit 73, and stores the encoded image 1 as encoded image information 91.
[0050]
As described above, the image 1 in FIG. 4 is moved by (Δx, Δy) based on the grid movement information 92 ((Δx, Δy)) by the processing in FIGS. , Split, recombined and encoded. This makes it possible to display the object 10 as an ROI using only two tiles, “tile aI” and “tile aII”. At this time, the grid of (Δx, Δy) moves, and a new tile is generated. In step S18, the encoder 71 encodes data of one image for each of the newly generated tiles (tiles “aI”, “aII”,...).
[0051]
The image encoded by the processing of FIGS. 6 and 7 requires the grid movement information 92 to return to the original image after decoding. Therefore, as shown in FIG. 9, when transmitting the encoded image information 91 to the image display device 150, the grid movement information 92 is transmitted at the same time. Thus, the image display device 150 can correctly decode the image information by using the received grid movement information 92.
[0052]
In the example of FIG. 9, the image conversion device 50 and the image display device 150 are connected via the network 130. The storage unit 73 of the image conversion device 50 stores the encoded image information 91 by the processing of FIGS. 6 and 7, and further stores the grid movement information 92 supplied from the position specification unit 72. . In addition, the image conversion device 50 includes a communication unit 101 that performs communication via the network 130.
[0053]
The communication unit 101 transmits the encoded image information 91 and the corresponding grid movement information 92 to the communication unit 161 of the image display device 150 via the network 130 based on a command from the user.
[0054]
The image display device 150 includes a communication unit 161, a decoder 162, and an output unit 163. The communication unit 161 communicates via the network 130, receives the encoded image information 91 transmitted from the image conversion device 50 and the corresponding grid movement information 92, and supplies the grid movement information 92 to the decoder 162. The decoder 162 acquires and decodes the encoded image information 91 supplied from the communication unit 161 and the corresponding grid movement information 92, and supplies the decoded image information 91 to the output unit 163 as image information. As a result, the image information can be correctly decoded and displayed.
[0055]
When the image display device 150 does not support such an encoding method (the encoding process in FIGS. 6 and 7), by providing the decoder 181 in the image conversion device 50 as shown in FIG. After decoding by the decoder 181 (after the decoder 181 decodes based on the encoded image information 91 and the grid movement information 92), it can be transmitted as image information via the communication unit 101.
[0056]
At this time, as shown in FIG. 11, after being decoded by the decoder 181, the data is again encoded by the encoder 221 in another format that does not require the grid movement information 92, and is encoded by the encoder 221 by the communication unit 101. The image information can be transmitted via the network 130. In the example of FIG. 11, the encoder 221 and the decoder 251 are ordinary encoders and decoders (not using the above-described method). Thus, even when the image display device 150 does not support the image conversion method performed by the image conversion device 50, the image conversion device 50 can change the format to change the format.
[0057]
With the above processing, when cutting out a specific range (ROI) of an image, the moving position of the grid is adjusted according to the shape and size of the specific range, and the minimum tile is cut out and compressed. Therefore, it is possible to efficiently reduce the amount of image information.
[0058]
In addition, there is no need to change the compression algorithm or the like of the encoder 71, so that it can be easily executed.
[0059]
Further, it is possible to suppress the amount of image information after compressing the image and to improve the image quality of a specific range of the image.
[0060]
In the above example, the size of the tile is fixed. However, instead of adjusting the moving position of the grid in accordance with the shape and size of the ROI, the shape and size of the tile may be changed. It is possible. For example, when the object 10 is an ROI (region of interest), as shown in FIG. 12, when the size (grid width) of the tile is doubled in the x direction and halved in the y direction, the area of the tile becomes Is the same as before, but the object 10 straddling two tiles fits into one tile. Thus, since the object 10 is composed of only one tile, when the object 10 is cut out, only the image information amount of one tile is obtained, and the image data can be efficiently compressed. The amount can be reduced.
[0061]
Although the encoded image information 91 and the grid movement information 92 are separately stored in the storage unit 73, for example, a data area for one word is added to the end of the encoded image information 91, and the grid movement information 92 is stored therein. You may save it.
[0062]
In the above example, among the coordinates in the ellipse of the object 10, the position specifying unit 72 obtains the minimum value for each of the x-axis and the y-axis as reference coordinates, and moves the coordinates (Δx, Δy) to the grid. Although set as the information 92, among the coordinates in the ellipse of the object 10, the maximum values with respect to the x-axis and the y-axis may be obtained as the reference coordinates.
[0063]
When the minimum value is obtained as the reference coordinate and the coordinate (Δx, Δy) is set as the grid movement information 92, the grid touches the upper left of the ellipse (object 10) as shown in FIG. When the maximum value is obtained as the reference coordinate and the coordinate is set to (Δx, Δy) as the grid movement information 92, the grid touches the lower right of the ellipse.
[0064]
Also, for example, when (x, Δy) is set with the x-axis at the maximum value and the y-axis at the minimum value, the grid touches the upper right of the ellipse (object 10), the x-axis becomes the minimum value, and the y-axis becomes the maximum. If (Δx, Δy) is set as a value, the grid will be in contact with the lower left of the ellipse (object 10). Furthermore, the center of gravity of the ellipse (object 10) and the center of gravity of the tile can be matched, and (Δx, Δy) can be set to any value within the range where the ellipse is included in the tile.
[0065]
In the above example, the encoded image information 91 output by the encoder 71 and the grid movement information 92 output by the position specifying unit 71 are stored in the storage unit 73, but need not necessarily be stored. , Or directly to the network.
[0066]
Also, in the above example, a model in which divided tiles are encoded with the same algorithm and the same resolution has been described. However, a different encoding algorithm is applied to a specific area or compression is performed at a high resolution. You can also do so. For example, in step S17 in FIG. 7, the encoder 71 compresses the “tile aI” and the “tile aII” including the object 10 as the ROI at a high resolution, and compresses the other tiles at a low resolution. As a result, it is possible to prevent the file size from becoming unnecessarily large, and thus to efficiently perform compression.
[0067]
The series of processes described above can be executed by hardware, but can also be executed by software. When a series of processing is executed by software, a program constituting the software executes various functions by installing a computer built in dedicated hardware or installing various programs. For example, it is installed from a recording medium such as a general-purpose personal computer. In this case, for example, the image conversion device 50 is configured by a personal computer 300 as shown in FIG.
[0068]
13, a CPU (Central Processing Unit) 301 performs various processes in accordance with a program stored in a ROM (Read Only Memory) 302 or a program loaded from a storage unit 308 into a RAM (Random Access Memory) 303. Execute. The RAM 303 also appropriately stores data necessary for the CPU 301 to execute various processes.
[0069]
The CPU 301, the ROM 302, and the RAM 303 are interconnected via an internal bus 304. An input / output interface 305 is also connected to the internal bus 304.
[0070]
The input / output interface 305 includes an input unit 306 including a keyboard and a mouse, a display including a CRT (Cathode Ray Tube), an LCD (Liquid Crystal Display), an output unit 307 including a speaker, a hard disk, and the like. A communication unit 309 including a storage unit 308, a modem, a terminal adapter, and the like is connected. The communication unit 309 performs communication processing via various networks including a satellite line and a CATV.
[0071]
A drive 310 is connected to the input / output interface 305 as necessary, and a magnetic disk 321, an optical disk 322, a magneto-optical disk 323, a semiconductor memory 324, or the like is appropriately mounted, and a computer program read therefrom is required. Is installed in the storage unit 308 in accordance with.
[0072]
When a series of processing is executed by software, a program constituting the software is used to execute various functions by installing a computer incorporated in dedicated hardware or installing various programs. For example, it is installed in a general-purpose personal computer that can be executed from a network or a recording medium.
[0073]
As shown in FIG. 13, this recording medium is a magnetic disk 321 (including a floppy disk) on which the program is recorded and an optical disk 322 (CD) which are distributed separately from a computer to provide the user with the program. -Not only a package medium including a ROM (Compact Disc-Read Only Memory), a DVD (including a Digital Versatile Disc), a magneto-optical disk 323 (including an MD (Mini Disc)), a semiconductor memory 324, but also And a hard disk including a ROM 302 and a storage unit 308 in which a program is recorded, which is provided to a user in a state of being incorporated in the apparatus main body in advance.
[0074]
In this specification, a step of describing a computer program refers to not only a process performed in chronological order according to the described order, but also a process executed in parallel or individually even if not necessarily performed in chronological order. Is also included.
[0075]
【The invention's effect】
As described above, according to the present invention, it is possible to reduce the amount of image information after compressing an image, and to enhance the image quality of a specific range of the image.
[Brief description of the drawings]
FIG. 1 is a diagram illustrating an example of a conventional image.
FIG. 2 is a diagram illustrating an example when the image in FIG. 1 is divided into tiles.
FIG. 3 is a block diagram illustrating a configuration example of an image conversion device according to the present invention.
FIG. 4 is a diagram illustrating an example of grid movement of an image.
5 is a diagram illustrating an example of grid movement information stored in a storage unit of the image conversion device in FIG.
FIG. 6 is a flowchart illustrating processing in an encoder of the image conversion device in FIG. 3;
FIG. 7 is a flowchart illustrating a process in an encoder of the image conversion device in FIG. 3;
8 is a diagram illustrating an image recombined by the processes in FIGS. 6 and 7. FIG.
FIG. 9 is a diagram illustrating an example of transmitting information from the image conversion device of FIG. 3 to an image display device.
FIG. 10 is a diagram illustrating an example of transmitting information from the image conversion device of FIG. 3 to an image display device.
11 is a diagram illustrating an example of transmitting information from the image conversion device in FIG. 3 to an image display device.
12 is a diagram illustrating an example in which tiles of the image in FIG. 4 are changed.
FIG. 13 is a block diagram illustrating a personal computer.
[Explanation of symbols]
1 image, 10, 11, 12, 13 objects, 50 image conversion device, 71 encoder, 72 position designation unit, 73 storage unit, 91 encoded image information, 92 grid movement information

Claims (7)

In an image processing apparatus that divides an image of a predetermined frame into a plurality of tiles along a grid and compresses the tile,
Acquisition means for acquiring position information specifying an image of a specific region in the image of the predetermined frame,
Generating means for generating movement information for moving the grid, based on the position information obtained by the obtaining means,
A synthesizing unit that divides an area of the image of the predetermined frame based on the movement information generated by the generating unit, and re-synthesizes;
An image processing apparatus comprising: a compression unit that divides an image of the predetermined frame recombined by the combination unit into a plurality of tiles and compresses the tiles. The image processing apparatus according to claim 1, wherein the compression unit divides the image of the predetermined frame into tiles having different sizes depending on the area, and compresses the tile. The method according to claim 1, wherein the compression unit compresses the tile including the image in the specific range using a different algorithm from the tile including no image in the specific range. Image processing device. 2. The image processing apparatus according to claim 1, wherein the compression unit compresses the tile including the image in the specific range at a resolution different from that of the tile not including the specific range. apparatus. In an image processing method of an image processing apparatus, an image of a predetermined frame is divided into a plurality of tiles along a grid and compressed.
Acquisition step of acquiring position information specifying an image of a specific region in the image of the predetermined frame,
A generation step of generating movement information for moving the grid, based on the position information obtained by the processing of the obtaining step,
A combining step of dividing an area of the image of the predetermined frame based on the movement information generated by the processing of the generating step and re-synthesizing;
A compression step of dividing the image of the predetermined frame recombined in the combining step into a plurality of tiles and compressing the divided tiles. A program for controlling an image processing apparatus that divides an image of a predetermined frame into a plurality of tiles along a grid and compresses the tiles,
Acquisition step of acquiring position information specifying an image of a specific region in the image of the predetermined frame,
A generation step of generating movement information for moving the grid, based on the position information obtained by the processing of the obtaining step,
A combining step of dividing an area of the image of the predetermined frame based on the movement information generated by the processing of the generating step and re-synthesizing;
A compression step of dividing the image of the predetermined frame re-synthesized by the processing of the synthesizing step into a plurality of tiles and compressing the divided tiles, wherein the computer-readable program is recorded. A computer that controls an image processing apparatus that divides an image of a predetermined frame into a plurality of tiles along a grid and compresses the tiles,
Acquisition step of acquiring position information specifying an image of a specific region in the image of the predetermined frame,
A generation step of generating movement information for moving the grid, based on the position information obtained by the processing of the obtaining step,
A combining step of dividing an area of the image of the predetermined frame based on the movement information generated by the processing of the generating step and re-synthesizing;
A program that divides the image of the predetermined frame recombined in the combining step into a plurality of tiles and compresses the tiles.

Images