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

Description

  The present invention relates to an image processing apparatus and an image processing method, and in particular, frequency domain image data is divided into a plurality of partial image data, and is compressed and encoded for each coding pass in a bit plane of the partial image data. The present invention relates to an image processing apparatus and an image processing method for re-compressing code data that constitutes a layer by the encoding pass in accordance with a code data amount for each layer.

  In recent years, JPEG 2000 has been known as an international standard for image compression / decompression technology. JPEG2000 has a higher compression rate, has abundant encoding functions, and supports video data, etc. compared to JPEG, which was the international standard for image compression / decompression technology before that. It is characterized by.

  FIG. 1 shows the flow of JPEG2000 encoding procedure. Further, in FIG. 1, a configuration necessary for the description is shown, and a configuration not necessary for the description is omitted. The same applies to the following drawings.

  In the JPEG2000 encoding procedure, the image data 1 includes a color conversion unit 10, a two-dimensional discrete wavelet transform (DWT) unit 11, a quantizer 12, a coefficient modeling unit 13, an MQ encoder 14, and a code formation unit 15. As a result, code data 2 is obtained. FIGS. 2 to 8 schematically show these processes. Note that entropy coding is performed by the coefficient modeling unit 13 and the MQ encoder 14.

First, input image data 1 is converted into a luminance component (component 1) and a color difference component (component 2 and component 3) called YC _b C _r, and input to a discrete wavelet transform (DWT) unit 11 respectively. Thereafter, each component is independently encoded until it is combined into one code at the final code formation stage.

  FIG. 2 is a diagram for explaining an example when three-level two-dimensional discrete wavelet transform is performed on image data of M pixels in the horizontal direction and N pixels in the vertical direction.

  Image data of M pixels in the horizontal direction and N pixels in the vertical direction are obtained by performing level 3 two-dimensional discrete wavelet transform, and 10 pieces of 3LL, 3HL, 3LH, 3HH, 2HL, 2LH, 2HH, 1HL, 1LH, 1HH are obtained. Converted to subband wavelet coefficient data. At this time, the size of each sub-band is M / 8 × N / 8 for 3LL, 3HL, 3LH, and 3HH, M / 4 × N / 4 for 3HL, 2LH, and 2HH. Three of 1HH are M / 2 × N / 2.

  It is also possible to perform processing by dividing an image to be processed into a plurality of rectangular blocks called tiles. When an image is divided into a plurality of tiles, the subsequent encoding process is performed in units of the tiles.

  FIG. 3 is a diagram for explaining an example in which image data is divided into tiles having a size of m × n and level 3 two-dimensional discrete wavelet transform is performed.

  The image data of one tile in the horizontal direction m and the vertical direction n is 10 pieces of 3LL, 3HL, 3LH, 3HH, 2HL, 2LH, 2HH, 1HL, 1LH, 1HH as a result of performing level 3 two-dimensional discrete wavelet transform. Are converted into wavelet coefficient data of subbands. At this time, the size of each sub-band is 3/8, 3HL, 3LH, 3HH, m / 8 × n / 8, 2HL, 2LH, 2HH is 3/4 × m / 4, 1HL, 1LH, Three of 1HH are m / 2 × n / 2. As described above, the subsequent encoding process is performed in units of this tile.

  JPEG2000 defines two reversible and irreversible coefficients as wavelet transform filter coefficients. When dealing with reversible / irreversible in a unified manner, reversible filter coefficients are used, and when realizing higher rates or good distortion characteristics, irreversible filter coefficients are used.

  Next, scalar quantization is performed on each wavelet coefficient data according to the equation shown in FIG. Here, a is input wavelet coefficient data, q is output quantized coefficient data, sign (a) is the sign of wavelet coefficient data a, | a | is the absolute value of wavelet coefficient data a, Δb Represents a quantization step determined for each subband, and “” represents a floor function. However, when a reversible wavelet coefficient is used, this scalar quantization is not performed.

  The coefficient data after wavelet transform or quantization is entropy encoded for each subband or for each code block obtained by dividing the subband into a plurality of rectangular regions. FIG. 5 shows an example in which each subband is divided into code blocks having a size of P × Q. The entropy encoding is performed by processing in the coefficient modeling unit 13 that generates a context to be given to the subsequent MQ encoder 14 and processing in the MQ encoder 14 that actually performs encoding.

  FIG. 6 shows processing of the subband CB1 and its MQ encoder 14 when entropy coding is performed for each subband. The subband CB1 has an image size of P × Q, and the image of each point is quantized with (N + 2) bits. The upper surface is an MSB (Most Significant Bit) with a quantization bit, and the lower surface is an LSB (Least Significant Bit) with a quantization bit. In FIG. 6, there is no quantization bit in the second plane from the top. This bit plane is called a zero bit plane.

  In the process in the coefficient modeling unit 13, the wavelet coefficient data is divided into bit planes in units of code blocks, and the encoding process proceeds in order from the upper bit plane.

  First, wavelet coefficient data is represented by a sign (positive / negative) and an absolute value, and the absolute value of the wavelet coefficient data included in the same code block is divided into bit planes.

  Subsequently, it is examined how many zero bit planes continue from the MSB side. The zero bit plane does not perform the MQ coding process, and reflects only the number of zero bit planes (number of zero bit planes) continuous from the MSB in the packet header described later. The MQ encoding process is started from a bit plane (bit plane N in the figure) in which non-zero bit data appears for the first time from the MSB side.

  Next, each bit on the bit plane is classified into S, R, and C according to a certain rule. FIG. 7 shows an example in which each bit on the bit plane is classified into S, R, and C according to a certain rule. As described above, after the bit planes are classified into S, R, and C, the bit planes are scanned.

Only the bit data initially classified as S is encoded using a context created based on information of pixels around the bit data. Subsequently, bit data classified as R is encoded with bit data finally classified as C according to different contexts, and one bit plane is encoded. This bit plane is scanned once and the encoding of the corresponding bit is a coding pass.
A path for encoding bits classified as S is a significant propagation path.

  A path for encoding bits classified into R is a magnesium refinement path.

A path for encoding bits classified as C is a clean up path.
Call it.

  Eventually, one bit plane is all encoded in three passes. However, the bits of the bit plane (bit plane N in FIG. 6) in which bit data appears for the first time from the MSB side are all classified as C, and only this bit plane is encoded by the clean up path only.

  Therefore, as shown in FIG. 6, all code blocks in which there are N non-zero bit planes (non-zero bit planes) are encoded in 3N-2 passes.

  An example of the finally obtained code data (MQ code data) is shown in FIG. As shown in FIG. 8, the MQ code data is obtained by connecting the code data generated in each pass.

  In addition, each subband can be divided into rectangular areas called precincts. An example in which each subband is divided into precincts is shown in FIGS. In FIG. 9, the 3LL subband is divided into two precincts (P1, P2), and each precinct includes four code blocks. FIG. 10 shows a state where subbands other than LL are divided into P1, P2, P3,... And a plurality of precincts, and each precinct includes four code blocks. Note that the number of code blocks included in one precinct can be arbitrarily set for each resolution.

  In addition, a single layer can be configured by combining any number of coding passes. This is equivalent to dividing the MQ encoded data in the accuracy direction of the original wavelet coefficient data. FIG. 11 shows an example in which one precinct (P1) including four code blocks (CB1, CB2, CB5, CB6) in the 3LL subband of FIG. 9 is divided into 16 layers L1 to L16. .

  Layer 1 includes a code (PS1, PS2) generated in coding path 1 and 2 of CB1, and a code (PS1) generated in coding path 1 of CB6, and layer 2 includes a coding of CB2. The code (PS1) generated in pass 1 and the code (PS1) generated in the CB5 coding pass are included. Thus, the number of coding passes of each code block included in the layer can be arbitrarily set.

  As described above, the image data for each component is converted into wavelet coefficient data for each subband with a reduced resolution by a two-dimensional discrete wavelet transform, and each subband is divided into rectangular regions called precincts. Further, the wavelet coefficient data included in the precinct is subjected to MQ coding in three coding passes for each bit plane in units of code blocks. At this time, a series of MQ code data can be divided into layers called layers in units of coding paths.

  In JPEG2000, MQ code data classified by the above components, subbands, precincts, and layers, that is, code data surrounded by a thick frame in FIG. 11, is managed as one packet. Here, in some cases, there is a packet called a zero packet that does not include the MQ code data of the corresponding code block.

FIG. 12 is a diagram for explaining a specific example of a packet. The packet 20 shown in FIG. 12 includes a packet header 21 and packet data (entropy code data) 22. Here, the MQ code data (PS1 of CB1, PS2 of CB1, PS1 of CB6) is stored in the packet data 21. On the other hand, the packet header 20 stores the following information necessary for decoding the packet.
(1) Whether the packet is a zero packet.

In the example of FIG. 12, information that a packet is not a zero packet is stored.
(2) Whether MQ code data of the corresponding code block is included in the packet.

MQ code data of CB1 and CB6 is included, and MQ code data of CB2 and CB5 is not included.
(3) The number of coding passes of each MQ code data included in the packet The number of coding passes of the MQ code data included in CB1 is 2.
The number of coding passes of MQ code data included in CB6 is 1.
(4) Number of bytes of each MQ code data included in the packet Number of bytes of MQ code data (total of PS1 and PS2) included in CB1,
Number of bytes (PS1) of MQ code data included in CB6.

  Here, the packets in the 3LL subband have been described, but the other subbands have the same resolution, and the codes of the same layer of three precincts at the same position constitute one packet. Taking FIG. 10 as an example, MQ code data for each layer generated from the code blocks included in the precinct and P1 of the HL subband, the LH subband, and the HH subband is managed as the same packet.

  Finally, the JPEG2000 code stream shown in FIG. 13 is generated. The JPEG 2000 code stream is composed of a main header marker (SOC) 31, a main header marker segment 32, a tile part header marker (SOT) 33, a tile part header marker segment 34, an SOD marker 35, a bit stream 36, and an EOC marker 37. Has been.

  The main header marker 31 represents the start of the code stream, and the main header marker segment 32 includes image information, quantization information, encoding information, and the like. The tile part header marker 33 represents the start of a tile part, and the tile part header marker segment 34 includes tile part information, quantization information, encoding information, and the like. The SOD marker 35 represents the start of data, and the bitstream 36 includes all packets included in that tile part. When the code data is composed of a plurality of tile parts, the tile part header marker 33, the tile part header marker segment 34, the SOD marker 35, and the bit stream 36 are repeated, and the EOC marker 37 represents the end of the code stream. Here, it is possible to divide the code data of one tile into a plurality of tile parts to form a code stream.

As described above, the image data is MQ-encoded in units of code blocks, and the code data is for each luminance / color difference component (component), for each resolution (LL, HL-LH-HH subband), for each region (precinct), Each layer is grouped into packets, and arranged in a specific order at the position of the bit stream 36 in FIG. As an example, let us consider a case where encoding is performed using the parameters shown below without dividing the entire image into tiles.
(1) Number of components: C _max (C1, C2,..., C _max )
(2) Resolution: R level = R + 1 (1: RLL, 2: RHL-RLH-RHH,..., R + 1: 1HL-1LH-1HH)
(3) precinct: P _max at each resolution (P1, P2,..., P _max )
(4) Layer: L _max (L1, L2,..., L _max )
At this time, the total number of packets is C _max × (R + 1) × P _max × L _max .

  When constructing a JPEG2000 code stream, if it is not divided into tile parts, it is necessary to arrange all the information included in the tile part header 40 at the position of the bit stream 36. According to the JPEG2000 standard, five types of ordering (progression order) are defined depending on what is prioritized among components, resolution, precinct, and layer.

FIG. 14 shows a sequence of packets in the order of Layer-reaction-component-position, which is one of progression order. Arranging a packet (L1, RLL, C1, P1 ) at the beginning, layers, resolution, component is precinct remains 1 2, 3, _..., arranged in the order of packets _{P max.} Next, the component is 2, and packets with precinct of 1, 2,..., P _max are arranged in order. This is continued until the component reaches C _max , and then the resolution is set to 2, 3,. The packets are arranged in order until the layers reach 2, 3,..., L _max .

The progression order is in the order of Resolution-layer-component-position in addition to the order of Layer-reaction-component-position.
Resolution-position-component-layer order.
Position-component-resolution-layer order.
Component-position-resolution-layer order.
However, the content of the packet (packet header, packet data) itself is not changed, only the element, resolution, precinct, and layer are preferentially arranged.

  The progression order has the following meanings. When packets decoded at the time of decoding are sequentially displayed as image data, for example, the order of Layer-reaction-component-position is the resolution in which all component data of the entire upper image is compressed at the time of decoding Therefore, a coarse image is output first, and is gradually restored to an image with good image quality. In the order of Resolution-layer-component-position, an image with a low resolution is restored first, and an image with a high resolution is gradually created. In this way, what is preferentially displayed at the time of decoding changes depending on the code progression order.

  Next, a method of recompressing the code, which is a feature of JPEG 2000, that is, a method of generating a further compressed code without decoding the code data once will be described. This recompression function is used when transmitting data that has been encoded and stored at a lossless or similar compression rate using a certain transmission line. In other words, because the transmission capacity of the transmission path is low, when the transmission of the accumulated code data is not completed within a predetermined time, the code amount is compressed below a predetermined upper limit by re-compression of the code. By transmitting, the transmission of the code data can be completed within a predetermined time. Further, even in such a case, it is desirable that the image quality of the decoded image data is the highest within the limits. In JPEG2000, such a function is realized as follows.

FIG. 15 shows an example in which code data is recompressed in the order of Layer-resolution-component-position. In such a case, the number of bytes is counted while transmitting from the beginning of the code data. For example, if the upper limit preset in layer n is reached, the code data is terminated at that point (a in the figure). By doing this, it is possible to transmit code data from an upper layer, and to transmit code data with the best image quality at the time of decoding with a necessary code amount.
Martin Boriek, C.I. Christopoulos, E .; Majani, JPEG 2000 Part I Final Committee Draft Version 1.0, USA, ISO / IEC JTC1 / SC29 WG1 JPEG 2000, March 16, 2000, p. 10 Rate control JP 2001-268369 A

  However, in the above-described conventional method, the code progression orderer is limited in the order of Layer-resolution-component-position, and further considering hardware, MQ coding is actually performed for each code block. As described above, it is difficult to perform encoding with this progression order in which the upper layers of the entire image are arranged with priority.

  The present invention has been made in view of the above points, and an object thereof is to provide an image processing apparatus and an image processing method capable of easily and efficiently recompressing compressed code data.

  Therefore, in order to solve the above problem, the image processing apparatus of the present invention divides the frequency domain image data into a plurality of partial image data, and performs compression encoding for each encoding pass in the bit plane of the partial image data, An image processing apparatus that re-compresses code data constituting a layer by a predetermined number of coding passes based on the code data amount for each layer, and integrates the code data amount for each layer from the highest layer. Then, the layer selection means for selecting a layer whose accumulated code data amount does not exceed a predetermined amount, and the code data of a layer lower than the layer selected by the layer selection means are discarded or made zero. And a data amount compression means for compressing the data amount.

  The image processing apparatus according to the present invention is characterized in that the accumulated code data amount value for each layer is used as header information of the recompressed code data.

  Further, the image processing apparatus of the present invention has code data decoding means for decoding the code data, and the data amount compression means has header decoding means for decoding a header, and the code data decoding means Is characterized by decoding using header information output from the header decoding means.

  The image processing apparatus of the present invention is characterized by performing encoding and / or decoding processing defined by JPEG2000.

  According to the image processing apparatus of the present invention, the image data in the frequency domain is divided into a plurality of partial image data, compressed and encoded for each encoding pass in the bit plane of the partial image data, and a predetermined number of encoding passes. An image processing apparatus that re-compresses code data constituting a layer based on a code data amount for each layer, the code data amount for each layer being accumulated from the highest layer, and the accumulated code data A layer selection unit that selects a layer in a range in which the amount does not exceed a predetermined amount, and compresses the data amount by discarding or zeroing code data of a layer lower than the layer selected by the layer selection unit By including the data amount compression means, it is possible to provide an image processing apparatus that can perform simple and efficient recompression of code data.

  According to the image processing apparatus of the present invention, by using the accumulated code data amount value for each layer as header information of the recompressed code data, the header of the recompressed code data can be easily and efficiently used. Can be generated.

  According to the image processing apparatus of the present invention, the data processing apparatus includes code data decoding means for decoding the code data, and the data amount compression means includes header decoding means for decoding a header, and the code data decoding means By decoding using the header information output from the header decoding means, it is possible to decode the image data that is the source of the code data to be recompressed.

  According to the image processing device of the present invention, by using the image processing device for JPEG2000 re-encoding and / or decoding processing, an image with an optimum image quality can be obtained with an information amount of code data equal to or less than a predetermined information amount. Can be restored.

  According to the image processing apparatus and the image processing method of the present invention, it is possible to provide an image processing apparatus and an image processing method capable of easily and efficiently recompressing the compressed code data.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. The embodiment of the present invention will be described based on JPEG2000.

  FIG. 16 shows an example of a one-chip encoder / decoder 50 in the embodiment of the present invention. In FIG. 16, a configuration necessary for the description is shown, and a configuration not necessary for the description is omitted. The same applies to the following drawings.

  16 includes a pre / post processing unit 51, a two-dimensional discrete wavelet transform (DWT / IDWT) unit 52, an entropy coding / decoding unit 53, a code forming unit 54, a PLL (Phase Locked Loop). ) Circuit 55, CPU I / F unit 56, work memory 57 of entropy encoding unit 53, and header processing unit 58.

The pre / post-processing unit 51 obtains image data from the image data I / F at the time of encoding, for example, performs level shift, and converts RGB (red / green / blue) data to YC _b C _r (luminance component / color difference component). ) Convert to data. Further, the inverse transformation is performed at the time of decoding.

  A two-dimensional discrete wavelet transform unit (DWT / IDWT) unit 52 performs a two-dimensional discrete wavelet transform and its inverse transform.

  The entropy encoding / decoding unit 53 performs entropy encoding and its inverse transformation.

  The code forming unit 54 performs code formation at the time of encoding, adds the header generated by the header processing unit 58 to the generated code, and outputs a code data format having a bit stream by the code data I / F. At the time of decoding, a code data format having a bit stream is obtained from the code data I / F, and the reverse processing to that at the time of decoding is performed.

  The PLL circuit 55 generates a clock for the encoder / decoder 50. The CPU I / F unit 56 serves as an interface between the encoding / decoding unit 50 and an externally provided CPU.

  Next, image data encoding and code data recompression processing will be described. FIG. 17A is a diagram for explaining image data encoding processing, and FIG. 17B is a diagram for explaining code data re-compression processing.

  In FIG. 17A, the code amount for each layer when the entire image is encoded is obtained, and the calculated code amount is managed together with the code data. In FIG. 17B, based on the calculated code amount, a layer in which the maximum code amount is obtained within a range not exceeding the predetermined upper limit code amount is determined, and packets in layers lower than the layer are discarded. Thus, the code data is recompressed.

  FIG. 18 shows an example of an apparatus for obtaining the code amount for each layer. In FIG. 18, when the code construction unit 54, which is the final step of encoding, outputs code data in units of bytes, the byte output enable signal of the code data and the layer number information to which the output packet belongs are displayed. At the same time, it is input to the code amount count unit 60.

  FIG. 19 shows an example of the content of the layer code amount. As shown in FIG. 19, the code amount of a layer is defined as the code amount of a packet belonging to the layer, and the number of bytes of the main header, the number of bytes of the tile part header, and 2 bytes of EOC are included in the code amount of layer 1.

  FIG. 20 shows an example of the configuration of the code amount counting unit 60. The code amount counting unit 60 includes a counter 61 that counts up by an output enable signal of code data, a decoder 62 that decodes information of each layer number, and an accumulator that stores a code amount for each layer corresponding to the number of layers. 63.

  The count value of the counter 61 is reset every time the layer number changes, and is incremented every time code data of that layer is generated. The counted up count value is input to the cumulative adder 63 when the layer number changes. At this time, the decoder 62 selects all layers higher than the layer number to which the currently output packet belongs. Thus, for example, if the count value of the counter 61 is a value obtained by counting the code data of the layer N, the count value is added by all the cumulative adders 63 of the layers 1 to N. In addition, when the code data to be output is a main header, tile part header, or EOC, the code amount for each layer shown in FIG. 19 can be calculated by setting layer 1 to be output.

  FIG. 21 shows another example of the content of the layer code amount. As shown in FIG. 21, the code amount of the layer is defined as only the code amount of the packet belonging to the layer, and the number of bytes of the main header, the number of bytes of the tile part header, and 2 bytes of EOC are included in the code amount of layer 1 . By defining the code amount of the layer in this way, the code amount counting unit 60 can be configured as follows.

  FIG. 22 shows another example of the configuration of the code amount counting unit 60. The code amount counting unit 60 includes a counter 61 that counts up by an output enable signal of code data, a decoder 62 that decodes information of each layer number, and a code amount count that stores the code amount for each layer corresponding to the number of layers. Part register 64.

  The count value of the counter 61 is incremented every time the layer number changes, the code amount for each layer corresponding to the next layer is reset, and the code data of that layer is generated. The counted up count value is input to the code amount count unit register 64 when the layer number changes. At this time, the decoder 62 selects the layer number to which the currently output packet belongs. By doing so, it is possible to obtain data of the code amount for each layer shown in FIG.

  Hereinafter, an example of an apparatus for determining a layer that can obtain a maximum code amount within a range not exceeding a predetermined upper limit code amount based on information for each layer when code data is recompressed will be described.

  FIG. 23 is a diagram for explaining an example of the configuration of the layer selection circuit 70 when performing re-encoding. The layer selection circuit 70 shown in FIG. 23 includes a comparator 71 and a priority encoder 72.

  Before inputting code data to the comparator 71, an upper limit set code amount is set, and the code amount for each layer is input to the comparator 71. The comparator 71 compares the code amount for each layer with the set code amount, and inputs the comparison result to the priority encoder 72. The priority encoder 72 selects a layer that provides the maximum code amount within a range that does not exceed the set code amount, based on the comparison result in each layer input from the comparator 71. The selected selection layer is transferred to the code recompression circuit 73 and used for re-encoding the code data.

  FIG. 23 shows a layer selection circuit 70 at the time of re-encoding corresponding to the code amount for each layer obtained by the code amount counting unit shown in FIGS. 19 and 20.

  FIG. 24 is a diagram for explaining another example of the configuration of the layer selection circuit 70 when performing re-encoding. The layer selection circuit 70 shown in FIG. 24 includes a comparator 71, a multiplexer 75, an adder 76, a layer selection circuit register 77, and a layer determination circuit 78.

  The multiplexer 75 selects one of the code amount of layer 1, the code amount of layer 2,..., The code amount of layer 16, and inputs the code amount of the selected layer to the adder 76. The adder 76 adds the input code amount of the layer to the code amount included in the previous layers, and stores the addition result in the layer selection circuit register 77. The layer selection circuit register 77 stores the addition result and holds the next layer code amount and the value to be added. The comparator 71 compares the output of the adder with a predetermined set code amount, and inputs the comparison result to the layer determination circuit 78. The layer determination circuit 78 selects and selects a layer having the maximum code amount within a range that does not exceed a predetermined set code amount. The selected selection layer is transferred to the code recompression circuit 73 and used for re-encoding the code data.

  Here, the code amount of layer 1, the code amount of layer 2,..., The code amount of layer 16 are selected in order by the multiplexer 75 and stored in the layer selection circuit register 77 using the adder 76. The code amount of the layer so far and the code amount of the selected layer are added and compared with the set code amount by the comparator 71. When the added value becomes larger than the set code amount for the first time, the previous layer is selected and passed to the code recompression circuit 73 from the layer determination circuit.

  FIG. 24 shows a layer selection circuit 70 at the time of re-encoding corresponding to the code amount for each layer obtained by the code amount counting unit shown in FIGS. 21 and 22.

  Next, the code recompression circuit 73 will be described. FIG. 25 is a diagram for explaining a configuration example of the code recompression circuit 73. The code recompression circuit 73 includes a header decoding unit 81, a buffer 82, and a header rewriting unit 83.

  The code data input to the code compression circuit 73 includes a main header 40, a tile part header 41, and a bit stream 36 that follows the main header 40, as shown in FIG. As described above, the bit stream 36 has a configuration in which a plurality of packets including the packet header 21 and the packet data 22 are arranged in the order of a prescribed progression order.

  Here, it is assumed that the packet order, the number of layers, the number of components, the resolution information, and the precinct information are set in the header decoding unit 81 in advance. At this time, since the packet order, the number of layers, the number of components, the resolution information, and the precinct information are described in the main header 40 or the tile part header 41, the header decoding unit 81 automatically captures the values. It is also possible. Further, the information on the packet to be discarded can be known from the selected layer selected by the layer selection circuit 70.

  The header decoding unit 81 inputs the main header 40 and the tile part header 41 of the input code data to the buffer 82. On the other hand, the header decoding unit 81 decodes the number of zero bit planes of the code block, the number of coding passes, and the number of bytes of MQ code data from the packet header of the packet. Further, the number of layers of the packet is compared with the layer selected by the layer selection circuit 70. If the packet is to be discarded, the packet is discarded up to the beginning of the next packet, and if the packet is not to be discarded, The packet header 21 and the packet data 22 are input to the buffer 82. Similar operations are repeated until the last packet, and at the same time, the number of bytes of code data to be left is counted.

  The header rewriting unit 83 rewrites the number of layers, resolution, component, and precinct information in the main header 40 so as to meet preset conditions, and the number of bytes of code data counted by the header decoding unit 81 Further, information on the number of bytes of the code data in the tile part header 41 is changed, and the final recompressed code data 3 is output.

  FIG. 26 shows an example of code data in the order of Resolution-position-component-layer.

  The code data in FIG. 26 includes 16 layers (1 to 16), 3 components (1, 2, 3), and 3 resolutions (3LL, 3HL-LH-HH, 2HL-LH-HH, 1HL-LH-HH). , Code data in the order of Resolution-position-component-layer with a precinct number of 1.

  Hereinafter, a case where the layer selected by the layer selection circuit 70 is assumed to be the layer 8 and the code data lower than the layer 8 (8 to 16) is discarded will be considered. FIG. 27 shows a flowchart of an example of processing for discarding code data lower than layer 8 in the code recompression circuit 73.

  In step S1, code data is input to the header decoding unit 81, and the main header 40 and the tile part header 41 are input to the buffer 82 as they are.

  Progressing to step S2 following step S1, in step S2, the header decoding unit 81 selects the input code data packet. For the first packet, code data corresponding to L (layer) = 1, r (resolution) = 3LL, C (component) = 1, and P (precinct) = 1 is selected regardless of the progression order.

  Progressing to step S3 following step S2, the header decoding unit 81 decodes the packet selected in step S2 in step S3. The information to be decoded is the number of zero bit planes (ZBP), the number of coding passes (CP) and the number of bytes (PD) of MQ code data as described above. Here, the number of bytes of the packet header itself (hereinafter referred to as PH) is also acquired in the decoding process.

  In step S4, the header decoding unit 81 determines whether the corresponding packet is a packet to be discarded. In this example, it is determined whether the layer L is 8 or more. If it is determined that the layer L is 8 or more (YES in step S4), the process proceeds to step S6. If it is determined that the layer L is not 8 or more (NO in step S4), the process proceeds to step S5.

  In step S5, the header decoding unit 81 stores the packet in a predetermined buffer 82. That is, the code data of continuous PH + PD bytes including the packet header is stored in the buffer 82. At the same time, in order to know the number of bytes N of newly generated code data, the value of PH + PD is cumulatively added. Here, the buffer 82 creates an area where a code can be held, and has an area where a plurality of packet data can be continuously stored.

  In step S6, the header decoding unit 81 skips the code data of successive PH + PD bytes including the packet header.

  Following step S5 and step S6, the process proceeds to step S7. In step S7, the header decoding unit 81 determines whether the currently selected packet is the last packet. This is determined based on whether all of the layer, component, resolution, and precinct of the packet indicate the end of the packet. In this example, determination is made based on whether L (layer) = 16, r (resolution) = 1HL-LH-HH, C (component) = 3, and P (precinct) = 1. If it is determined that it is the last packet (YES in step S6), the process proceeds to step S9. If it is determined that it is not the last packet (NO in step S6), the process proceeds to step S8.

  In step S8, the header decoding unit 81 selects the next packet. The L (layer), r (resolution), C (component), and P (precinct) of the next packet can be determined by the progression orderer. Note that the processing from step S3 to step S8 is repeated until the processing of the final packet is completed.

  In step S9, the header rewriting unit 83 rewrites the information on the number of layers, the number of components, the resolution, and the precinct in the main header 40 so as to correspond to the newly obtained code data. Further, the number of code bytes in the tile part header is rewritten using the number of bytes N counted in step S5.

  Progressing to step S10 following step S9, the header rewriting unit 83 outputs the recompressed code data 3 in step S10.

  By performing such processing, code data in which packets of layers 8 to 16 shown below are discarded can be obtained. FIG. 28 shows an example in which the packets of layers 8 to 16 of the code data shown in FIG. 26 are discarded.

  In the above-described example, the packet after layer 8 is completely discarded. However, the packet after layer 8 can be replaced with a zero packet without discarding. FIG. 29 shows a flowchart of an example of processing for rewriting code data lower than layer 8 in the code recompression circuit 73 to zero packets. Here, the description of the steps for performing the same processing as in FIG. 27 is omitted.

  Unlike step S6 in FIG. 27, in step S16, the header decoding unit 81 skips the corresponding packet and simultaneously inputs “00”, which is a zero packet, to the buffer 82 and adds 1 to the number of bytes N of the code data.

  Also, unlike step S9 of FIG. 27, in step S19, the main header 40 is not rewritten, and only the number of code bytes of the tile part header 41 is rewritten.

  FIG. 30 shows an example in which the packets of layers 8 to 16 of the code data shown in FIG. 26 are rewritten to zero packets.

  In addition, the code recompression circuit 73 and the encoder / decoder 50 may be combined as follows to generate the recompressed code data 3 and the image data 1 at the same time. FIG. 31 shows an example of a combination of the code recompression circuit 73 and the encoder / decoder 50.

  When re-compressing the code data 2, as described above, the code data 2 is once input to the header decoding unit 81, and then the main header 40 and the tile part header 41 are input to the buffer 82 as they are. The bit stream 36 is input to the buffer 82 only for necessary packets after the packet header 21 is decoded. Finally, after changing the main header 40 and the tile part header 41 by the header rewriting unit 82, the recompressed code data is output.

  On the other hand, when decoding the code data 2, the code data 2 is once input to the header decoding unit 81, the main header 21 and the tile part header 41 are skipped, and the hit stream 36 is the packet data after the packet header decoding. Only 20 is input to the buffer 82. Thereafter, ZBP, CP, and PD obtained by decoding the packet header 21 together with the packet data 20 by the header decoding unit 81 are input to the entropy decoding unit 52. By using the input data, wavelet coefficient data generated by the entropy decoding unit 52 is subjected to inverse wavelet transform (IDWT) and input to the post-processing unit 51, whereby final image data 1 can be obtained. .

  The present invention is not limited to the encoding or decoding process defined by JPEG2000.

  Further, the recompression process of the present invention can be decoded by performing the reverse process.

  In addition, according to the present invention, code data can be recompressed from the compressed code data without decoding the image once and regardless of the arrangement of the code data packets.

  As described above, according to the present invention, it is possible to provide an image processing apparatus and an image processing method capable of easily and efficiently recompressing compressed code data.

  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.

It is a figure for demonstrating the flow of encoding of JPEG2000. It is a figure for demonstrating an example at the time of performing the level 3 two-dimensional wavelet transform to the image data of a horizontal direction M pixel and a vertical direction N pixel. It is a figure for demonstrating an example at the time of dividing | segmenting image data into a tile of a magnitude | size of mxn, and performing the level 3 two-dimensional discrete wavelet transform. This is a scalar quantization equation. It is a figure of an example which divided | segmented each subband into the code block of a magnitude | size of PxQ. It is a figure for demonstrating the process of a subband and a MQ encoder at the time of entropy encoding for every subband. It is a figure for showing an example which classified each bit on a bit plane into three of S, R, and C by a certain rule. It is a figure for showing an example of MQ code data. It is a figure for showing an example which divided | segmented the subband into the rectangular area | region called precinct. It is a figure for showing an example which divided | segmented the subband into the rectangular area | region called precinct. It is a figure for showing an example which has divided one precinct containing four code blocks into 16 layers. It is a figure for demonstrating an example of a packet. It is a figure for demonstrating an example of a JPEG2000 code stream. It is a figure for demonstrating how to arrange the packet of a Layer-resolution-component-position order. It is a figure for demonstrating an example which recompresses code | cord | chord data in a Layer-resolution-component-position order. It is a figure for demonstrating the structural example of an encoder / decoder. It is a figure for demonstrating the process of encoding of image data and the recompression of code data. It is a figure for demonstrating an example of the apparatus which calculates | requires the code amount for every layer. It is a figure for demonstrating an example showing the content of the code amount of a layer. It is a figure for demonstrating an example of a structure of a code amount count part. It is a figure for demonstrating the other example showing the content of the code amount of a layer. It is a figure for demonstrating the other example of a structure of a code amount count part. It is a figure for demonstrating an example of a structure of the layer selection circuit at the time of performing re-encoding. It is a figure for demonstrating the other example of a structure of the layer selection circuit at the time of performing re-encoding. It is a figure for demonstrating the structural example of a code recompression circuit. It is a figure which shows an example of the code data of Resolution-position-component-layer order. It is a flowchart figure of an example of the process which discards the code data lower than the layer 8 in a code recompression circuit. It is a figure which shows an example of the code data which discarded the packet of layers 8-16. It is a flowchart figure of an example of the process which replaces the code data lower than the layer 8 in a code recompression circuit with a zero packet. It is a figure which shows an example of the code data which rewritten the packet of layers 8 to 16 to the zero packet. It is a figure which shows an example of the combination of a code recompression circuit and an encoder / decoder.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Image data 2 Code data 3 Recompressed code data 10 Color conversion part 11 DWT part 12 Quantizer 13 Coefficient modeling part 14 MQ encoder 15 Code formation part 20 Packet 21 Packet header 22 Entropy code data (packet data)
31 Main header marker (SOC)
32 Main Header Marker Segment 33 Tile Part Header Marker (SOT)
34 Tile Part Header Marker Segment 35 SOD Marker 36 Bit Stream 37 EOC Marker 40 Main Header 41 Tile Part Header 50 Encoder / Decoder 51 Pre / Post Processing Unit 52 DWT / IDWT
53 Entropy Coding / Decoding Unit 54 Code Configuration Unit 55 PLL Circuit 56 CPU I / F Unit 56 Work Memory 57 Header Processing Unit 60 Code Amount Counting Unit 61 Counter 62 Decoder 63 Accumulator 64 Code Amount Counting Unit Register 70 Layer Selection Circuit 71 Comparator 72 Priority encoder 73 Code recompression circuit 75 Multiplexer 76 Adder 77 Layer selection circuit register 78 Layer determination circuit 81 Header decoding unit 82 Buffer 83 Header rewriting unit

Claims (6)

The frequency domain image data is divided into a plurality of partial image data, compressed and encoded for each encoding pass in the bit plane of the partial image data, and the code data constituting a layer by a predetermined number of encoding passes An image processing apparatus that recompresses based on the amount of code data for each,
A layer selection means for accumulating the code data amount for each layer from the highest layer, and selecting a layer in a range where the accumulated code data amount does not exceed a predetermined amount;
Have a data amount compressing means for compressing the data amount by the discard or zero the sign data of the lower layer than the layer selected by the layer selection section,
The accumulated value of the code data amount for each layer is stored in header information of the recompressed code data . Code data decoding means for decoding the code data;
The data amount compression means includes header decoding means for decoding a header,
The image processing apparatus according to claim 1, wherein the code data decoding unit decodes using the header information output from the header decoding unit. The image processing apparatus according to claim 1 or 2 , wherein encoding and / or decoding processing defined by JPEG2000 is performed. The frequency domain image data is divided into a plurality of partial image data, compressed and encoded for each encoding pass in the bit plane of the partial image data, and the code data constituting a layer by a predetermined number of encoding passes An image processing method for recompressing based on the amount of code data for each,
A layer selection step of accumulating the code data amount for each layer from the highest layer, and selecting a layer in a range where the accumulated code data amount does not exceed a predetermined amount;
Have a data amount compression step of compressing the data amount by the discard or zero the sign data of the lower layer than the layer selected by the layer selection section,
The integrated code data amount value for each layer is stored in header information of recompressed code data . A code data decoding step for decoding the code data;
The data amount compression step includes a header decoding step for decoding a header,
5. The image processing method according to claim 4, wherein the code data decoding step uses the header information output from the header decoding step for decoding. 6. The image processing method according to claim 4 , wherein encoding and / or decoding processing defined by JPEG2000 is performed.

Images