WO2006057047A1 - Dispositif et procede de traitement de codage et de decodage - Google Patents

Dispositif et procede de traitement de codage et de decodage Download PDF

Info

Publication number
WO2006057047A1
WO2006057047A1 PCT/JP2004/017613 JP2004017613W WO2006057047A1 WO 2006057047 A1 WO2006057047 A1 WO 2006057047A1 JP 2004017613 W JP2004017613 W JP 2004017613W WO 2006057047 A1 WO2006057047 A1 WO 2006057047A1
Authority
WO
WIPO (PCT)
Prior art keywords
scramble
block
input image
image
descrambling
Prior art date
Application number
PCT/JP2004/017613
Other languages
English (en)
Japanese (ja)
Inventor
Tomohiro Kimura
Mitsuyoshi Suzuki
Hiroshi Ito
Ryousuke Fujii
Koichi Magai
Original Assignee
Mitsubishi Denki Kabushiki Kaisha
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mitsubishi Denki Kabushiki Kaisha filed Critical Mitsubishi Denki Kabushiki Kaisha
Priority to PCT/JP2004/017613 priority Critical patent/WO2006057047A1/fr
Publication of WO2006057047A1 publication Critical patent/WO2006057047A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
    • H04N21/2347—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving video stream encryption
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/387—Composing, repositioning or otherwise geometrically modifying originals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/41—Bandwidth or redundancy reduction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/16—Analogue secrecy systems; Analogue subscription systems
    • H04N7/167—Systems rendering the television signal unintelligible and subsequently intelligible
    • H04N7/1675—Providing digital key or authorisation information for generation or regeneration of the scrambling sequence

Definitions

  • Scramble processing device descramble processing device, scramble processing method, and descramble processing method
  • the present invention relates to a scramble processing device, a descramble processing device, a scramble processing method, and a descramble for performing disturbance on content data such as an image or sound, or canceling the disturbance and restoring the data It relates to a processing method.
  • the scramble processing device first performs partial scramble processing by partially replacing images, and then performs coding processing.
  • the descramble processing device performs first decoding processing. There is a method of performing a descrambling process to restore the replaced partial image to its original state.
  • the code bit stream is scrambled, and the descramble processing device returns the scrambled code bit stream to the original one.
  • Non-Patent Document 1 For example, see Non-Patent Document 1 of scrambling after generating a code bit stream, for example, a discrete cosign transform (DCT) applied in JPEG code or MPEG code is used. Corresponding coding portions are exchanged with each other in units of blocks of (conversion). Alternatively, the DC component in the block (hereinafter referred to as DC coefficient value) is stored and only the AC component (hereinafter referred to as AC coefficient value) is exchanged with another block. With these methods, you can get an overview of the rough image While making it possible, the code length is kept unchanged.
  • DCT discrete cosign transform
  • Patent Document 1 Japanese Patent Laid-Open No. 2002-77568 (Section 6: Power is also Section 8, Figure 2, Figure 12, Figure 13)
  • Non-Patent Document 1 Ayuko Takagi, Hitoshi Takaya, "Bitstream type of MPEG image Scramble method ", IEICE General Conference A-49, pp. 100, 2004. 3
  • the conventional scramble processing apparatus and descrambling processing apparatus are intended to replace all replacement units in the scramble application area or a partial area, and include extremely different replacement units such as brightness.
  • the conventional scramble processing apparatus and descrambling processing apparatus are intended to replace all replacement units in the scramble application area or a partial area, and include extremely different replacement units such as brightness.
  • In order to select and exchange one based on the central random number of the exchange unit there was a problem that the image was disturbed more than necessary.
  • the partial areas are rearranged in order of luminance, random numbers are not required, but there is a problem that positional information other than codes is required to maintain reversibility.
  • the present invention has been made to solve the above-described problems, and is classified into one or more similar features from among all the exchange units in the scramble area or its partial areas.
  • the degree of disturbance applied to the image can be controlled by specifying the class range, scramble processor, descrambler, scrambler
  • the purpose is to obtain a processing method and a descrambling method.
  • the scramble process apparatus by using the same series of random numbers in the scramble process and the descramble process, the scramble process apparatus, the descramble process apparatus, the scramble process method, and the descramble process that do not require position information while maintaining reversibility
  • the purpose is to obtain a method.
  • the code length is not changed by exchanging only the DC coefficient value or the AC coefficient value in the block or only in the block without signing again.
  • the scramble processing apparatus selects and selects a class classifier that classifies block feature values in an input image into one or more classes, and a class including the feature values of the block to be replaced.
  • a scramble change is provided for selecting a block to be exchanged from within a class and exchanging with the exchangeable block.
  • FIG. 1 is a flowchart showing an outline of scramble processing according to the present invention.
  • FIG. 2 is a configuration diagram of a scramble processing apparatus and a descramble processing apparatus according to Embodiment 1 of the present invention.
  • FIG. 3 is a block diagram of a scramble processing device and a descrambling processing device different from those in FIG. 2.
  • FIG. 4 is an internal configuration diagram of a scramble processing unit in FIGS.
  • FIG. 5 is an internal configuration diagram of a descrambling processing unit in FIGS.
  • FIG. 6 shows the scramble application area specified for the image in the first embodiment.
  • FIG. 7 is a flowchart showing a processing flow in a scramble processing unit in FIG.
  • FIG. 8 is a diagram showing feature quantities of blocks constituting the scramble application area of the slice shown in FIG. 6.
  • FIG. 9 is a diagram showing a scramble process (A) and a descramble process (B) in FIG. 8.
  • FIG. 10 is an internal configuration diagram of a sign key processing unit in FIGS.
  • FIG. 11 is an internal block diagram of the decoding processing unit in FIGS.
  • FIG. 12 is a more detailed internal configuration diagram of the code key processing unit of FIG. 10 when executing PEG encoding.
  • FIG. 13 is a more detailed internal configuration diagram of the decoding processing unit in FIG. 11 when PEG encoding is executed.
  • FIG. 14 shows the same area corresponding to the scramble application area in FIG.
  • FIG. 15 is a configuration diagram of a scramble processing apparatus and a descramble processing apparatus according to Embodiment 2 of the present invention.
  • FIG. 16 is a configuration diagram of a scramble processing apparatus and a descramble processing apparatus according to Embodiment 3 of the present invention.
  • FIG. 17 is a configuration diagram of a scramble processing device and a descramble processing device different from those in FIG.
  • FIG. 18 is an internal configuration diagram of a scramble processing unit in a scramble processing apparatus according to Embodiment 4 of the present invention.
  • FIG. 19 is an internal configuration diagram of a descrambling unit in a descrambling processing device according to Embodiment 4 of the present invention.
  • the scramble processing apparatus outputs a scrambled image by inputting the image divided into at least two or more blocks having feature amounts.
  • the descrambling device inputs the scrambled image and outputs the original image.
  • the scramble process and the descramble process according to the present invention are executed without changing the image format at the input / output of the processing unit, and do not depend on the image format.
  • Image format here Means an unprocessed uncompressed image, a temporary intermediate image in the compression process, a compressed image after compression, and the like.
  • the blocks themselves may be exchanged, or a part of codes constituting the blocks may be exchanged by applying a coding scheme such as JPEG. Let's go.
  • FIG. 1 is a flowchart showing an outline of a scramble process according to the present invention.
  • step ST11 the block is classified into one or more exchange classes based on the feature amount of the block in the scramble application area.
  • step ST12 an exchange class including the block is selected for the exchange target block.
  • step ST13 one exchange target block is selected from the selected exchange class and exchanged with each other.
  • step ST14 the scramble process in steps ST12 and ST13 is continued until the last exchange target block is scanned.
  • the outline of the descrambling process can be explained in the same manner as the outline of the scramble process described above. Details of the first embodiment will be described below.
  • FIG. 2 is a configuration diagram of the scramble processing apparatus and the descramble processing apparatus according to the first embodiment. A case will be described in which images input and output to and from the scramble processing device and descrambling processing device are given in an encoded compression format.
  • a scramble processing device 101 inputs an original image and outputs an encoded image, and inputs an encoded image and outputs an encoded scrambled image.
  • a scramble processing unit 103 is provided.
  • the descrambling processor 104 receives a coded scrambled image and outputs a coded image.
  • a descrambling processing unit 105 inputs the coded image and outputs a reproduced image.
  • a processing unit 106 is provided.
  • the same encryption key required for scrambling and descrambling is input to the scramble processing unit 103 and the descrambling processing unit 105.
  • the code unit or decoding unit and the scramble exchange unit are the same. This will be described as a size area (hereinafter referred to as a block).
  • the image is decomposed into blocks at the time of input to the scramble processing device 101, and the blocks are assembled into images at the time of output from the descramble processing device 104.
  • FIG. 3 is a configuration diagram of a scramble processing device and a descramble processing device different from those in FIG.
  • the encoding processing unit 102 of the scramble processing device 101 and the decoding processing unit 106 of the descrambling processing device 104 are arranged outside both devices, and input to the scrambling processing device 101, And the output from the descramble processing unit 104 is input / output as a code bit stream (hereinafter referred to as “code”).
  • code code bit stream
  • FIG. 4 is an internal configuration diagram of the scramble processing unit in FIGS. 2 and 3
  • FIG. 5 is an internal configuration diagram of the descrambling processing unit in FIGS.
  • the scramble processing unit 103 includes a buffer memory 121, a scramble converter 122, a class classifier 123, and a random number generator 124.
  • the descrambling processing unit 105 includes a notch memory 131, a descrambling conversion 132, a class classifier 133, and a random number generator 134.
  • a nother memory 121 (FIG. 4) is a memory having a capacity capable of temporarily storing a scramble application area, and stores a scrambled code and outputs it as necessary. To do.
  • the code is temporarily expanded as necessary until the state of the image or the middle of the code.
  • the scramble application area does not have any problem for the entire image, but the minimum required memory size of the nota memory 121 changes according to the designated range of the application area. Considering versatility, a memory size that can store one image is desired.
  • FIG. 6 shows a scramble application area designated for an image in the first embodiment.
  • the slice size including the shaded area is the minimum buffer size, so the memory size including the left and right scramble processing excluded areas is required.
  • the memory size of the noffa memory 121 is limited
  • a low-strength slice may be defined and the scrambling process performed within the application area within the slice. In the vertical direction, it is not necessary to align the top and bottom edges of the scramble application area with the top and bottom edges of the slice, and scramble may be applied with a constant slice capacity.
  • the scramble processing unit 103 applies scramble to a specific area of an image
  • the scramble application area information is given from the outside together with the encryption key. It is assumed that the encryption key and scramble application area information are shared with the descramble processing unit 105 (see the broken line arrows in FIGS. 2 and 3).
  • the scrambler 122 first makes it possible to refer to information necessary for the scramble process from the code stored in the buffer memory 121.
  • the necessary information is the size of the image, the code length of each block and its position information, the amount of features correlated between the blocks, etc., and these are managed as a list.
  • the class classifier 123 lists and manages unscrambled blocks (n blocks) within the scramble application area in the slice (shaded area in FIG. 6), and manages one or more blocks to be replaced. Classify into classes. (Step ST11 in Figure 1).
  • the random number generator 124 Based on the encryption key input to the scramble processing unit 103 (scramble conversion 122), the random number generator 124 generates a random number according to the setting value associated with the encryption key. From the obtained random number value, the scrambler 122 selects the exchange class including the exchange target block, selects the exchange target block from the exchange class, and exchanges them with each other. Then, both blocks are excluded from the class list as processed (steps ST12 and ST13 in Fig. 1).
  • class classifier 123 may divide the unprocessed blocks into the prescribed number of classes based on the number of unprocessed blocks n as an exchange class, and classify them equally, and the feature amount is biased. In such cases, it may be classified unequal. Also, class that does not meet the specified number of blocks should be integrated with other classes.
  • the feature quantity may be applied after classifying into a large number of classifications as negative and non-negative, and then classifying as a small number into a specified number and classifying into multiple levels. Correct the feature value if necessary, or convert it to another feature value, The conversion value may be classified.
  • the conversion is to perform a DC difference value (another feature amount) conversion from a DC coefficient value (a feature amount) of the DCT block by using, for example, a PEG code.
  • the correction includes aligning negative numbers and real numbers with the effective number of digits.
  • FIG. 7 is a flowchart showing a processing flow in the scramble processing unit in FIG.
  • step ST101 the total number N of blocks in the scramble application area in the slice is set to the number n of unprocessed blocks.
  • step ST102 if n is 1 or less, the scrambling process from step ST103 to ST109 is not performed! /.
  • step ST103 classification is made into one or more classes by class setting and division. This class setting and division may be performed only once for a slice in the scramble processing loop from ST103 to ST109.
  • step ST104 a class including the exchange target block is selected.
  • step ST105 if there is no block other than the block to be exchanged in the selected class, that is, if n is 1 or less, the block cannot be exchanged. Therefore, the exchange process of steps ST106 and 107 is skipped and the process proceeds to ST108.
  • step ST106 if there is a block to be exchanged in the class, a random number is generated, and the exchange target block is selected based on the random value.
  • step ST107 the exchange target block and the selected exchange target block are exchanged with each other, the block position information and the feature quantity are associated with each other, and these blocks are excluded from the class list as processed.
  • step ST108 the number n of unprocessed blocks is reduced by 1.
  • step ST109 if the number of unprocessed blocks n is not 1, scramble processing from step ST103 to ST108 is executed until it is 1.
  • step ST110 if the scrambled slice is not the final slice in the scramble application area, the scramble process in steps ST101 to ST109 is continued until the final slice is reached.
  • the notch memory 131 stores the scrambled code and outputs the scrambled code.
  • the code to which the scramble is applied and the code to which the scramble is applied have the same function as the buffer memory 121 of the scramble processing unit 103 because the code format rules are not impaired.
  • the scramble processing is applied to a specific area of the image, the external force and the scramble application area information are given together with the encryption key. It is assumed that the encryption key and the scramble application area information are shared with the scramble processing unit 103.
  • the descrambling conversion 132 first makes it possible to refer to information necessary for descrambling processing from the code number stored in the buffer memory 131.
  • the necessary information is the same as the information handled in the scramble modification 122 of the scramble processing unit 103.
  • the class classifier 133 and the random number generator 134 are different in the functions and operations of the class classifier 123 and the random number generator 124 due to the relationship between the scramble process and the descrambling process.
  • the blocks exchanged by the scramble processing are restored by re-exchange by descrambling processing, and the processing flow of the descrambling processing unit 105 is the same as the processing flow of FIG. 7 described in the scramble processing unit 103.
  • the decoding processing unit 106 inputs the descrambled code and outputs a reproduced image.
  • FIG. 8 is a diagram showing the feature amounts of the blocks constituting the scramble application area of the slice shown in FIG. Fig. 8 (A) shows before scramble processing, and Fig. 8 (B) shows after scramble processing.
  • FIG. 9 is a diagram showing the scramble process (A) and the descramble process (B) in FIG.
  • Fig. 8 the scramble application block of the slice shown in Fig. 6 is shown in Fig. 8 (A). It is assumed that the feature quantity (1) is one (8).
  • the scramble change 122 (FIG. 4) prepares a list of block feature quantities to be exchanged in the scramble application area.
  • (1) 1 (8) features are listed in the order of appearance "(1), (2), (3), (4), (5), (6), (7), (8)" The list will be in the order of.
  • the classifier 123 has a negative value class ( ⁇ 1), (4), (6), (8) ", a non-negative class" (2), (3), (5), (7) “2” (Step ST103 in FIG. 7).
  • the scramble change 122 selects a block to be exchanged based on the random value R of the random number generator 124 in the class including the block to be exchanged, and exchanges the feature quantity with the block to be exchanged.
  • the subscript indicates block position information.
  • Step ST104 when the feature quantity of the block to be exchanged is (1), the class of "(1), (4), (6), (8)" including the feature quantity (1) is selected ( Step ST104). Based on the random value R, the feature value (8) of the exchange target block is selected and exchanged with the exchange target block (steps ST106 and ST107 in FIG. 7).
  • the processed feature quantities (1) and (8) are removed from the entire list, and the feature quantity (2) is included "(2), (3 ) ⁇ (5) ⁇ (7) Select the class. Based on the random value R, the feature quantity (5) of the exchange target block is selected and exchanged with the exchange target block.
  • the same processing is repeated.
  • the replacement target block is (7)
  • the replacement is not performed because there is only the replacement target block in the selected class (step ST105).
  • the feature quantity of the replacement target block is (8)
  • the number n of unprocessed blocks in the slice is 1, so that the process proceeds to the next slice (step ST109).
  • the feature quantity of the exchange target block and the feature quantity of the exchange target block are interchanged as they are in the scramble processing process shown in FIG.
  • the random value is reproduced as it is corresponding to the scramble process.
  • scramble processing Similarly to the reason, for the already exchanged block, the exchanged feature quantity in the order of processing is applied as long as the exchange process is skipped.
  • the difference between the scramble process and the descramble process is in the search method for searching the feature quantity of the exchange target block and the feature quantity of the exchange target block.
  • FIG. 10 is an internal configuration diagram of the sign key processing unit in FIGS. 2 and 3
  • FIG. 11 is an internal configuration diagram of the decoding processing unit in FIGS.
  • the code key processing unit 102 includes a model key unit 111 and an entropy code key unit 112.
  • the decoding processing unit 106 includes an entropy decoding unit 141 and an inverse model unit 142.
  • FIG. 12 is a more detailed internal configuration diagram of the code key processing unit of FIG. 10 when executing the JPEG code key
  • FIG. 13 is a diagram of the decoding processing unit of FIG. It is a more detailed internal configuration diagram.
  • a code key processing unit 102 includes a DCT transformation 113 and a quantizer 114 that constitute a model key unit 111, and an encoder 115 that constitutes an entropy code key unit 112.
  • the decoding processing unit 106 includes a decoder 143 constituting the entropy decoding unit 141, an inverse quantizer 144 constituting an inverse model unit 142, and an inverse DCT transformer 145.
  • quantization may not be applied depending on color components such as luminance and color difference.
  • thinning processing may be applied before DCT conversion of the model part, and interpolation processing may be applied after inverse DCT conversion of the inverse model part! / ⁇ .
  • FIG. 14 shows the same area corresponding to the scramble application area of FIG.
  • MCU minimum coding unit
  • this MCU is used as a basic processing unit called a macro block. Therefore, although the block processing order is different from that in FIG. 8, the description of the scramble processing and descrambling processing in FIG. 9 is not affected.
  • the slice shown in Fig. 6 should be a multiple of the MCU height for processing.
  • Each DCT block in Fig. 14 consists of a DC coefficient value and a plurality of AC coefficient values, which are encoded and output in the order of block processing.
  • the DC coefficient value is encoded as a difference value (hereinafter referred to as a DC difference value) from the immediately preceding DC coefficient value except for the first DCT block in the unit of interval used in JPEG encoding.
  • the scramble converter 122 shows the size of the image and slice, the code length of the DC coefficient value and AC coefficient value of each block, the position information of the block, the encoded DC difference value, and the DC difference value.
  • the DC coefficient value that also obtained the force is used as the feature value.
  • DC difference values are managed as a list.
  • the class classifier 123 classifies the list into a predetermined number of classes according to the feature amount of the block in the scramble target area given in pixel units or slice units.
  • the random number generator 124 generates a random value R.
  • the scramble variable 122 selects a block to be exchanged based on the random value R from within the selected class, exchanges a code with the block to be exchanged, and selects those blocks from the list of classes. Exclude both blocks.
  • the substance to be exchanged between the exchange target block and the exchange target block is represented by both the sign of the DC coefficient value and the sign of the AC coefficient value or By using one, scramble processing can be realized.
  • the scramble processing may be performed by grouping the exchange targets into a plurality of exchange units such as MCU units larger than the block unit. At this time, instead of the DC coefficient value of a single block, the feature quantity used for classification should be selected as the replacement target unit as the average of the DC coefficient values included in the exchange unit.
  • the scramble processing device and the descrambling processing device shown in the first embodiment are not limited to implementation forms such as a dedicated device using hardware and a general-purpose device using software on a computer.
  • the sign key processing unit 102 arranged outside the scramble processing device 101 in FIG. 3 is not limited to implementation forms such as a digital camera, a camera-equipped mobile phone camera, a scanner, and a computer.
  • the decryption processing unit 106 arranged outside the descramble processing unit 104 is also limited to implementation forms such as a monitor on a digital camera, a monitor on a mobile phone with a camera, a printer, a display, and a computer.
  • the connection between these devices may be any wired, wireless, digital or analog transmission system.
  • one of the classes classified into one or more by the similar feature amount from all the exchange units in the scramble area or the partial area Therefore, by selecting and exchanging one block to be exchanged based on random numbers, it is possible to control the degree of disturbance added to the image by specifying the class range and the number. In addition, by using random numbers of the same series in the scramble process and the descramble process, it is possible to obtain an effect of making the position information unnecessary while maintaining the reversibility.
  • images input to and output from the scramble processing and descrambling processing are converted in the course of the encoding processing built in the scramble processing device and the decoding processing built in the descrambling processing device. The case where it is given in an intermediate form is explained.
  • FIG. 15 is a configuration diagram of a scramble processing apparatus and a descrambling process apparatus according to Embodiment 2 of the present invention.
  • FIG. 15 is different from FIG. 2 in that a scramble processing unit 103 is arranged between the model key unit 111 and the entropy code key unit 112 of the code key processing unit 102.
  • a descrambling processing unit 105 is arranged between the entropy decoding unit 141 and the inverse modeling unit 142 of the decoding processing unit 106.
  • the intermediate format of the input / output image is the state after DCT transformation and quantization in the scramble process, ie, the state before entropy coding by the entropy code part 112, and is descrambled.
  • the process is a state after being decoded by the entropy decoding unit 141, that is, a state before being subjected to inverse quantization and inverse DCT conversion by the inverse modeling unit 142.
  • the scramble converter 122 uses the image and slice size, the code length of the DC coefficient value and AC coefficient value of each block, the position information of the block, and the DC coefficient value as the feature quantities. Also, DC coefficient values are managed as a list.
  • the class classifier 123 classifies the DC coefficient value of the block to be replaced by classifying it into one or more classes according to a predetermined rule from the list of DC coefficient values of the unprocessed block, as in the first embodiment. Select a class that contains.
  • the random number generator 124 generates a random number R.
  • the scramble conversion 122 also selects the block to be exchanged based on the random value R, exchanges the code with the block to be exchanged, and excludes those blocks from the list of classes together.
  • the code length is undetermined, but in terms of image disturbance. Has the same effect as in the first embodiment.
  • FIG. 16 is a configuration diagram of the scramble processing device and the descrambling processing device according to the third embodiment. Compared to FIG. 2, the scramble processing unit 103 is placed before the sign key processing unit 102. Deploy. Further, the decoding processing unit 106 is arranged in front of the descrambling processing unit 105.
  • FIG. 17 is a configuration diagram of a scramble processing device and a descramble processing device different from those in FIG. FIG. 17 is different from FIG. 16 in that the code processing unit 102 and the decoding processing unit 106 are independent of the scramble processing device and the descramble processing device. Since there is no difference in operation description between the force scramble processing unit 103 and the descrambling processing unit 105, FIGS. 16 and 17 will be described together.
  • encoding is performed after the image before encoding is decomposed into blocks and scramble processing is directly applied. Become. Therefore, in order to maintain reversibility, a reversible encoding method is applied in the encoding process.
  • lossless encoding methods JPEG encoding extended mode of international standard encoding, JPEG-LS, JPEG2000, etc. are known! /, But not limited to international standard encoding methods, non-standard lossless encoding methods are also available. An encoding method can also be applied.
  • the following describes the process of exchanging features used in the configuration of the scramble processing device and descramble processing device according to the third embodiment and used for the scramble processing and descrambling processing, corresponding to the components of the scramble processing device. To do.
  • the scramble change 122 uses the image and slice size, block size, position information of each block, and block average value (average pixel level) as feature quantities.
  • the block average value is managed as a list.
  • the class classifier 123 classifies the block average value of the block to be exchanged by classifying into one or more classes according to a predetermined rule from the list of block average values of the unprocessed blocks, as in the first embodiment. Select a class to include.
  • the random number generator 124 generates a random number R.
  • the scramble conversion 122 selects a block to be exchanged based on the random value R from the selected class and exchanges codes with the block to be exchanged.
  • the same effect as in the first embodiment is obtained in terms of image disturbance.
  • Embodiment 4 In the configuration shown in FIGS. 4 and 5, the scramble application area information together with the encryption key is sent to the scramble processing unit 103 and the descramble process unit 105 when the scramble is applied to the specific area of the image in the configurations shown in FIGS. was explained as an external force input.
  • the fourth embodiment a case will be described in which scramble application area information is added to a scrambled image so that no external input is required.
  • FIG. 18 is an internal configuration diagram of a scramble processing unit in the scramble processing apparatus according to the fourth embodiment.
  • the scramble processing unit 103 is newly provided with an application area information embedder 126 with respect to FIG.
  • the application area information embedder 126 embeds the scramble application area information obtained from the scramble change l22 into the output of the nota memory 121.
  • FIG. 19 shows the descrambling process inside the descrambling apparatus according to the fourth embodiment. It is an internal block diagram of a part.
  • the descrambling processing unit 105 is newly provided with an application region information detector 136 as compared to FIG.
  • the application area information detector 136 detects the scramble application area information with respect to the input of the buffer memory 131 and sets it in the descrambling variable 132.
  • the scramble application area information may be attached to a part of the image as a header or a footer, a comment area may be used, or a dedicated information area may be provided.
  • the encryption key is shared and applied to the application area information embedder 126 and the application area information detector 136 via the scramble converter 22 and the descramble converter 132, and the encryption key is applied. May be. This encryption key may be managed and shared in the same way as other encryption keys.
  • the scramble application area information uses electronic permeability
  • the scramble application area information is passed through the scramble converter 122 and the descramble converter 132 to the application area information embedder 126 and the application area information detector 136. May be set so that the application area information embedder 126 embeds them and the application area information detector 136 detects them.
  • the electronic transparency detected as the application area information may or may not be released from the image cover.
  • the application area information embedder 126 is placed after the buffer memory 121.
  • the scramble processing unit 103 does not change the input / output image format, it may be arranged reversely.
  • the application area information detector 136 since the scramble application area information needs to be detected first, the application area information detector 136 needs to be arranged in front of the buffer memory 131.
  • the scramble processing apparatus and descrambling processing apparatus shown in the above embodiments are examples of application forms, and application forms applying the same configuration and other encoding methods other than JPEG are also applicable. It is feasible.
  • DCT transformation 113 in model part 111 and DCT transformation in inverse DCT transformation 145 in inverse modeling part 142 have been explained for the configuration, but applied to JPEG2000 coding.
  • Other transformations such as wavelet transformation may be applied.
  • the data to be scrambled can be applied not only to images but also to audio.
  • the scramble processing device and descrambling processing device shown in Embodiments 1 to 4 of the present invention are divided into blocks that are constituent units of an image, and the difference is whether an object to be exchanged is an image piece of a block or a code. Regardless of the class, the exchange target is selected from the classes classified by the block feature. In addition, the effect of scrambling can be controlled by specifying the class range and setting the number of classes.
  • a scramble process is performed on an image in a compressed format without changing the code length except for a control signal for communication. Apply.
  • scramble processing is applied to a temporary intermediate format image, which is a modeled stage before the entropy code key is applied by the code key processing unit 102.
  • blocks are exchanged at the stage of an uncompressed image, and the code is applied after scrambling is applied.
  • the scramble processing can be applied regardless of the compression format, intermediate format, or uncompressed format.
  • the application is not limited.
  • scramble application area information is input from the outside if necessary, and scramble is applied and released.
  • additional areas inside the image and electronic By embedding it with permeability, it is not necessary to input scramble application area information from outside.
  • the scramble processing device, the descrambling device, the scramble processing method, and the descramble processing method according to the present invention are applied to the entire content data such as images and sounds to disturb data reproduction. Therefore, it is suitable for protecting copyrights or applying them only partially to protect specific rights such as portrait rights, privacy, and creative design of a person.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)

Abstract

Cette invention concerne un dispositif de traitement de codage (101) qui comprend un classificateur de classe (126) pour ranger la valeur d’attribut d’un bloc dans une image d’entrée en une ou plusieurs classes d’échange et un convertisseur de codage (122) pour sélectionner la classe d’échange contenant la valeur d’attribut d’un bloc d’objet échangé et sélectionner un bloc d’objet d’échange dans cette classe afin de remplacer le bloc sélectionné par celui échangé.
PCT/JP2004/017613 2004-11-26 2004-11-26 Dispositif et procede de traitement de codage et de decodage WO2006057047A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2004/017613 WO2006057047A1 (fr) 2004-11-26 2004-11-26 Dispositif et procede de traitement de codage et de decodage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2004/017613 WO2006057047A1 (fr) 2004-11-26 2004-11-26 Dispositif et procede de traitement de codage et de decodage

Publications (1)

Publication Number Publication Date
WO2006057047A1 true WO2006057047A1 (fr) 2006-06-01

Family

ID=36497796

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2004/017613 WO2006057047A1 (fr) 2004-11-26 2004-11-26 Dispositif et procede de traitement de codage et de decodage

Country Status (1)

Country Link
WO (1) WO2006057047A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008017281A (ja) * 2006-07-07 2008-01-24 Kddi Corp 符号化画像データの撹拌装置および復号装置

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0730855A (ja) * 1993-07-08 1995-01-31 Sony Corp ビデオデータの記録方法
JPH0779426A (ja) * 1993-09-07 1995-03-20 Toshiba Corp スクランブル方式
JPH08181986A (ja) * 1994-12-22 1996-07-12 Sanyo Electric Co Ltd 画像処理装置
JPH09214930A (ja) * 1996-01-30 1997-08-15 Sanyo Electric Co Ltd スクランブル変換装置及びスクランブル逆変換装置
JPH10155151A (ja) * 1996-09-30 1998-06-09 Nec Corp 画像データ処理装置
JPH11298878A (ja) * 1998-04-08 1999-10-29 Nec Corp 画像スクランブル方法およびそれを実施する装置
JP2002077568A (ja) * 2000-08-24 2002-03-15 Nippon Telegr & Teleph Corp <Ntt> 画像スクランブル装置、解除装置、画像スクランブル方法、画像スクランブル解除方法、及びプログラムを記録した記録媒体
JP2004236231A (ja) * 2003-01-31 2004-08-19 Ricoh Co Ltd 画像符号化装置、符号復号化装置、プログラム及び記憶媒体
JP2004248267A (ja) * 2003-01-22 2004-09-02 Ricoh Co Ltd 画像符号化装置、符号復号化装置、画像符号化方法、符号復号化方法、プログラム及び記憶媒体

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0730855A (ja) * 1993-07-08 1995-01-31 Sony Corp ビデオデータの記録方法
JPH0779426A (ja) * 1993-09-07 1995-03-20 Toshiba Corp スクランブル方式
JPH08181986A (ja) * 1994-12-22 1996-07-12 Sanyo Electric Co Ltd 画像処理装置
JPH09214930A (ja) * 1996-01-30 1997-08-15 Sanyo Electric Co Ltd スクランブル変換装置及びスクランブル逆変換装置
JPH10155151A (ja) * 1996-09-30 1998-06-09 Nec Corp 画像データ処理装置
JPH11298878A (ja) * 1998-04-08 1999-10-29 Nec Corp 画像スクランブル方法およびそれを実施する装置
JP2002077568A (ja) * 2000-08-24 2002-03-15 Nippon Telegr & Teleph Corp <Ntt> 画像スクランブル装置、解除装置、画像スクランブル方法、画像スクランブル解除方法、及びプログラムを記録した記録媒体
JP2004248267A (ja) * 2003-01-22 2004-09-02 Ricoh Co Ltd 画像符号化装置、符号復号化装置、画像符号化方法、符号復号化方法、プログラム及び記憶媒体
JP2004236231A (ja) * 2003-01-31 2004-08-19 Ricoh Co Ltd 画像符号化装置、符号復号化装置、プログラム及び記憶媒体

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008017281A (ja) * 2006-07-07 2008-01-24 Kddi Corp 符号化画像データの撹拌装置および復号装置

Similar Documents

Publication Publication Date Title
EP0926897B1 (fr) Méthode de traitement d&#39;un signal vidéo pour l&#39;insertion d&#39;un filigrane électronique
JP3673664B2 (ja) データ処理装置、データ処理方法及び記憶媒体
US7545938B2 (en) Digital watermarking which allows tampering to be detected on a block-specific basis
US9258568B2 (en) Quantization method and apparatus in encoding/decoding
TWI323613B (en) Digital image encoding
JP4365957B2 (ja) 画像処理方法及びその装置及び記憶媒体
US20040252834A1 (en) Scrambling of image by randomizing pixel values
WO2006095218A1 (fr) Procede, produit-programme informatique et dispositif de traitement d&#39;images fixes dans un domaine comprime
JP4023324B2 (ja) 透かし埋め込み及び画像圧縮部
JP2005295505A (ja) 動画像符号化装置及び動画像復号装置及びそれらの制御方法、並びに、コンピュータプログラム及びコンピュータ可読記憶媒体
Minemura et al. A scrambling framework for block transform compressed image
CN101409830B (zh) Dct系数块相似性判断、图像加解密方法及装置
EP2371137B1 (fr) Méthode, appareil et produit programme d&#39;ordinateur pour l&#39;extraction de sous-images à partir de données codées jpeg
WO2015028098A1 (fr) Procédé et système pour intégrer des informations et authentifier une vidéo h.264 en utilisant un filigrane numérique
JP4684701B2 (ja) スクランブル処理装置、デスクランブル処理装置、スクランブル処理方法及びデスクランブル処理方法
EP1478185A2 (fr) Procédé pour la protection des données d&#39;image dans la mémoire de trame d&#39;un système de compression vidéo
WO2006057047A1 (fr) Dispositif et procede de traitement de codage et de decodage
KR101930676B1 (ko) Cctv 영상 암호화 방법
JP3853708B2 (ja) デジタル画像符号化装置および符号化方法ならびにプログラム
JP2004120122A (ja) 画像処理装置
JP5235850B2 (ja) 画像符号化装置、画像復号化装置、画像符号化・復号化システム及びその方法
Hadar et al. Rate distortion optimization for efficient watermarking in the DCT domain
WO2006057032A1 (fr) Dispositif et procede de traitement de codage et de decodage
Zeng et al. Compression and protection of JPEG images
JP4588514B2 (ja) スクランブル映像配信システムおよび再生装置

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP

122 Ep: pct application non-entry in european phase

Ref document number: 04822459

Country of ref document: EP

Kind code of ref document: A1

WWW Wipo information: withdrawn in national office

Ref document number: 4822459

Country of ref document: EP