[go: up one dir, main page]

WO2001049038A1 - Procede, dispositif et produit programme informatique servant a effectuer une prediction lors du codage d'une image divisee en blocs d'image - Google Patents

Procede, dispositif et produit programme informatique servant a effectuer une prediction lors du codage d'une image divisee en blocs d'image Download PDF

Info

Publication number
WO2001049038A1
WO2001049038A1 PCT/DE2000/004095 DE0004095W WO0149038A1 WO 2001049038 A1 WO2001049038 A1 WO 2001049038A1 DE 0004095 W DE0004095 W DE 0004095W WO 0149038 A1 WO0149038 A1 WO 0149038A1
Authority
WO
WIPO (PCT)
Prior art keywords
image
block
prediction
image block
blocks
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/DE2000/004095
Other languages
German (de)
English (en)
Inventor
Ralf Buschmann
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
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 Siemens AG, Siemens Corp filed Critical Siemens AG
Publication of WO2001049038A1 publication Critical patent/WO2001049038A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • 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, an arrangement and a computer program product for predicting the coding of an image divided into m image blocks.
  • a method for image compression with the associated arrangement is known from [1].
  • the known method serves as a coding method in the MPEG standard and is essentially based on the hybrid DCT (Discrete Cosine Transformation) with motion compensation.
  • DCT Discrete Cosine Transformation
  • the procedure is for video telephones with nx 64kb ⁇ t / s (CCITT recommendation H.261, H.263), for TV contribution (CCIR recommendation 723) with 34 or 45Mb ⁇ t / s and for multimedia applications with 1.2Mb ⁇ t / s (ISO-MPEG-1) is used.
  • the hybrid DCT consists of a temporal processing stage that takes advantage of the relationship between successive images and a local processing stage that uses the local correlation within an image.
  • Intra-frame coding essentially corresponds to classic DCT coding.
  • the image is broken down into m blocks of 8x8 pixels, each of which is transformed using DCT m the frequency range.
  • 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 properties of the human eye are used, which dissolve high spatial frequencies less accurately than low ones.
  • the data reduction takes the form of an adaptive one
  • Quantization by means of which the amplitude accuracy of the coefficients is further reduced or by which the small amplitudes are set to zero.
  • the degree of quantization depends on the fill level of the output buffer: when the buffer is empty, fine quantization takes place so that more data is generated, while when the buffer is full, it is coarser, which reduces the amount of data to be transferred.
  • variable-length coding VLC
  • EOB code End Of Block
  • 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) and compensated before the difference is formed (movement compensation).
  • the motion information is transmitted with the image information, usually only one motion vector per macroblock (e.g. four 8x8 image blocks) is used.
  • the coder In the case of a motion-compensated hybrid or not the image signal itself is transformed, but the temporal difference signal after the motion compensation. For this reason, the coder also has a recursion time loop, because the predictor must
  • I-pictures No temporal prediction is used for the I-pictures, i.e. the picture values are directly transformed and encoded. I-pictures are used in order to be able to start the decoding process again without knowing the past, or to resynchronize
  • a temporal prediction is made on the basis of the P-pictures, the DCT is applied to the temporal prediction error.
  • the bidirectional prediction works basically adaptively, i.e. it will be one
  • a picture sequence is divided into so-called GOPs (Group Of Pictures), n pictures from one I picture to the next form a GOP.
  • GOPs Group Of Pictures
  • the distance between the P-pictures is denoted by, wherein there are m-1 B-pictures between the P-pictures.
  • [2] discloses a method for estimating motion in the context of a method for block-based image coding. It is assumed that a digitized image
  • an image block can also comprise several image blocks.
  • the image block for which a motion estimation is to be carried out is carried out in a temporally preceding image, starting from an image block which was located in the same relative position in the previous image
  • a value for an error measure is determined.
  • a sum is preferably determined via the magnitude of the differences between the coding information of the picture block and the previous picture block assigned to the picture elements.
  • Coding information here means brightness information (luminance value) and / or color information (chrominance value), each of which is assigned to a pixel. "In a search space of a predeterminable size and shape around the starting position in the previous image, a value of the error measure is determined for an area of the same size of the previous image block, shifted by one or half an image point.
  • Picture block is assumed that this previous picture block best matches the picture block of the picture to be encoded for which the motion estimation is to be performed.
  • the result of the movement estimation is a
  • Motion vector with which the displacement between the image block m the image to be encoded and the selected image block is described in the previous image.
  • Compression of the image data is achieved in that the motion vector and the error signal are encoded.
  • the motion estimation is carried out for each image block of an image.
  • An ect-based image compression method is based on a decomposition of the image into objects with any
  • Boundary The individual objects are encoded separately in different "Video Object Plans", transmitted and reassembled in a receiver (decoder). As described above, in conventional coding methods, the entire picture is divided into m square picture blocks. This principle is also adopted in object-based methods, in that the object to be coded is divided into m square blocks and a movement estimation with movement compensation is carried out separately for each block. The coding of edge blocks is problematic since the edge of the object generally does not match the block edges.
  • block matchmg method is used for block-based image compression methods. It is based on the fact that the picture block to be coded is compared with picture blocks of the same size of a reference picture. One of the reference picture blocks is in the same position as the picture block to be coded, the others
  • Reference image blocks are shifted in relation to this.
  • a large search area in the horizontal and vertical directions, there are numerous search positions, so that a correspondingly large number of block comparisons must be carried out when the search is complete.
  • a sum is generally used the absolute differences of the individual pixels.
  • Such a search procedure is also often associated with so-called rate boundary conditions according to [2] in order to make the motion vectors robust against incorrect estimates. This improves the picture quality.
  • the quality of the prediction determines the data rate for the transmission of the image and thus the image quality at the receiver (decoder).
  • the blocks within a block cell are usually processed from left to right and within an image from top to bottom and transmitted to the decoder. This processing creates a local neighborhood for an image block currently to be transmitted, which at best consists of three picture blocks adjacent above and a left picture block already transmitted.
  • the object of the invention is to carry out a prediction which delivers significantly improved results with regard to data rate and performance and thus enables either a lower data rate for the same image quality or a higher image quality for the same data rate. This object is achieved according to the features of the independent claims.
  • a method for predicting the coding of an image subdivided into image blocks is specified, in which at least one image block in the neighborhood is used for prediction for a current image block, the at least one image block in the neighborhood being determined by a m the image block following the display order.
  • the image data transmission that is to say the transmission of the digital image divided into m image blocks, preferably takes place from an encoder to the decoder.
  • the image data are transmitted as a data stream, the data stream being unpacked and, in particular, displayed on the decoder side.
  • Image compression with prediction is expediently carried out on the encoder.
  • the order of representation relates in particular to the order of the decoder, i.e. image blocks shown on the receiver after decoding.
  • Error correction compensates for errors associated with prediction (differences between image blocks).
  • the prediction is an intra-prediction.
  • Coding the image blocks of an image results in a display order from left to right (per line) to the picture is processed.
  • a prediction of a current image block (or a part thereof) based on an image block on the right-hand side fulfills the above-mentioned condition.
  • prediction is a motion-compensated prediction (inter-coding, movement estimation).
  • Image blocks in particular, are predicted using a previous image (and the image blocks contained therein) (motion estimation, explanations see above).
  • the current block is preferably buffered and the subsequent block is first coded.
  • the coding of the current image block is now carried out on the basis of the image block which has just been transmitted but which follows the display sequence.
  • a motion vector for the current image block is determined as part of the motion estimation.
  • the motion vector is based on the
  • Motion vectors of the blocks m of the local neighborhood are predicted, so that the smallest possible difference to the motion vectors from the neighborhood manifests itself in a low data transmission rate.
  • a large difference in the motion vector would lead to the fact that a corresponding amount of data had to be transmitted and thus the required data rate increased or the image quality decreased accordingly.
  • a further development consists in that in particular several picture blocks from the local neighborhood are used to predict the current picture block.
  • both image blocks following the display sequence for the current image block and previous image blocks can be used for the prediction of the current image block.
  • One embodiment consists in that the current image block is subdivided into m a first part and m a second part, different blocks of the local neighborhood including at least one of the m being used to predict the first and the second part
  • An example of an intra-prediction is that an edge divides the current image block m a left sub-block and m a right sub-block.
  • the edge in this case is a texture edge, i.e. the texture in the left sub-block can be better predicted from the predecessor block and the texture in the right sub-block can be better predicted from the successor block.
  • the edge is expediently an edge of a moving object. It is particularly important that the image areas on the left and right in the block are caused by different shifts in the image signal in the previous block, i.e. they each have different displacement vectors.
  • the first part is a left part of the current image block and the second part is a right part of the current image block.
  • the order of presentation refers to the prediction of the left part of the current image block, particularly to the previous left image block, whereas the right part of the current image block, among others. is decoded using the right image block.
  • the subdivision of the current image block is determined analytically. If, for example, an edge is involved, it is advantageous to describe this edge functionally. An approximate description of the course of the edge, for example as a straight line, saves a significant data rate.
  • edge or the subdivision of the current image block can also be described using a specific syntax selected for the coding.
  • coding patterns By means of certain coding patterns, the course of object edges within the current image block can be determined.
  • Such coding has the advantage that it can be extremely memory efficient.
  • Another embodiment consists in that a decoding of an image divided into m image blocks, which has been encoded according to the above method, is carried out, the current image block being predicted on the basis of at least one image block lying in the neighborhood.
  • the decoder can expediently be expanded to include a semantics of the coding by dividing the currently received image data block.
  • Such coding can be coupled with corresponding information for restoring the left sub-block and the right sub-block of the current image block. If different environments (contexts, expertise) are taken into account for the right or left sub-block, this can be communicated to the decoder by suitable coding on the side of the encoder.
  • Such coding as is customary in communication protocols, can be carried out by different masking of code words.
  • an arrangement for predicting the coding of an image divided into m image blocks in which a processor unit is provided which is set up in such a way that at least one image block in the neighborhood m is used for the prediction for a current image block, whereby the at least one of the
  • Neighboring image block is determined by an image block following in the display order.
  • a computer program product for predicting the coding of an image subdivided into image blocks is specified for solving the task
  • Execution of the following steps enables: for a current picture block, at least one picture block lying in the neighborhood is used for prediction, wherein the at least one picture block lying in the neighborhood can be determined by a picture block following the sequence of representation.
  • the arrangement and the computer program product are particularly suitable for carrying out the method according to the invention or one of its developments explained above.
  • Fig.l is a sketch showing a Cod ⁇ réelles- / representation order of picture blocks
  • FIG. 3 shows a sketch with an image encoder and an image decoder
  • Fig.l shows a sketch that illustrates a coding or presentation order of image blocks.
  • Fig.l two lines 111 and 112 are shown with image blocks 101 to 106.
  • Different block modes I to V for block 105 will be described below.
  • an edge 113 optionally runs through the image blocks 102 and 105, left partial blocks 107 and 109 and right partial blocks 108 and 110 being formed in each case.
  • block modes (combination modes):
  • Intra-prediction is understood to mean that a prediction is made only from the currently decoded image signal, ie the local environment of the current image is taken into account in the prediction. Inter-Praditation however, the (temporal) previous image signal (image) is also taken into account.
  • the image block 105 is not divided into two parts by an edge m, it is predicted from surrounding blocks (of the current image), in particular on the basis of the subsequent block 106.
  • the prediction takes place particularly in the signal range or in the DCT range.
  • the image block 105 is divided by the edge 113 m, the left sub-block 109 and the right sub-block 110.
  • Sub-blocks 109 and 110 are predicted individually: for sub-block 109, a prediction results from blocks or sub-blocks 101, 107 and 104.
  • For sub-block 110 a prediction results from blocks or sub-blocks 106, 108 and 103.
  • the edge describes a texture edge, for example a transition between the colors black and white.
  • An inter-prediction (without edge) is to be carried out for the image block 105.
  • a movement estimate is made for block 105, the resulting displacement vector (displacement vector) is determined on the basis of displacement vectors of the surrounding blocks 101, 102, 103, 104 and 106. If necessary, the residual error image is encoded. This results in a saving in terms of a bit rate necessary for the shift vector.
  • an inter-prediction is now made taking into account edge 113.
  • the edge is preferably an object edge of a moving one Object, ie the sub-blocks 109 and 110 have different displacements.
  • ⁇ the displacement vector for sub-block 109 from the image blocks or sub-blocks 101, 107 and 104 and ⁇ the displacement vector for sub-block 110 from the image blocks or sub-blocks 108, 103 and 106 are determined and encoded.
  • the displacement vector for sub-block 109 can be set equal to the displacement vector for block 104 and, accordingly, the displacement vector for sub-block 110 can be set equal to the displacement vector for block 106.
  • block mode II can be used for sub-block 109 and block mode III for sub-block 110.
  • FIG. 2 shows a sketch with a case distinction and the possibilities for combining the block modes explained in FIG.
  • step 201 a decision is made as to whether an edge (113 in FIG. 1) is present. If this is not the case, a branch is made to point 202 and a decision is made as to whether an inter-prediction 203 or an intra-prediction 204 should be carried out.
  • the edge 113 divides the image block into m a left sub-block 205 (see reference number 109 m FIG. 1) and m a right sub-block 206 (see reference number 110 m FIG. 1). Now the left sub-block 205 and the right sub-block 206 can either be m-predicted or m-predicted (cf. blocks 207 to 210).
  • 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 temporally 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 macro block 1202 comprises two chrominance blocks 1207 and 1208 with the chrominance values assigned to the pixels (color information, color saturation).
  • the block of an image contains a luminance value
  • luminance value, first chrominance value and second chrominance value are referred to as color values.
  • 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 currently to be coded; only the difference formation information 1210 of the transformation coding unit (Discrete Cosine Transformation, DCT) 1209 is supplied. This is done via a Connection 1234 the current macroblock 1202 a motion estimation unit 1229 communicated.
  • spectral coefficients 1211 are formed for the picture blocks or difference picture blocks to be coded and fed to a quantization unit 1212.
  • Quantized spectral coefficients 1213 are fed to both a scan unit 1214 and an inverse quantization unit 1215 on a backward path.
  • entropy coding is carried out on the scanned spectral coefficient 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 an inverse quantization of the quantized spectral coefficients 1213.
  • Spectral coefficients 1218 obtained in this way are supplied to an inverse transformation coding unit 1219 (inverse discrete cosine transformation, IDCT).
  • 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.
  • Reconstructed image blocks 1222 are formed with the adder 1221 and stored in an image memory 1223.
  • Chrominance values 1224 of the reconstructed image blocks 1222 are supplied from the image memory 1223 to a motion compensation unit 1225.
  • a motion compensation unit 1225 For holiness values 1226 there is an interpolation m of an interpolation unit 1227 provided for this purpose. The interpolation is used to determine the number m of the respective image block contained brightness values preferably doubled. All brightness values 1228 are supplied to both the movement compensation unit 1225 and the movement estimation unit 1229.
  • the Movement Estimation Unit 1229 also receives the
  • Motion estimation taking into account the interpolated brightness values ("motion estimation on a half-pixel basis").
  • motion 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 previous 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).
  • the processor unit PRZE comprises a processor CPU, a memory MEM and an input / output interface IOS, which is used in different ways via an interface IFC: an output becomes visible on a monitor MON and / or on a printer via a graphics interface PRT issued. An entry is made using a mouse MAS or a keyboard TAST.
  • the processor unit PRZE also has a data bus BUS, which connects the memory MEM, the processor CPU and the input / output interface IOS guaranteed.
  • additional components can be connected to the data bus BUS, for example additional memory, data storage (hard disk) or scanner.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

L'invention concerne un procédé servant à effectuer une prédiction lors du codage d'une image divisée en blocs d'image. Ce procédé consiste à utiliser au moins un bloc d'image voisin d'un bloc d'image actuel pour la prédiction, le bloc d'image voisin étant déterminé par l'intermédiaire d'un bloc d'image suivant dans l'ordre de représentation.
PCT/DE2000/004095 1999-12-23 2000-11-21 Procede, dispositif et produit programme informatique servant a effectuer une prediction lors du codage d'une image divisee en blocs d'image Ceased WO2001049038A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19962627.8 1999-12-23
DE19962627 1999-12-23

Publications (1)

Publication Number Publication Date
WO2001049038A1 true WO2001049038A1 (fr) 2001-07-05

Family

ID=7934244

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE2000/004095 Ceased WO2001049038A1 (fr) 1999-12-23 2000-11-21 Procede, dispositif et produit programme informatique servant a effectuer une prediction lors du codage d'une image divisee en blocs d'image

Country Status (1)

Country Link
WO (1) WO2001049038A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009080132A1 (fr) * 2007-12-21 2009-07-02 Telefonaktiebolaget L M Ericsson (Publ) Prédiction de pixel améliorée pour codage vidéo
WO2010001045A1 (fr) * 2008-07-01 2010-01-07 France Telecom Procede et dispositif de codage d'images mettant en oeuvre une prediction amelioree, procede et dispositif de decodage, signal et programmes d'ordinateur correspondants
EP1429564A4 (fr) * 2001-08-28 2012-07-25 Ntt Docomo Inc Systeme et procede de transmission/codage d'images en mouvement, appareil de codage et appareil de decodage, procedes de decodage et de codage et programme utilisable pour ces derniers
EP1878260A4 (fr) * 2005-04-15 2014-12-10 Lg Electronics Inc Procede echelonnable de codage et decodage de signaux video

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5159448A (en) * 1990-11-20 1992-10-27 Sony Corporation Highly efficient coding apparatus
EP0833520A2 (fr) * 1996-09-30 1998-04-01 Hyundai Electronics Industries Co., Ltd. Appareil et méthode de codage vidéo prédictif
EP0895424A2 (fr) * 1997-07-31 1999-02-03 Victor Company of Japan, Ltd. Procédé de codage et de décodage de signal vidéo numérique avec interpolation de blocs

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5159448A (en) * 1990-11-20 1992-10-27 Sony Corporation Highly efficient coding apparatus
EP0833520A2 (fr) * 1996-09-30 1998-04-01 Hyundai Electronics Industries Co., Ltd. Appareil et méthode de codage vidéo prédictif
EP0895424A2 (fr) * 1997-07-31 1999-02-03 Victor Company of Japan, Ltd. Procédé de codage et de décodage de signal vidéo numérique avec interpolation de blocs

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BIERLING M: "Displacement estimation by hierarchical blockmatching", VISUAL COMMUNICATIONS AND IMAGE PROCESSING '88, CAMBRIDGE, MA, USA, 9-11 NOV. 1988, vol. 1001, pt.2, Proceedings of the SPIE - The International Society for Optical Engineering, 1988, USA, pages 942 - 951, XP000863657, ISSN: 0277-786X *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1429564A4 (fr) * 2001-08-28 2012-07-25 Ntt Docomo Inc Systeme et procede de transmission/codage d'images en mouvement, appareil de codage et appareil de decodage, procedes de decodage et de codage et programme utilisable pour ces derniers
EP1878260A4 (fr) * 2005-04-15 2014-12-10 Lg Electronics Inc Procede echelonnable de codage et decodage de signaux video
WO2009080132A1 (fr) * 2007-12-21 2009-07-02 Telefonaktiebolaget L M Ericsson (Publ) Prédiction de pixel améliorée pour codage vidéo
US9049457B2 (en) 2007-12-21 2015-06-02 Telefonaktiebolaget L M Ericsson (Publ) Pixel prediction for video coding
WO2010001045A1 (fr) * 2008-07-01 2010-01-07 France Telecom Procede et dispositif de codage d'images mettant en oeuvre une prediction amelioree, procede et dispositif de decodage, signal et programmes d'ordinateur correspondants
CN102084658A (zh) * 2008-07-01 2011-06-01 法国电信公司 实施改进的预测的图像编码方法和装置、对应的解码方法和装置、信号和计算机程序
US8320692B2 (en) 2008-07-01 2012-11-27 France Telecom Image encoding method and device implementing an improved prediction, corresponding decoding method and device, signal and computer programs
CN102084658B (zh) * 2008-07-01 2013-06-05 法国电信公司 实施改进的预测的图像编码方法和装置、对应的解码方法和装置、信号和计算机程序

Similar Documents

Publication Publication Date Title
DE69620160T2 (de) Bildkodierungsgerät und Bilddekodierungsgerät
DE69623330T2 (de) Merkmalbasiertes videokompressionsverfahren
DE69801209T2 (de) Hierarchischer rekursiver Bewegungsschätzer für Bewegtbildkodierer
DE69738264T2 (de) Videokodierungs- und Videodekodierungsvorrichtung
DE69522861T2 (de) Verfahren und Einrichtung zur Codeumwandlung von codiertem Datenstrom
DE69803821T2 (de) Verfahren zur rechnerisch graziösen Degradierung in einem audio-visuellen Kompressionssystem
DE69313692T2 (de) Kodierung und Dekodierung zur Videokompression mit automatischer Halbbild/Bild Bewegungskompensation auf der Subpixelebene
DE19704439C2 (de) Verfahren und Vorrichtung zur Bewegungsschätzung in einem digitalen Videocodierer unter Verwendung von Trajektorien
DE69422564T2 (de) Verfahren zur halbpixel Bewegungskompensation in Bilddekodierung
EP1025708B1 (fr) Procede et dispositif pour le traitement d'une image numerique
DE4442643B4 (de) Verfahren zum Abschätzen der Bewegung in einem Bewegtbild
DE69126525T2 (de) Digitale bildverarbeitung mit filterung der blockkanten
EP1116184B1 (fr) Procede et systeme de traitement d'une image numerisee dotee de points d'images
EP1101196B1 (fr) Procede et dispositif d'evaluation du mouvement dans une image numerisee possedant des pixels
EP1285537B1 (fr) Procede et agencement pour le codage et le decodage d'une suite d'images
EP1110407B1 (fr) Procede et dispositif pour le codage et le decodage d'une image numerisee faisant appel a un vecteur de deplacement total
DE69430738T2 (de) Kompatible teilbandkodierung/dekodierung von fernsehbildern
DE69909880T2 (de) Dekodierung eines komprimierten digitalen Bildsignals
WO2001049038A1 (fr) Procede, dispositif et produit programme informatique servant a effectuer une prediction lors du codage d'une image divisee en blocs d'image
EP1941744B1 (fr) Procede et dispositifs de determination et de reconstruction d'une zone d'image predite
DE19944300C2 (de) Verfahren, Anordnung und Computerprogrammerzeugnis zur Bewegungsschätzung bei der Codierung von einem Bildobjekt in einem Bild
WO2001062009A1 (fr) Procede et dispositif de codage, ou de codage et decodage d'une suite de nombres
WO2000046998A1 (fr) Procede et dispositif pour la transformation d'une zone d'image
WO2001028252A1 (fr) Codage et decodage progressifs tolerants aux erreurs d'une suite d'images
WO2000049525A1 (fr) Procede et dispositif pour memoriser au moins une image avec les donnees relationnelles qui s'y rapportent

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): JP

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
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