Method for encoding and decoding digital data, transmitted using prioritized pixel transmission method or stored in memory

FIELD: method for encoding and decoding digital data transferred by prioritized pixel transmission method or stored in memory.

SUBSTANCE: in accordance to the invention, informational content being encoded and decoded consists of separate pixel groups, where each pixel group contains value of position, at least one pixel value and priority value assigned to it, where at least one key is used, with which value of position and/or pixel value/values of pixels of pixel group are selectively encoded or decoded. Depending on used keys and on parts of informational content which are encoded, for example, value of positions and/or values of pixel groups, many various requirements may be taken into consideration during encoding.

EFFECT: ensured scaling capacity of encoding and decoding of digital data.

8 cl, 5 dwg, 3 tbl

 

The technical field to which the invention relates.

The invention relates to a method for encoding and decoding digital data transmitted by the method priorisierung transmission pixels or stored in memory, according to the restrictive part of claim 1 of the formula.

The level of technology

Preparation of informational content, such as images, video data, audio data and documents is very difficult. During transmission and storage of such information content in many applications it is expedient and necessary to encode the information content to protect it from unauthorized access. For this there are a number of ways of coding and applications that performs this task.

When this encoding content can occur in different planes:

- directly in the application, for example, by means of password protection in personal computers or access to the program;

- regardless of the application, for example, by the known method of encoding PGP (Pretty Good Privacy) e-mail;

- when sending information, for example, through the Internet using Internet Protocol Security (IPSec).

Known so far, the encoding method lacks the ability to encode the information content of its flexibility and scalability. This means that absent the possibility of flexible adjustment, so, for example, depending on the information content and the specific application it was possible to implement a consistent coding. This can be, however, it is advantageous if it is desirable to provide, for example, video on demand (video on demand), and for different video quality, for example, depending on the resolution of the image must be calculated different payment.

The invention

Object of the invention is to provide a method for encoding and decoding digital data transmitted by the method priorisierung transmission pixels or stored in memory, which would encode the information content in a flexible and scalable.

This problem is solved according to the invention through the characteristics of claim 1 of the formula.

The basis of the method according to the invention should be considered as methods of compression and expansion of image data or video data through priorisierung transmission pixels described in DE 10113880.6 (corresponds to PCT/DE02/00987) and DE 10152612.1 (corresponds to PCT/DE02/00995 leather straps). These methods can handle, for example, digital image data or video data, consisting of a matrix of individual image points (pixels), each pixel has a time-varying value that describes color information or brightness information of the pixel. According izobreteniya pixel or each pixel group is assigned a priority and the pixels in accordance with their prioritaria place in the priority matrix. This matrix contains in each moment of time sorted by prioritaria pixel values. In accordance with prioritaria these pixels and used to calculate prioritaria values are passed from or write to a memory. Pixel receives high priority, if different from its neighboring pixels are very large. For the reconstruction of the actual pixel values display on the display. Not yet transferred to the pixels calculated by already passed.

The content of the publications DE 10113880.6 and DE 10152612.1 fully included in the disclosed content of the present invention.

According to the invention the transfer or storage priorisierung pixel groups is in the form of data packets, and data packets can contain not only the image data in the form of image points (pixels), but any kind of digital data that can be stored in the matrix. When one data packet consists of the data values, which describes the position of the pixel group in the matrix, and of the values of individual pixels of the pixel groups. By encoding the position values of the pixel groups and/or values of the pixel groups, you can protect the content from unauthorized access. Depending on the keys, and from what parts of content are encoded, for example, a position value and/elizajane pixel groups, you can consider different needs when encoding. The data packets according to their importance transmit and/or store in descending order. Due to this, at least in static, not time-varying n-dimensional matrices, according to the invention it is also possible, and encoding and decoding of the pixel groups with the help of their importance.

Advantages of the invention compared with the current level of technology are scalable application encoding. In contrast to traditional methods separate encoding of location values and/or values of the pixel groups for different requirements gives the advantage that when the respective applications and related devices should be introduced only this way. If this method once implemented, the different requirements can use the same General method. This reduces the number of deployments that, including, saves space for memory, available only in a limited order, in particular in mobile terminal devices. The decrease in the number of implementations follows from the ability to encode audio, images and video the same way.

The preferred implementation and improvements of the invention are given in the dependent clauses.

Brief description of drawings:

- figure 1: the image matrix from 20×21 pixels is LEU;

- figure 2: various forms of pixel groups;

- figure 3: the new image matrix with the entered pixel groups in the corners of the image;

- figure 4: filling surfaces between the already entered pixel groups;

- figure 5: the introduction of an additional pixel groups and the filling of the intermediate surfaces.

The implementation of the invention

Below are explained some examples of carrying out the invention.

You should assume that the information content presented in the form of a two-dimensional image file (the image matrix). Each image point (pixel) matrix image presents a 32-bit value (pixel value). 32 bits is divided, for example, on 4 values (transparent, red, green, blue) by 8 bits. The pixels of the image matrix image count, and the position of each pixel is defined by an integer. Form a pixel group consisting of the reference pixel, indicating the position of the pixel group in the matrix, and the extra pixels surrounding a reference pixel. Each pixel group based on its "importance to the images assign priority, and the pixel groups with the highest priority store or transmit first.

The pixel group may be transmitted or stored according to the invention at various stages of codiovan is.

Without coding:

There is easy access to the entire information content, i.e. the pixel group passed Nemirovskii.

The use of simple key:

For encoding and decoding using only the key, i.e. apply a symmetric encoding method. You can encode, for example, the position values of the reference pixels of the pixel group, so without the correct key is of the correct position of the positioning of the pixel group in the image matrix is no longer possible. The key can be transmitted over the second transmission path, for example via email or regular mail. Additional infrastructure is not required. A symmetric encoding method is faster than asymmetric way, such as PGP.

The use of asymmetric coding method is:

To encode and decode information of the content use one secret and one public key. Coding in comparison with the symmetric method is complicated and limited to just point to point. However, no second transmission key is not required.

The use of a compound key:

This key consists of a combination of individual keys. Keys can be based on content, time, original source, transmission medium, or other signs.

<> Thus, the possibility to reproduce the information content can, if necessary, to arbitrarily limit, and the information content of the display in accordance with the situation. Here are some examples:

- temporary component in the key: the information content can be decoded only with the/up to a certain point;

key depending on the transmission media: content can be decoded only when the transmission medium has a specific identification;

key depending on the original source: the information content can be decoded only in the device in which it was recorded, for example, as protection from abuse when copying protection.

The use of cascading keys:

Cascading keys can be used to implement partial encoding of content. This can be, for example, it is appropriate to make in one data stream to transmit normal as in coded form, as bad as, for example, to show the image in nekodirovannie form without the emergence of redundancy. The resolution of the image can be reduced. Under "resolution" in this case should not be understood "image height × image width", because it is in the application of the method remains n is izmennoy. On the contrary, under the reduced resolution should understand the deviation from the original image during the reconstruction can occur because of not yet transmitted and/or decoded pixel groups. The method of cascading keys works on the principle of onion scales. Using priorisierung transmission pixels of the reduced size of the pixel groups can be, for example, for the formation of a cascade encoding. One pixel group consists of a reference pixel, is uniquely determined by the value of its provisions, and a number of other pixels. If, for example, the pixel group is composed, in General, from 9 pixels, it is possible to transmit, for example, 5 pixels Nemirovskii, and 4 pixel - coded. The outer shell includes 5 noncoding pixels, does not contain coding and would allow, for example, to watch without a key video the size of a postage stamp. The following shell pass one or more of the encoded pixels. For each of the next shell use the additional key. Kind of shells coordinates before passing between the transmitter and receiver. Thus, the one who has all the keys and can decode all the membranes can watch a video of the best quality.

To reduce the interference that may occur, for example, because of dependencies between the data of individual shells, this type of encoding can be advanced to the position value and the values of the pixel groups to transmit the hash value that is calculated from the values of the position and values of the pixel groups. If calculated in the receiver, the hash value is not identical to the transmitted hash value, this pixel group is not decoded. This ensures that there is no interference due to other shells.

The possible combination of different keys and modes.

By itself, the coding method according to the invention is applicable not only to image data and video data, but also to all types of digital data, which can be divided into data blocks similar to the blocks of data points in the image.

The invention is explained in more detail below with a simple example.

Table 1 depicts the flow of data prepared by the method priorisierung transmission pixels. The value of "Pos x" indicates the corresponding position of the pixel group, and RP indicate individual values contained in the pixel group of pixels. Each pixel group consists, for example, from 5 pixels.

Table 1.
Pos0RRRRRRPos1R RRRRR

Table 2 shows the encoding of only the pixel values. Advantage: you want to encode only part of a data flow that gives a noticeable performance improvement compared to the full encoding of all data. Reconstruction of the coded so the data without knowing the key is impossible or possible only with great expenditure of computer time to calculate.

Table 3 shows the coding part of the pixel group. Advantage: also provides due to different encoding pixel values of the different quality in the reconstruction of image data, audio and video. In the example below, the receiver can be used without a key position value and the pixel values RH-RH. For decoding the values of the pixels RH-RH, respectively, required a suitable wrench. If the receiver does not have a key/keys for the values of the pixels RH-RH, the application must reconstruct these pixel values from the freely available values RH-RH. Because the receiver is missing, however, many of pixel values, the reconstruction quality (resolution) is noticeably reduced.

In the examples, coded and isn't a code is rowanne data is transmitted by one thread. To detect transmission errors and success of decoding each piece of the pixel group (the value of the position and RHP) may contain decrypted CRC check (cyclic redundancy check). When there is a transmission error and a failed CRC check, the corresponding pixel value is not used for reconstruction. The other part of the pixel group can be used further. Thus, it also increases the stability of the mode of transmission to transmission errors. Instead of CRC can be used as the hash function. They provide the best protection, it requires more computation.

1. The method of encoding or decoding digital data transmitted by the method priorisierung transmission pixels or stored in memory, in which digital data consists of a matrix of individual image points (pixels), each pixel includes a pixel value, which can change over time and which carries the color information or the brightness of the pixel, thus form a pixel group consisting of a reference pixel which displays the position of the pixel group in the matrix, and other pixels surrounding a reference pixel, assign each pixel group priority, depending on its importance for the image, and the pixel groups with the highest priority store or transfer the t first, and in which the encoded or decoded information content consists of separate pixel groups, each pixel group to be encoded or decoded, contains the position value for at least one pixel value and assigned a priority value, using at least one key, which selectively encode or decode the value of the position and/or the value of the pixel values of the pixels of the pixel group.

2. The method according to claim 1, characterized in that the key is selectively connected with the form of the encoded content, and/or with the original source, and/or used by the transmission medium or has a time dependence.

3. The method according to any of claim 1 or 2, characterized in that each pixel value or one or more of the selected pixel values to encode or decode a single key.

4. The method of claim 1, wherein implementing a symmetric encoding method.

5. The method according to claim 1, characterized in that the implement asymmetric coding method.

6. The method according to claim 1, characterized in that the digital data is image data, video or audio data.

7. The method according to claim 1, characterized in that the pixel values characterizing the color saturation, encode or decode with a gradation of a single key.



 

Same patents:

FIELD: video signals.

SUBSTANCE: method for modifying data in input encoded video signal for generation of output scaled video signal, composed of main video signal and a set of at least one quality increase video signal, where method contains at least one error decoding stage for generation of decoded data signal using input encoded video signal, first stage of repeated encoding for generation of main video signal using intermediate data signal, received by addition of signal with movement compensation and decoded data signal, reconstruction stage for generating main video signal encoding error, movement compensation stage for generation of signal with compensation of movement based on encoding error, second stage of repeated encoding for generation of quality increase video signal on basis of encoding error. Encoding error of main video signal is repeatedly encoded with higher degree of detail in comparison to error which is used for generation of main video signal.

EFFECT: ensured adaptation of bit-rate of encoded video signal being transferred to traffic capacity of communication network.

6 cl, 3 dwg

FIELD: compression of video signal data, possible use for encoding and decoding video data.

SUBSTANCE: in accordance to the invention, video frame is segmented on a series of sections, with each section including a row of macro-blocks. Corresponding sections are encoded, and signal is included in header of encoded section for defining whether global movement compensation should be used during restoration of encoded section. If it should, global movement compensation information, such as information, representing a set of movement vectors, is included in the section. In any variant of realization movement vectors for each image of certain encoded section may be restored using global movement compensation information, contained only in certain encoded section.

EFFECT: creation of new method and system for global compensation of movement.

3 cl, 10 dwg

FIELD: radio engineering, possible use for digital processing of video signals, transferring the image.

SUBSTANCE: in accordance to the invention, the image being processed is divided on blocks with following transformation of each block using discontinuous quantum transformation, result coefficients are quantized and encoded, supporting points are computed and linear interpolation is performed, while before the stage of supporting point selection, one of the supporting points on edge limit of block is selected and a supporting point on opposite limit block is calculated using additional low frequency filters, after that linear interpolation is performed between thus computed supporting points.

EFFECT: improved quality of compressed video image with insignificant CPU resource costs.

2 cl, 4 dwg

FIELD: radio engineering and television, possible use during generation, transmission and receipt of video-frames.

SUBSTANCE: in accordance to invention introduced additionally to encoder are video frames memory block, first function memory block, video frame transmission block, block for storing video frame being reproduced, while input of encoder serially, through block for forming video frames, video frames memory block, block for forming difference video frame, first frame memory block, video frame transmission block and block for memorizing video frame being reproduced is connected to second input of block for forming difference video frame, third input of which is connected to output of first function memory block, output of which is connected to second input of video frame transmission block, output of which is the output of device encoder. Introduced additionally to decoder are video frames receipt block, comparator and second function memory block, while input of decoder is serially, through video frame receipt block, second frame memory block and comparator, is connected to second video frame restoration block, third input of which is connected to output of second function memory device, and output is the output of decoder of device. Device realizes generation, transmission and receipt of code of function of distribution of screen point brightness in a series of frames, making it possible to increase the code compression coefficient.

EFFECT: increased coefficient of code compression of video frame information.

1 tbl, 1 dwg, 7 app

FIELD: engineering of systems for transferring video data and encoding/decoding methods having to do with the former, in particular, video data compression system, featuring "watermarks" embedded into video data, in which any falsification of video image or part of image is supposed to be detected.

SUBSTANCE: video data exchange device includes video input for receiving transferred video signals or signals of images without "watermarks", having certain number of video frames or image frames, in which each video frame or image frame includes certain amount of bit planes, while video input in working state is connected to processor. Processor divides at least one bit plane of each one of at least two video frames or image frames on first and second parts. Processor combines second part of at least one bit plane of first frame with first part of at least one bit plane of second frame for embedding a "watermark" bit into transfer of video signals or image signals. Described are video data exchange system and methods for detecting a fake area and for visual marking of faked area, allowing detection of falsification of images and video data, and determining of location of such falsification for users of given material.

EFFECT: during transfer images or video data are protected from falsification.

9 cl, 4 dwg

FIELD: video-coding; fine-grain coding method including quality and time scaling.

SUBSTANCE: use is made of hybrid time/signal-to-noise-ratio scaled structure found just useful for fine-grain coding method. Updated time frames in one example of this structure and updated frames of fine-grain scaling are included in single updated layer. In other example use is made of separate updated layers to attain hybrid time-dependent signal-to-noise ratio scaling. These two layers incorporate time scaled layer to attain time updating for basic layer (that is for better motion) while fine-grain scaling layer is used to improve quality of signal-to-noise basic layer and/or time-scaled updated layer.

EFFECT: improved video quality or signal-to-noise ratio of each frame or pattern transferred in basic layer.

10 cl, 21 dwg

FIELD: watermark implantation, transcoding, and digital recording including means for watermark implantation.

SUBSTANCE: first design alternate includes watermark implantation system that has transcoder incorporating cascaded decoders/coders related to type commonly used in digital recording systems. Input data stream in first format is received by transcoder decoder 10. Coding parameters are supplied from first output of decoder 10 to first input of transcoder coder 30. Second output signal of decoder 10 incorporates full video signal which is supplied to first input of adder 24. Output signal of watermark generator 22 is passed to second input of adder 24. Output signal of the latter is supplied to second input of coder 30. Output signal of the coder 30 includes information to be recorded in second format which is compatible with data medium.

EFFECT: provision for dispensing with additional complex recovery and re-compression systems.

9 cl, 8 dwg

FIELD: methods for embedding watermarks (spatial pseudonoise sequence) into informational signal (compressed video stream).

SUBSTANCE: watermark is embedded by selective dropping of the least quantized coefficients of discrete-cosine transformation (DCT). The dropped coefficients are sequentially joined in series of remaining coefficients. The decision whether to drop current coefficient or not is made on the basis of preliminary calculated DCT coefficient in watermark buffer and the quantity of already dropped coefficients on the DCT block of 8x8 size.

EFFECT: very simple scheme of bit transfer speed control; lack of necessity for drift compensation.

8 cl, 9 dwg

FIELD: engineering of systems for encoding moving image, namely - methods for encoding moving image, directed at increase of encoding efficiency with use of time-wise remote supporting frames.

SUBSTANCE: in the method in process of encoding/decoding of each block of B-frame in direct prediction mode movement vectors are determined, using movement vector of shifted block in given frame, utilized for encoding/decoding B-frame, and, if type of given frame is time-wise remote supporting frame, one of movement vectors, subject to determining, is taken equal to movement vector of shifted block, while another one of movement vectors, subject to determining, is taken equal to 0.

EFFECT: increased encoding efficiency in direct prediction mode, decreased amount of information bits for frame, wherein a change of scene occurs.

2 cl, 6 dwg

FIELD: engineering of systems for encoding moving images, namely, methods for encoding moving images, directed at increasing efficiency of encoding with use of time-wise remote supporting frames.

SUBSTANCE: method includes receiving index of supporting frame, standing for supporting frame, pointed at by other block, providing movement vector for determining movement vector of current block, and determining movement vector of current block with utilization of supporting frame index, denoting a supporting frame.

EFFECT: increased efficiency of encoding in direct prediction mode, decreased number of information bits for frame, in which scene change occurs.

3 cl, 6 dwg

FIELD: systems for encoding and decoding video signals.

SUBSTANCE: method and system for statistical encoding are claimed, where parameters which represent the encoded signal are transformed to indexes of code words, so that decoder may restore the encoded signal from aforementioned indexes of code words. When the parameter space is limited in such a way that encoding becomes inefficient and code words are not positioned in ordered or continuous fashion in accordance with parameters, sorting is used to sort parameters into various groups with the goal of transformation of parameters from various groups into indexes of code words in different manner, so that assignment of code word indexes which correspond to parameters is performed in continuous and ordered fashion. Sorting may be based on absolute values of parameters relatively to selected value. In process of decoding, indexes of code words are also sorted into various groups on basis of code word index values relatively to selected value.

EFFECT: increased efficiency of compression, when encoding parameters are within limited range to ensure ordered transformation of code word indexes.

6 cl, 3 dwg

FIELD: technology for encoding and decoding of given three-dimensional objects, consisting of point texture data, voxel data or octet tree data.

SUBSTANCE: method for encoding data pertaining to three-dimensional objects includes following procedures as follows: forming of three-dimensional objects data, having tree-like structure, with marks assigned to nodes pointing out their types; encoding of data nodes of three-dimensional objects; and forming of three-dimensional objects data for objects, nodes of which are encoded into bit stream.

EFFECT: higher compression level for information about image with depth.

12 cl, 29 dwg

The invention relates to the representation of three-dimensional objects on the basis of images with depth

The invention relates to the representation of three-dimensional objects on the basis of images with depth

The invention relates to the representation of three-dimensional objects obtained using photos of real objects

The invention relates to photo - and video system technology

The invention relates to the encoding of the synthesized images

The invention relates to the encoding of the synthesized images

FIELD: technology for encoding and decoding of given three-dimensional objects, consisting of point texture data, voxel data or octet tree data.

SUBSTANCE: method for encoding data pertaining to three-dimensional objects includes following procedures as follows: forming of three-dimensional objects data, having tree-like structure, with marks assigned to nodes pointing out their types; encoding of data nodes of three-dimensional objects; and forming of three-dimensional objects data for objects, nodes of which are encoded into bit stream.

EFFECT: higher compression level for information about image with depth.

12 cl, 29 dwg

Up!