JP2008306595A - Image processing unit, image processing method, and information recording medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an image processing unit speedily examining a small region, having identical coding conditions from code data, to provide an image processing method and an information recording medium on which the code data is recorded. <P>SOLUTION: The image processing unit has an image coding means for allowing the image data of an image having a plurality of small regions to generate an image code coded, under prescribed coding conditions for each small region; a name space code generation means for generating a name-space code, having name-space information for prescribing the identity of the coding conditions to the small region; and a code data generation means for generating the code data, having the image code and the name space code. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to an image processing device, an image processing method, and an information recording medium.

  Conventionally, in order to process high-resolution image data at high speed and easily, there is a technique of dividing an image into small areas and performing processing such as transfer for each small area. For example, Japanese Patent Laying-Open No. 2003-23630 (Patent Document 1) describes that a part requested by a client in a compressed code stream stored in the server is transmitted from the server to the client. For example, Japanese Patent Laid-Open No. 11-205786 (Patent Document 2) discloses a technique such as an image data transfer system that transfers an image requested by a client from a server that stores a plurality of images having different resolutions. .

  According to such a technique, there is an advantage that the amount of transmission data can be reduced by transmitting only the selected small region, rather than transmitting data corresponding to the entire image.

By the way, according to the encoding method defined in the JPEG2000 (ISO / IEC 15444 (Non-Patent Document 1)) standard or the like, it is preferable to specify the encoding condition for each small area included in the image. Encoding can be performed.
JP 2003-23630 A JP-A-11-205786 ISO / IEC 15444

  However, in the techniques disclosed in Patent Documents 1 and 2, as in the encoding method described in Non-Patent Document 1, a small area is selected from code data having different coding conditions for each small area. Is not considered.

  For example, when data corresponding to a predetermined area in an image is acquired, it is necessary to check an encoding condition common to each small area. More specifically, for example, in the JPEG2000 standard, it is necessary to acquire a code so that the precinct size in the subband and the resolution of the small area are the same. As the resolution of the image becomes higher and the number of small areas increases, the number of small areas to be examined increases and the amount of processing increases.

  The present invention has been invented in order to solve these problems in view of the above points, and is an image processing apparatus that performs high-speed processing for examining small regions having the same encoding condition from code data. An object of the present invention is to provide an image processing method and an information recording medium on which the code data is recorded.

  In order to achieve the above object, the image processing apparatus of the present invention employs the following configuration.

  The image processing apparatus of the present invention includes an image encoding unit that generates an image code in which image data of an image having a plurality of small regions is encoded according to a predetermined encoding condition for each of the small regions, and a code for the small region A namespace code generating means for generating a namespace code having namespace information that defines the identity of the conversion conditions, and a code data generating means for generating code data having the image code and the namespace code It can be configured.

  Accordingly, it is possible to provide an image processing apparatus that performs high-speed processing for examining small regions having the same encoding condition from code data.

  In order to achieve the above object, in the image processing apparatus of the present invention, the namespace code can be configured to have identification information of a small area in which the same encoding condition is defined.

  In order to achieve the above object, in the image processing apparatus of the present invention, the code data generation means is configured such that the image code of the small area in which the same coding condition is defined is located at a position behind the namespace code. It is possible to configure so as to generate code data arranged continuously.

  In order to achieve the above object, in the image processing apparatus of the present invention, when the encoding conditions for all the small regions included in the image are the same, the namespace code is stored in all the images included in the image. It can be configured to have namespace information that specifies that the coding conditions of the small areas are the same.

  In order to achieve the above object, in the image processing apparatus of the present invention, when there are a plurality of images having a plurality of small regions, the namespace code has the same encoding condition for the small regions included in different images. It can be configured to have namespace information that defines gender.

  In order to achieve the above object, an image processing apparatus according to the present invention includes an image code obtained by encoding image data of an image including a plurality of small areas according to a predetermined coding condition for each small area, and the small code. A namespace code decoding means for decoding the namespace code from the code data to obtain namespace information from the code data, and a predetermined code from the code data. And a small area code selecting unit that selects an image code of a small area corresponding to the conversion condition.

  In order to achieve the above object, the image processing apparatus according to the present invention may include a decoding unit that decodes the image code of the small region selected by the small region code selecting unit.

  In order to achieve the above object, in the image processing apparatus of the present invention, when the name space code includes identification information of a small region in which the same coding condition is defined, the small region The code selection means can be configured to select an image code of a small area having the same encoding condition based on the identification information of the small area.

  In order to achieve the above object, in the image processing apparatus of the present invention, the code data is continuously arranged with image codes of small areas in which the same coding condition is defined behind the namespace code. In the case of such a configuration, the small area code selection means can be configured to select image codes of the small areas arranged continuously.

  In order to achieve the above object, the image processing method according to the present invention generates an image code in which image data of an image having a plurality of small areas is encoded according to a predetermined encoding condition for each of the small areas. Code data having an encoding step, a namespace code generating step for generating a namespace code having namespace information defining the identity of the encoding condition for the small area, and the image code and the namespace code A code data generation step to be generated.

  In order to achieve the above object, the image processing method of the present invention includes an image code in which image data of an image including a plurality of small areas is encoded according to a predetermined encoding condition for each small area, and the small code A namespace code decoding step for decoding the namespace code from the code data, and a small area corresponding to a predetermined encoding condition from the code data. And a small region code selecting step for selecting the image code.

  In order to achieve the above object, the information recording medium of the present invention includes an image code obtained by encoding image data of an image having a plurality of small areas according to a predetermined coding condition for each small area, and the small code. A computer-readable information recording medium having an area for storing code data having a namespace information code that defines the identity of the encoding condition for the area.

  According to the image processing apparatus, the image processing method, and the information recording medium of the present invention, an image processing apparatus, an image processing method, and an image processing apparatus that perform high-speed processing for examining small regions having the same encoding condition from code data, and It is possible to provide and provide an information recording medium on which the code data is recorded.

Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[First embodiment]
(Example of functional configuration of image processing apparatus according to one embodiment of the present invention)
FIG. 1 is a diagram illustrating an example of a functional configuration of an image processing apparatus according to an embodiment of the present invention. The image processing apparatus 1 in FIG. 1A associates an image code in which image data of an image including a plurality of small areas is encoded with a predetermined encoding condition for each small area, and the encoding condition. Code data including the namespace code of the namespace information is generated. The image processing apparatus 1 includes, for example, an image encoding unit 11, a namespace code generation unit 12, and a code data generation unit 13.

  The image encoding unit 11 encodes data of a small area of the image to generate an image code. The encoding process performed by the image encoding unit 11 may be, for example, wavelet transform and arithmetic encoding processing included in the JPEG2000 standard, or may be DCT conversion and Huffman encoding, for example. Processing is also acceptable.

  The namespace code generating means 12 generates a namespace code including namespace information corresponding to the encoding condition for each small area. The identity of the encoding condition is determined by the name space represented by the name space information. The name space information is identification information for identifying the name space, and has, for example, a URI (Universal Resource Identifier) format. The name space has, for example, a tag set format. Tags included in the name space correspond to various parameter variable names of the encoding conditions, and values associated with the tags are values that the parameter variables have. .

  The namespace code has, for example, the format of user-defined information included in image code data. More specifically, for example, it may be a COM marker segment in the JPEG2000 standard.

  For example, when there are a plurality of small areas to which the encoding condition corresponding to the same namespace is applied among the small areas included in the image, the namespace code generating unit 12 selects the namespace information and the small areas. The identification information is included in the namespace code. As a result, for example, when acquiring an image code of a small area having the same encoding condition from code data including the namespace code, information on the encoding condition included for each image code of the small area is decoded. Can be omitted.

  The code data generation unit 13 generates code data including the image code generated by the image encoding unit 11 and the namespace code generated by the namespace code generation unit 12. The code data generation unit 13 generates code data by associating, for example, a namespace code and a small area to which an encoding condition corresponding to the namespace code is applied.

  More specifically, for example, when the encoding conditions corresponding to the same name space are applied to all of the small areas included in the image, the code data generation unit 14 supports all the small areas. One namespace code to be included is included in the code data. Thereby, for example, when acquiring a small area included in a predetermined area from the code data, by decoding the namespace code, it can be seen that the encoding conditions of all the small areas are the same, It is possible to omit the process of decoding and checking the information of the encoding condition included for each small area image code.

  In addition, for example, when image codes of a plurality of small areas to which encoding conditions corresponding to the same name space are applied among the small areas included in the image are consecutive in the code data, code data generation is performed. The means 13 associates the image code of the leading small area with the namespace code among the image codes of the continuous small areas.

  Thereby, when acquiring the image code of the small area with the same encoding condition from the code data, the image code of the small area corresponding to the next namespace code is obtained from the image code of the small area corresponding to the corresponding namespace code. It is sufficient to acquire up to the image code of the small area immediately before the image code, and it is possible to omit the process of decoding and examining the information of the coding condition included for each image code of the small area.

  When there is no next namespace code, that is, among the namespace codes included in the code data, the namespace code located at the end includes the image code of the small area located behind the namespace code. It is matched.

  The image processing apparatus 2 in FIG. 1B associates an image code in which image data of an image including a plurality of small areas is encoded according to a predetermined encoding condition for each small area with the encoding condition. Code data including the namespace code of the namespace information. The image processing apparatus 2 includes, for example, a namespace code decoding unit 22 and a small area code selection unit 23, and further includes a code data analysis unit 21, an image transfer unit 24, and an image decoding unit 25. Also good.

  The code data analysis means 21 is means for accessing predetermined data included in the code data by searching for a predetermined marker or the like from the head of the code data. Note that “accessing” means, for example, reading the corresponding data in the code data or rewriting the corresponding data in the code data.

  The code data analysis unit 21 searches for a predetermined marker when the code data is based on the JPEG2000 standard, for example. For example, when the code data includes a start code according to the MPEG standard, the code data analysis means 21 searches for a predetermined start code. The code data analysis means 21 may also search for any other code, for example.

  The code data analysis means 21 acquires a namespace code by searching for a predetermined code in order from the top of the code data, for example. The predetermined code is, for example, a COM marker defined in the JPEG2000 standard.

  The namespace code decoding means 22 acquires the namespace information included in the namespace code by decoding the namespace code acquired from the code data. This namespace information defines the identity of the encoding conditions of the corresponding small area.

  Further, the namespace code decoding means 22 acquires a namespace corresponding to the encoding condition based on the namespace information, and acquires those values for each parameter variable of the encoding condition determined by the namespace. Also good. Thereby, the encoding condition itself can be acquired. The namespace code decoding means 22 may be configured to include an XML parser, for example.

  The small area code selection means 23 is a means for selecting data of a small area having the same coding condition from the code data based on the namespace information acquired by the namespace code decoding means 22. The small area code selection unit 23 also selects small area data so that the resolutions are the same based on, for example, the encoding condition. For example, when the code data conforms to the JPEG200 standard, the small area code selection unit 23 selects the small area data so that the precinct sizes in the subbands are the same based on the encoding condition. To do.

  The image transfer means 24 transfers the small area data selected by the small area code selection means 23 to a device connected to the outside of the image processing apparatus 2. The image transfer unit 24 may generate new code data including data of the selected small area and transmit the code data.

  The image decoding means 25 decodes the small area data selected by the small area code selection means 24 to generate an image. The image decoded by the image decoding unit 25 may be displayed on a display device (not shown), may be transmitted to the outside of the image processing device 2 by the image transfer unit 24, or may be displayed on a medium by an image forming unit (not shown). It may be formed and output.

(Example of code data including namespace code)
FIG. 2 is an example of code data of an image including a namespace code. FIG. 2A shows an example of code data when the encoding conditions for all the small regions are the same. In the code data D1 in FIG. 2A, the header information H1 is followed by a namespace code NS1 and small area data A1 to A7. The namespace code NS1 includes namespace information indicating that the encoding conditions for all the small area data included in the code data are the same.

  Thereby, for example, when acquiring data of a small area included in a predetermined area from the code data D1, it is possible to omit the process of acquiring and checking the encoding condition for each data of the small area.

  The code data D2 in FIG. 2B is an example of code data in which identification information of a small area in which an encoding condition corresponding to the namespace is applied to the namespace code. The code data D2 includes two namespace codes NS2 and NS3. The namespace code NS2 corresponds to the encoding conditions applied to the small area data B1, B2, and B4, and the namespace code NS3 is the code applied to the small area data B3, B5, and B6. It corresponds to the conversion condition.

  Thus, for example, when data of a predetermined small area is acquired from the code data D2, the namespace codes NS2 and NS3 may be acquired and checked, and the encoding condition is acquired and checked for each data of the small area. Processing can be omitted.

  In this case, the namespace code NS2 and the like may be configured to be included in any position in the code data D2. For example, as in the position following the header information H2 shown in FIG. By being included at a position close to the head in the code data D2, the process of acquiring the namespace code can be facilitated and the process can be performed in a short time. Therefore, the namespace code may be configured to be included at a position closer to the head of the code data D2 than the small area data group.

More specifically, for example, a COM marker segment in the JPEG2000 standard is used. Details of the COM marker segment will be described later. In this case,
[COM marker (4 bytes)] [length information (4 bytes)] [identifier (value 1)] [name space information] [number of elements] [range elements]
Has the form However,
For example, the namespace is
www. recoh. com / jpeg2000 / codingtype / type1
com. recoh. jpeg2000. codingtype. type1
The namespace information is this name.

  The number of elements and the range element can be expressed as follows.

A) [3] [0-5] [8-9] [15-20]
B) [6] [0] [1] [2] [3] [6] [9]
Here, [3] of a) and [5] of a) represent the number of elements.

  That is, in a), there are three range elements [0-5], [8-9], and [15-20] following the number of elements. These indicate that the identification numbers of the small areas are 0 to 5, 8 to 9, and 15 to 20, respectively. The encoding condition of the small area corresponding to this identification number is defined by the name space information included in this COM marker segment.

  Similarly, in a), there are six range elements [0] [1] [2] [3] [6] [9] following the number of elements. These represent that the identification numbers of the small areas are 0, 1, 2, 3, 6, and 9, respectively.

The namespace information may be an alias for the namespace. For example,
rj2k0 = jpeg2000. recoh. com / jpeg2000 / codingtype / type1
Rj2k0 may be included in the COM marker segment as namespace information.

  Furthermore, when the image data includes a plurality of images, the configuration of the code data is as follows.

[Encoding condition for entire image] [Encoding condition for one image] [Code data for one image] [Encoding condition for one image] [Code data for one image]
Here, when a namespace code corresponding to the entire image is entered in [Encoding condition of entire image], and there is no namespace code in [Code data of one image], [Encoding of entire image] The encoding condition can be acquired by the namespace code included in the encoding condition], and the processing can be performed at high speed.

  In addition, identification information of an image to which the encoding condition is applied may be included in the namespace code included in [Encoding condition of the entire image], and identification information of an image to which the encoding condition is not applied It may be included. As a result, it is possible to omit the process of obtaining and examining the header information included in the code data corresponding to each image for the image to which the [encoding condition of the entire image] is applied or the image to which the image is not applied. Can be performed at high speed and easily.

  Code data D3 in FIG. 2C is an example of code data when a small area data group corresponding to the namespace code is continuous. The code data D3 includes two namespace codes NS4 and NS5. The namespace code NS4 corresponds to the encoding conditions of the small area data C1 to C4, and the namespace code NS5 corresponds to the encoding conditions of the small area data C5 to C7.

  Thus, for example, when data of a predetermined small area is acquired from the code data D3, the namespace code is searched and acquired from the head of the code data, and the data of the small area following the namespace code is identified. What is necessary is just to acquire information. As a result, it is possible to omit the process of acquiring and examining the coding conditions included in the data for each small area data.

(Example of processing code data including small area identification information)
FIG. 3 is a flowchart of an example of a process for acquiring the encoding condition of the data of the small area included in the area from the encoded data when selecting a predetermined area in the image. It is an example in case the code | symbol contains the identification information of the corresponding small area. The process in FIG. 3 is, for example, a process for the code data D2 in FIG.

  In step S101 in FIG. 3, the code data analysis means 21 obtains a namespace code by searching for a predetermined marker from the code data, and the namespace code decoding means 22 decodes this to obtain the namespace information. get. Progressing to step S102 following step S101, the namespace code decoding means 22 analyzes the namespace information acquired in step S101, so that the namespace information has the same coding conditions for the entire image. Whether or not is represented. If the coding conditions for the entire image are the same, the process ends here. If not, the process proceeds to step S103.

  In step S103 following step S102, the namespace code decoding means 22 determines whether or not the identification information of the small area is included in the namespace code acquired in step S101. When the identification information of the small area is included, the process proceeds to step S108, and when it is not included, the process proceeds to step S104.

  In step S104 subsequent to step S103, the small region code selecting unit 23 determines whether or not the small region corresponding to the namespace code is included in the region to be selected. If it is included, the process proceeds to step S105, and if it is not included, the process proceeds to step S106. In step S105 subsequent to step S104, the small area code selecting unit 23 acquires and holds the encoding condition defined by the name space information as the corresponding small area encoding condition.

  In step S106, the code data analysis means 21 determines whether or not there is a next namespace code in the code data. If there is a next namespace code, the process proceeds to step S107, and if not, the process ends.

  On the other hand, in step S108 following step S103, the small region code selecting unit 23 determines whether or not the small region whose identification information has been acquired in step S103 is included in the selected region. If it is included, the process proceeds to step S109. On the other hand, if it is not included, the process proceeds to step S106, and processing related to the next namespace code is performed.

  Subsequent to step S108, the process proceeds to step S109, and the small area code selection unit 23 holds the coding conditions of the small area determined to be included in the area selected in step S108. After the process of step S109, the process proceeds to step S106, and the process related to the next namespace code is performed.

(Example of processing code data in which a namespace code and small area data corresponding to the namespace code are continuous)
FIG. 4 is a flowchart of an example of a process for acquiring the encoding condition of the data of the small area included in the area from the encoded data when selecting a predetermined area in the image. In this example, the code is arranged prior to the data of the corresponding small area, and the data of the small area corresponding to the name space code is processed thereafter. The process in FIG. 4 is, for example, a process for the code data D3 in FIG.

  In step S201 of FIG. 4, the code data analysis unit 21 searches for the namespace code from the head of the code data D3, acquires the first namespace code, and the namespace code decoding unit 22 decodes it. To obtain namespace information. Following step S201, the process proceeds to step S202, where the namespace code decoding means 22 uses the same encoding conditions for all the small area data included in the code data based on the namespace information acquired in step S201. Judge whether there is. If all are the same, the process ends. On the other hand, if all are not the same, the process proceeds to step S203.

  In step S203 subsequent to step S202, the small region code selection unit 23 determines whether or not the small region data following the namespace code acquired in step S201 is small region data included in the region to be selected. If it is included in the area to be selected, the process proceeds to step S204. If it is not included in the area to be selected, the process proceeds to step S205. In step S204 subsequent to step S203, the small region code selecting means 23 acquires and holds the coding condition applied to the small region data following the namespace code as the small region coding condition.

  In step S205 following step S203 or step S204, the code data analysis means 21 determines whether or not there is small area data following the small area data processed in step S203. If the small area data is continuous, the process returns to step S203 to repeat the process. On the other hand, if there is no data in the small area, the process proceeds to step S206.

  In step S206 following step S205, the code data analyzing means 21 searches the code data from the continuation of step S205, and determines whether or not a namespace code exists. If the namespace code exists, the process proceeds to step S207, and if there is no namespace code, the process ends.

  In step S207 subsequent to step S206, the namespace code decoding means 22 acquires and decodes the next namespace code from the code data, and acquires namespace information. Progressing to step S203 following step S207, the processing is repeated.

  With the processes in FIGS. 3 and 4 described above, all the encoding conditions for the data in the small area included in the area to be selected are acquired. As a result, it is possible to check the encoding condition common to each small area, and to obtain data of an area having the same resolution or precinct size or an image of the area.

(Example of processing according to the JPEG2000 standard)
FIG. 5 to FIG. 37 are examples of the image processing method according to the embodiment of the present invention, and are examples in the case of processing code data according to the JPEG2000 standard. In the following embodiment, “a parameter of a method for dividing into tile parts” will be described as an example of an encoding condition, but the embodiment of the present invention is not limited to this example. Any encoding condition may be defined by the name space.

  FIG. 5 is a diagram for explaining the outline of image data encoding processing and code data decoding processing according to the JPEG2000 standard. In S1 of FIG. 5, image data divided into rectangular areas called tiles are divided into color components for each tile. Further, a DC level shift process is performed for each color component.

  In S2, wavelet transformation is performed for each tile. As a result, four components, that is, a subband, of an LL component, an HL component, an LH component, and an HH component are generated. By repeating the subband conversion processing on the LL component recursively, one LL component and a plurality of different levels of HL, LH, and HH components are generated.

  Further, each subband is divided into rectangles called precincts. The precinct is a subband divided into rectangles, and roughly represents a place in an image. More specifically, the precinct is a “set” of three components, that is, an HL component, an LH component, and an HH component corresponding to a place in the image. The precinct may be the same as the subband size.

  A code block is obtained by further dividing a precinct into rectangles. Therefore, the physical size is in the order of image ≧ tile> subband ≧ precinct ≧ code block.

  FIG. 6 is a diagram for explaining the relationship among images, tiles, subbands, precincts, and code blocks. FIG. 7 is a diagram for explaining the relationship between subbands and resolution levels. FIG. 7 shows an example when the decomposition level is 3 at the maximum. The composition level is the number of times that subband conversion is performed. In FIG. 3, the resolution level 0 corresponds to 3LL with the maximum composition level.

  Returning to FIG. 5, in S3, a quantization process is performed for each subband generated by the wavelet transform in S2.

  In S4, bit-plane encoding is performed on the wavelet transform coefficient for each unit called a code block obtained by further dividing the subband. The bit plane encoding performed in S4 is entropy encoding.

  In S5, unnecessary codes among codes generated by bit plane coding are discarded, and the remaining necessary codes are grouped into units called packets. The necessary codes are, for example, a collection of codes from the MSB side of all code blocks to the third bit plane in order, and may be selected for each code block in units of bit planes or layers. . Further, the necessary code may be an “empty” code, that is, the entropy code generated in S4 may not be included in the contents of the packet.

  Note that the packet header arranged at the head of the packet includes information relating to the code included in the packet. As a result, the code can be acquired and processed in units of packets from the generated code data.

  Further, a part of the code of the entire image is formed by all precinct packets included in one decomposition level. That is, for example, when codes up to the third bit plane are collected in order from the MSB side, codes up to that bit plane can be generated. This is called a layer. The layer is, for example, a part of the code of the bit plane of the entire image. Therefore, as the number of layers increases, the image quality of the decoded image improves. In other words, the number of layers is a unit of image quality.

  FIG. 8 is a diagram for explaining a layer and a packet included in the layer when the decomposition level is 2 and the size of the precinct is equal to the size of the subband. FIG. 9 is a diagram for explaining a packet in the example of FIG. The packet is based on a precinct. Therefore, one packet is configured to include an HL component, an LH component, and an HH component that constitute a precinct. In FIG. 9, some packets are illustrated by being surrounded by thick lines.

  Returning to FIG. 5, in S6, the code data is formed by arranging the packets generated in S5 in a predetermined order.

(Explanation of the order of arranging packets)
FIG. 10 is a diagram illustrating a predetermined order in which packets are arranged. Packet
Which component (hereinafter described using the symbol “C”) belongs to,
Which resolution level (which will be described below using the symbol “R”),
Which precinct, that is, the place (hereinafter described using the symbol “P”)
Which layer (hereinafter described using the symbol “L”) belongs to,
These four attributes are included in the header part. The header part of the packet is called a packet header. Packet data follows the packet header. The packet data is an entropy code, and is an MQ code when arithmetic code according to the JPEG2000 standard is performed.

  That is, the packet arrangement means the order in which the packet header and packet data are arranged hierarchically. This arrangement order is called a progression order. In FIG. 10, five patterns are shown.

Here, the process of arranging packets in the order of progression when generating code data and the process of interpreting the attributes of packets in the order of progression when decoding code data are as follows.
That is, for example, according to the script language style:
for (layer) {
for (resolution) {
for (component) {
for (Precinct) {
Encoding: Place packet
When decoding: Interpret packet attributes}
}
}
}
The packets are arranged or interpreted in the hierarchical order.

In the packet header,
-Whether the packet is empty-Which code block is included in the packet-Number of zero bit planes of each code block included in the packet-Number of coding passes of each code block code included in the packet, or further Number of bit planes-The code length of each code block included in the packet is described.

  However, the packet header does not include a layer number or a resolution number. Therefore, when processing code data, in order to determine which resolution of which layer the packet is, the information contained in the head part of the code data called the main header is described in the COD marker etc. The for loop shown in the above script language is formed from the progression order, and the break of the packet is determined from the sum of the code lengths of the code blocks included in the packet, and at which position in the for loop each packet is located. It is necessary to check whether it has been acquired. Therefore, if only the code length in the packet header is read, the next packet can be detected without decoding the entropy code itself. That is, any packet can be accessed.

(Progression order and code data example)
11 to 14 are diagrams for explaining examples of code data corresponding to the progression order. FIGS. 11 and 12 are examples of the order of LRCP (layer, resolution, component, precinct). FIG. 14 shows an example of the order of RLCP (resolution, layer, component, precinct).

  The code data in FIG. 11 indicates that the layer is located on the outermost side of the for loop. The outermost part of the for loop is hereinafter referred to as “outermost shell”. In FIG. 11, SOC is a Start of Codestream marker and represents the head of code data. The main header is a main header including parameters related to the entire code data.

  The code data can be further divided into a plurality of pieces at packet breaks for each code constituting each tile. This “the divided code constituting the tile” is referred to as a tile part. Each tile part has a header that starts with an SOT (start of tile-part) marker segment and ends with an SOD (start of data) marker prior to the packet. This header is called a tile part header.

  Returning to FIG. 11, SOT is an SOT marker representing the start of a tile part marker segment located at the head of the tile part. Following the SOT, a tile part header is arranged. SOD is a Start of Data marker placed at the end of the tile part header. The SOD marker is followed by an entropy code. The tile part header is from the SOT marker to the SOD marker.

  Further, the code data in FIG. 13 represents that the resolution is located in the outermost shell.

  FIGS. 12 and 14 show the case where the image size is 100 pixels vertically and horizontally, the number of layers is 2, the resolution level is 3 levels, that is, 0 to 2, the number of components is 3, and the precinct size is 32 horizontally and vertically. FIG. 12 shows an example of an LRCP progression order corresponding to FIG. 11, and FIG. 14 shows an example of an RLCP progression order corresponding to FIG.

(Description of SOT marker segment)
15 and 16 are diagrams for explaining the configuration of the SOT marker segment. FIG. 15 is an example of the configuration of the SOT marker segment, and FIG. 16 is a table for explaining parameters included in the SOT marker segment. By obtaining the value of Psot included in FIG. 16, the entropy code can be accessed for each tile part. FIGS. 12 and 14 already described are examples in which the number of tile parts is one.

(Description of TLM marker segment)
If it is desired to omit the decoding of the packet header, the length of each packet may be recorded in the PLT marker in the tile part header or the PLM marker in the main header at the time of encoding. Furthermore, when it is desired to omit the process of searching for the SOT marker, the length of each tile part may be recorded in the TLM marker at the time of encoding.

  FIG. 17 to FIG. 19 are diagrams for explaining the configuration of the TLM marker segment. The TLM marker segment is a marker segment that describes the length of the tile part, and is included in the main header. FIG. 17 is an example of a configuration of a TLM marker segment, and FIG. 18 is a diagram for explaining the meaning of parameters included in the TLM marker segment. FIG. 19 is a diagram for explaining the meaning of Stlm and the corresponding meaning among the parameters in FIG. As is clear from FIGS. 17 and 18, the length of the i-th tile part can be known by acquiring the value of Ptlm (i).

(Explanation of access for each tile part)
The JPEG2000 code can be accessed in units of packets, or more simply in units of tile parts. This means that only necessary codes can be extracted from the original code data to generate new code data. This also means that only partial code data can be decoded from the original code data as necessary.

  For example, when a large image on the server is displayed on the client side, the client can display code data corresponding to the required image quality, code data corresponding to the required resolution, code data for only the area to be viewed, or component to be viewed. -Code data corresponding to the nent can be received from the server and decoded.

  As described above, a protocol for receiving only necessary codes from the JPEG2000 codes in the server is called JPIP (JPEG2000 Interactive Protocol) and has been established as a standard. As such a protocol for partially accessing a hierarchical image, there are, for example, FlashPix, which is a multi-resolution representation of an image, and IIP (Internet Imaging Protocol), which is a protocol for accessing it. More specifically, see http: // www. i3a. org / i_ip. See html. As for the cache model and the like in JPIP, there is image processing for JPEG2000 in the server client environment in Patent Document 1.

  By the way, in JPIP, it is conceivable that the resolution to be drawn and the window size to be actually drawn are designated from the client to the server. The server having received such a specification transmits a precinct packet included in the area of the resolution or, more simply, transmits a tile part included in the area.

  The “precinct or tile part included in the specified area” means a precinct or tile part whose entirety is included in the specified area, and a precinct or tile part whose part is included in the specified area. It is.

  In the following embodiment, a JPIP system that transmits tile parts will be described. A JPIP system that transmits tile parts is called a JPT system.

  In the JPT system, there is a procedure for extracting tile parts included in an area from tile parts constituting the entire image. In the procedure, first, it is necessary to examine how the code data managed by the server is divided into tile parts.

(Explanation of division into tile parts)
20 to 22 are diagrams for explaining division into tile parts. 20 to 22 are different examples in which code data having a permutation of packets of the RLCP progression order of FIG. 14 is divided into tile parts. The code data in FIG. 14 is obtained when the image size is 100 pixels vertically and horizontally, the number of layers is 2, the resolution level is 3 levels, that is, 0 to 2, the number of components is 3, and the precinct size is 32 horizontally and vertically. It consists of packets and the number of tiles is 1.

  FIG. 20 is an example in which all resolution boundaries are tile part boundaries, and is divided into three tile parts. FIG. 21 shows an example in which layer boundaries are divided into tile parts in addition to all resolution boundaries, and are divided into six tile parts. FIG. 22 shows an example in which the tile parts are divided at all resolution boundaries, all layer boundaries, and all component boundaries, and are divided into 18 tile parts.

(Description of selecting a predetermined area from code data)
By the way, it is assumed that there is a request from the client to the server “I want to display a resolution portion corresponding to 25 × 25 pixels with a window size of 20 × 20”. The resolution corresponding to 25 × 25 pixels refers to a portion of resolution level 0. Further, the 20 × 20 window means that only the 20 × 20 portion of the resolution level 0 pixels is displayed.

  The server may extract a tile part including resolution level 0 from the code data held and transmit it to the client together with the information of the main header. Since there is always an SOT marker at the head of the tile part and the length of the tile part is also known, the boundary of the tile part itself can always be determined.

  However, as can be easily understood from the examples of FIGS. 20 to 22, the number of tile parts to be selected and transmitted is determined by two parameters, the progression order of the code and the division method of the tile parts. Depends on.

  Since the progression order is included in the COD marker segment of the main header or tile part header, it can be easily obtained from the code data. However, in the JPEG2000 standard, there is no marker segment defined to include a tile part division method. Therefore, when the division method into tile parts is not determined by a method different from the code data, a process of counting packets one by one is required to determine a desired tile part. Note that the determination by another method means that, for example, when the encoder and the decoder are paired, the method of dividing into tile parts performed by the encoder can be easily performed by the decoder. It means that it can be acquired.

  If there is only SOT, repeat the procedure of “Search for SOT to obtain tile part length, seek code data to get to the next tile part”, and when a predetermined number of SOTs are reached, the desired tile part is obtained. Will be.

  If there is more TLM, repeat the procedure of “detect and accumulate tile part length in TLM”, and when the predetermined number of tile parts is reached, seek length to the desired tile part, that is, the first tile An offset from the part is obtained, resulting in the desired tile part.

  In both cases of SOT and TLM, a desired tile part cannot be transmitted unless the “offset to the desired tile part” is calculated in the server. When the number of tiles is not large and the number of tile parts is not large, such an offset calculation time and its processing amount are unlikely to be a problem. However, when the image size is increased, the number of tiles is increased, and the number of tile parts is extremely increased, the calculation time and the processing amount become a problem. That is, a large amount of integration must be performed to access only a small portion of the code of a very large image. A similar problem occurs when the leading position of a packet is calculated using PLT.

  Incidentally, the JPEG2000 standard code format and file format include a marker segment and a box which are allowed to contain arbitrary information. Therefore, if a method of dividing into tile parts is put at the position, for example, the process of counting packets one by one can be omitted for the JPT server, which is very useful.

  Further, in order to realize a high-speed server response in JPIP, not only the tile part length and the packet length but also the “offset” itself may be included in the code data or the like. In the JPEG2000 code format, there is no dedicated position for storing the offset, but an optional marker that can be used freely may be used. Further, this offset may be suitably stored using a file format.

  Furthermore, by using a name space that defines various encoding conditions including a method of dividing into tile parts, namespace information for identifying the name space is included in the code data with an optional marker, so that a small amount of information can be obtained. Only by adding the data amount, the same coding condition for a plurality of small regions can be included in the code data.

(Description of COD marker segment)
FIG. 23 to FIG. 25 are diagrams for explaining COD marker segments for including information related to the progression order. FIG. 23 is a diagram illustrating the configuration of the COD marker segment, and FIG. 24 is a diagram illustrating parameters included in the COD marker segment.

  The progression order specified as the default over the entire code data is included in the Sgcod parameter of the COD marker segment in the main header. Further, in a tile part using a progression order different from the default, it may be included in the COD marker segment in the tile part header.

  FIG. 25 is a diagram for explaining the correspondence between the value of the Sgcod parameter in FIG. 24 and the progression order. There are five values corresponding to the progression orders.

(Description of COM marker segment)
FIG. 26 to FIG. 28 are diagrams for explaining a COM marker segment used as a namespace code including namespace information in an embodiment of the present invention. FIG. 26 is a diagram illustrating the configuration of a COM marker segment. FIG. 27 is a diagram for explaining the values of parameters included in the COM marker segment. FIG. 28 is a diagram for explaining a parameter Rcom representing the type of data included in the COM marker segment.

  In FIG. 27, arbitrary data is entered in the value of the Ccom (i) parameter. In one embodiment of the invention, this value includes namespace information. Further, identification information of a small area corresponding to the encoding condition defined by the name space information may be included.

  In the present embodiment, the small area may be any of a tile, a tile part, a precinct, a code block, a packet, and the like. A tile or tile part is preferred.

(Example of JP2 file format)
FIG. 29 shows the structure of the JP2 file format, which is a form of code data processed by the image processing apparatus according to the embodiment of the present invention. For example, a namespace code may be included in UUIDBox (code b1) or XML Box (code b2) in FIG.

  30 and 31 are diagrams for explaining the basic structure of a box. FIG. 30 is a diagram for explaining the basic structure of a box, and FIG. 31 is a diagram for explaining parameter values included in the box and contents corresponding to the values. The value of the DBox parameter is information included in the box, that is, the data body.

  FIG. 32 is a diagram for explaining the structure of the DBbox in the UUIDbox. The first field is UUID, followed by DATA which is the information body. FIG. 33 is a diagram for explaining the value of each field included in the Dbox. The DATA field is a field for storing user-defined information arbitrarily determined by the user. In one embodiment of the present invention, the DATA field may include a namespace code.

  XMLBox is a box for storing user-defined information described in the XML format. By putting a predetermined value in TBox in FIG. 31, user-defined information in XML format can be stored in Dbox. In one embodiment of the present invention, the namespace code may be formed in the XML format, and in that case, an XML box may be used.

  The structure of UUIDbox and XMLBox is the same in the JPX file format.

(Example of JPM file format)
FIG. 34 is a diagram for explaining an example of the configuration of code data including a plurality of images, and is a diagram of an example of a JPM file format. In the JPM file format of FIG. 34, the configuration of UUIDBox and XMLBox is the same as that of the JP2 file format, and thus description thereof is omitted here.

  As apparent from FIG. 34, the code data generated or processed by the image processing apparatus according to the embodiment of the present invention may include a plurality of images. In this case, the name space that defines the encoding condition of the small area included in the image may be associated with a plurality of small areas included in one image, or a plurality of names included in the plurality of images. May be associated with a small area.

  Thereby, when selecting and acquiring a region from code data including a plurality of images, it is possible to simplify the process of checking the encoding condition for each small region included in these images.

(Example of a computer that executes an image processing method according to an embodiment of the present invention)
35 and 36 are diagrams for explaining the configuration and operation of a computer that implements the image processing method according to the embodiment of the present invention. FIG. 35 is an example of a computer that performs processing for generating code data, and FIG. 36 is an example of a computer that performs processing for selecting small area data from the generated code data and generating new code data. is there.

  35 is connected to a CPU 41, a RAM 42, and an HDD 43 via a data bus. For example, the CPU 41 and the RAM 42 may be included in the computer 40, and the HDD 43 may be provided outside the computer 40.

  The process for generating the code data from the original image is performed according to the following A (1) to A (4). Note that the numbers enclosed in circles in FIG. 35 correspond to the procedures of numbers enclosed in parentheses () in the following procedure.

  A (1) The original image recorded on the HDD 43 is read onto the RAM 42 by a command from the CPU 41. When the original image includes a plurality of images, processing is performed for each image.

  A (2) The CPU 41 reads an image on the RAM 42 and performs encoding by the image processing method according to the embodiment of the present invention. By this process, code data including a namespace code is generated.

  A (3) The CPU 41 writes the code data in an area on the RAM 42 different from the original image data.

  A (4) Code data is recorded on the HDD 43 in accordance with a command from the CPU 41.

  In FIG. 36, the computer 40 of FIG. 35 is further connected to the client PC 44 via a data bus. According to this configuration, the second code having a resolution lower than that of the code data or a smaller number of layers or components is obtained from the JPEG2000 code data by the following procedure B (1) to B (4). Data is generated. Note that the numbers enclosed in circles in FIG. 36 correspond to the procedures of numbers enclosed in parentheses () in the following procedure.

  B (1) Code data recorded on the HDD 43 is read onto the RAM 42 by a command from the CPU 41.

  B (2) The CPU 41 reads the code data on the RAM 42, and selects the small area data from the code data by the image processing method according to the embodiment of the present invention to generate the second code data.

  B (3) The CPU 41 writes the generated second code data in an area different from the area where the original code data is written on the RAM 42.

  B (4) Second code data is recorded on the HDD 43 in accordance with a command from the CPU 41.

  Prior to the processing of B (1) to B (4), the client PC 44 connected on the bus designates code data to be processed for the server and designates the resolution of the image of the second code data to be generated. (Fsize) and display size may be specified. Thereby, instead of the process from B (1) to B (4), the following process from C (1) to C (3) is performed.

  C (1) Code data recorded on the HDD 43 is read onto the RAM 42 by a command from the CPU 41.

  C (2) The CPU 41 reads the code on the RAM 42, selects the data of the small area by the image processing method according to the embodiment of the present invention, and generates the second code data.

  C (3) Then, the second code data is transmitted to the client PC 44 in accordance with a command from the CPU 41. Note that the second code data is, for example, a code corresponding to a predetermined tile part.

  Also, when the code data conforms to the JPEG2000 standard, for example, the resolution designation is fsiz and the display window is rsiz, and the parameters are transmitted from the JPT client to the JPT server.

For example, fsiz = “fsiz” “=” x-direction size “,” y-direction size [“,” “closest”]
rsiz = “rsiz” “=” x-direction window size “,” x-direction window size may be used.

  Although the best mode for carrying out the invention has been described above, the present invention is not limited to the embodiment described in the best mode. Modifications can be made without departing from the spirit of the present invention.

1 is a functional configuration example of an image processing apparatus according to an embodiment of the present invention. An example of code data of an image including a namespace code. The flowchart of the example of a process in case the namespace code contains the identification information of the corresponding small area. The flowchart of the example which processes the code data which the data of the small area corresponding to a name space code follow. The figure explaining the outline of the encoding process of the image data by the JPEG2000 standard, and the decoding process of code data. The figure explaining the relationship between an image, a tile, a subband, a precinct, and a code block. The figure explaining the relationship between a subband and a resolution level. The figure explaining the layer and the packet contained in the layer (the 1). The figure explaining the packet contained in a layer and its layer (the 2). The figure explaining a progression order. The figure of the example of the code data of LRCP. The figure of the example of the permutation of the packet of the code data of LRCP. The figure of the example of the code data of RLCP. The figure of the example of the permutation of the packet of the code data of RLCP. The figure explaining the structure of a SOT marker segment. The figure explaining the parameter contained in a SOT marker segment. The figure explaining the structure of a TLM marker segment. The figure explaining the meaning of the parameter contained in the TLM marker segment. The figure explaining the value and the corresponding meaning of a Stlm parameter. An example (part 1) in which code data having a permutation of RLCP progression order packets is divided into tile parts. An example (part 2) in which code data having a permutation of packets of an RLCP progression order is divided into tile parts. An example (part 3) in which code data having a permutation of packets of an RLCP progression order is divided into tile parts. The figure explaining the structure of a COD marker segment. The figure of explanation of the parameter contained in a COD marker segment. The figure explaining the response | compatibility with the value of a Sgcod parameter and a progression order. The figure explaining the structure of a COM marker segment. The figure explaining the value of the parameter contained in a COM marker segment. The figure explaining parameter Rcom showing the kind of data included in a COM marker segment. The figure explaining the structure of a JP2 file format. The figure explaining the basic structure of a box. The figure explaining the value corresponding to the value of the parameter contained in a box, and its value. The figure explaining the structure of DBbox in UUIDbox. The figure explaining the value of each field contained in Dbox. The figure explaining the structure of a JPM file format. An example (part 1) of a computer that executes an image processing method according to an embodiment of the present invention. The example (the 2) of the computer which performs the image processing method which concerns on one embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1, 2 Image processing apparatus 11 Image encoding means 12 Name space code generation means 13 Code data generation means 21 Code data analysis means 22 Name space code decoding means 23 Small area code selection means 24 Image transfer means 25 Image decoding means 40 Computer 41 CPU
42 RAM
43 HDD
44 Client PC
D1, D2, D3 Code data NS1, NS2, NS3, NS4, NS5 Namespace codes A1, A2, A3, A4, A5, A6, A7 Small region image codes B1, B2, B3, B4, B5, B6, B7 Small region image code C1, C2, C3, C4, C5, C6, C7 Small region image code

Claims (12)

Image encoding means for generating an image code in which image data of an image having a plurality of small regions is encoded according to a predetermined encoding condition for each of the small regions;
Namespace code generating means for generating a namespace code having namespace information that defines the identity of the encoding condition for the small region;
Code data generating means for generating code data having the image code and the namespace code;
An image processing apparatus.   The image processing apparatus according to claim 1, wherein the namespace code includes identification information of a small area in which the same encoding condition is defined.   3. The code data generation unit generates code data in which image codes of a small area in which the same encoding condition is defined are consecutively arranged at a position behind the namespace code. 4. Image processing apparatus. When the encoding conditions for all the small regions included in the image are the same,
The image processing apparatus according to claim 1, wherein the namespace code includes namespace information that defines that the encoding conditions of all the small regions included in the image are the same. If there are multiple images with multiple small areas,
The image processing apparatus according to any one of claims 1 to 4, wherein the namespace code includes namespace information that defines the identity of encoding conditions of small areas included in different images. The image data of an image including a plurality of small areas has an image code encoded according to a predetermined encoding condition for each small area, and a namespace code that defines the identity of the encoding conditions for the small areas, Namespace code decoding means for decoding the namespace code to obtain namespace information from code data;
A small area code selecting means for selecting an image code of a small area corresponding to a predetermined encoding condition from the code data;
An image processing apparatus.   The image processing apparatus according to claim 6, further comprising a decoding unit that decodes the image code of the small region selected by the small region code selecting unit. In the case where the namespace code includes identification information of a small area where the identity of the encoding condition is defined,
The image processing apparatus according to claim 6 or 7, wherein the small region code selection unit selects an image code of a small region having the same encoding condition based on the identification information of the small region. In the case where the code data has a configuration in which image codes of small areas in which the identity of the encoding condition is defined are continuously arranged behind the namespace code,
The image processing apparatus according to claim 6 or 7, wherein the small area code selection unit selects image codes of the small areas arranged continuously. An image encoding step for generating an image code in which image data of an image having a plurality of small regions is encoded according to a predetermined encoding condition for each of the small regions;
A namespace code generating step for generating a namespace code having namespace information defining the identity of the encoding condition for the small region;
A code data generation step for generating code data having the image code and the namespace code;
An image processing method. Image data of an image including a plurality of small areas has an image code encoded according to a predetermined encoding condition for each small area, and a namespace code that defines the identity of the encoding conditions for the small areas, A namespace code decoding step of decoding the namespace code from code data;
A small region code selection step of selecting a small region image code corresponding to a predetermined encoding condition from the code data;
An image processing method.   An image code in which image data of an image having a plurality of small areas is encoded according to a predetermined encoding condition for each of the small areas, and a namespace information code that defines the identity of the encoding conditions for the small areas, A computer-readable information recording medium having an area for storing code data.

Images