JPH06152989A - Picture processor - Google Patents

Abstract

PURPOSE:To provide a picture processor in which the leakage, destruction, and rewriting of information can be prevented at the time of preserving or transmitting picture data. CONSTITUTION:A reading circuit 2 transmits the read picture data of an original to an RAMb 3. A reducing circuit 4 reduces the picture data stored in the RAMb 3, and transmits the data to an RAMc 5. A CODEC 6 operates a hierarchical encoding by an arithmetic operation by referring to the picture data stored in the RAMb 3 and the RAMc 5, and transmits the encoded data to a transmission buffer 11 or the like. A CPU 1 scramble-processes the encoded data stored in the transmission buffer 11.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing apparatus, for example, an image processing apparatus such as a facsimile machine to which hierarchical coding is applied.

[0002]

2. Description of the Related Art Conventionally, MH and MR have been used as image compression techniques.
Although encoding has been generally used, there is a problem that a sufficient compression rate cannot be obtained in an image having a large amount of information such as halftone. On the contrary,
In recent years, advances in LSI technology have made it possible to use compression methods by hierarchical encoding, and it becomes possible to digitize document images with a sufficient compression rate, and to save a large number of document images. Easy transmission.

[0003]

However, the above conventional example has the following problems. That is, with the progress of computerization of information, many cases of information leakage, destruction, and rewriting have become a social problem.

[0004]

SUMMARY OF THE INVENTION The present invention is intended to solve the above problems, and has the following structure as one means for solving the above problems. That is, coding means for hierarchically coding image data, storage means for storing code data coded by the coding means according to the hierarchy of the code data, and code data stored in the storage means. The image processing apparatus is provided with an encryption means for encrypting.

The first decryption means for decrypting the encrypted data, the storage means for storing the hierarchical code data output from the first decryption means according to the hierarchy of the code data, and the storage means. A second decoding means for decoding the stored code data, wherein the second decoding means is an image processing device for outputting image data.

[0006]

With the above configuration, it is possible to provide an image processing apparatus for hierarchically encoding and encrypting image data. Further, with the above configuration, it is possible to provide an image processing device that decrypts encrypted data, decrypts the decrypted hierarchical code data, and outputs image data.

For example, with the above configuration, it is possible to provide an image processing apparatus that prevents information leakage, destruction, rewriting, and the like when storing or transmitting image data.

[0008]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A facsimile machine according to an embodiment of the present invention will be described below in detail with reference to the drawings. In the following, an embodiment in which the present invention is applied to a facsimile apparatus will be described, but it goes without saying that the present invention is not limited to this and can be applied to other image processing apparatuses.

[0009]

[First Embodiment] FIG. 1 is a block diagram showing a configuration example of the present embodiment. In the figure, reference numeral 1 denotes a CPU, which controls the whole of the present embodiment via a CPU bus 1a according to a program stored in a ROM 9 and the like, and encodes and decodes for scrambling image data. Also run.

Reference numeral 10 is a RAMa, which is used as a work memory for the CPU 1. 2 is a reading circuit, which is a drive system 12
The image of the original document conveyed by is read and sent to the RAMb3. A reduction circuit 4 reduces the image data stored in the RAMb3 and sends it to the RAMc5. Further, the reduction circuit 4 can reduce the image data of the image data stored in the RAMc 5 and send it to the RAMb 3.

Reference numeral 6 is an encoder / decoder CODEC, which is a RAM
b3, referring to the image data stored in RAMc5,
Hierarchical encoding is performed by calculation, and the encoded data is sent to the image storage RAM 14 or the transmission buffer 11.
Further, the CODEC 6 decodes the coded data of the image storage RAM 14 or the transmission buffer 11 to generate the RAMb 3
Alternatively, it is possible to sequentially form the image data on the RAMc 5 according to the layer of the decoded image data.

The transmission buffer 11 is a CODEC.
6 or the image data formed by the CPU 1 is temporarily held. 7 is a network control unit NCU, 8 is a modulator / demodulator MO
In the DEM, the MODEM 8 modulates the image data sequentially input from the transmission buffer 11 and, via the NCU 7,
Sends modulated data to telephone lines. In addition, when receiving data from a telephone line, MODEM8 is NC
The modulated data sequentially input from U7 is demodulated and output to the transmission buffer 11.

A recording unit 13 records an image according to the received image data. Reference numeral 15 denotes a display / operation unit for displaying the operation state of the present embodiment and receiving instructions from the operator. Next, the transmission operation of this embodiment will be described. FIG. 2 is a flow chart showing an example of the transmission procedure of this embodiment.

In the figure, this embodiment is based on step S1.
In step 1, the operator waits for a transmission instruction from the operator via the display / operation unit 15, and when the transmission instruction is received, the process proceeds to step S12. Next, in the present embodiment, in step S12, the document is read by the reading circuit 2 and COD
The image data read by the EC6 is hierarchically encoded. Next, in this embodiment, in step S13, it is determined whether or not all the pages of the original have been read, and if all the pages have been read, the process proceeds to step S14. Return to step S12.

When the reading of all the pages is completed, this embodiment controls the NCU 7 in step S14 to make a call,
In step S15, which will be described in detail later, the encoded image data is transmitted, and then the process ends. The transmission procedure at step S15 complies with CCITT recommendation T.30. FIG. 3 is a flow chart showing an example of the document reading procedure in step S12.

In the figure, this embodiment is based on step S2.
In step 1, the image data for one page is stored in the RAMb3, and in step S22, the image data stored in the RAMb3 is reduced by the reduction circuit 4 and stored in the RAMc5. Subsequently, in the present embodiment, in step S23, the CODEC 6 refers to the image data in the RAMb3 and RAMc5 to execute the hierarchical encoding of the image data, and in step S2.
At 4, the code data is stored in the image storage RAM 14.

Next, in this embodiment, in step S25,
It is determined whether or not the encoding has been performed a predetermined number of times. If the encoding has been performed a predetermined number of times, the routine returns to the routine shown in FIG. If the encoding has not reached the predetermined number of times, in the present embodiment, the image data stored in the RAMc5 is reduced by the reduction circuit 4 and stored in the RAMb3 in step S26.

Next, in this embodiment, in step S27,
The CODEC 6 refers to the image data in the RAMb3 and the RAMc5 to execute the hierarchical encoding of the image data, and in step S28, the encoded data is stored in the image storage RAM 14. Subsequently, in this embodiment, step S29 is executed.
Then, it is determined whether or not the encoding has been performed a predetermined number of times, and if the encoding has been performed a predetermined number of times, the process returns to the routine shown in FIG. 2, and if the number of times has not been reached, the process returns to step S22.

FIG. 4 is a flow chart showing an example of the transmission procedure of step S15, and shows an example of scramble transmission of hierarchically encoded image data. In this figure, in the present embodiment, initial identification is executed in step S31, it is determined in step S32 whether or not a DIS (digital identification signal) is received, and if the signal is received, step S33 follows. If the signal is not received, the process jumps to step S43, disconnects the line at the same step, and then returns to the routine shown in FIG.

When DIS is received, in the present embodiment, in step S33, it is determined whether or not the partner receiver can receive the hierarchical code, and if it can be received, the process proceeds to step S34, and the reception failure occurs. If possible, jump to step S42. In the case where the receiver of the other party can receive the hierarchical code, in the present embodiment, the digital command signal (D
(CS) + training check (TCF) is transmitted, the response is received in step S35, and step S36 is received.
Then, it is determined whether or not the CFR (reception preparation confirmation) is received, and if the signal is received, the process proceeds to step S37, and if the signal is not received, the process proceeds to step S42.

When the CFR is received, in this embodiment, in step S37, the CODEC 6 sends the RA for image storage.
The code data read page by page from M14 is decoded, and the decoded image data is stored in RAMb3 (or RAMc5). That is, in the present embodiment, by the processing opposite to the encoding processing described as an example in FIG. 3, data substantially similar to the image data read by the reading circuit 2 is reproduced on the RAMb3 (or RAMc5). It If there is an instruction from the operator to add data such as the transmission date and time, this embodiment writes the data to RAMb3 (or R) at this point.
It is added to the image data on AMc5). Further, in the present embodiment, the image data on the RAMb3 (or RAMc5) can be encoded by a system such as MR, MH, MMR, if necessary.

Subsequently, in this embodiment, in step S38,
Although details will be described later, the image data reproduced on the RAMb3 is page-encoded and the encoded data is transmitted to the buffer 1 for transmission.
Store in 1. Subsequently, in the present embodiment, step S39
Then, the code data stored in the transmission buffer 11 is scrambled. In the present embodiment, if it is not necessary to scramble, the same step is passed.

In this embodiment, only the code data of the lowest resolution image data is scrambled. This is because in the case of hierarchical encoding, high-resolution images are sequentially formed from the lowest-resolution data based on the data, so an image is formed unless the first image is formed. There is no. Therefore, by scrambling only the code data corresponding to the lowest resolution, the confidentiality of the page can be maintained.

Further, in the present embodiment, in order to scramble the code data, it is necessary to make the encryption keys of the transmitting side and the receiving side the same. Furthermore, the scramble operation is
For example, the code data is divided into blocks, and the encryption key is used as an exclusive OR or a bit shift by a combination of operations. The calculation related to scrambling is executed by the CPU 1 using the RAMa11.

Next, in this embodiment, in step S40,
Although details will be described later, as shown in FIG. 5, pages are transmitted in a hierarchical order (DS0, DS1, ..., DSn). In FIG. 5, DS0 is the scrambled code data of the lowest resolution, Dc1 is the code data of the second resolution,
..., Dcn represents code data of the nth resolution. Also,
The transmission data is packed in 256-byte units in HDLC format.

Next, in this embodiment, in step S41,
It is determined whether or not transmission of all pages is completed. If completed, the process proceeds to step S42, and if not completed, the process proceeds to step S44. If the receiver of the other party cannot receive the hierarchical code at step S33, C at step S36.
If the FR cannot be received, or step S41
When all pages have been transmitted in step S42, in this embodiment, DCN (disconnect command) is transmitted in step S42, and step S42 is executed.
After disconnecting the line at 43, the process returns to the routine shown in FIG.

If there is a page that has not been transmitted in step S41, this embodiment determines in step S44 whether or not to change the mode. If the mode is to be changed, the process returns to step S31. If the mode is not changed, the process returns to step S37. FIG. 6 is a flow chart showing an example of the page decoding procedure in step S37. In this figure, in this embodiment, in step S51, the RA for image storage is stored.
The lowest resolution data stored in M14 is decoded and RA
Accumulates in Mb5.

Subsequently, in this embodiment, in step S52,
The next resolution data stored in the image storage RAM 14 is decoded and stored in the RAM a3. Then, in this embodiment,
In step S53, it is determined whether or not the decoding is executed a predetermined number of times. If the decoding is executed a predetermined number of times, the routine returns to the routine shown in FIG. 4, and if the predetermined number of times is not reached, the processing proceeds to step S54.

If the decoding has not reached the predetermined number of times,
In this embodiment, in step S54, the image storage RAM 14 is
The next resolution data stored in is decoded and stored in the RAMb5. Subsequently, in the present embodiment, in step S55, it is determined whether or not the decoding is executed a predetermined number of times, and when the decoding is executed a predetermined number of times, the process returns to the routine shown in FIG. 4, and the predetermined number of times is not reached. If so, return to step S52.

FIG. 7 is a flow chart showing an example of the page coding procedure in step S38. In the figure, in the present embodiment, in step S61, the reduction circuit 4 causes R
Image data stored in AMb3 is reduced to RAMc5
Store to. Subsequently, in this embodiment, in step S62,
The CODEC 6 refers to the image data in the RAMb3 and the RAMc5 to execute the hierarchical encoding of the image data, and in step S63, the encoded data is stored in the transfer buffer 11.

Subsequently, in this embodiment, in step S64,
It is determined whether or not the encoding has been executed a predetermined number of times, and if the encoding has been executed a predetermined number of times, the routine returns to the routine shown in FIG. 4, and if it has not reached the predetermined number of times, the routine proceeds to step S65. If the encoding has not reached the predetermined number of times, in the present embodiment, the image data stored in the RAMc5 is reduced by the reduction circuit 4 and stored in the RAMb3 in step S65.

Subsequently, in this embodiment, in step S66,
The CODEC 6 refers to the image data in the RAMb3 and the RAMc5, executes the hierarchical encoding of the image data, and stores the encoded data in the transmission buffer 11 in step S67. Subsequently, in this embodiment, in step S68,
It is determined whether or not the encoding has been performed a predetermined number of times. If the encoding has been performed a predetermined number of times, the routine returns to the routine shown in FIG.

FIG. 8 is a flow chart showing an example of the page transmission procedure in step S40. In this figure, in this embodiment, the code data of the corresponding layer is transmitted in step S71, and it is determined in step S72 whether the transmission of the code data of all layers is completed, and if it is completed, step S7.
If not completed, the process returns to step S71.

When the transmission of the code data of all the layers is completed, in this embodiment, the Q signal is transmitted in step S73, the response is received in step S74, and step S75 is received.
Then, it is determined whether or not a PPR (partial page request) is received. If the PPR is not received, the process proceeds to step S77, and if the PPR is received, the process proceeds to step S76, and the PPR is performed in the same step. After retransmitting the requested data, the process returns to step S73.

In the case where the PPR is not received, in the present embodiment, in step S77, it is determined whether or not the MCF (message confirmation) is received.
If the MCF is not received, the process returns to step S78 and the process proceeds to step S78. When the MCF is not received, the present embodiment transmits DCN in step S78, disconnects the line in step S79, and then returns to the main routine, for example, and displays an error message on the display / operation unit 15.

As described above, this embodiment is a normal ECM.
Similar to the procedure, when a transmission error occurs, the data requested by the PPR is retransmitted. In this embodiment, as shown in FIG. 9, the control field of the HDLC format is changed to add data indicating the relationship between the frame and the hierarchical data. Further, in the present embodiment, a marker code indicating a boundary between layers may be included. Further, in this embodiment, an area indicating whether or not the layer is scrambled can be provided, which facilitates reception control.

Next, the receiving operation of this embodiment will be described. FIG. 10 is a flow chart showing an example of the receiving procedure of this embodiment. In this figure, this embodiment is based on step S
In step 91, the DIS is transmitted, and in step S92, it is determined whether or not the DCS is received. If the DCS is received, the process proceeds to step S93. If the DCS is not received, the process returns to step S91.

When DCS is received, the present embodiment executes training in accordance with the TCF received in step S93, determines in step S94 whether the training is good or bad, and if it is good, proceeds to step S94. ,Also,
If it is defective, the process proceeds to step S95, FTT (training failure) is transmitted in the same step, and then the process returns to step S92.

If the training is successful, the present embodiment sends the CFR at step S96, and at step S9.
7, the page reception is executed, which will be described in detail later. Subsequently, in this embodiment, the Q signal is received in step S98, and the process branches in accordance with the received Q signal in step S99. For example, in this embodiment, if the Q signal is MPS (multi-page signal), the process returns to step S97, if it is EOM (end of message), returns to step S91, and if it is EOP (end of procedure), proceeds to step S100. .

When the EOP is received, the present embodiment ends the processing after receiving the command in step S100. FIG. 11 is a flow chart showing an example of the page receiving procedure in step S97. In this figure, in this embodiment, data is received in step S101, and step S1 is received.
In step 02, the received data is stored in the transmission buffer 11, and in step S103, it is determined whether or not RCP (return to partial page control) has been received, and if so, step S104.
If not received, the process returns to step S101.

When the RCP is received, in this embodiment, the command is received in step S104, and step S105 is received.
Then, it is checked whether or not there is a transmission error. If there is no error, the process proceeds to step S107, and if there is an error, the process proceeds to step S106, the PPR is transmitted in the same step, and then the process returns to step S101. In this embodiment, the FLC of HDLC format, an example of which is shown in FIG.
The transmission error is detected by (frame check sequence).

If there is no transmission error, this embodiment
The MCF is transmitted at step S107, and then step S108.
Then, the received data stored in the transmission buffer 11 is scrambled and decoded to be converted into coded data. Then, in the present embodiment, in step S109, if the data of all layers are received, the process proceeds to step S110, and if there is unreceived data, the process returns to step S101.

When the data of all the layers are received, the present embodiment executes the page decoding in step S110, and then returns to the routine shown in FIG. In the above description and FIG. 11, an example in which the data of all the layers is decoded after being described has been described, but the present embodiment is not limited to this, and for example, the data of all the layers is prepared. Even if it is not connected, the decoding can be performed in the order of the received layers.

The page decoding in step S110 is
The procedure is the reverse of the page encoding shown in FIG. Further, the decoded image data is recorded on a recording paper or the like by the recording unit 13, for example. FIG. 13 is a conceptual diagram showing an example of the hierarchical image processing of this embodiment.

In the figure, the original image data read by the reading circuit 2 is, for example, one half of the resolution of 400 dpi.
The resolution is reduced one by one to obtain image data of 12.5 dpi. The transmitting side first encodes 12.5 dpi image data, further scrambles the coded data, and sends it to the receiving side. The receiving side decodes the received scramble data, decodes the code data obtained by the decoding, and stores the image data of 12.5 dpi obtained by the decoding.

Next, the transmitting side refers to the 12.5 dpi image data, encodes the 25 dpi image data, and sends it to the receiving side. The receiving side refers to the 12.5 dpi image data, decodes the received code data, and obtains 25 dp obtained by decoding.
Store the image data of i. After that, in the present embodiment, this procedure is repeated until the reading circuit 2 reads, for example, 400 dpi.
Restore the image data of. The restored image data is sent to the recording unit 13.

As described above, according to this embodiment,
By encrypting the hierarchically encoded transmission data, it is possible to prevent information leakage. further,
According to the present embodiment, since the layered data to be encrypted need only be the layered data of the lowest resolution, the encryption processing time can be shortened.

[0048]

[Second Embodiment] A second embodiment of the present invention will be described below. In the second embodiment, the same components as those in the first embodiment are designated by the same reference numerals and detailed description thereof will be omitted. FIG. 14 is a diagram showing an example of the transmission procedure of this embodiment, and FIG. 15 is a conceptual diagram showing an example of the hierarchical image processing of this embodiment.

In the above-described first embodiment, an example in which only the code data of the lowest resolution layer is scrambled has been described. However, as shown in FIGS. 14 and 13, all layers in the second embodiment are shown. Scramble the code data of. That is, the present embodiment has substantially the same effect as the first embodiment, and the confidentiality of the image data to be transmitted can be enhanced by changing the encryption key for each layer. However, it is necessary to determine the encryption key and the order of using the key in advance.

[0050]

[Third Embodiment] A third embodiment of the present invention will be described below. In the third embodiment, the same components as those in the first embodiment are designated by the same reference numerals and detailed description thereof will be omitted. FIG. 16 is a diagram showing an example of the transmission procedure of the present embodiment, and FIG. 17 is a flow chart showing an example of the page transmission procedure of the present embodiment.

In the first and second embodiments, the scrambled lowest resolution hierarchical data is transmitted together with other hierarchy data, but in the third embodiment, the scrambled lowest resolution hierarchical data is transmitted. Is transmitted separately from other hierarchical data. 17, in the present embodiment, it is determined whether or not the lowest resolution hierarchical data is transmitted in step S151, the Q signal is transmitted in step S152, the response is received in step S153, and the PPR is received in step S154. If the PPR is not received, the process proceeds to step S156, and if the PPR is received, the process proceeds to step S155, the data requested by the PPR is retransmitted in the same step, and then the process returns to step S152.

In the case where the PPR is not received, in this embodiment, in step S156, it is determined whether or not the MCF is received. If the MCF is received, the process proceeds to step S157, and the MCF is not received. If yes, step S1
Proceed to 58. When the MCF is received, in this embodiment, in step S157, "page transmission 1", an example of which is shown in FIG.
And then returns to the parent routine.

When the MCF is not received, the present embodiment transmits DCN in step S158, disconnects the line in step S159, and then returns to the main routine to display an error message on the display / operation unit 15, for example. Is displayed. That is, in this embodiment, after transmitting the lowest resolution hierarchical data, the page transmission procedure similar to that in the first embodiment is executed with the Q signal interposed.

That is, the present embodiment has substantially the same effect as that of the first embodiment, and the sender side can promptly know whether or not the encryption keys match.

[0055]

[Fourth Embodiment] A fourth embodiment of the present invention will be described below. In the fourth embodiment, the same components as those in the first embodiment are designated by the same reference numerals, and detailed description thereof will be omitted. FIG. 18 is a diagram showing an example of the transmission procedure of the present embodiment, and FIG. 19 is a flow chart showing an example of the page transmission procedure of the present embodiment.

In the third embodiment, the hierarchical data is not collectively transmitted but is transmitted for each hierarchical data. 19, in the present embodiment, it is determined whether or not the code data of the corresponding layer is transmitted in step S171, the Q signal is transmitted in step S172, the response is received in step S173, and the PPR is received in step S174. And P
If PR is not received, the process proceeds to step S176,
When the PPR is received, the process proceeds to step S175, the data requested by the PPR is retransmitted in the same step, and then the process returns to step S172.

In the case where the PPR is not received, in this embodiment, it is determined in step S176 whether or not the MCF is received. If the MCF is received, the process proceeds to step S177, and the MCF is not received. If yes, step S1
Proceed to 78. When the MCF is received, in this embodiment, in step S177, it is determined whether or not the transmission of the code data of all layers is completed, and if it is completed, the process returns to the parent routine,
If not completed, the process returns to step S171.

When the MCF is not received, the present embodiment transmits DCN in step S178, disconnects the line in step S179, and returns to the main routine, for example, and returns to the display / operation unit 15 with an error message. Is displayed. That is, in the present embodiment, the first embodiment,
In addition to the effects substantially similar to those of the second and third embodiments, when all layer data are scrambled, the sender can quickly know whether the encryption keys match or not for each layer.

[0059]

[Fifth Embodiment] A fifth embodiment of the present invention will be described below. In the fifth embodiment, the same components as those in the first embodiment are designated by the same reference numerals and detailed description thereof will be omitted. FIG. 20 is a diagram showing an example of the HDLC format of this embodiment.

That is, in the first embodiment, when HDLC framing hierarchical data, a general ECM is used.
Similarly, each frame is fixed to 256 bytes, but in the present embodiment, each frame has an arbitrary length as shown in an example in FIG. That is, in this embodiment,
In addition to the effects similar to those of the first, second, and third embodiments, when there is hierarchical data of 256 bytes or less,
The transmission time can be shortened.

The present invention may be applied to a system composed of a plurality of devices or an apparatus composed of a single device. Further, it goes without saying that the present invention can be applied to the case where it is achieved by supplying a program to a system or an apparatus.

[0062]

As described above, according to the present invention, it is possible to provide an image processing apparatus for hierarchically encoding and encrypting image data.
Further, according to the present invention, it is possible to provide an image processing apparatus that decrypts encrypted data, decrypts the decrypted hierarchical code data, and outputs image data.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration example of an embodiment according to the present invention.

FIG. 2 is a flow chart showing an example of a transmission procedure of the present embodiment.

FIG. 3 is a flow chart showing an example of a document reading procedure of the present embodiment.

FIG. 4 is a flow chart showing an example of a transmission procedure of this embodiment.

FIG. 5 is a diagram showing an example of a transmission procedure of the present embodiment.

FIG. 6 is a flowchart showing an example of a page decoding procedure according to this embodiment.

FIG. 7 is a flow chart showing an example of a page encoding procedure of the present embodiment.

FIG. 8 is a flow chart showing an example of a page transmission procedure of the present embodiment.

FIG. 9 is a diagram showing an example of the HDLC format of the present embodiment.

FIG. 10 is a flow chart showing an example of a receiving procedure of the present embodiment.

FIG. 11 is a flow chart showing an example of a page receiving procedure of the present embodiment.

FIG. 12 is a diagram showing an example of the HDLC format of the present embodiment.

FIG. 13 is a conceptual diagram showing an example of hierarchical image processing according to the present embodiment.

FIG. 14 is a diagram showing an example of a transmission procedure of the second embodiment according to the present invention.

FIG. 15 is a conceptual diagram showing an example of hierarchical image processing according to the second embodiment.

FIG. 16 is a diagram showing an example of a transmission procedure of the third embodiment according to the present invention.

FIG. 17 is a flow chart showing an example of a page transmission procedure of the third embodiment.

FIG. 18 is a diagram showing an example of a transmission procedure of the fourth embodiment according to the present invention.

FIG. 19 is a flow chart showing an example of a page transmission procedure of the fourth embodiment.

FIG. 20 is a diagram showing an example of an HDLC format according to a fifth embodiment of the present invention.

[Explanation of symbols]

 1 CPU 2 Reading circuit 3 RAMb 4 Reduction circuit 5 RAMc 6 Encoder / decoder CODEC 7 Network control unit NCU 8 Modulator / demodulator MODEM 11 Transmission buffer 13 Recording part 14 Image storage RAM 15 Display / operation part

Claims (5)

[Claims] 1. A coding means for hierarchically coding image data, a storage means for storing code data coded by the coding means in accordance with a hierarchy of the code data, and stored in the storage means. An image processing apparatus comprising: an encryption unit that encrypts the encoded data. 2. The image processing apparatus according to claim 1, wherein the encryption means encrypts code data of a hierarchy having a predetermined resolution. 3. The image processing apparatus according to claim 1, wherein the encryption unit encrypts the code data with an encryption key corresponding to a hierarchy of code data to be encrypted. 4. A first decryption unit for decrypting encrypted data, a storage unit for storing the hierarchical coded data output from the first decryption unit according to a hierarchy of the coded data, and the storage unit. An image processing apparatus comprising: a second decoding unit that decodes stored code data, wherein the second decoding unit outputs image data. 5. The first decryption means decrypts the encrypted data by using a predetermined encryption key.
The image processing device described.