WO2004017157A2 - Systeme de compression video ameliore - Google Patents

Systeme de compression video ameliore Download PDF

Info

Publication number
WO2004017157A2
WO2004017157A2 PCT/US2002/041174 US0241174W WO2004017157A2 WO 2004017157 A2 WO2004017157 A2 WO 2004017157A2 US 0241174 W US0241174 W US 0241174W WO 2004017157 A2 WO2004017157 A2 WO 2004017157A2
Authority
WO
WIPO (PCT)
Prior art keywords
block
coefficient
quantizer
filter
transform
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/US2002/041174
Other languages
English (en)
Other versions
WO2004017157A3 (fr
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.)
On2com
Original Assignee
On2com
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
Priority claimed from US10/219,774 external-priority patent/US7027654B1/en
Application filed by On2com filed Critical On2com
Priority to AU2002364104A priority Critical patent/AU2002364104A1/en
Publication of WO2004017157A2 publication Critical patent/WO2004017157A2/fr
Publication of WO2004017157A3 publication Critical patent/WO2004017157A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00Image coding
    • G06T9/007Transform coding, e.g. discrete cosine transform
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/527Global motion vector estimation

Definitions

  • Patents 6,178,205; 6,167,164; and 6,188,799 entitled "AN EFFICIENT REAL TIME ALGORITHM TO SIMULTANEOUSLY REDUCE BLOCKING AND RINGING ARTIFACTS OF COMPRESSED VIDEO" by Min-Cheol Hong, Chang Mo Yon and Young Man Park, assigned to Digital Media Research Lab IEEE 1999.
  • This application specifically relates to a method and apparatus for reducing the decode complexity of two dimensional inverse transforms on a vector process.
  • a typical digital video decoding system involves the following steps (among others). For each block in a frame:
  • the 2-dimensional inverse transform functions typically take a large portion of the time to decode a frame due to their complexity.
  • the invention described here attempts to reduce the decoder complexity on vector processing machines that are capable of doing the same operation to multiple values stored sequentially in a machine's registers by lowering the complexity of the 2 dimensional transform.
  • a 2- dimensional separable inverse transform performed on a block typically involves performing the following steps: a) For each row of the block:
  • the 1-dimensional inverse transform usually involves performing exactly the same operations on a number of rows or columns in the block
  • vector processors are often used to reduce the decoding time. This is typically accomplished by filing vector processing registers with a value from each of N rows in the block (see diagram). The operations of the inverse transform are then performed on the N rows in parallel. And then the vector processing registers are filled with values from each of the N columns in the block and the inverse transform is then performed on the N columns in parallel.
  • a programmer In order to fill the vector processing registers quickly with different values from each row a programmer typically has two options: a) Transpose the coefficients so that the transform coefficients appear in the order that matches the vector processor and load them directly into the registers. b) Fill the vector registers one value at a time with the coefficient data.
  • Choice (a) requires numerous operations to perform the transpose and choice (b) requires numerous bit-mask AND/OR operations to place each coefficient into the register.
  • This invention attempts to address these issues. To do so: a) Fill an entire frame's coefficient buffers with 0 before the start of coefficient decoding. b) Extract the transform coefficient for a token from the bit-stream. c) If the coefficient value is non-zero place it in the transposed order that best suits the target vector processor.
  • the specific embodiment uses an 1DCT transform but the technique is equally applicable to any separable 2-dimensional transform, for example, the discrete wavelet transform or the generalized orthogonal transform.
  • Figure 1 is a block diagram of the embodiment.
  • FIG. 2 is an overview block diagram of the embodiment.
  • the invention includes enhanced video processing and compression and is further described hereinafter.
  • the encoder uses a motion estimator, block based 8x8 Discrete Cosine Transform (DCT), a quantizer, a variable length encoder, and a loop filter for smoothing block edges in the reconstruction buffer.
  • the decoder uses a variable length decoder and inverse quantizer, a motion compensator and a loop filter for smoothing block edges.
  • a blocking artifact is produced when quantization of the DCT coefficients in adjacent blocks produces pixel values on the shared block edge that differ on either side of the edge by a greater amount than in the original image.
  • a ringing or mosquito artifact results from the quantization of higher frequency components of the transform around strong edges in the image. This means that the transform basis vectors do not reinforce and cancel correctly, producing edges in the reconstruction near to the strong edge that were not present in the original image.
  • the current invention embodies two separate but dependent filters that attempt to remove these image artifacts in a manner that is low on decoder complexity: a) a de-blocking filter that reduces the blocking artifacts described above b) an edge-enhancement and de-ringing filter that attempts to reduce the mosquito noise or ringing artifacts at the same time it sharpens real text images.
  • FIG. 2 A block diagram of the vectorized de-blocker is shown in Figure 2.
  • the de-blocking filter of Fig. 2 works as follows:
  • BlockSadArray that contains one entry for each 8x8 block in the image. Initialize each entry of BlockSadArray to the value 0.
  • BlockSadArray is used as input to the de-ringing filter.
  • BSAV BlockSadArray value corresponding to the current block.
  • Thresh that are computed as a function of the quantization level such that Highest Thresh > High Thresh > Medium Thresh
  • the strong de-ringing filter works as follows: Calculate a maximum blurring modifier (HighModifier) and maximum sharpening modifier (LowModifier) by looking up a value based upon the level of quantization applied to the coefficients.
  • the deblocker uses simple linear calculations and one dimensional filters to remove deblocking artifacts and to gather information used by the deringer filter to determine how many iterations to apply its filter.
  • the deringing filter encompasses a pixel to pixel spatially adaptive filter that can both blur and sharpen. It does so by collecting the difference between neighboring pixels into a two dimensional array, applying a simple function to this array and then using the result as a convolution kernel. Since the function can produce both positive and negative tapes, the filter can perform both deringing and sharpening.
  • the Weak de-ringing filter works exactly the same as above except that the High and Low Modifiers are smaller magnitude numbers and the DeringModifier Function works as follows:
  • CD-Rom Enclosed with this application is a CD-Rom with the preferred embodiment illustrated by providing a listing in Source Code of the method, system and steps of this invention. Following a reading of said CD-Rom, the invention herein is again summarized.
  • BlockSad value for the block In summary, the following table identifies some of the advantages, features and benefits of this invention.
  • Sharpen/Deringing Filter A spatially adaptive kernel filter in which the kernel modifiers are determined by applying a non-continuous function on the pixel's neighborhood.
  • the filter is capable of both sharpening and blurring depending on the neighborhood. Different functions and number of iterations are used based upon the local variance measures determined by the deblocking filter and the quantization level used in building the block.
  • Simplified Deblocker An extremely simple 1 dimensional kernel filter is applied across block boundaries that differs based upon the variance across the block boundary and within the block border. The total amount adjusted is determined by the quantization level.
  • MV cost The selection process of a new motion vector is ties to the cost of transmitting that specific mv (a higher value costs more).
  • Iterative MV adjustment An iterative process is used for motion vector selection that in the first pass would mark all of the blocks as having a similar enough mv to use the first mv encountered in the neighborhood and in the second pass would pick a best mv for that neighborhood.
  • Datarate control using a model of the players buffer A datarate control stepping mechanism is used that does not allow any frame's quantization level to go above a certain level until an internal model of the player's buffer is beyond a certain point, at which point a new maximum level of quantization is chosen.
  • This same model of the player's buffer is used to determine whether or not to drop frames (now with a dampened threshold on the buffer overrun). We also use the model to decide when to undershoot the datarate to improve buffer fullness.
  • the model is used to decide when to perform internal spatial resampling. Datarate Control Using Error Selection of the quantizer is now performed after all of the modes are chosen. A function based on an error metric for the frame which equals the sum of the errors for each selected block and the total number of blocks to be coded is used to pick a quantizer.
  • DCT Coefficient Arrangement Novel Optimization Technique Since the typical block has very few non zero coefficients, these coefficients are placed in transposed position as we read them off the bitstream rather than doing the transpose as part of the idct. The position these are placed differs based upon the specific processor.
  • the aim here is to insure that the output value after inverse quantization is close to the mean of the samples that have ended up in that bin (and hence to minimize the mean square error).
  • Motion Prediction Block Deblocking Rather than applying a typical reconstruction loop filter a deblocking filter is applied only to the motion predictor of blocks that cross a block boundary. This gets around the problem with accumulating dct errors and improves the prediction of the block. Token Order Transmittal Updates All coefficients for a block are transmitted in order, but the tokens used also account for some information about blocks that have yet to be transmitted.
  • MVs and display fragments different token set probabilities are chosen based upon the information transmitted nearby.
  • the token probability sets are determined by a function of what the coefficient is, what plane
  • a more complex model of the context and probabilities that makes use of the neighboring blocks frame type and position within the block is used to select between probability sets.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Discrete Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Image Processing (AREA)

Abstract

Cette invention concerne un système de compression vidéo amélioré dans lequel la transformée de coefficients est accélérée par la transposition par repliement de coefficients dans la phase d'extraction de jetons. A cette fin, on remplit un groupe de tampons de coefficients de blocs avec des 0 avant démarrage du décodage de coefficients, on extrait le jeton du train binaire et l'on place toute valeur de coefficient extraite qui est non zéro dans l'ordre transposé correspondant le mieux au processeur cible.
PCT/US2002/041174 2002-08-15 2002-12-21 Systeme de compression video ameliore Ceased WO2004017157A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2002364104A AU2002364104A1 (en) 2002-08-15 2002-12-21 Imprroved video compression system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10/219,774 US7027654B1 (en) 2001-08-16 2002-08-15 Video compression system
US10/219,774 2002-08-15

Publications (2)

Publication Number Publication Date
WO2004017157A2 true WO2004017157A2 (fr) 2004-02-26
WO2004017157A3 WO2004017157A3 (fr) 2004-06-17

Family

ID=31886598

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2002/041174 Ceased WO2004017157A2 (fr) 2002-08-15 2002-12-21 Systeme de compression video ameliore

Country Status (2)

Country Link
AU (1) AU2002364104A1 (fr)
WO (1) WO2004017157A2 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7136536B2 (en) 2004-12-22 2006-11-14 Telefonaktiebolaget L M Ericsson (Publ) Adaptive filter
EP1863293A3 (fr) * 2006-03-31 2007-12-12 Kabushiki Kaisha Toshiba Appareil de traitement d'images numériques, procédé de traitement d'images numériques et programme de traitement d'images numériques
CN1992777B (zh) * 2005-12-27 2010-10-13 普诚科技股份有限公司 提高图像质量的方法及相关图像处理器
WO2014060637A1 (fr) * 2012-10-18 2014-04-24 Nokia Corporation Procédé, dispositifs et système de traitement d'image
US8804831B2 (en) 2008-04-10 2014-08-12 Qualcomm Incorporated Offsets at sub-pixel resolution
US10440388B2 (en) 2008-04-10 2019-10-08 Qualcomm Incorporated Rate-distortion defined interpolation for video coding based on fixed filter or adaptive filter

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6041145A (en) * 1995-11-02 2000-03-21 Matsushita Electric Industrial Co., Ltd. Device and method for smoothing picture signal, device and method for encoding picture and device and method for decoding picture
US6188799B1 (en) * 1997-02-07 2001-02-13 Matsushita Electric Industrial Co., Ltd. Method and apparatus for removing noise in still and moving pictures
JP3095140B2 (ja) * 1997-03-10 2000-10-03 三星電子株式会社 ブロック化効果の低減のための一次元信号適応フィルター及びフィルタリング方法
KR100244290B1 (ko) * 1997-09-09 2000-02-01 구자홍 저속 전송에서의 동영상을 위한 디블록킹 필터링 방법
US6529638B1 (en) * 1999-02-01 2003-03-04 Sharp Laboratories Of America, Inc. Block boundary artifact reduction for block-based image compression
US6707952B1 (en) * 2000-05-30 2004-03-16 Sharp Laboratories Of America, Inc. Method for removing ringing artifacts from locations near dominant edges of an image reconstructed after compression

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7136536B2 (en) 2004-12-22 2006-11-14 Telefonaktiebolaget L M Ericsson (Publ) Adaptive filter
CN1992777B (zh) * 2005-12-27 2010-10-13 普诚科技股份有限公司 提高图像质量的方法及相关图像处理器
EP1863293A3 (fr) * 2006-03-31 2007-12-12 Kabushiki Kaisha Toshiba Appareil de traitement d'images numériques, procédé de traitement d'images numériques et programme de traitement d'images numériques
US8804831B2 (en) 2008-04-10 2014-08-12 Qualcomm Incorporated Offsets at sub-pixel resolution
US10440388B2 (en) 2008-04-10 2019-10-08 Qualcomm Incorporated Rate-distortion defined interpolation for video coding based on fixed filter or adaptive filter
US11683519B2 (en) 2008-04-10 2023-06-20 Qualcomm Incorporated Rate-distortion defined interpolation for video coding based on fixed filter or adaptive filter
WO2014060637A1 (fr) * 2012-10-18 2014-04-24 Nokia Corporation Procédé, dispositifs et système de traitement d'image
US9819951B2 (en) 2012-10-18 2017-11-14 Nokia Technologies Oy Image processing method, devices and system

Also Published As

Publication number Publication date
WO2004017157A3 (fr) 2004-06-17
AU2002364104A1 (en) 2004-03-03
AU2002364104A8 (en) 2004-03-03

Similar Documents

Publication Publication Date Title
US7027654B1 (en) Video compression system
US5454051A (en) Method of reducing block artifacts created by block transform compression algorithms
JP3653183B2 (ja) ウェーブレット係数再構成処理方法及び装置、並びに記録媒体
KR100242636B1 (ko) 블록화효과 및 링잉노이즈 감소를 위한 신호적응후처리시스템
KR100234316B1 (ko) 링잉노이즈 감소를 위한 신호적응 필터링 방법 및 신호적응필터
US7190838B2 (en) Method and device for processing a coded digital signal
US8116581B2 (en) Efficient image representation by edges and low-resolution signal
US20030053711A1 (en) Reducing blocking and ringing artifacts in low-bit-rate coding
US7382923B2 (en) Method and device for processing and decoding a coded digital signal
CN1126926A (zh) 降低图象数据解码处理蚊音噪声的方法及装置
KR100675498B1 (ko) 필터링 장치 및 방법
JP4945533B2 (ja) 画像処理装置及び画像処理方法
WO2004017157A2 (fr) Systeme de compression video ameliore
Ghazel et al. Fractal-wavelet image denoising
US10783392B1 (en) Motion compensation in system and method for processing digital signals based on compression of hierarchical pyramid
US8989278B2 (en) Method and device for coding a multi dimensional digital signal comprising original samples to form coded stream
JP2919986B2 (ja) 画像信号復号化装置
US8139880B2 (en) Lifting-based directional lapped transforms
Zhao et al. Content adaptive image de-blocking
JP2008547288A (ja) 重複変換符号化及び復号化の方法と装置
JPH05344346A (ja) 画像圧縮装置
JP2002344732A (ja) 変換符号の画像伸張方法、プログラムおよび記録媒体
Niu et al. Edge-based perceptual image coding
EP2226760A1 (fr) Appareil et procédé de réduction d'artéfacts de compression dans des signaux vidéo
CN114422805B (zh) 一种视频编解码方法、装置及设备

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

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

AL Designated countries for regional patents

Kind code of ref document: A2

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

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

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP