JP4812585B2 - Code conversion apparatus, code conversion method, program, and recording medium - Google Patents

Description

  The present invention relates to a code conversion device, a code conversion method, a program, and a recording medium.

  An invention that separates common and non-common parts of a plurality of files on a storage medium, stores file common information and non-common parts for the common parts for each file, and shares the common part with a plurality of files It is described in Patent Document 1.

  The technique disclosed in Patent Document 1 as described above does not generally perform redundancy compression, but attempts to realize lossless compression of a file using the characteristics of a code format having a BOX structure. It is.

  As a code format having such a BOX structure, sharing / referencing is not defined in BOX information (for example, see Non-Patent Document 1), and sharing / referencing is defined in BOX information (for example, Non-Patent Document). 2 and 3). Here, a BOX is an object having a binary structure encapsulated in a file. The code format targeted by the present invention is a code format in which sharing / reference is defined in the latter BOX information.

  FIG. 22 shows the JPEG syntax described in Non-Patent Document 1. As shown in FIG. 22, “ENTROPY-CODED SEGMENT 0” 30 and “ENTROPY-CODED SEGMENT LAST” 31 are synchronized with a “restart interval end symbol RST” 32 to form one “SCAN1” 33, A “Frame” 34 is configured as an aggregate of these SCANs, and is encapsulated by “SOI marker” 35 and “EOI marker” 36 to form a code format. However, in this code format, even if there are a plurality of “ENTROPY-CODED SEGMENT” having the same content in one file, the mechanism for sharing or referring to them is not defined at all in Non-Patent Document 1.

  FIG. 23 shows a conceptual structure of a JPM (JPEG2000 Multi Page) file disclosed in Non-Patent Document 2. Non-Patent Document 2 defines the sharing / referencing of Boxes such as “Contiguous Codestream Box” 37 and “Metadata Boxes” 38 shown in FIG.

JP 2000-293413 A Annex B (P31-49), “INFORMATION TECHNOLOGY-DIGITAL COMPRESSION AND CODINGOF CONTINUOUS-TONE STILL IMAGES−REQUIREMENTS AND GUIDELINES, TEMINAL EQUIPMENT AND PROTOCOLS FOR TELEMATIC SERVICES, THE INTERNATIONAL TELEGRAPH AND TELEPHONE CONSULTATIVE COMITTEE. Tsuki, INTERNATIONAL TELECOMMUNICATION UNION 5.2.7 Shared Data, "Information technology-JPEG2000 Image Coding System-Part 6: Compound Image File Fomrmat, JPEG2000 Part 6 FDIS", 9 DECEMBER 2002, ISO / IEC 15444-6 5.2.7 Shared Data, “Information technology-JPEG2000 Image Coding System-Part2: Extensions, JPEG2000 Part2 FDIS”, 8 AUGUST 2001, ISO / IEC 15444-2

  By the way, the same image may be arranged in a plurality of places with different sizes on the same page of the document, or a common logo mark or the like may be printed over a plurality of pages of the document. Such a common logo mark image can be made more compact if one codestream is shared / referenced by the entire document file. When a large number of manuals are created by multiple persons in charge, the hue of the logo mark may differ slightly for each section (page) in charge, but the code for one logo mark in the entire document file If the stream is shared / referenced, not only the file can be made compact, but also the hue of the logo mark becomes uniform, which is advantageous in terms of the appearance of the document.

  However, in order to share / reference such an object such as a common logo mark, it is not realistic to manually search binary data such as a logo mark and perform the sharing / reference operation.

  The present invention has been made in view of the above, and pays attention to the characteristics of a code format in which sharing / referencing of BOX information is defined, and is an object such as a logo mark that is common on the same page of a document or across a plurality of pages. Can be automatically shared / referenced, and a new operation can also automatically perform operations for representing similar codes with the same value and aligning the entire document so that they are shared / referenced. An object of the present invention is to provide a code conversion device and a code conversion method.

In order to solve the above-described problems and achieve the object, the invention according to claim 1 takes in an input code stream of a code format that defines sharing or reference as BOX information as a file to be converted , and inputs the input code stream to it. A code conversion apparatus for converting into an output code stream having a similar size and a more compact file size, wherein the BOX decomposition means for extracting BOX information from the input code stream and the BOX decomposition means for the conversion Sharing / reference determining means for determining whether to perform sharing processing or reference processing on the BOX information obtained, and sharing or reference necessary for the BOX information cut out by the BOX decomposing means according to the result of determination by the sharing / reference determining means Sharing / reference processing means for performing processing for reference, and Yes / reference processing unit can specify a reference unit into units of logical group of the side of the code to be referenced when referencing subcode.

  According to a second aspect of the present invention, in the code conversion device according to the first aspect of the present invention, the contents of a local file or a remote file other than the conversion target file are also referred to or shared.

  The invention according to claim 3 further comprises means for allowing the user to input an instruction for designating or not designating BOX information shared or referenced in the conversion in the code conversion device according to claim 1 or 2. .

  The invention according to claim 4 further includes means for generating a status report indicating the contents of the conversion in the code conversion device according to claim 1 or 2.

  According to a fifth aspect of the present invention, in the code conversion device according to the fourth aspect, the contents of the conversion are indicated for each object shared or referenced by the conversion in the status report.

  According to a sixth aspect of the present invention, in the code conversion device according to the fourth aspect, the status report includes a size reduced by the conversion.

  The invention according to claim 7 is the code conversion apparatus according to claim 2, further comprising means for a user to specify a range of a remote file referred to in the conversion.

  According to an eighth aspect of the present invention, in the code conversion device according to the seventh aspect, the range of the remote file referred to in the conversion is designated by the number of hops.

  According to a ninth aspect of the present invention, in the code conversion device according to the seventh aspect, a range of a remote file referred to in the conversion is specified by a domain name or a list thereof.

  According to a tenth aspect of the present invention, in the code conversion device according to the seventh aspect, a range of a remote file referred to in the conversion is designated by a work group name or a list thereof.

  The invention according to claim 11 is the code conversion apparatus according to claim 1 or 2, wherein the page thumbnails are unified by reference processing in the conversion.

  According to a twelfth aspect of the present invention, in the code conversion device according to the eleventh aspect, a page thumbnail of another page is referred to for a page having no page thumbnail in the conversion.

  According to a thirteenth aspect of the present invention, in the code conversion device according to the eleventh aspect, document thumbnails are unified by reference processing in the conversion.

  According to a fourteenth aspect of the present invention, in the code conversion device according to the first or second aspect, the conversion target file is a file conforming to IS15444-2.

  According to a fifteenth aspect of the present invention, in the code conversion device according to the first or second aspect, the conversion target file is a file conforming to IS15444-3.

  According to a sixteenth aspect of the present invention, in the code conversion device according to the first or second aspect, the conversion target file is a file conforming to IS15444-6.

  According to a seventeenth aspect of the present invention, in the code conversion device according to the first or second aspect, the conversion target file is a file conforming to the PDF specification.

  The invention according to claim 18 is the code conversion device according to claim 1, wherein the reference unit by the sharing / reference processing means can be set for each resolution.

  According to a nineteenth aspect of the present invention, in the code conversion device according to the first aspect, the reference unit by the sharing / reference processing means can be set for each color component.

  According to a twentieth aspect of the present invention, in the code conversion device according to the first aspect, the reference unit by the sharing / reference processing means can be set for each position.

  The invention according to claim 21 is the code conversion apparatus according to claim 1, wherein the reference unit by the sharing / reference processing means can be set for each image quality.

  According to a twenty-second aspect of the present invention, in the code conversion device according to the nineteenth aspect, the reference unit by the sharing / reference processing means can be set for each precinct.

  According to a twenty-third aspect of the present invention, in the code conversion device according to the nineteenth aspect, the reference unit by the sharing / reference processing means can be set for each tile.

  According to a twenty-fourth aspect of the present invention, in the code conversion device according to the fourth aspect, the reference unit is changed so as to indicate that the status report is being created / under examination / approved.

  According to a twenty-fifth aspect of the present invention, in the code conversion device according to the fourth aspect, the reference unit is changed to indicate that the status report is being created / edited / deleted.

The invention according to claim 26 is a code conversion method for converting an input code stream of a code format in which sharing or reference is defined in BOX information into an output code stream of a more compact file size having the same contents as that. A BOX decomposition step for extracting BOX information from the input code stream for the conversion, and a sharing / reference determination step for determining whether to perform a sharing process or a reference process for the BOX information extracted by the BOX decomposition process. A sharing / reference processing step for performing necessary sharing or reference processing on the BOX information cut out by the BOX decomposition step according to the determination result of the sharing / reference determination step. The process is based on the logical unit of the reference code when referring to the subcode. You can specify the irradiation unit.

The program of the invention according to claim 27 converts an input code stream of a code format that defines sharing or reference into BOX information into an output code stream of a more compact file size having the same contents as the code code. A BOX decomposition step for cutting out BOX information from the input code stream; a sharing / reference determination step for determining whether the BOX information extracted by the BOX decomposition step should be shared or referred to; and the BOX decomposition step. A sharing / reference processing step for performing necessary sharing or reference processing according to the determination result of the sharing / reference determination step with respect to the BOX information cut out by the sharing / reference processing step. When referring to the logical unit of the reference side code You can specify the irradiation unit.

  A computer-readable recording medium according to a twenty-eighth aspect records the program according to the twenty-seventh aspect.

  According to the first aspect of the invention, the sharing / referencing process for the redundant contents of the file is performed in the reference unit, which is a logical unit of the code, so that the file size is maintained while maintaining the identity of the file contents. It is possible to reduce the size before conversion.

  In addition, according to the second aspect of the invention, there is an effect that the file size can be reduced by performing the sharing / referencing process for the contents of the local file or the remote file other than the conversion target file.

  Further, according to the invention of claim 3, there is an effect that the code for the image referred to in the file can be explicitly shown.

  Moreover, according to the invention concerning Claim 4, there exists an effect that the user can confirm the content of conversion easily by a status report.

  Further, according to the invention of claim 5, there is an effect that the user can easily confirm the correspondence relationship of the objects that are shared or referred to in the conversion by the status report.

  Further, according to the invention of claim 6, there is an effect that the user can easily confirm the size reduction effect by the conversion by the status report.

  According to the invention of claim 7, since the range of the remote file to be referred to can be clarified on the user side, the relationship between the range of sharing / referencing and its effect can be managed accurately. There is an effect that it is possible.

  According to the eighth aspect of the present invention, since the range of the remote file to be referred to can be clarified on the user side, the relationship between the range of sharing / referencing and its effect can be accurately managed. There is an effect that it is possible.

  According to the ninth aspect of the present invention, since the range of the remote file to be referred to can be clarified on the user side, the relationship between the range of sharing / referencing and its effect can be accurately managed. There is an effect that it is possible.

  Further, according to the invention of claim 10, since the range of the remote file to be referred to can be clarified on the user side, the relationship between the range of sharing / reference and the effect thereof can be managed accurately. There is an effect that it is possible.

  According to the eleventh aspect of the invention, the conversion has the effect that the file size can be reduced and the page thumbnail or the document thumbnail can be unified and the appearance of the document can be adjusted.

  According to the twelfth aspect of the invention, it is possible to reduce the file size and convert the page thumbnail or the document thumbnail to unify the appearance of the document by conversion.

  In addition, according to the invention of claim 13, by the conversion, the file size can be reduced and the page thumbnail or the document thumbnail can be unified and the appearance of the document can be adjusted.

  According to the fourteenth aspect of the present invention, there is an effect that the file can be reversibly recompressed while maintaining international standard compatibility or PDF compatibility.

  According to the fifteenth aspect of the present invention, there is an effect that the file can be reversibly recompressed while maintaining international standard compatibility or PDF compatibility.

  In addition, the invention according to claim 16 has the effect that the file can be reversibly recompressed while maintaining international standard compatibility or PDF compatibility.

  According to the seventeenth aspect of the present invention, there is an effect that the file can be reversibly recompressed while maintaining international standard compatibility or PDF compatibility.

  According to the invention of claim 26, the sharing / referencing process for the redundant contents of the file is performed in the reference unit which is a logical unit of the code, so that the file contents remain identical. There is an effect that the file size can be reduced from before the conversion.

  Further, according to the invention of claim 27, there is an effect that the invention of claim 26 can be easily implemented by loading the program into the computer.

  Further, according to the invention of claim 28, there is an effect that the invention of claim 26 can be easily implemented by loading the program into the computer.

  First, an outline of the “hierarchical encoding algorithm” and the “encoding / decoding algorithm based on discrete wavelet transform” which are the premise of the present invention will be described. A representative example of “encoding / decoding algorithm based on discrete wavelet transform” is “JPEG2000 algorithm”.

  FIG. 1 is a functional block diagram of a system that implements a hierarchical encoding algorithm that is the basis of an encoding scheme based on discrete wavelet transform. This system functions as an image compression means, and includes a color space conversion / inverse conversion unit 101, a two-dimensional wavelet transform / inverse conversion unit 102, a quantization / inverse quantization unit 103, an entropy encoding / decoding unit. 104, each functional block of the tag processing unit 105.

  One of the biggest differences between this system and the conventional JPEG algorithm is the conversion method. While JPEG uses discrete cosine transform (DCT), this hierarchical coding algorithm uses discrete wavelet transform (DWT) in the two-dimensional wavelet transform / inverse transform unit 102. ing. DWT has the advantage that the image quality in the high compression region is better than DCT, and this is one of the main reasons why DWT is adopted in JPEG2000, which is a successor algorithm of JPEG.

  Another major difference is that in this hierarchical encoding algorithm, a functional block of the tag processing unit 105 is added in order to perform code formation at the final stage of the system. The tag processing unit 105 generates compressed data as code string data during an image compression operation, and interprets code string data necessary for decompression during the decompression operation. With the code string data, JPEG2000 can realize various convenient functions. For example, the compression / decompression operation of a still image can be freely stopped at an arbitrary hierarchy (decomposition level) corresponding to octave division in block-based DWT (see FIG. 3 described later). Further, a low resolution image (reduced image) can be extracted from one file, or a part of the image (tiling image) can be extracted.

  In many cases, a color space conversion / inverse conversion unit 101 is connected to an input / output portion of an original image. For example, the RGB color system composed of R (red) / G (green) / B (blue) components of the primary color system and the Y (yellow) / M (magenta) / C (cyan) components of the complementary color system This corresponds to the part that performs conversion or reverse conversion from the YMC color system consisting of the above to the YUV or YCbCr color system.

  Next, the JPEG2000 algorithm will be described. As shown in FIG. 2, in a color image, each component 111 (RGB primary color system here) of an original image is generally divided by a rectangular area. This divided rectangular area is generally called a block or a tile, but in JPEG2000, it is generally called a tile. Therefore, such a divided rectangular area is hereinafter referred to as a tile. (In the example of FIG. 2, each component 111 is divided into a total of 16 rectangular tiles 112, 4 × 4 in length and breadth). When such individual tiles 112 (R00, R01,..., R15 / G00, G01,..., G15 / B00, B01,..., B15 in the example of FIG. 2) execute the image data compression / decompression process. It becomes the basic unit. Therefore, the compression / decompression operation of the image data is performed independently for each component and for each tile 112.

  At the time of encoding image data, the data of each tile 112 of each component 111 is input to the color space conversion / inverse conversion unit 101 of FIG. 1 and subjected to color space conversion, and then the two-dimensional wavelet conversion / inverse conversion unit. A two-dimensional wavelet transform (forward transform) is applied at 102 to divide the space into frequency bands.

  FIG. 3 shows subbands at each decomposition level when the number of decomposition levels is three. That is, the tile original image (0LL) (decomposition level 0) obtained by the tile division of the original image is subjected to two-dimensional wavelet transform, and subbands (1LL, 1HL, 1LH, 1HH shown in the composition level 1). ). Subsequently, the low-frequency component 1LL in this hierarchy is subjected to two-dimensional wavelet transform to separate subbands (2LL, 2HL, 2LH, 2HH) shown in the decomposition level 2. Similarly, the low-frequency component 2LL is also subjected to two-dimensional wavelet transform, and the subbands (3LL, 3HL, 3LH, 3HH) indicated by the decomposition level 3 are separated. In FIG. 3, subbands to be encoded at each decomposition level are indicated by shading. For example, when the number of decomposition levels is 3, the subbands (3HL, 3LH, 3HH, 2HL, 2LH, 2HH, 1HL, 1LH, 1HH) indicated by shading are to be encoded, and the 3LL subband is encoded. Not.

  Next, the bits to be encoded are determined in the specified encoding order, and the context is generated from the bits around the target bits by the quantization / inverse quantization unit 103 shown in FIG.

  The wavelet coefficients that have undergone the quantization process are divided into non-overlapping rectangles called “precincts” for each subband. This was introduced to use memory efficiently in implementation. As shown in FIG. 4, one precinct consists of three rectangular regions that are spatially coincident. Further, each precinct is divided into non-overlapping rectangular “code blocks”. This is the basic unit for entropy coding.

The coefficient value after wavelet transform can be quantized and encoded as it is,
In JPEG2000, in order to increase encoding efficiency, coefficient values can be decomposed into “bit plane” units, and ranking can be performed on “bit planes” for each pixel or code block.

  Here, FIG. 5 is an explanatory diagram showing an example of a procedure for ranking the bit planes. As shown in FIG. 5, this example is a case where the original image (32 × 32 pixels) is divided into four 16 × 16 pixel tiles, and the size of the precinct and code block at the composition level 1 are respectively 8 × 8 pixels and 4 × 4 pixels. The numbers of the precinct and the code block are assigned in raster order. In this example, the number of assigns is assigned from numbers 0 to 3, and the code block is assigned from numbers 0 to 3. A mirroring method is used for pixel expansion outside the tile boundary, wavelet transform is performed with a reversible (5, 3) filter, and a wavelet coefficient value of decomposition level 1 is obtained.

  An explanatory diagram showing an example of the concept of a typical “layer” configuration for tile 0 / precinct 3 / code block 3 is also shown in FIG. The converted code block is divided into subbands (1LL, 1HL, 1LH, 1HH), and wavelet coefficient values are assigned to the subbands.

  The layer structure is easy to understand when the wavelet coefficient values are viewed from the horizontal direction (bit plane direction). One layer is composed of an arbitrary number of bit planes. In this example, layers 0, 1, 2, and 3 are made up of bit planes of 1, 3, 1, and 3, respectively. A layer including a bit plane close to LSB (Least Significant Bit) is subject to quantization first. Conversely, a layer close to MSB (Most Significant Bit) is quantized to the end. It will remain without being. A method of discarding from a layer close to the LSB is called truncation, and the quantization rate can be finely controlled.

  The entropy encoding / decoding unit 104 illustrated in FIG. 1 performs encoding on the tile 112 of each component 111 by probability estimation from the context and the target bit. In this way, encoding processing is performed in units of tiles 112 for all components 111 of the original image. Finally, the tag processing unit 105 performs a process of combining all the encoded data from the entropy encoding / decoding unit 104 into one code string data and adding a tag thereto.

  FIG. 6 shows a schematic configuration for one frame of the code string data. Tag information called a header (main header, tile part header which is tile boundary position information, etc.) is provided at the head of the code string data and the head of the code data (bit stream) of each tile. Appended, followed by the encoded data for each tile. In the main header, coding parameters and quantization parameters are described. A tag (end of codestream) is placed again at the end of the code string data. FIG. 7 shows a code stream structure in which packets containing encoded wavelet coefficient values are represented for each subband. As shown in FIG. 7, the same packet string structure is obtained regardless of whether the tile division process is performed or the tile division process is not performed.

  On the other hand, when the encoded data is decoded, the image data is generated from the code string data of each tile 112 of each component 111, contrary to the case of encoding the image data. In this case, the tag processing unit 105 interprets tag information added to the code string data input from the outside, decomposes the code string data into code string data of each tile 112 of each component 111, and Decoding processing (decompression processing) is performed for each code string data of each tile 112. At this time, the position of the bit to be decoded is determined in the order based on the tag information in the code string data, and the quantization / inverse quantization unit 103 determines the peripheral bits (that have already been decoded) of the target bit position. Context is generated from the sequence of The entropy encoding / decoding unit 104 performs decoding by probability estimation from the context and code string data, generates a target bit, and writes it in the position of the target bit. Since the data decoded in this way is spatially divided for each frequency band, the two-dimensional wavelet transform / inverse transform unit 102 performs two-dimensional wavelet inverse transform on each of the components of the image data. The tile is restored. The restored data is converted to original color system image data by the color space conversion / inverse conversion unit 101.

  The above is the outline of the “encoding / decoding algorithm based on discrete wavelet transform”.

  By the way, various standards are defined for JPEG2000, for example, JPEG2000 Part 2 (ISO15444-2) including ROI (region of interest) encoding options, JPEG2000 Part3 (ISO15444-3), which is a moving image standard, Examples include JPEG 2000 Part 6 (ISO 15444-6), which is a standard specialized for composite images including different characteristics such as pictures and characters.

Here, Part 6 “Compound image file Format” of JPEG2000 will be described. Part 6 of JPEG2000 is a standard specialized for composite images including different characteristics such as pictures and characters, and is defined in the international standard ISO 15444-6 shown in Non-Patent Document 1. The file extension of JPEG2000 data defined in Part 6 of JPEG2000 is “JPM”. As shown in FIG. 8, a JPM file as an example of such a structured document is composed of an Object Header Box 201 in which an offset indicating the position of a code stream is written, a referenced code stream Box 202, and other Box 203. . The JPM file can be referred to by the reference number rather than the position designation by offset, by referring to data in the file, defining the order of the BOX information, or specifying the position by offset. Further, it is defined that the predetermined BOX shown in FIG. 8 functions as a standard compatible JPM file if its level and range are maintained, even if the number of appearances and the order of appearance vary. As an example, the codestream for the objects in each layout object satisfies the logical structure of the structured document,
1) Document thumbnail (reference numeral 203 in FIG. 8) and thereafter 2) It is defined that any position can be placed at the highest level.

  Next, embodiments of the present invention will be described in detail. An example relating to JPEG2000 will be described here, but it goes without saying that the present invention is not limited to the content of the following description.

  Here, FIG. 9 is a block diagram showing a hardware configuration of the code conversion apparatus 1000 according to the present embodiment. The code conversion apparatus 1000 is mainly composed of, for example, a personal computer or a workstation. As shown in FIG. 9, such a code conversion apparatus 1000 includes a CPU (Central Processing Unit) 2 that is a main part of a computer and controls each part centrally. The CPU 2 is connected by a bus 5 to a ROM (Read Only Memory) 3 which is a read-only memory storing BIOS and a RAM (Random Access Memory) 4 which stores various data in a rewritable manner.

  Further, the bus 5 has an HDD (Hard Disk Drive) 6 that stores various programs and the like, and a CD-ROM drive 8 that reads a CD (Compact Disc) -ROM 7 as a mechanism for reading computer software that is a distributed program. A communication control device 10 for communicating information with other external computers via the network 9, an input device 11 such as a keyboard and mouse for inputting various commands and information to the CPU 2, and processing progress And a display device 12 such as a CRT (Cathode Ray Tube) or an LCD (Liquid Crystal Display) for displaying results and the like are connected via an I / O (not shown).

  Since the RAM 4 has the property of storing various data in a rewritable manner, it functions as a work area for the CPU 2 and functions as a buffer.

  A CD-ROM 7 shown in FIG. 9 implements the storage medium of the present invention, and stores an OS (Operating System) and various programs. The CPU 2 reads the program stored in the CD-ROM 7 with the CD-ROM drive 8 and installs it in the HDD 6.

  As the storage medium, not only the CD-ROM 7 but also various types of media such as semiconductor memories such as various optical disks such as DVD, various magnetic disks such as various magneto-optical disks and flexible disks, and the like can be used. Further, a program may be downloaded from the Internet or the like via the communication control device 10 and installed in the HDD 6. In this case, the storage device storing the program in the server on the transmission side is also a storage medium of the present invention. Note that the program may operate on a predetermined OS (Operating System), and in that case, the OS may take over the execution of some of the various processes described later, It may be included as a part of a group of program files constituting the application software or OS.

  The CPU 2 that controls the operation of the entire system executes various processes based on a program loaded on the HDD 6 used as the main storage of the system.

  Next, among the functions that the various programs installed in the HDD 6 of the code conversion apparatus 1000 cause the CPU 2 to execute, the characteristic functions provided in the code conversion apparatus 1000 of the present embodiment will be described.

  FIG. 10 is a block diagram illustrating a functional configuration of the code conversion apparatus 1000. In FIG. 10, reference numeral 1000 denotes a code conversion apparatus according to the present invention, which takes in a code stream (input code stream) 1001 of a file to be converted and has the same contents as the input code stream 1001 and has a more compact file size. An operation of converting to a code stream (output code stream) 1002 is performed. Note that the input code stream 1001 and the output code stream 1002 have the same syntax, and sharing / referencing of BOX information is permitted.

  The code conversion apparatus 1000 includes a BOX decomposition unit 1003 that extracts BOX information from the input code stream 1001 for the conversion, a sharing / reference determination unit 1004 that determines whether to perform sharing / reference processing on the extracted BOX information, According to the result of the determination by the sharing / reference determining unit 1004, it includes a sharing / reference processing unit 1005 that performs processing for necessary sharing or reference regarding the BOX information cut out from the input code stream 1001.

  FIG. 11 is a flowchart showing an example of the processing flow of the code conversion apparatus 1000. The processing contents of the “sharing process” and “reference process” called in step S9 in this flowchart are shown in FIGS.

  Prior to the description of the operation of the code conversion apparatus 1000, the operation image of the sharing / referencing process will be described with reference to FIGS.

  FIG. 14 shows an example in which the same image is rendered on the page in five places with different sizes. Each of the code data of these five images 0, 1, 2, 3, 0 ′ is accompanied by “Riooh copyright” that is not the object of rendering and metadata with a copyright notice. And

What can be shared / referenced depends on the code format. For example, in the case of the code format described in Non-Patent Documents 2 and 3,
-The sharing target is the header of metadata and BOX information.-The reference target is the code stream.

  Therefore, in the following description, a JPM file (ISO 15444-6) defined in Non-Patent Document 2 will be described as an example of a conversion target file. However, the present invention is not limited to JPM files, but can be applied to similar code formats having a sharing / reference mechanism. For example, a file conforming to ISO 15444-2, a file conforming to ISO 15444-3, or a file conforming to the PDF specification.

  FIG. 15 shows an image of metadata in the file in the page as shown in FIG. In FIG. 15, (a) shows a file without sharing metadata. Each image 0, 1, 2, 3, 0 'has a layout object "Layout Object Box", and it is shown that the metadata "Riooh copyright" consisting of 15 characters is contained in the metadata part of each. Yes. Since there are a total of five such layout objects for each image, the metadata portion contains a total of 75 bytes (= 15 × 5) of data.

  FIG. 15B is an image of a file to which the shared data described in detail in “B.1.8” of Non-Patent Document 2 is applied. That is, the metadata “Riooh copyright” is registered together with the ID in the “Shared Data Entry Box” 42 in the JPM file, and the metadata is entered by entering the ID of the shared data in the metadata portion 43 of the layout object corresponding to each image. Sharing is realized. In this case, 17 bytes of “Shared Data Entry BOX” (= 2 bytes of ID + 15 bytes of metadata) and 2 bytes of ID in each reference destination (here there are 5 places, a total of 10 bytes) are required. Therefore, the total number of bytes is 27 bytes. Therefore, the size can be compressed as much as 48 bytes (= 75-27) compared with the case where the metadata is not shared.

Next, the case of reference will be described. Reference is to the codestream. In FIG. 14, assuming that the five images differ only in position and size, and that the images generated by specifying the reduction ratio have exactly the same contents, as shown below,
The image 3 has a size of 1/64 at the position (x3, y0).
The image 2 has a size of 1/16 at the position (x2, y0).
The image 1 has a size 1/4 at the position (x1, y0).
Image 0 has size 1/1 at position (x0, y0).
The image 0 ′ has a size ¼ at the position (x0 ′, y0 ′).
Each will be rendered.

FIG. 16 shows the structure in this JPM file. FIG. 16A shows a file without reference, which contains five independently encoded code streams “CodeStream” corresponding to the images 0, 1, 2, 3, 0 ′. . Although the encoding is variable length, for the sake of simplicity, the code length is assumed to be proportional to the size of the image, and assuming that the approximate size of each codestream is as shown below, for example,
CodeStream3 size = 1KB
CodeStream2 size = 4KB
CodeStream1 size = 16KB
CodeStream0 size = 64KB
CodeStream0 'size = 16KB
The total size is 101 KB.

  On the other hand, FIG. 16B shows a file to which reference is applied. Since each image 0, 1, 2, 3, 0 ′ is assumed to be an image that can be uniquely determined by the reduction ratio, these five code streams are represented by one “Codestream 0”, and from the beginning of the file to Code Stream 0 The length “length” 45 of the offset “offset” 44 and “CodeStream 0” is obtained and written in each reference destination. Each reference destination has “ScaleBox” information indicating the size. By specifying a ratio between the size of the image when the codestream to be referred to is expanded and the size of the rendered image ( The same image as in the case of a) can be reproduced.

  Since the data size at this time is 64 KB of “CodeStream0”, the size can be saved by approximately 37 KB (= 101 KB−64 KB) as compared with the case of (a) where reference is not made. Note that the code stream name written in the case of FIG. 16A has the effect of reducing by writing the offset / length pair in the case of FIG. 16B, but this is insignificant. It is excluded from the above calculation.

  In the present invention, when referring to a partial code, a reference unit can be specified as a logical unit of a reference-side code. That is, the reference unit can be set for each resolution, color component, position, and image quality. When the reference unit is set for each color component, the reference unit can be set for each precinct or tile.

  The above is the description of the sharing / referencing operation image. Needless to say, sharing / referencing is a reversible transformation.

  Next, the operation of the code conversion apparatus 1000 of the present invention will be described along the flowchart of FIG.

  First, in step S1, an input buffer and an output buffer are prepared. The code stream of the pre-conversion file (input code stream 1001) is taken into the input buffer. The output buffer is initialized.

  In step S2, the BOX decomposition unit 1003 checks whether the input code stream 1001 is at the end. If not, the process proceeds to step S3, where one piece of BOX information is cut out from the beginning of the input code stream 1001 in the input buffer and input to the BOX information (A).

  Next, the sharing / reference determining unit 1004 checks whether sharing / referencing of the BOX information (A) is permitted in step S4. If it is determined in step S4 that the file size is not permitted, there is no room for reducing the file size by sharing / referencing, and the process returns to step S2.

  On the other hand, if it is determined in step S4 that sharing / referencing is permitted, the process proceeds to step S5. In this step S5, the sharing / reference determining unit 1004 describes whether the contents of the BOX information (A) are described in the shared data format in the file and a valid ID inside the file, or the necessary “FLAGMENT TABLE”. Check whether the offset and length from the beginning of the file to the reference part are written via The former is shared, and the latter is a reference. If it is either format, the format has already been shared / referenced, so the processing returns to step S2. On the other hand, since there is a possibility that sharing / referencing is possible in either format, the process proceeds to step S6 in order to find an object to be shared.

  Steps S6 to S10 are steps for detecting whether there is a target that can be shared / referenced in the input code stream 1001 and performing a corresponding process.

  First, in step S6, the BOX decomposing means 1003 cuts out the last BOX information of the input code stream 1001, and sets it in the BOX information (B). In step S7, the sharing / reference determination unit 1004 checks whether the position of the BOX information (B) is behind the BOX information (A). If the positions match, it is determined that there is no target that can be shared / referenced after the position of the BOX information (A), and the process proceeds to step S10. If not, the process proceeds to step S8.

  In step S8, the sharing / reference determination unit 1004 checks whether the contents of the BOX information (A) input earlier and the contents of the BOX information (B) are the same. If the contents do not match, the process returns to step S7 to check the previous BOX information, but if the contents match, it becomes a share / reference candidate, and the process proceeds to step S9.

  In step S9, the sharing / reference processing unit 1005 performs a procedure for updating the BOX information (A) as sharing or reference data of the BOX information (B) according to a predetermined rule. Whether to share or reference is determined in advance, or depending on the file specification, there are certain rules such as allowing only sharing or referencing in some cases, so that it should comply with them.

  For example, ISO 15444-6 (Information technology-JPEG2000 Image Coding System-Part6: Compound Image File Format) allows sharing and reference within the same file as the BOX information (A), but other specifications conforming to this specification Only reference to the BOX information in the JPM file is allowed.

  The sharing / reference processing means 1005 performs the sharing process shown in FIG. 12 when sharing is selected in step S9, and performs the reference process shown in FIG. 13 when selecting the reference, whereby the BOX information (A) and Since the BOX information (B) is associated, the BOX information (A), “cross reference table”, and “Fragment Table” are written to the output buffer in the next step S10. Then, the process returns to step S2 for processing the next BOX information.

Such a series of operations is performed up to the end of the input code stream 1001. When the end of the input code stream 1001 is detected in step S2 (step S2, Y), the sharing / reference processing unit 1005 proceeds to post-processing.

  The content of post-processing differs depending on whether the BOX information (A) is shared or referenced. In the case of sharing, the BOX information (B) (information contained in the sharing entry BOX) detected as sharing in the previous operations is also replaced with the reference ID. On the other hand, in the case of reference, since the portion corresponding to the BOX information (A) of the input stream in the reference processing portion has been updated to the offset and length, there is no replacement target, so no special processing is necessary. This post-processing (step S11 to step S18) will be further described.

  First, in step S11, sharing / reference is distinguished as in step S9. In the case of reference, since there is no particular post-processing, the process proceeds to step S18.

  On the other hand, in the case of sharing, the process proceeds to step S12, and the contents of the first entry of the shared entry BOX are copied to the Buffer. In the next step S13, it is checked whether or not the contents of Buffer are “null”. Since “null” indicates the end of the shared entry BOX, if “null”, the process proceeds to step S18.

  If it is not “null”, BOX information (B) for the entry is searched from the input code stream 1001. That is, in step S14, it is checked whether or not the content of the BOX information (B) is the same as that of the Buffer sequentially from the end of the input stream (or from the beginning). If they do not match, the same operation is repeated for the next BOX information (B) to search for a matching portion.

  If a matching part is found in step S14, the process proceeds to step S15, and the BOX information (B) is updated to the reference ID for the corresponding entry written in the shared BOX. In step S16, it is checked whether there is a cross reference BOX. When there is a cross reference BOX, the offset value is shifted by this update. Therefore, there is no particular processing when there is no cross reference BOX, but when there is a cross reference BOX, the offset value is corrected in step S17.

  Since it is known that the BOX information (B) matches only one entry in the shared BOX in the processing from step S1 to step S10, after step S17, the search is not performed to the end of the input code stream 1001. The next entry of the shared BOX is pointed out, and the same operation is repeated for steps S13 to S17. If it is detected in step S13 that the entry is the last entry in the shared BOX, the process proceeds to step S18, where the cross reference BOX, “Flagment List BOX” is written to the output buffer, and the process ends.

  The contents of the sharing process and the reference process called in step S9 are as shown in FIGS. That is, as shown in FIG. 12, in the sharing process, first, a new entry is created in the shared entry BOX and its reference ID is assigned.

  Next, after the contents of the BOX information (A) are moved to the shared entry BOX, the contents are updated to the reference ID. By this operation, the contents of the referenced shared entry BOX and the referenced BOX information (A) are associated. At this time, the size of the BOX information (A) is reduced by rewriting the BOX information (A) with the reference ID.

  Therefore, the offset from the beginning of the file to the reference position varies with respect to another group having the BOX information referenced after the BOX information (A) in the file. Therefore, the relationship between the two is maintained by subtracting from the previous offset value by “size before change−size after change” of the BOX information (A). This completes the sharing process. FIG. 17 is an example showing a case where a common logo mark is printed across a plurality of pages of a document.

As shown in FIG. 13, in the reference process, first,
-Offset from the beginning of the file to the BOX information (B)-Find the length of the BOX information (B).

  Enter the offset and length in the “Fragment List BOX” linked from the cross-reference BOX. In the BOX information (A), the corresponding entry of the cross reference BOX (in the configuration in which another cross reference BOX is generated each time reference is made) is recorded. Thereby, the reference side and the reference side can be associated. In addition, since the size of the BOX information (A) is reduced by changing this value, for the same reason as described in the shared operation part, the contents in the cross-reference BOX (or “Fragment List BOX”) When the BOX information after the position of the BOX information (A) is also referred to for the offsets of other entries, the offset value before the changed size from the size before the BOX information (A) is changed. By subtracting from, the relationship between the two is maintained. This completes the reference process.

  According to the code conversion apparatus 1000 of the present invention, as described above, the sharing / reference processing for the redundant contents of a file is performed in a reference unit, which is a unit of logical unit of codes, so that the file size is converted. It can be further reduced.

  Next, the invention of claim 2 will be described. According to the second aspect of the present invention, the code conversion apparatus 1000 can perform the sharing / referencing process for data of a local file or a remote file other than the file to be converted (own file). The contents will be specifically described with reference to FIG.

  In FIG. 18, reference numeral 1101 denotes a file to be converted (referred to as a self file). Reference numerals 1102, 1103, and 1104 denote other files that are shared / referenced within the own file, the files 1102 and 1103 are local files, and the file 1104 is a remote file on the network 1105 such as the Internet.

  Here, the self file 1101 will be described as a JPX file shown in Non-Patent Document 3, but it goes without saying that it may be a file of another specification having the same mechanism as the JPX file.

  The JPX file has several areas called “Media Data”. This is a data fragment corresponding to “CodeStream” in FIG.

In the example shown in FIG. 18, seven entries are registered in the “Fragment List Box”.
・ The 1st, 4th, 5th and 7th data are the data in the local file 1101 ・ The 2nd and 3rd data are the data in the local file 1102 and 1103 ・ The 6th data is the data in the remote file 1104 ing.

  Reference of data in the local file is performed as follows. There is a “Data Reference BOX” in its own file 1101. In the example of FIG. 18, three entries are shown. By specifying the location and file name of each file by URI (Uniform Resource Identifiers), another file is referred to.

First, whether the reference destination is in its own file or in another file is uniquely determined by the DR (Data Reference) bit of “Fragment List”. If the DR bit is 0, the reference destination is in the own file, but if it is 1, the reference destination is in another file.

  Then, which part in the other file is to be referred to is specified by a set of offset and length written in the corresponding entry of “Fragment List” in “Fragment Table”. If this is done, the file size is reduced by performing sharing / reference processing of the contents of other files by referring to the same mechanism as when referring to the “Media Data” fragment in the self-file described above. be able to.

  When the other file to be referred is a remote file on the network, the reference method is as follows.

  Since the “Data Reference table” in the “Data Reference Box” is generally described with a URI, when referring to a remote file on the network, enter the name on the network in the “Data Reference table”. Thus, the corresponding part can be referred to by the offset and the length specified by “FragmentList” by the same mechanism as the access of the other local file fragment described above. Thus, the file size can be reduced by sharing / referencing the contents of the remote file.

  Next, the invention of claim 3 will be described. According to the third aspect of the present invention, the code conversion apparatus 1000 is provided with means (not shown) for inputting an instruction for designating or not designating a BOX to be shared / referenced by the user.

  The operation when the user specifies a BOX to be shared / referenced will be described with reference to FIG. For convenience of explanation, FIG. 19 will be described using data in the real space. Needless to say, in actual sharing / referencing, BOX information such as encoded data and metadata of an image corresponding thereto is an operation target. .

  Now, an example of referring to code data on Page 1 that has already been created while editing Page 100 will be described. Here, Page 100 is a page explaining the scaling of the color image, and Page 1 is a page explaining the scaling of the monochrome image.

  In creating Page 100, considering the processing independent of the luminance component and color difference component of the color image and the ease of explanation, the portion created by Page 1 can be used as it is (images 0, 1, 2, and 2). 3) There are 40 and a newly created portion (image 0 ′) 41. Here, the images 0, 1, 2, and 3 can explicitly indicate the codes for the images that are referred to in the file by designating the user to refer to the images 0, 1, 2, and 3 of Page 1, respectively. This operation can be realized by checking whether or not the specified image is in Page 1 and if there is no error, if there is an error, enter the offset and length in the “Fragment List” shown in FIG. Since this is a simple operation, the flowchart is omitted here.

  Since the code for the new image 0′41 has no reference anywhere in the document, it is described as a new code in the corresponding part in the file.

  If the image to be referred to is not explicitly specified, the operation becomes more complicated, but since it has already been described in detail with reference to FIG. 18, the description thereof is omitted here. Even in the case of sharing, there are some differences such as registration in the shared entry BOX without specifying by offset and length, and conversion to a reference ID, but the difference will be explained in detail using FIG. 19 and FIG. As you can see, data that can be shared / referenced and data that you do not want to share / reference can be deliberately divided, so that the image part that will be edited in the future can be edited before and after editing. Since the file size does not fluctuate greatly, the possibility of being unable to save after editing due to the limitation of the free disk space is reduced. In addition, by creating a file that does not depend on external reference data, such as other local files or remote files, or by consolidating shared / reference data, create a document that is easy to see and has a beautiful finish throughout the document. Can be controlled.

  When the user does not specify the BOX to be shared / referenced, all the BOXes in the file are targeted, and the operation is as described with reference to FIGS. By performing the sharing / referencing process for all BOXes that can be shared / referenced, the highest lossless compression rate can be realized.

  Next, inventions of claims 4, 5 and 6 will be described. According to these inventions, the code conversion apparatus 1000 generates a status report indicating conversion contents in the sharing / reference processing unit 1005 and outputs the status report to the outside. This will be described with reference to FIG.

  FIG. 20 shows an example of a status report generated when the sharing process shown in FIG. 15 is performed. The first half portion 46 of FIG. 20 shows the correspondence before and after conversion of each BOX. In each BOX, the state before conversion is shown before “→”, and the state after conversion is shown after “→”. The latter half 47 of FIG. 20 shows the change in file size due to conversion.

  Hereinafter, the contents shown in FIG. 20 will be described taking the JPM file shown in ISO 15444-6 as an example. However, it goes without saying that this description can also be applied to other file structures that perform similar functions.

First, “→ Shared Data Entry BOX [1]”
Reference ID = 0
Shared Data = “Riooh copyright”
Is shown to have been created. In the next “Page BOX”
Layout Object Box3
Layout Object Box2
Layout Object Box1
Layout Object Box0
Layout Object Box0 '
Each "Metadata Boxes [1]" has reference ID = 0
It shows that it was filled in.

And
Size newly created by conversion = 28 bytes Size deleted by conversion = 80 bytes Size reduced by conversion = 52 bytes (= 80-28)
It is shown that.

Here, the newly created size breakdown is
Shared Data Entry Box
ID = 2 bytes
Shared Data = “Riooh copyright \ 0” = 16 bytes (1 byte of \ 0 is entered as the last delimiter of the character string)
“Metadata Boxes [1]” for each “Layout Object Box”
ID = 2 bytes × 5 places.

  The deleted size is “Metadata Boxes [1]” of each “Layout Object Box”. Before the change, “Riooh copyright \ 0” = 5 bytes were written in 5 places, but this was deleted. Minutes.

  Then, it is reported that 52 bytes have been reduced as a whole file due to the difference between the two bytes.

  The case of sharing has been described above. In the case of reference, how the correspondence is performed before and after conversion in the example of FIG. 16 and how the file size changes by referring to the algorithm described so far. This can be explained in the same way.

  Note that, as seen in the example of the status report shown in FIG. 20, since a status report corresponding to each object that is shared / referenced is output, the correspondence between the objects that are the targets of sharing / referencing can be easily established. It can be confirmed (Claim 5), and since the size reduced by the conversion is shown, the effect of sharing / referencing can be easily confirmed (Claim 6).

  In addition, the status report may be changed in the reference unit so as to indicate that it is being created / examined / approved. Further, in the status report, the reference unit may be changed so as to indicate creation / editing / deleted.

  Next, inventions of claims 7, 8, 9, and 10 will be described. As already described with reference to FIG. 18, in order to refer to a remote file, if the reference range cannot be designated, it takes a considerable amount of time for the conversion process for all the files in the world. Therefore, it is necessary to limit the target range by designating a network range such as the Internet shown as an example in FIG. According to the seventh, eighth, and ninth inventions, means (not shown) for the user to specify such a reference range is added to the code conversion apparatus 1000.

  By default, it may be within the segment to which you belong, but here the number of hops that pass through the router around the segment to which you belong, the domain that is managed by the network administrator, or the network administrator In addition, the range of work groups combined for a common purpose or the range can be specified by a list of URLs to be referred to.

  For these, the range on the network can be defined, and each will operate as described in detail in the network related materials. The relationship between the scope of reference and its effects can be managed accurately. According to the invention of claim 8, the remote file reference range is specified by the number of hops, according to the invention of claim 9, it is specified by a domain name or a list thereof, and according to the invention of claim 10. For example, it is specified by a workgroup name or a list thereof.

  Next, inventions of claims 11, 12, and 13 will be described. Refer to FIG. 21 for the explanation here.

FIG. 21 is a diagram showing unification and complementation of page thumbnails. Here, for the sake of simplicity, there is a document with a total of 8 pages and 2 pages for each season, with the document name “Four Seasons”. Each page is created by a separate person. Take as an example the case of creating by integrating afterwards. In such a case, for example, as shown in FIG. 21 (a), the page thumbnails 48 are usually irregular. The contents of each page thumbnail are as follows.
"Page""Theme""Contents of icon"
P1 Spring Azalea P2 Spring None (not consistent with P1 in the same spring)
P3 summer sunflower P4 summer morning glory (not the same as summer P3)
P5 Autumn None P6 Autumn Colored leaves (not aligned with P5 in the same autumn)
P7 winter snowman 1
P8 Winter Snowman 2 (not aligned with P7 in the same winter)

  As shown in FIG. 21B, it is assumed that the page thumbnails are unified for each season and the appearance of the document is adjusted.

  When this document is encoded by the encoding method shown by ISO15444-6 shown in Non-Patent Document 2, each page thumbnail is the first “Layout object Box” (layout object BOX) of “Page BOX” shown in FIG. Therefore, when the reference processing is performed according to the procedure described with reference to FIGS. 18 and 20, the thumbnail of P2 is made the same by referring to the thumbnail of P1. Even if the thumbnails of P3 and P4 are the same summer thumbnail, the pattern is not uniform. For example, by referring to the thumbnail of P3, the same offset and length as the code stream written in the first layout box of P4 , P3 and P4 thumbnails can be unified. Similarly, the page thumbnail of P6 is referred to by P5, and the thumbnail of P7 is referred to by P8, so that the page thumbnails are unified for each season as shown in FIG. Note that reference numeral 49 in FIG. 21 denotes a document thumbnail.

  By the above operation, it is possible to unify the page thumbnails common to each page of the same theme, so that not only the document format is prepared but also the file size is reduced. The above is the description of the invention of claim 11, and this also serves as the explanation of the invention of claim 12.

  That is, according to the invention of claim 12, when there is no page thumbnail of a certain page, the page thumbnail of another page is referred to, and this has already been described in the example of referring to the thumbnail of P2 and the thumbnail of P1. As well as being able to arrange the document format, the file size can be reduced.

According to the invention of claim 13, each document is unified with a common document thumbnail. Although FIG. 21 shows unification and complementation of page thumbnails, the same operation is performed on document thumbnails across documents. The specific operation is as follows in the above description of the invention of claim 11.
(1) Page thumbnails as document thumbnails (2) “Contigeous Codestream BOX”, which is the sixth layout box from the top of FIG.
(3) There is no reference in its own file, and it may be understood by replacing each other local file or remote file.

  The invention according to claim 14 is characterized in that a file conforming to ISO 15444-2 is processed. That is, since the JPX file shown in Non-Patent Document 3 has a structure for sharing / referencing, it is possible to perform reversible recompression while maintaining international standard compatibility by executing the conversion process described above. .

  The invention of claim 15 is characterized in that a file conforming to ISO 15444-3 is processed. In other words, since the MJ2 file conforming to ISO 15444-3 has a structure for sharing / referencing, reversible recompression can be performed while maintaining international standard compatibility by executing the conversion process described above.

  The invention of claim 16 is characterized in that a file conforming to ISO 15444-6 is processed. That is, since the JPM file shown in Non-Patent Document 2 has a structure for sharing / referencing, it is possible to perform reversible recompression while maintaining international standard compatibility by executing the conversion process described above. .

  The invention of claim 17 is characterized in that a file conforming to the PDF specification is processed. That is, since the PDF file has a structure for sharing / referencing, lossless recompression is possible while maintaining PDF compatibility by executing the conversion process described above.

1 is a functional block diagram of a system that realizes a hierarchical encoding algorithm that is the basis of an encoding / decoding scheme based on a discrete wavelet transform that is a premise of the present invention. It is explanatory drawing which shows the rectangular area | region where each component of the original image was divided | segmented. It is explanatory drawing which shows the subband in each decomposition level when the number of decomposition levels is three. It is explanatory drawing which shows a precinct. It is explanatory drawing which shows an example of the procedure which ranks a bit plane. It is explanatory drawing which shows schematic structure for 1 frame of code sequence data. It is explanatory drawing which shows the code stream structure which represented the packet in which the encoded wavelet coefficient value was accommodated for every subband. It is a schematic diagram which shows the data structure of a JPM file. It is a block diagram which shows the hardware constitutions of the code converter of this Embodiment. It is a block diagram which shows the function structure of a code converter. It is a flowchart for operation | movement description of a code converter. It is a figure which shows the flow of a process in the sharing process called by step S9 in FIG. It is a figure which shows the flow of a process in the reference process called by step S9 in FIG. It is a figure which shows the example of a rendering image. It is a figure which shows the example of the JPM file which shares the same copyright display metadata written in each layout object of FIG. It is a figure which shows the example of the JPM file which made the file without a reference the file with a reference, and was made compact. It is a figure which shows a common part over several pages. It is a figure for demonstrating operation | movement when referring to the information in another file with a JPX file. It is a figure which shows the image in the case of designating BOX to refer / do not. It is a figure which shows the example of a status report after the sharing process of FIG. It is a figure explaining unification and complementation of a page thumbnail. It is a figure which shows the syntax of sequential DCT, progressive DCT, and lossless DCT. It is a figure which shows the conceptual structure of a JPM file.

Explanation of symbols

30 Entropy-coded segment 0 (entropy-coded segment 0)
31 Entropy-coded segment n (entropy-coded segment n)
32 End symbol for restart interval 33 scan1
34 frames 35 SOI marker segment 36 EOI marker segment 37 Contiguous Codestream Box
38 Metadata Boxes
40 Reference code 41 Non-reference code 42 Shared Data Entry Box
43 Shared Data Reference Box
44 Offset 45 Length 46 Object part of status report 47 Statistics part of status report 48 Page thumbnail 49 Document thumbnail

Claims (28)

A code conversion device that takes an input code stream of a code format that defines sharing or reference as BOX information as a conversion target file, and converts this input code stream into an output code stream of a more compact file size having the same contents as the conversion target file. And for the conversion,
BOX decomposition means for cutting out BOX information from the input code stream;
Sharing / reference determination means for determining whether to perform sharing processing or reference processing on the BOX information cut out by the BOX decomposition means;
Share / reference processing means for performing necessary sharing or reference processing on the BOX information cut out by the BOX decomposing means according to the result of determination by the sharing / reference determining means;
Have
The sharing / reference processing means can designate a reference unit as a logical unit of a code on the side referred to when referring to a partial code.
The code conversion apparatus characterized by the above-mentioned. The contents of a local file or remote file other than the conversion target file are also subject to reference or sharing in the conversion.
The code conversion apparatus according to claim 1. A means for a user to input an instruction for designating or not designating BOX information shared or referenced in the conversion;
The code conversion apparatus according to claim 1 or 2, characterized in that Means for generating a status report indicating the contents of the conversion;
The code conversion apparatus according to claim 1 or 2, characterized in that The content of the conversion is indicated for each object shared or referenced by the conversion in the status report.
The code conversion apparatus according to claim 4. The status report includes the size reduced by the conversion,
The code conversion apparatus according to claim 4. Further comprising means for a user to specify a range of remote files referenced in the conversion;
The code conversion apparatus according to claim 2. The range of remote files referenced in the transformation is specified in hop counts;
The code conversion apparatus according to claim 7. A range of remote files referenced in the conversion is specified by a domain name or list thereof;
The code conversion apparatus according to claim 7. A range of remote files referenced in the conversion is specified by a workgroup name or list thereof;
The code conversion apparatus according to claim 7. The page thumbnail is unified by the reference process in the conversion.
The code conversion apparatus according to claim 1 or 2, characterized in that A page thumbnail of another page is referred to for a page that has no page thumbnail in the conversion.
The code conversion device according to claim 11. Document thumbnails are unified by reference processing in the conversion.
The code conversion device according to claim 11. The conversion target file is a file conforming to ISO 15444-2.
The code conversion apparatus according to claim 1 or 2, characterized in that The conversion target file is a file conforming to ISO 15444-3.
The code conversion apparatus according to claim 1 or 2, characterized in that The conversion target file is a file conforming to ISO 15444-6.
The code conversion apparatus according to claim 1 or 2, characterized in that The conversion target file is a file conforming to the PDF specification.
The code conversion apparatus according to claim 1 or 2, characterized in that The reference unit by the sharing / reference processing means can be set for each resolution.
The code conversion apparatus according to claim 1. The reference unit by the sharing / reference processing means can be set for each color component.
The code conversion apparatus according to claim 1. The reference unit by the sharing / reference processing means can be set for each position.
The code conversion apparatus according to claim 1. The reference unit by the sharing / reference processing means can be set for each image quality.
The code conversion apparatus according to claim 1. The reference unit by the sharing / reference processing means can be set for each precinct.
The code conversion apparatus according to claim 19. The reference unit by the sharing / reference processing means can be set for each tile.
The code conversion apparatus according to claim 19. The reference unit is changed to indicate that the status report is being created / reviewed / approved,
The code conversion apparatus according to claim 4. The reference unit is changed to indicate that the status report is being created / edited / deleted,
The code conversion apparatus according to claim 4. A code conversion method for converting an input code stream of a code format that defines sharing or reference into BOX information into an output code stream of a more compact file size having the same contents as that, for the conversion,
A BOX decomposition step of extracting BOX information from the input code stream;
A sharing / reference determination step for determining whether to perform a sharing process or a reference process on the BOX information cut out by the BOX decomposition step;
A sharing / reference processing step for performing necessary sharing or reference processing according to the determination result of the sharing / reference determination step with respect to the BOX information cut out by the BOX decomposition step;
Have
In the sharing / reference processing step, a reference unit can be specified as a logical unit of a reference code to be referred to when a partial code is referred to.
A code conversion method characterized by the above. To convert an input codestream in a code format that defines sharing or reference to BOX information into a more compact file size output codestream with similar content,
A BOX decomposition step of extracting BOX information from the input code stream;
A sharing / reference determination step for determining whether to perform a sharing process or a reference process on the BOX information cut out by the BOX decomposition step;
A sharing / reference processing step for performing necessary sharing or reference processing according to the determination result of the sharing / reference determination step with respect to the BOX information cut out by the BOX decomposition step;
And execute
In the sharing / reference processing step, a reference unit can be specified as a logical unit of a reference code to be referred to when a partial code is referred to.
A program characterized by that.   A computer-readable recording medium on which the program according to claim 27 is recorded.

Images