JP2004166096A - Image transmitter, image receiver, network system, program, storage medium, image transmission method and image reception method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To prevent such a critical malfunction that an image can not be reproduced at all and to prevent a processing burden from being too large even though a burst mode occurs in which a communication error temporally continues when image data are communicated. <P>SOLUTION: A code sequence converting part 21 converts a code sequence obtained by compressively encoding image data by a JPEG 2000 or Motion JPEG 2000 system into a new code sequence by rearranging a code arrangement in a prescribed range of the code sequence, for example, within a range about an ROI (region of interest) area and by not performing the rearrangement outside the range. The converted code sequence is transmitted through a network. <P>COPYRIGHT: (C)2004,JPO

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to an image transmission device, an image reception device, a network system, a program, a storage medium, an image transmission method, and an image reception method.
[0002]
[Prior art]
Patent Literature 1 discloses a technique of retransmitting, when receiving moving image data, if the priority of a missing data frame is higher than a threshold in communication of moving image data.
[0003]
[Patent Document 1] Japanese Patent Application Laid-Open No. 2001-274861 [Problems to be Solved by the Invention]
During communication of image data, a burst mode in which a communication error occurs continuously in time may occur. When such a burst mode occurs and the image data is not transmitted, especially when a communication error is an important part of the image data, the image cannot be used at all. When such a communication error occurs, the only option is to request data retransmission.
[0004]
In order to cope with such a burst mode, it is conceivable to rearrange the danger by rearranging the order of the image data.
[0005]
However, recombining the entire image data has a disadvantage that the load of the recombining process is large, and the load of the process of returning to the original data after transmission is too large.
[0006]
SUMMARY OF THE INVENTION An object of the present invention is to prevent a catastrophic failure such that an image cannot be reproduced at all even when a burst mode in which a communication error occurs continuously in time while communicating image data is performed, and furthermore, processing is performed. Is not to be overly burdensome.
[0007]
[Means for Solving the Problems]
The invention according to claim 1 is a communication interface connected to a network and a code string obtained by compression-encoding image data, and a predetermined range is different from the compression-coding standard within the range. A storage device that is arranged in a sequence of codes, and stores a sequence other than the range, arranged in the sequence of the standard, and a transmission unit that transmits the code sequence via the network by the communication interface. And an image transmitting apparatus.
[0008]
Therefore, even when a burst mode in which a communication error occurs consecutively in time during communication of image data occurs and continuous image data is not transmitted, a predetermined range of the code of the original image is obtained. Since the important part of is transmitted in a distributed manner, it is possible to use a partial code that is received without causing a communication error, and it is possible to prevent a fatal problem that an image cannot be reproduced at all. . Moreover, since the code rearrangement is performed only in a predetermined range of the code string, the load of the code rearrangement processing does not become excessive.
[0009]
According to a second aspect of the present invention, there is provided a communication interface connected to a network, a storage device for storing a code sequence obtained by compressing and encoding image data, and an arrangement of codes within a predetermined range of the storage device. And a code string conversion means for converting the code string into a new code string by not performing the rearrangement except for the range, and transmitting the code string via the network by the communication interface. An image transmitting apparatus comprising: a transmitting unit.
[0010]
Therefore, even when a burst mode in which a communication error occurs consecutively in time during communication of image data occurs and continuous image data is not transmitted, a predetermined range of the code of the original image is obtained. Since the important part of is transmitted in a distributed manner, it is possible to use a partial code that is received without causing a communication error, and it is possible to prevent a fatal problem that an image cannot be reproduced at all. . Moreover, since the code rearrangement is performed only in a predetermined range of the code string, the load of the code rearrangement processing does not become excessive.
[0011]
According to a third aspect of the present invention, in the image transmission device according to the first or second aspect, the compression encoding method is JPEG2000 or Motion JPEG2000.
[0012]
Therefore, it is possible to rearrange codes that are compression-encoded by JPEG2000 or Motion JPEG2000, thereby preventing a fatal problem that an image cannot be reproduced at all without increasing the load of the code rearrangement process.
[0013]
According to a fourth aspect of the present invention, in the image transmission device according to the third aspect, the predetermined range is a region of interest (ROI) region.
[0014]
Therefore, the ROI area, which is an important area of the image, is transmitted in a distributed manner, and a fatal problem that the image cannot be reproduced at all can be prevented without increasing the load of the code rearrangement process.
[0015]
According to a fifth aspect of the present invention, in the image transmitting apparatus according to the third aspect, when the code string is progressively reproduced on the transmitting side, the predetermined range is selected according to a progressive order.
[0016]
Therefore, the important area of the code string according to the progressive order is transmitted in a distributed manner, and a fatal problem that an image cannot be reproduced at all can be prevented without excessively burdening the code rearrangement processing. it can.
[0017]
The invention according to claim 6 is the image transmission device according to claim 5, wherein the predetermined range is a certain range at the head of the code string when the progressive order is image progressive or resolution progressive. is there.
[0018]
Therefore, when the progressive order is image progressive or resolution progressive, a certain range at the head of the code string, which is an important area of the code string, is distributed and transmitted, and the load of code rearrangement processing becomes excessive. Thus, it is possible to prevent a catastrophic failure such that an image cannot be reproduced at all.
[0019]
The invention according to claim 7 is the image transmission device according to claim 5, wherein the predetermined range is a range of luminance data when the progressive order is a component progressive.
[0020]
Therefore, when the progressive order is the component progressive, the range of the luminance data, which is an important area of the code string, is transmitted in a distributed manner, so that the load of the code rearrangement processing is not excessive, and the image cannot be reproduced at all. Fatal inconvenience can be prevented.
[0021]
According to an eighth aspect of the present invention, there is provided a receiving means for receiving a code sequence obtained by compressing and encoding image data, and the received code sequence is different from the standard of the compression encoding within a predetermined range within the predetermined range. And a conversion means for rearranging the codes and converting the codes to the original code sequence when the codes are rearranged in an array of codes, and the ranges other than the range are arranged in an array of the standard. Device.
[0022]
Therefore, it is possible to reproduce the image by rearranging the received code string into the original code string.
[0023]
According to a ninth aspect of the present invention, there is provided the image transmitting apparatus according to any one of the first to seventh aspects, wherein the image transmitting apparatus is connected to the image transmitting apparatus via a network and receives a code string transmitted by the image transmitting apparatus. A network system comprising: the image receiving device according to claim 8.
[0024]
Therefore, the same operation and effect as the invention described in any one of claims 1 to 7 and the invention described in claim 8 can be obtained.
[0025]
According to a tenth aspect of the present invention, there is provided a computer-readable program that causes a computer to execute each of the means according to the first aspect of the present invention.
[0026]
Therefore, by operating on a computer, the same operation and effect as the invention according to any one of claims 1 to 8 can be obtained.
[0027]
The invention according to claim 11 is a storage medium storing the program according to claim 10.
[0028]
Therefore, the same operation and effect as those of the tenth aspect can be obtained by the stored program.
[0029]
The invention according to claim 12 is a code string obtained by compression-encoding image data, and a predetermined range is rearranged within the range into an array of codes different from the compression encoding standard, An image transmission method for transmitting an arrangement other than the range arranged in the standard array in a storage device via a communication interface connected to the network through the network.
[0030]
Therefore, even when a burst mode in which a communication error occurs consecutively in time during communication of image data occurs and continuous image data is not transmitted, a predetermined range of the code of the original image is obtained. Since the important part of is transmitted in a distributed manner, it is possible to use a partial code that is received without causing a communication error, and it is possible to prevent a fatal problem that an image cannot be reproduced at all. . Moreover, since the code rearrangement is performed only in a predetermined range of the code string, the load of the code rearrangement processing does not become excessive.
[0031]
According to a thirteenth aspect of the present invention, a receiving step of receiving a code sequence obtained by compressing and encoding image data, and the received code sequence is different from the standard of the compression encoding within a predetermined range within the predetermined range. And a conversion step of rearranging the codes and converting the codes into the original code sequence when the codes are rearranged in an array of codes and other than the range are arranged in an array of the standard. Is the way.
[0032]
Therefore, it is possible to reproduce the image by rearranging the received code string into the original code string.
[0033]
BEST MODE FOR CARRYING OUT THE INVENTION
[Overview of JPEG2000 algorithm]
First, an outline of a JPEG2000 algorithm which is a prerequisite technique in an embodiment of the present invention will be described.
[0034]
FIG. 1 is an explanatory diagram for explaining the basics of the JPEG2000 algorithm. The JPEG2000 algorithm includes a color space conversion / inverse conversion unit 111, a two-dimensional wavelet conversion / inverse conversion unit 112, a quantization / inverse quantization unit 113, an entropy encoding / decoding unit 114, and a tag processing unit 115. I have.
[0035]
As shown in FIG. 2, in the color image, generally, each component (here, RGB primary color system) of the original image is divided by rectangular regions (tiles) 121, 122, and 123. Each of the tiles, for example, R00, R01, ..., R15 / G00, G01, ..., G15 / B00, B01, ..., B15 is a basic unit when executing the compression / decompression process. Therefore, the compression / expansion operation is performed independently for each component and for each tile.
[0036]
When encoding the image data, the data of each tile of each component is input to the color space conversion / inverse conversion unit 111 of FIG. 1 and subjected to color space conversion. A two-dimensional wavelet transform (forward transform) is applied to perform spatial division into frequency bands.
[0037]
FIG. 3 shows subbands at each decomposition level when the number of decomposition levels is three. That is, a two-dimensional wavelet transform is performed on the tile original image (0LL) (decomposition level 0 (131)) obtained by the tile division of the original image, and the sub-level shown in the decomposition level 1 (132) Separate the bands (1LL, 1HL, 1LH, 1HH). Subsequently, two-dimensional wavelet transform is performed on the low-frequency component 1LL in this layer to separate the sub-bands (2LL, 2HL, 2LH, 2HH) indicated by the decomposition level 2 (133). Similarly, two-dimensional wavelet transform is similarly performed on the low-frequency component 2LL to separate the sub-bands (3LL, 3HL, 3LH, 3HH) indicated by the decomposition level 3 (134). Further, in FIG. 3, the sub-bands to be encoded at each decomposition level are indicated by oblique lines. For example, when the number of decomposition levels is 3, the sub-bands (3HL, 3LH, 3HH, 2HL, 2LH, 2HH, 1HL, 1LH, 1HH) indicated by oblique lines are to be encoded, and the 3LL sub-band is Not encoded.
[0038]
Next, bits to be encoded are determined in the specified encoding order, and the quantization / inverse quantization unit 113 in FIG. 1 generates a context from bits around the target bit. The wavelet coefficients after the quantization process are divided into non-overlapping rectangles called “precincts” for each subband. This was introduced to make efficient use of memory in the implementation. As shown in FIG. 5, one precinct is formed of three spatially coincident rectangular areas. Further, each precinct is divided into non-overlapping rectangular "code blocks". This is a basic unit when performing entropy coding.
[0039]
The coefficient value after wavelet transform can be quantized and encoded as it is. However, in JPEG2000, in order to increase the encoding efficiency, the coefficient value is decomposed into “bit plane” units, and each pixel or code block is decomposed. "Bit planes" can be ranked. FIG. 6 briefly shows the procedure. In this example, the original image (32 × 32 pixels) is divided by four tiles of 16 × 16 pixels, and the size of the precinct and the code block at the decomposition level 1 are 8 × 8 pixels and 4 pixels, respectively. × 4 pixels. Precincts and code blocks are numbered in raster order. The pixel expansion outside the tile boundary is performed using a mirroring method, and a wavelet transform is performed by a reversible (5 × 3) filter to obtain a wavelet coefficient value of decomposition level 1. In addition, a conceptual diagram of a representative “layer” for tile 0 / precinct 3 / code block 3 is also shown. The layer structure is easy to understand when the wavelet coefficient values are viewed from the horizontal direction (bit plane direction). One layer is composed of an arbitrary number of bit planes. In this example, layers 0, 1, 2, and 3 are each composed of three bit planes of 1, 3, and 1. Then, a layer including a bit plane closer to the LSB is subject to quantization first, and conversely, a layer closer to the MSB remains without being quantized to the end. A method of discarding from a layer close to the LSB is called truncation, and it is possible to finely control the quantization rate.
[0040]
The entropy encoding / decoding unit 114 (see FIG. 1) encodes each component tile by probability estimation from the context and the target bit. In this way, the encoding process is performed for all the components of the original image in tile units. Finally, the tag processing unit 115 combines all encoded data from the entropy coder unit into one code stream, and performs a process of adding a tag to the code stream. FIG. 4 briefly shows the structure of the code stream. As shown in FIG. 4, tag information called a header is added to the head of the code stream and the head of the partial tiles constituting each tile, followed by the encoded data of each tile. Then, the tag is placed again at the end of the code stream.
[0041]
On the other hand, at the time of decoding, image data is generated from the code stream of each tile of each component, contrary to the encoding. This will be briefly described with reference to FIG. In this case, the tag processing unit 115 interprets the tag information added to the code stream input from the outside, decomposes the code stream into a code stream of each tile of each component, and Decoding processing is performed for each code stream. The position of the bit to be decoded is determined in the order based on the tag information in the code stream, and the quantization / dequantization unit 113 sets the peripheral bits of the target bit position (decoding has already been completed). ) Generates a context. The entropy coding / decoding unit 114 performs decoding by probability estimation from the context and the code stream, generates a target bit, and writes it to the position of the target bit. Since the data decoded in this way is spatially divided for each frequency band, the two-dimensional wavelet transform / inverse transform unit 112 performs an inverse two-dimensional wavelet transform on each of the components, thereby obtaining each component of the image data. The tile is restored. The restored data is converted by the color space conversion / inverse conversion unit 111 into the original color system data.
[0042]
[Embodiment of the invention]
An embodiment of the present invention will be described.
[0043]
FIG. 7 is a block diagram illustrating the network system 10 according to the first embodiment. As shown in FIG. 7, the network system 10 includes a server 1 that transmits a code string obtained by compressing and encoding moving image data using an algorithm such as Motion JPEG2000 via a network 3 such as the Internet, and a code from the server 1. It consists of a client 2 receiving the queue.
[0044]
FIG. 8 is a block diagram showing an electrical connection between the server 1 and the client 2. As shown in FIG. 8, the server 1 and the client 2 implement the image transmitting apparatus and the image receiving apparatus of the present invention, respectively, and perform various operations to centrally control each unit of the server 1 (or the client 2). A CPU 11 and a memory 12 including various ROMs and RAMs are connected by a bus 13.
[0045]
The bus 13 is provided with a magnetic storage device 14 such as a hard disk serving as a storage device, an input device 15 including a mouse and a keyboard, a display device 16 such as an LCD and a CRT, an optical disk A storage medium reading device 18 that reads a storage medium 17 that implements the storage medium of the present invention, and a predetermined communication interface 19 that is a communication device that communicates with the network 3 are connected. As the storage medium 17, various types of media such as optical disks such as CDs and DVDs, magneto-optical disks, and flexible disks can be used. Further, as the storage medium reading device 18, specifically, an optical disk drive, a magneto-optical disk drive, a flexible disk drive, or the like is used according to the type of the storage medium 17.
[0046]
The magnetic storage device 14 stores an image transmission program (or an image reception program) for executing the program of the present invention. Generally, the image transmission program (or the image reception program) is installed on the server 1 (or the client 2) by reading from the storage medium 17 storing the program by the storage medium reading device 18, 3 and installed in the magnetic storage device 14, for example, by downloading it from With this installation, the server 1 and the client 2 become operable. The image transmission program and the image reception program may be a part of specific application software. Further, it may operate on a predetermined OS.
[0047]
Next, processing performed by the server 1 based on the image transmission program will be described. FIG. 9 is a flowchart of such processing. As shown in FIG. 9, when the server 1 receives an image transmission request from the client 2 by the image transmission program (Y in step S1), the server 1 converts the code string stored in the magnetic storage device 14 into a file to be described later. The code sequence is converted into another code sequence rearranged as described above (code sequence conversion unit) (step S2), and the rearranged code sequence is transmitted to the client 2 (transmission unit) (step S3). Alternatively, the process of step S2 may be omitted, and the pre-arranged code string may be transmitted to the client 2 as it is.
[0048]
The code string stored in the magnetic storage device 14 is a code string obtained by compression-coding image data of a moving image or a still image in accordance with, for example, the JPEG2000 algorithm or the Motion JPEG2000 algorithm (hereinafter, such a compression method is used). It is explained on the assumption of).
[0049]
FIG. 10 is a functional block diagram relating to the rearrangement of the code string in step S2. That is, the server 1 realizes the code string conversion unit 21 by the processing of the CPU 11 based on the image transmission program or the processing executed by a predetermined code string conversion circuit. The code string conversion unit 21 includes an image reading unit 22, a header / code data division processing unit 23, a header processing unit 24, a code data synthesis unit 25, and a rearrangement designation unit 26.
[0050]
First, the image reading unit 22 reads the code string a stored in the magnetic storage device 14. The rearrangement specifying unit 26 specifies which part of the code string a is to be rearranged, and specifies how to rearrange. That is, in this designation, codes within a predetermined range of the code string a are to be rearranged, and the codes are rearranged within the range by a predetermined procedure (the details thereof will be described later). The code string a read by the image reading unit 22 is divided into a header part and a code part by a header / code data division processing unit 23. Then, the header processing unit 24 generates header information such as a new tile part header so that the above-described rearrangement is performed. Then, the code data synthesizing unit 25 rearranges the code part, synthesizes the code part with the newly generated header information, and generates and outputs a new code string b after the code rearrangement. This code string b is transmitted to the client 2 in step S3. In the header information of the code string b, information on which range of the code string a is rearranged and how can be recorded.
[0051]
The rearrangement of the code string a performed by the code string conversion unit 21 is to determine a predetermined range of data of the code string a from the header information of the code string a and rearrange the codes within the range.
[0052]
The predetermined range in this case is an important part in the code string a. Specifically, first, a tile corresponding to a ROI (Region Of Interest) region at the center of the normal image is considered (the range is clear from the header information).
[0053]
When the code string b is progressively reproduced on the client 2 side, a predetermined range can be selected according to the progressive order. Specifically, when the progressive order is an image or a resolution progressive, since important data is included at the head of the code string a, the predetermined range at the head of the code string a can be set. Further, when the progressive order is component progressive, since the luminance data is important, only the range of the luminance data can be set to a predetermined range (these ranges are also apparent from the header information).
[0054]
Next, a specific example of how to rearrange codes within the above-described predetermined range will be described. FIG. 11 is an explanatory diagram conceptually showing an arrangement of codes within a predetermined range of the code string b. In FIG. 11, “O” indicated by reference numeral 31 is a single reference. The order in which the codes are arranged in the code string b is from left to right as indicated by the arrow in FIG. In addition, in the example of FIG. 11, four code strings 32 to 35 are shown, but the upper code string is located at the top. When the code string b is directly transmitted without rearrangement as in the present embodiment, the transmission is performed in the order of the codes. That is, each code 31 is sequentially selected and transmitted rightward from the code string in the top row 32.
[0055]
On the other hand, in the present embodiment, for example, the leading code 31 of the top column 32 is selected, the second code 31 of the second column 33 is selected, and then the third code 34 of the third column 34 is selected. A third code 31 is selected, and codes are sequentially selected, such as... (Arrow 41). When the processing is performed up to the last column 35 of the code data group, the process returns to the first column 32, and the fourth code 31 from the beginning is selected. Next, the fifth code 31 in the second column 33 is selected, then the sixth code 31 in the third column 34 is selected, and so on (arrow 42).
[0056]
As described above, when the codes 31 in the columns 32 to 35 are selected by skipping the two codes 31, the second code 31 in the uppermost column 32 is selected, and then the third code 31 in the second column 33 is selected. The third code 31 is selected, then the third code 31 in the fourth column 34 is selected, and so on. Next, the third code 31 in the top column 32 is selected, the fourth code 31 in the second column 33 is selected, and then the third code 31 in the fifth column 34 is selected. .. Are sequentially selected. By executing such processing, the codes 31 within a predetermined range can be rearranged according to a certain rule. Of course, this rearrangement procedure is an example, and the code 31 can be rearranged and changed in various other procedures. As a result of this rearrangement, the code string b has, in a predetermined range, codes arranged in an arrangement different from the original JPEG2000 and Motion JPEG2000 standards, and other than the predetermined range, the original JPEG2000 or The codes are arranged in an arrangement according to the Motion JPEG2000 standard. Therefore, in the code string b, the image data cannot be expanded unless the codes within the predetermined range are returned to the original order.
[0057]
FIG. 12 is a flowchart of a process performed by the client 2 that receives the code string b. As shown in FIG. 12, when the client 2 receives the code string b in which the codes are rearranged within the predetermined range (receiving means, receiving step) (Y in step S11), the client 2 receives the code string b within the predetermined range. For the codes, a process of restoring the arrangement of the codes is performed (conversion means, conversion step) (step S12). Then, the code string (code string a) in which the arrangement of the codes is restored is stored in the magnetic storage device 14 (step S13). Therefore, when it is desired to use the image of the code string a, the image may be called from the magnetic storage device 14 and expanded.
[0058]
For the processing in step S12, the same code string conversion unit 21 (see FIG. 10) as used in the server 1 can be used. That is, the image reading unit 22 reads the code string b stored in the magnetic storage device 14. The rearrangement specifying unit 26 specifies which part of the code string b is rearranged and how the rearrangement is performed. That is, the predetermined range in which the codes are rearranged in the code string b may be read from the header information, or when the predetermined range is uniquely determined between the client 2 and the server 1, regardless of the header information. The predetermined range can be determined. How the codes are rearranged and restored in the predetermined range may be read from the header information on the rearrangement procedure performed in the server 1, or the predetermined range may be uniquely defined between the client 2 and the server 1. When it is determined (for example, when it is uniquely determined that rearrangement is performed by the algorithm described with reference to FIG. 11), the determination can be made without using the header information.
[0059]
The code string b read by the image reading unit 22 is divided into a header part and a code part by a header / code data division processing unit 23. Then, the header processing unit 24 generates header information such as a new tile part header so that the above-described rearrangement is performed. Then, the code data synthesizing unit 25 rearranges the code part, synthesizes it with the newly generated header information, and generates and outputs a new code sequence after code rearrangement, that is, the original code sequence a. I do.
[0060]
【The invention's effect】
The invention according to claims 1, 2 and 12 is a case where a burst mode in which a communication error occurs continuously in time during communication of image data occurs and continuous image data is not transmitted. Also, since an important part of a predetermined range of the code of the original image is distributed and transmitted, it is possible to use the partial code received without causing a communication error, so that the image cannot be reproduced at all. Fatal inconvenience can be prevented. Moreover, since the code rearrangement is performed only in a predetermined range of the code string, the load of the code rearrangement processing does not become excessive.
[0061]
According to a third aspect of the present invention, in the first or the second aspect of the present invention, the codes compressed and encoded by JPEG2000 or Motion JPEG2000 are rearranged, so that the load of the code rearrangement process is not excessively increased. It is possible to prevent a catastrophic failure such that an image cannot be reproduced at all.
[0062]
According to a fourth aspect of the present invention, in the third aspect of the present invention, the ROI area, which is an important area of the image, is transmitted in a distributed manner, so that the load of the code rearrangement processing is not excessively increased. It is possible to prevent a catastrophic failure that cannot be reproduced at all.
[0063]
According to a fifth aspect of the present invention, in the third aspect of the present invention, an important area of a code sequence according to a progressive order is distributed and transmitted, and a load of code rearrangement processing is not excessively increased. It is possible to prevent a catastrophic failure such that an image cannot be reproduced at all.
[0064]
According to a sixth aspect of the present invention, in the invention of the fifth aspect, when the progressive order is an image progressive or a resolution progressive, a certain range on the leading side of the code string which is an important area of the code string is distributed. It is possible to prevent a fatal inconvenience that an image cannot be reproduced at all without increasing the load of the code rearrangement process.
[0065]
According to a seventh aspect of the present invention, in the fifth aspect of the invention, when the progressive order is a component progressive, a range of luminance data which is an important area of a code string is transmitted in a distributed manner, and codes are rearranged. It is possible to prevent a catastrophic failure such that an image cannot be reproduced at all without excessive processing load.
[0066]
According to the eighth and thirteenth aspects, an image can be reproduced by rearranging a received code string into an original code string.
[0067]
According to the ninth aspect, the same operation and effect as those of the first aspect and the eighth aspect can be obtained.
[0068]
The invention according to claim 10 operates on a computer, and can provide the same operation and effect as the invention according to any one of claims 1 to 8.
[0069]
According to the eleventh aspect of the present invention, the same operation and effect as those of the tenth aspect of the invention can be achieved by the stored program.
[Brief description of the drawings]
FIG. 1 is an explanatory diagram for explaining the basics of a JPEG2000 algorithm.
FIG. 2 is an explanatory diagram for describing each component of a color image.
FIG. 3 is an explanatory diagram showing sub-bands at each decomposition level when the number of decomposition levels is three.
FIG. 4 is an explanatory diagram of a structure of a code stream.
FIG. 5 is an explanatory diagram showing that one precinct is formed of three spatially coincident rectangular regions.
FIG. 6 is an explanatory diagram of decomposing a coefficient value in units of bit planes and ranking the bit planes for each pixel or code block.
FIG. 7 is a block diagram of a schematic configuration of a network system according to the embodiment of the present invention.
FIG. 8 is a block diagram of electrical connection between a server and a client.
FIG. 9 is a flowchart of a process performed by a server.
FIG. 10 is a functional block diagram of a server and a client.
FIG. 11 is an explanatory diagram showing an example of code rearrangement.
FIG. 12 is a flowchart of a process performed by a client.
[Explanation of symbols]
a, b Code string 1 Image transmitting device 2 Image receiving device 3 Network 14 Storage device 17 Storage medium 10 Network system 31 Code

Claims (13)

A communication interface connected to the network;
A code sequence obtained by compression-encoding the image data, wherein a predetermined range is rearranged within the range into an array of codes different from the standard of the compression encoding, and an array of the standard other than the range is arranged. A storage device for storing the items arranged in
Transmitting means for transmitting the code string via the network by the communication interface,
An image transmission device comprising: A communication interface connected to the network;
A storage device that stores a code sequence obtained by compression-encoding the image data,
Code sequence conversion means for converting the code sequence into a new code sequence by rearranging the arrangement of codes within the predetermined range and not performing the rearrangement outside the range.
Transmitting means for transmitting the code string via the network by the communication interface,
An image transmission device comprising: 3. The image transmitting apparatus according to claim 1, wherein the compression encoding method is JPEG2000 or Motion JPEG2000. The image transmission device according to claim 3, wherein the predetermined range is a region of interest (ROI) area. The image transmitting apparatus according to claim 3, wherein the predetermined range is selected in accordance with a progressive order when the code string is progressively reproduced on a transmission side. The image transmission device according to claim 5, wherein the predetermined range is a certain range on the leading side of the code string when the progressive order is image progressive or resolution progressive. The image transmission device according to claim 5, wherein the predetermined range is a range of luminance data when the progressive order is component progressive. Receiving means for receiving a code string obtained by compressing and encoding image data,
When the received code string is rearranged in an array of codes different from the compression encoding standard within the predetermined range for the predetermined range, and is arranged in an array of the standard for other than the range. Conversion means for rearranging the code and converting it to the original code string;
An image receiving device comprising: An image transmission device according to any one of claims 1 to 7,
The image receiving apparatus according to claim 8, wherein the image receiving apparatus is connected to the image transmitting apparatus via a network and receives a code string transmitted by the image transmitting apparatus.
A network system comprising: A computer-readable program that causes a computer to execute the means according to any one of claims 1 to 8. A storage medium storing the program according to claim 10. A code sequence obtained by compression-encoding the image data, wherein a predetermined range is rearranged within the range into an array of codes different from the compression-encoding standard, and an array of the standard other than the range is arranged. An image transmission method, comprising transmitting, via a communication interface connected to a network, those stored in a storage device. A receiving step of receiving a code string obtained by compression-encoding the image data,
When the received code string is rearranged in an array of codes different from the compression encoding standard within the predetermined range for the predetermined range, and is arranged in an array of the standard for other than the range. Is a conversion step of rearranging the code and converting it to the original code sequence,
An image receiving method comprising:

Images