WO2001041450A1 - Verfahren und anordnung zur codierung bzw. decodierung einer zahlenfolge - Google Patents
Verfahren und anordnung zur codierung bzw. decodierung einer zahlenfolge Download PDFInfo
- Publication number
- WO2001041450A1 WO2001041450A1 PCT/DE2000/004241 DE0004241W WO0141450A1 WO 2001041450 A1 WO2001041450 A1 WO 2001041450A1 DE 0004241 W DE0004241 W DE 0004241W WO 0141450 A1 WO0141450 A1 WO 0141450A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- digit
- sequence
- digits
- registered
- significant
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/34—Scalability techniques involving progressive bit-plane based encoding of the enhancement layer, e.g. fine granular scalability [FGS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/20—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using video object coding
- H04N19/29—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using video object coding involving scalability at the object level, e.g. video object layer [VOL]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/33—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability in the spatial domain
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
Definitions
- the invention relates to a method and an arrangement for coding or decoding a sequence of numbers.
- Such a method is known from [1] and is usually carried out with image compression.
- Image coding standard MPEG2 for coding and decoding a sequence of digital images and is based on the principle of block-based image coding.
- the block-based, hybrid DCT consists of a temporal processing level (interframe coding), which takes advantage of the relationship between successive images, and a local processing level (intraframe coding), which uses correlations within an image.
- the local processing essentially corresponds to the classic DCT coding.
- the image is broken down into blocks of 8x8 pixels, which are each transformed using the DCT.
- the result is a matrix of 8x8 coefficients, which approximately reflect the two-dimensional spatial frequencies in the transformed image block.
- a coefficient with frequency 0 (DC component) represents an average gray value of the image block.
- the coefficients are spectrally weighted, so that the amplitude accuracy of the high-frequency coefficients is reduced.
- the coefficients are spectrally weighted, so that the amplitude accuracy of the high-frequency coefficients is reduced.
- a second step of data reduction takes place in the form of an adaptive quantization, by means of which the amplitude accuracy of the coefficients is further reduced or by which small amplitudes are set to zero.
- the degree of quantization depends on the fill level of a buffer:
- the block is scanned diagonally ("z ⁇ gzag" scanning). Then there is one
- variable data rate of the VLC is smoothed for decoding, for example a moving average.
- the time differences are only small, even if the movements in the picture are small. If, on the other hand, the movements in the picture are large, large differences arise, which in turn are difficult to code. For this reason, the picture-to-picture movement is measured (movement estimation or prediction) and compensated before the difference is formed (movement compensation).
- the motion information is transmitted with the image information, usually only one motion vector per macro block (e.g. four 8x8 image blocks) is used.
- the motion-compensated hybrid has a recursion loop, because the predictor must calculate the prediction value from the values of the already transmitted (coded) images.
- a corresponding recursion loop is located in the decoder, so that the encoder and decoder are synchronized.
- [5] discloses a method for estimating motion in the context of a method for block-based image coding.
- An object-based image compression method which is known from [9], is based on a decomposition of the image into
- the individual objects are coded separately in different "Video Object Plans", transmitted and reassembled in a receiver (decoder).
- the entire picture is divided into square picture blocks.
- This principle is also adopted in object-based methods in that the object to be coded is divided into square blocks and a movement estimation with movement compensation is carried out separately for each block.
- Image data will be lost. Such a loss of image data manifests itself in the form of drastic quality changes in more or less large image areas.
- a transmission channel can also be disturbed by reducing the transmission capacity of the transmission channel. Since, as described above, methods of motion estimation with motion compensation are used for image coding / image decoding, the image interference does not disappear even if the transmission channel again ensures error-free transmission.
- Video data compression methods based on the well-known image coding standards H.261 [3], JPEG [4] and MPEG2 [2] use motion-compensated prediction (motion estimation with error correction) and transformation-based residual error coding, whereby the discrete cosine transformation is preferably used as the transformation coding.
- [1] discloses a method for scalable coding (hierarchical coding) in the context of picture coding.
- an image is divided into basic information with a predetermined image quality and additional information for producing a complete or improved image quality (sufficient image quality).
- the basic information which has quantized DCT coefficients, is encoded and transmitted in a base data stream (base layer).
- the additional information which has a difference between the non-quantized DCT coefficients and the quantized DCT coefficients, is also encoded and transmitted in an additional data stream (enhancement layer).
- the values of the quantized DCT coefficients and the difference values are represented as a sequence of numbers from binary numbers. This number sequence is ordered according to a scan sequence of the "zigzag ⁇ scanning.
- the ordered number sequence is represented as a two-dimensional data block or matrix, in which a column comprises digits of the binary number.
- the matrix is coded line by line with a run length coding as is known from [1].
- the basic information is transmitted in the base layer, the additional information is transmitted in the enhancement layer.
- the invention is based on the problem of a method for coding a sequence of numbers, as occurs, for example, in the above-described method for coding the additional information, and a method for decoding a sequence of numbers, and an arrangement for coding a sequence of numbers and an arrangement for decoding one
- the sequence of numbers is split up into m sequences of digits , where the k th digit of the i th digit sequence is the i th digit of the k th number.
- a first digit sequence of the digit sequences is encoded in such a way that for each significant digit found a position using the sequence information 1 of the corresponding number is determined and the determined
- Each subsequent sequence of digits of the digit sequences is encoded in such a way that the digits of all registered positions are registered and for each significant digit found on an unregistered position the position is determined using the sequence information 1 of the corresponding number and the determined position and the significant digit are registered become.
- the arrangement for coding a sequence of numbers comprising numbers, each number represented by digits from a group of digits, which comprises a non-significant digit and at least one significant digit, and whose number is assigned sequence information 1, has a processor which is set up in this way is that the number sequence can be split into m number sequences, the k-th number of the i-th number sequence being the i-th number of the k-th number, a first number sequence of the number sequences can be coded in such a way that for each significant number found one Position is determined using the following information 1 of the corresponding number and the determined
- Position and the significant digit are registered, - each subsequent digit sequence of the digit sequences can be coded in such a way that the digits of all registered positions are registered and the position for each significant digit found on an unregistered position is determined using the sequence information 1 of the corresponding number and the determined position and the significant number are registered.
- Coding method encodes in such a way that a number sequence comprising numbers, each number of which is represented by the digits from a group of numbers, which comprises a non-significant number and at least one significant number and whose number is assigned sequence information 1, is split up into m Sequences of digits, whereby the kth digit of the ith digit sequence is the ith digit of the kth number,
- a first digit sequence of the digit sequences is coded in such a way that for each significant digit found, a position is determined using the sequence information 1 of the corresponding number and the determined one
- each subsequent digit sequence of the digit sequences is coded in such a way that the digits of all registered positions are registered and for each significant digit found on an unregistered position the position is determined using the sequence information 1 of the corresponding number and the determined position and the significant number are registered.
- the arrangement for decoding a coded sequence of numbers has a processor which is set up in such a way that a conversion is carried out for numbers of the coded sequence of numbers or the reconstruction of digits can be carried out using a method inverse to coding.
- the coded sequence of numbers was coded using the coding method in such a way that a sequence of numbers comprising numbers, each number of which is represented by the digits from a group of digits, which comprises a non-significant digit and at least one significant digit, and each number of which is a sequence of information 1 is assigned, is split into m digit sequences, the kth digit of the i th
- Sequence of digits is the i-th digit of the k-th number, a first digit sequence of the digit sequences is encoded in such a way that a position is determined for each significant digit found using the sequence information 1 of the corresponding number and the determined number
- Position and the significant digit are registered, - each subsequent digit sequence of the digit sequences is coded in such a way that the digits of all registered positions are registered and the position for each significant digit found on an unregistered position is determined using the sequence information 1 of the corresponding number and the determined position and the significant number are registered.
- the invention or any further development described below can also be implemented by a computer program product which has a storage medium on which a computer program which carries out the invention or further development is stored.
- each number of the sequence of numbers is represented as a binary expression.
- the group of digits includes a zero digit, which is the non-significant digit, and a one digit, which is the significant digit.
- the number with the maximum number of digits is determined.
- the coding prefferably set the number m of sequences of digits corresponding to this maximum number of digits.
- the second series of digits are ordered according to a value of the digits.
- a first digit sequence of the digit sequences comprises all first digits.
- a second string of digits the sequence of digits includes all second digits, etc.
- the rate sequence of digits of the sequence of digits thus includes at least the maximum digit.
- the digit sequences are rated in such a way that the first digit sequence having the method according to the maximum number.
- the number sequence has coded image information.
- a simplification is achieved if the registered positions are saved in a sequence.
- the registered digits can also be processed further. As part of this further processing, each registered digit can be checked to determine whether a C oding and transfer for reconstruction of the corresponding number is necessary.
- Such a case can occur if a value of a number of the number sequence exceeds a certain threshold value, which can be derived from the number m of the sequence of numbers.
- Fig.l is a sketch illustrating a coding of images, each having basic information and additional information; 2 shows a sketch which illustrates how the coding of additional information of an image block takes place;
- FIG. 3 shows a sketch with an image encoder and an image decoder
- FIG. 6 shows a sketch which illustrates a sequence in the coding of additional information
- FIG. 7 shows a sketch that illustrates a sequence in the coding of additional information
- FIG. 8 shows a sketch that illustrates a sequence when coding additional information.
- FIG. 1 shows a sketch which illustrates a coding of images of an image sequence, which images each have basic information and additional information.
- the additional information Z is based on the basic information B of each individual image 101 to 103.
- the additional information Z of the images are not linked to one another, that is to say depending on a current disturbance or a currently available transmission capacity of a transmission channel of the transmission channel, more or less additional information Z is used per image in the form of a progressive method, as described in [1] to improve the respective image quality of the individual image more or less.
- the transmission channel is severely disturbed for a short time or the currently available channel capacity is reduced, it can happen with a single picture that only little data of the additional information Z can be used for the reconstruction of the picture.
- this image could be displayed in a quality that differs only insignificantly from the quality ensured by the basic information B.
- the entire additional information Z can already be usable in the temporally subsequent image.
- This subsequent image is accordingly in quality, which is obtained from information of the basic information B and
- Figure 2 shows a sketch illustrating how the
- difference coefficients ⁇ DCT which consist of the non-quantized DCT coefficients of an image block and the associated quantized DCT Coefficients are determined, shown coded (see FIG. 6, step 610).
- the difference coefficients ⁇ DCT are each represented as binary values 204 from the numbers 0 202 (non-significant number) or 1 203 (significant number), 201 being arranged in a first dimension 205 of the data block with an increasing value m (see FIG 6, step 610).
- Each bit is assigned to a bit level 206 with the valency m.
- the difference coefficients ⁇ DCT are arranged in a second dimension 207 in accordance with a scanning sequence 1 of a “zigzag” scanning of the image block (cf. FIG. 6, step 610).
- difference coefficients ⁇ DCT are each identified by a marking x 209, the associated quantized DCT coefficient of which has a value other than zero.
- the coding of the data block takes place according to the
- the further bit planes 206 are encoded in succession in accordance with the decreasing significance m.
- the bit level with the significance 1 is encoded as the last bit level 206.
- the bit level with the highest significance m max 210 is encoded with a run length coding with a variable length code, as described in [1].
- bits are searched for in this bit level that have the number 1 220. Their positions 222 in the bit plane 210 are determined and registered. Under
- the run lengths 221 are determined for the corresponding difference coefficients ⁇ DCT.
- the information about the registered positions 222 is used and supplemented for coding the bit planes 206 with a lower value m.
- bit planes 206 are each encoded according to the following scheme (see FIG. 6, steps 630, 640, 650 and 660):
- bits 223 are determined in the bit plane 206 to be currently coded which have the number 1 and are at a position that has not yet been registered (cf. FIG. 6, steps 640), the numbers 224 of this bit 223 are registered (cf. FIG. 6, steps 640),
- the positions 225 of these bits are determined and also registered (cf. FIG. 6, steps 640), - Using the registered positions 225, 222, the run lengths 225 to the currently determined positions or to the corresponding difference coefficients ⁇ DCT are determined (cf. 6, steps 650), - when determining the run lengths, positions 222 that have already been registered are not counted (shortened run lengths 225) (see FIG. 6, steps 650), the digits and the run lengths are encoded (see FIG. 6, steps 660) ).
- FIG. 6 shows a sketch which illustrates the sequence when coding the data block or the additional information according to the above scheme.
- FIG. 3 shows a sketch of an arrangement for carrying out a block-based image coding method.
- a video data stream to be encoded with chronologically successive digitized images is fed to an image coding unit 1201.
- the digitized images are divided into macro blocks 1202, each macro block having 16x16 pixels.
- the macro block 1202 comprises four picture blocks 1203, 1204, 1205 and 1206, each picture block containing 8x8 picture elements to which luminance values (brightness values) are assigned.
- each macroblock 1202 comprises two chrominance blocks 1207 and 1208 with chrominance values (color difference values) assigned to the pixels.
- the image blocks are fed to a transformation coding unit 1209.
- a transformation coding unit 1209 In the case of differential image coding, values to be coded from image blocks of temporally preceding images are subtracted from the image blocks to be currently coded; only the difference formation information 1210 is supplied to the transformation coding unit (Discrete Cosine Transformation, DCT) 1209.
- DCT Discrete Cosine Transformation
- the current macro block 1202 is communicated to a movement estimation unit 1229 via a connection 1234.
- Spectral coefficients 1211 are formed in the transformation coding unit 1209 for the image blocks or differential image blocks to be coded, and are fed to a quantization unit 1212.
- Quantized spectral coefficients 1213 become both a scan unit 1214 and an inverse
- Quantization unit 1215 m fed to a reverse path.
- a scanning method for example a "zigzag" scanning method
- entropy coding is carried out on the scanned spectral coefficients 1232 in an entropy coding unit 1216 provided for this purpose.
- the entropy-coded spectral coefficients are transmitted as coded image data 1217 via a channel, preferably a line or a radio link, to a decoder.
- inverse quantization unit 1215 there is a mverse quantization of the quantized spectral coefficients 1213.
- Spectral coefficients 1218 obtained in this way are fed to an inverse transformation coding unit 1219 (inverse discrete cosine transformation, IDCT).
- IDCT inverse discrete cosine transformation
- Reconstructed coding values (also differential coding values) 1220 are supplied to an adder 1221 in the differential image mode.
- the adder 1221 also receives coding values of an image block, which result from a temporally previous image after motion compensation has already been carried out.
- the adder 1221 is used to reconstruct
- Image blocks 1222 are formed and stored in an image memory 1223.
- Chrominance values 1224 of the reconstructed image blocks 1222 become one from the image memory 1223
- Motion compensation unit 1225 supplied.
- an interpolation takes place in an interpolation unit 1227 provided for this purpose. Based on the interpolation, the number m of brightness values contained in the respective image block is preferably doubled. All brightness values 1228 are supplied to both the motion compensation unit 1225 and the motion estimation unit 1229.
- the motion estimation unit 1229 also receives the image blocks of the macro block to be coded in each case (16 ⁇ 16 pixels) via the connection 1234.
- the movement estimation takes place taking into account the interpolated brightness values ("movement estimation on a half-pixel basis").
- the movement estimation takes place taking into account the interpolated brightness values ("movement estimation on a half-pixel basis").
- absolute differences of the individual brightness values are preferably determined in the macro block 1202 currently to be coded and the reconstructed macro block from the previous image.
- the result of the motion estimation is a motion vector 1230, by means of which a local displacement of the selected macroblock from the temporally preceding image to the macroblock 1202 to be coded is expressed.
- Both brightness information and chrominance information relating to the macroblock determined by the motion estimation unit 1229 are shifted by the motion vector 1230 and subtracted from the coding values of the macroblock 1202 (see data path 1231).
- FIG. 5 shows an arrangement for image coding and image decoding.
- FIG. 5 shows a camera 501 with which images are recorded.
- the camera 501 is an analog camera 501, which records images of a scene and transmits the images in analog form to a first computer 502.
- the first computer 502 converts the analog images into digitized images 503 and processes the digitized images 503.
- the first computer 502 is designed as an independent arrangement in the form of an independent computer card, which is installed in the first computer 502, with which computer card the method steps described below are carried out.
- the first computer 502 has a processor 504 with which the method steps of image coding described below are carried out.
- the processor 504 is coupled via a bus 505 to a memory 506 in which image information is stored.
- the method described below for image coding is implemented in software. It is stored in memory 506 and executed by processor 504.
- the image decoding is carried out in the second computer 508.
- the second computer 508 has the same structure as the first computer 501.
- the second computer 508 also has a processor 509, which processor 509 is coupled to a bus 510 by a memory 510.
- FIG. 4 shows a processor unit PRZE 401, which is used for image coding or for image decoding.
- the processor unit PRZE 401 comprises a processor CPU 402, a memory MEM 403 and an input / output interface IOS 404, which is used in different ways via an interface IFC 405:
- Output is displayed on a MON 406 monitor and / or output on a PRT 407 printer via a graphic interface. Input is made using a MAS 408 mouse or a TAST 409 keyboard.
- the processor unit PRZE 401 also has a data bus BUS 410, which ensures the connection of the memory MEM 403, the processor CPU 402 and the input / output interface IOS 404.
- Additional components can also be connected to the BUS 410 data bus, e.g. additional memory, data storage (hard disk) or scanner.
- the digits registered when coding the additional information are processed further (cf. FIG. 7, step 745).
- the digits are examined to determine whether information about the respective digit is necessary for a reconstruction of the associated difference coefficient ⁇ DCT.
- this number is not encoded and is not transmitted.
- shortened run lengths in the bit level with the highest significance m max are also determined (cf. FIG. 7, steps
- those bits can be determined in the highest bit level which can only have the number zero. Such bits are not counted when determining a run length and thus lead to shortened run lengths.
- Value as the highest value m max is encoded with a run length coding with variable length code as described in [1] (cf. FIG. 8, steps 845 and 850).
- a mark is provided which identifies whether the current bit level is encoded according to the method known from [1] or according to the method from the exemplary embodiment.
- the method is applied to pixels or image information in the local area.
- the additional information Z in the enhancement layer is a difference image information from which the image block is restored in the decoder using the basic image information reconstructed from the quantized DCT coefficients.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19957685.8 | 1999-11-30 | ||
DE19957685A DE19957685A1 (de) | 1999-11-30 | 1999-11-30 | Verfahren und Anordnung zur Codierung bzw. Decodierung einer Zahlenfolge |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001041450A1 true WO2001041450A1 (de) | 2001-06-07 |
WO2001041450A8 WO2001041450A8 (de) | 2001-10-25 |
Family
ID=7930916
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/DE2000/004241 WO2001041450A1 (de) | 1999-11-30 | 2000-11-28 | Verfahren und anordnung zur codierung bzw. decodierung einer zahlenfolge |
Country Status (2)
Country | Link |
---|---|
DE (1) | DE19957685A1 (de) |
WO (1) | WO2001041450A1 (de) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1998037700A1 (en) * | 1997-02-19 | 1998-08-27 | Btg International Limited | Progressive block-based coding for image compression |
WO2001017268A1 (en) * | 1999-08-27 | 2001-03-08 | Koninklijke Philips Electronics N.V. | Scalable coding |
-
1999
- 1999-11-30 DE DE19957685A patent/DE19957685A1/de not_active Withdrawn
-
2000
- 2000-11-28 WO PCT/DE2000/004241 patent/WO2001041450A1/de active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1998037700A1 (en) * | 1997-02-19 | 1998-08-27 | Btg International Limited | Progressive block-based coding for image compression |
WO2001017268A1 (en) * | 1999-08-27 | 2001-03-08 | Koninklijke Philips Electronics N.V. | Scalable coding |
Non-Patent Citations (3)
Title |
---|
LI J ET AL: "AN EMBEDDED DCT APPROACH TO PROGRESSIVE IMAGE COMPRESSION", LAUSANNE, SEPT. 16 - 19, 1996,NEW YORK, IEEE,US, 16 September 1996 (1996-09-16), pages 201 - 204, XP000780627, ISBN: 0-7803-3259-8 * |
LI, WEIPING: "Fine Granularity Scalability Using Bit-Plane Coding of DCT Coefficients", INTERNATIONAL ORGANIZATION FOR STANDARDIZATION ISO/IEC JTC1/SC29/WG11, December 1998 (1998-12-01), pages 1 - 9, XP002165187 * |
LING F ET AL: "BITPLANE CODING OF DCT COEFFICIENTS FOR IMAGE AND VIDEO COMPRESSION", PROCEEDINGS OF THE SPIE, 1998, XP000892979 * |
Also Published As
Publication number | Publication date |
---|---|
WO2001041450A8 (de) | 2001-10-25 |
DE19957685A1 (de) | 2001-06-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE69116869T2 (de) | Digitale bildkodierung mit einer zufallsabtastung der bilder | |
DE69837497T2 (de) | Verfahren und vorrichtung zum kodieren eines videosignals | |
EP1025708B1 (de) | Verfahren und vorrichtung zur verarbeitung eines digitalisierten bildes | |
DE10022331A1 (de) | Verfahren zur Transformationscodierung von Bewegtbildsequenzen | |
DE602004001993T2 (de) | Transformations basiertes restbewegungsrahmen kodierungsverfahren mit übervollständiger basis und zugehörige vorrichtung zur videokompression | |
EP0956539B1 (de) | Verfahren und anordnung zur codierung und decodierung eines digitalisierten bildes | |
DE69915843T2 (de) | Teilbandkodierung/-dekodierung | |
EP0773690A2 (de) | Verfahren zur Codierung eines Videodatenstroms | |
DE69126525T2 (de) | Digitale bildverarbeitung mit filterung der blockkanten | |
DE19717608B4 (de) | Wahrnehmungsfehlerbearbeitungsverfahren und Bildkodierungsvorrichtung, welche dieses Verfahren verwendet | |
EP0956703B1 (de) | Verfahren und anordnung zur codierung und decodierung eines digitalisierten bildes | |
EP0985317B1 (de) | Verfahren zur codierung und decodierung eines digitalisierten bildes | |
EP1425920A2 (de) | Verfahren zur videocodierung und computerprogrammprodukt | |
EP1101196B1 (de) | Verfahren und anordnung zur bewegungsschätzung in einem digitalisierten bild mit bildpunkten | |
EP1110407B1 (de) | Verfahren und anordnung zur codierung und decodierung eines digitalisierten bildes mit anwendung eines gesamtbewegungsvektors | |
EP1285537B1 (de) | Verfahren und eine anordnung zur codierung bzw. decodierung einer folge von bildern | |
DE69909880T2 (de) | Dekodierung eines komprimierten digitalen Bildsignals | |
WO2001062009A1 (de) | Verfahren und anordnung zur kodierung bzw. zur kodierung und dekodierung einer zahlenfolge | |
EP1116184A1 (de) | Verfahren und anordnung zur bearbeitung eines digitalisierten bildes mit bildpunkten | |
EP0981910B1 (de) | Verfahren und vorrichtung zur codierung eines digitalisierten bildes | |
WO2001041450A1 (de) | Verfahren und anordnung zur codierung bzw. decodierung einer zahlenfolge | |
WO2001049038A1 (de) | Verfahren, anordnung und computerprogrammerzeugnis zur prädiktion bei der codierung eines in bildblöcke unterteilten bildes | |
EP1121809B1 (de) | Verfahren und anordnung zur codierung eines digitalisierten bildes, verfahren und anordnung zur decodierung eines digitalisierten bildes | |
EP1157557A1 (de) | Verfahren und anordnung zur transformation eines bildbereichs | |
DE69838821T2 (de) | Verfahren und vorrichtung zur codierung eines videosignals |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): BR CA CN JP KR RU US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
AK | Designated states |
Kind code of ref document: C1 Designated state(s): BR CA CN JP KR RU US |
|
AL | Designated countries for regional patents |
Kind code of ref document: C1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
CFP | Corrected version of a pamphlet front page |
Free format text: REVISED ABSTRACT RECEIVED BY THE INTERNATIONAL BUREAU AFTER COMPLETION OF THE TECHNICAL PREPARATIONS FOR INTERNATIONAL PUBLICATION |
|
AK | Designated states |
Kind code of ref document: B8 Designated state(s): BR CA CN JP KR RU US |
|
AL | Designated countries for regional patents |
Kind code of ref document: B8 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
CFP | Corrected version of a pamphlet front page |
Free format text: UNDER (57) PUBLISHED ABSTRACT IN ENGLISH REPLACED BY CORRECT ABSTRACT |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
122 | Ep: pct application non-entry in european phase | ||
NENP | Non-entry into the national phase |
Ref country code: JP |