+

WO2006039843A1 - Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives - Google Patents

Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives Download PDF

Info

Publication number
WO2006039843A1
WO2006039843A1 PCT/CN2004/001172 CN2004001172W WO2006039843A1 WO 2006039843 A1 WO2006039843 A1 WO 2006039843A1 CN 2004001172 W CN2004001172 W CN 2004001172W WO 2006039843 A1 WO2006039843 A1 WO 2006039843A1
Authority
WO
WIPO (PCT)
Prior art keywords
frames
frame
block
image data
motion
Prior art date
Application number
PCT/CN2004/001172
Other languages
English (en)
Inventor
Eric Li
Original Assignee
Intel Corporation
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 Intel Corporation filed Critical Intel Corporation
Priority to CN200480044126.3A priority Critical patent/CN101061722B/zh
Priority to DE112004002977T priority patent/DE112004002977T5/de
Priority to PCT/CN2004/001172 priority patent/WO2006039843A1/fr
Publication of WO2006039843A1 publication Critical patent/WO2006039843A1/fr
Priority to US12/559,995 priority patent/US8619855B2/en
Priority to US14/086,385 priority patent/US8879633B2/en

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/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
    • H04N19/533—Motion estimation using multistep search, e.g. 2D-log search or one-at-a-time search [OTS]
    • 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
    • H04N19/56—Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • 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

  • Motion compensation is often employed in connection with compression-coding of image data.
  • the proposed H.264 standard (more formally known as the Advanced Video Coding (AVC) standard, developed by the Joint Video Team (JVT) formed jointly by the Motion Picture Experts Group (MPEG) of the International Organization for Standardization (ISO) and the Video Coding Experts Group (VCEG) of the International Telecommunication Union Telecommunication Standardization Sector (ITU-T)) is an example of a technique for image data compression-coding using motion compensation.
  • AVC Advanced Video Coding
  • MPEG Motion Picture Experts Group
  • ISO International Organization for Standardization
  • VCEG Video Coding Experts Group
  • ITU-T International Telecommunication Union Telecommunication Standardization Sector
  • the reference block may be displaced in the image frame from the block which is currently being coded.
  • the displacement of the reference block is referred to as "motion compensation”.
  • the process of "motion estimation” determines which pixel block in the previous frame
  • the motion vector is included in "side information” that is transmitted along with the transformed, quantized, reordered, entropy-encoded difference information for the current block.
  • the motion compensation allows for a minimization of the differences between the current pixel block and the reference block, so that the amount of data required to be transmitted/recorded can be minimized.
  • Motion estimation may comprise a significant part of the processing burden, particularly when a so-called “full search” algorithm is employed.
  • So-called “fast search” algorithms have also been proposed, in which a reduced search pattern is employed, with small decreases in image quality.
  • FIG. 1 is a high-level block diagram of an image data processing system according to some embodiments.
  • FIG. 2 is a block diagram of an image data compression-coding component of the system of FIG. 1.
  • FIG. 3 illustrates in functional block form operation of the compression-coding component of FIG. 2.
  • FIGS. 4A-4C together form a flow chart that illustrates a motion estimation process performed according to some embodiments by the compression- coding component of FIG. 2.
  • FIG. 5 schematically illustrates a hexagonal search pattern used on some occasions in the motion estimation process of FIGS. 4A-4C.
  • FIG. 6 schematically illustrates a cross search pattern used on some other occasions in the motion estimation process of FIGS. 4A-4C.
  • FIG. 1 is a block diagram of an image data processing system 100 according to some embodiments.
  • the image data processing system 100 includes a compression-coding component 102 which is provided in accordance with some embodiments.
  • the system 110 further includes a source 104 of image data frames.
  • the source of image data frames is coupled to the compression-coding component to supply a sequence of image data frames to the compression-coding component.
  • the source of image data frames may, for example, be a video camera, a tele-cine, a digital video tape reproducing device, etc.
  • the system 100 also includes a transmission channel 106.
  • the compression-coding component is coupled to the transmission channel to provide compression-coded image data.
  • the transmission channel may operate to transmit the compression-coded image data to another location and/or to store the compression- coded image data on a recording medium (not separately shown).
  • FIG. 2 is a block diagram of an embodiment of the image data compression-coding component 102.
  • the compression-coding component 102 may include a processor 202.
  • the processor 202 may, for example, be a general purpose processor such as a conventional microprocessor and/or digital signal processor (DSP).
  • DSP digital signal processor
  • the compression-coding component 102 may also include a storage device 204 which is coupled to the processor.
  • the storage device 204 may store program instructions that control the processor to cause the processor to perform image data compression- coding in accordance with some embodiments, as described below.
  • the compression-coding component may also include working memory 206 (e.g., RAM—random access memory) coupled to the processor 202.
  • working memory 206 e.g., RAM—random access memory
  • the compression coding component 102 may be implemented as an application specific integrated circuit (ASIC) configured to perform image data compression-coding in accordance with some embodiments, as described below.
  • ASIC application specific integrated circuit
  • FIG. 3 illustrates in functional block form operation of the compression coding component 102.
  • each "macroblock" (16 x 16 pixel block) may be processed separately. Moreover, each macroblock may be subdivided, if it is advantageous to do so, into 8 x 16, 16 x 8 or 8 x 8 blocks. Each 8 x 8 block may further be subdivided, again if it is advantageous to do so, into 8 x 4, 4 x 8 or 4 x 4 blocks.
  • Each macroblock, whether or not subdivided, may be encoded in either an "intra" or "inter” mode (i.e., either intraframe or interframe prediction). Selection of intra mode for a particular block is indicated at 304. Selection between an inter- predicted or intra-predicted reference block is indicated by a switch 306. The output of the switch 306 is the predicted reference block. The predicted reference block is taken from a reconstructed frame, which is either the currently processed frame (unfiltered) in the case of intra prediction 308, or a previous frame 310, that has been filtered at 312 and stored, possibly with one or more other previous frames, at 314.
  • up to five previous reference frames may be selected from to provide the predicted reference block in the inter mode. These five previous frames may be referred to, in reverse chronological order, as “RefO”, “Refl”, “ReG”, “Ref3” and “Ref4".
  • RefO may be the frame in the input sequence of image data frames that immediately precedes the frame currently being compression-coded; Refl may immediately precede RefO in the sequence of image data frames; Ref2 may immediately precede Refl in the sequence of image data frames; Ref3 may immediately precede Re£2 in the sequence of image data frames; and Ref4 may immediately precede Ref3 in the sequence of image data frames.
  • a motion estimation algorithm may be applied to a reference frame to find the best matching block or subblock in a reference frame for the current block or subblock in the current frame. Details of a motion estimation algorithm provided according to some embodiments are set forth below. Except for the motion estimation algorithm as described below, all of the compression-coding process illustrated in FIG. 3 may generally be performed in accordance with conventional principles, such as those set forth in the H.264 standard.
  • motion compensation 318 is applied to a reference frame to select a reference block.
  • the reference block is supplied to a difference function 320, which subtracts the reference block from the block that is currently being compression-coded. (It will be noted that in intra mode a reference block from the current frame is used.)
  • the difference data block generated by subtracting the reference block from the currently coded block is transformed by using a block transform (as indicated at 322), and the resulting transform coefficients are quantized, as indicated at 324.
  • the quantized transform coefficients are then re-ordered (block 326) to improve coding efficiency and then subjected to entropy encoding (block 328).
  • bitstream has been produced, including the entropy encoded, re-ordered, quantized transform coefficients, as well as side information that identifies, e.g., prediction mode, quantization step size, block dimensions, motion vector, etc.
  • the bitstream may be passed to a network abstraction layer (NAL) for transmission or storage.
  • NAL network abstraction layer
  • a reconstruction branch process 330 takes the quantized transform coefficients and inverts the quantization (block 332) and then applies an inverse transform (block 334) to the de-quantized data, to produce difference data.
  • the difference data is added at sum function 336 to the reference block to produce a reconstructed block.
  • the resulting reconstructed block may be used for intra prediction at 308 or combined with other blocks to form a reconstructed frame that is filtered at 312 and stored at 314 as a reference frame for inter prediction.
  • FIGS. 4A-4C together form a flow chart that illustrates the motion estimation algorithm 316 of FIG. 3, as provided in accordance with some embodiments.
  • block 402 represents the start of the motion estimation algorithm with respect to one macroblock of the image data frame that is currently being compression-coded.
  • Block 404 indicates that the motion estimation algorithm is applied to each of the possible different block or subblock sizes or shapes, to allow for selection of the optimum block size/shape from the point of view of minimizing the amount of difference data.
  • the block size selection loop 404 considers each of 16 xl6, 8 x 16, 16 x 8, 8 x 8, 4 x 8, 8 x 4 and 4 x 4 block sizes/shapes. The order in which the different block sizes are considered may follow decreasing size from 16 x 16 to 4 x 4 in order to make use of upper-layer motion vector information.
  • a reference frame loop 406 Nested within the block size selection loop 404 is a reference frame loop 406 which causes a full or truncated set of reference frames to be considered with respect to the current block/subblock.
  • the full set of reference frames includes RefO, Refl, Ref2, Ref3, and Ref4, and the truncated set of reference frames includes RefO, Refl and Ref2.
  • a selection is made between the full or truncated set of reference frames according to criteria which are described below.
  • RefO, Refl and Ref2 may be considered to form a first set of reference frames that is examined in all cases in some embodiments, whereas Ref3 and Ref 4 may be considered to form a second (actually earlier) set of reference frames that sometimes is not examined in these embodiments.
  • RefO may be referred to as the "last one" of the frames of the first set of reference frames; Refl may be referred to as the “middle one” of the frames of the first set of reference frames; Ref2 may be referred to as the "earliest one” of the frames of the first set of reference frames; ReG may be referred to as the “later one” of the frames of the second set of reference frames; and Ref4 may be referred to as the "earlier one" of the frames of the second set of reference frames.
  • the order in which the reference frames are considered may be as stated in the second sentence of this paragraph (i.e., most recent considered first).
  • a "set of reference frames" need not include more than one frame.
  • P x (x) and P ⁇ (y) are the probability distributions of motion vectors in the X and Y directions, respectively. Both P x (x) and P ⁇ (y) may comply with an exponential distribution as defined below:
  • Equation (2) should satisfy the constraint that the sum of probability in the search window is 1. In other words, if the size of the search window is W, the summation of P(n) over n in the range -W to W is equal to 1.
  • the mean absolute value MV mean of the motion vectors can be defined as the summation of P(n)(
  • a probability distribution model of motion vectors in the reference frame currently being considered can be derived from MV me3n .
  • a "probability distribution model” of a variable which may also be referred to as a “probability model” or “distribution model” is the range of the variable and associated probabilities.
  • MV mean varies rather slowly during a typical sequence of frames
  • MV raean can be used as a parameter to predict characteristics of future frames, such as the frame currently being encoded. It is likely that the motion vectors are distributed in a diamond shaped area. Thus it may be possible to find the smallest diamond shaped area in which at least 99% of the motion vectors are located. That is, the value M can be found that is the smallest value for which the summation of P(n) for n over the range -M to M is not less than 0.99. This condition may otherwise be expressed as
  • ADL adaptive diamond length
  • a set of candidate motion vectors is assembled.
  • the set of candidate motion vectors includes all of the following:
  • (D) A subset of candidate motion vectors, each obtained by applying a scaling factor to the respective motion vector for the pixel block of each of Refl, Re£2, Ref3 and Ref4 that corresponds in size and location in the image frame to the currently considered pixel block.
  • the scaling factor in each case may be proportional to the distance in time between the reference frame and the current frame.
  • decision block 412 it is determined what is the largest number of the candidate motion vectors that are equal to each other and whether this number of motion vectors exceeds a threshold. If so, then as indicated at 414, this popular motion vector is considered to be the motion vector for the block currently being considered. Otherwise motion estimation for the block currently being considered continues with decision block 416 (FIG. 4B).
  • decision block 416 it is determined whether the currently considered pixel block is a zero block (all pixel data equal to zero). If so, the zero motion vector is considered the motion vector for the currently considered pixel block, as indicated at 418. Otherwise, each reference pixel block indicated by one of the candidate motion vectors is examined to determine the difference between the currently considered pixel block and the currently examined reference pixel block. The candidate motion vector which corresponds to the smallest such difference is temporarily selected (as indicated at 420) as the motion vector for the currently considered pixel block or the current frame, subject to further searching for an optimum matching reference pixel block, as described below.
  • decision block 422 It is next determined, at decision block 422, whether the candidate motion vector temporarily selected at 420 is the zero motion vector. If so, then as indicated at 424 a block matching search is conducted in the currently considered reference frame for the best matching reference pixel block, using a cross search pattern, as described below. Otherwise, it is determined whether a compact search area is expected (decision block 425) based on the statistical analysis of block 408 (FIG. 4A) and possibly based on other factors. For example, as a preliminary test, an average is obtained of the respective motion vector for each of the following adjoining pixel blocks in the currently coded frame: the block above the currently considered pixel block; the block above and to the right of the currently considered pixel block, and the block to the left of the currently considered pixel block.
  • a hexagonal search pattern is employed for further block matching searching, as described below. Otherwise, the ADL calculated at 408 is compared with a threshold (e.g., 4) and if the ADL is at least equal to the threshold, the hexagonal search pattern is employed (as indicated at 426, FIG. 4B). Otherwise (i.e., if ADL ⁇ the threshold), then the cross search pattern is employed, as indicated at 428.
  • a threshold e.g. 4 4
  • FIG. 5 An example of a hexagonal search pattern is schematically illustrated in FIG. 5.
  • An example of a hexagonal search pattern is also described in an article entitled, "Hexagon-Based Search Pattern for Fast Block Motion Estimation", by Ce Zhu et al., IEEE Transactions on Circuits and Systems for Video Technology, Vol. 12, no. 5, May 2002; pages 349-355.
  • each intersection of the grid corresponds to a pixel location in the reference frame currently under consideration.
  • the search starting point 502 at the center of the initial hexagonal search pattern corresponds to the pixel location indicated by the candidate motion vector temporarily selected at 420 (FIG. 4B).
  • each of the other six search points 504, 506, 508, 510, 512, 514 which makes up the balance of the initial hexagonal search pattern is either 2 pixels over, or 2 pixels up or down and one pixel over, from the search starting point 502.
  • the respective (candidate) reference pixel blocks corresponding to the seven initial search points are each compared with the pixel block currently under consideration for coding, and the search point corresponding to the candidate reference pixel block which best matches the pixel block currently under consideration for coding is declared the "winner".
  • point 506 is the winner.
  • An extension of the hexagonal search pattern in the direction of the winner then occurs, resulting in this case in the additional search points 516, 518, 520.
  • the winner among these three new points and the previous winner 506 is then determined. Again for purposes of this example, it is assumed that point 520 is the new winner. Once more the search pattern is extended in the direction of the new winner, resulting in new search points 522, 524, 526 in this case.
  • the hexagonal search pattern described above may provide for efficient searching when a relatively large area may need to be traversed.
  • the pattern formed by points 502, 504, 506, 508, 510, 512 and 514 may be rotated by 90° around point 502 to provide an alternative initial hexagonal search pattern.
  • FIG. 1 An example of a cross search pattern is schematically illustrated in FIG.
  • the intersections of the grid in FIG. 6 each correspond to a pixel location in the reference frame currently under consideration.
  • the search starting point 602 corresponds to the pixel location indicated by the candidate motion vector temporarily selected at 420 (FIG. 4B).
  • the balance of the initial cross (i.e., cross-shaped) search pattern consists of the four points 604, 606, 608 and 610 which are immediately above, below and to the sides of the starting point 602.
  • the respective (candidate) reference pixel blocks corresponding to the five initial search points are each compared with the pixel block currently under consideration for coding, and the search point corresponding to the candidate reference pixel block which best matches the pixel block currently under consideration for coding is declared the winner.
  • point 604 is the winner.
  • An extension of the cross search pattern in the direction of the winner then occurs, resulting in three additional search points 612, 614, 616 in this case.
  • the winner among these three new search points and the previous winner 604 is then determined.
  • point 612 is the new winner.
  • 612 remains the winner when points 618 and 620 are considered, so that the search ends, and 612 is selected as the motion vector for the pixel block currently under consideration for coding.
  • the cross search pattern described above may provide for efficient searching when a relatively small area may need to be traversed.
  • the likely better search pattern between hexagonal and cross is adaptively selected, based at least in part on the statistical distribution of motion vectors in a reference frame that is prior to the frame currently being coded. This may take advantage of the temporal predictive value of the motion vector distribution in the earlier frame to predict the likely distribution in the current frame.
  • a threshold value other than 4 may alternatively be used.
  • consideration of Ref3 and Ref4 may be skipped if the following conditions are met:
  • MV Ref0 is the motion vector determined for the currently coded pixel block with respect to RefO
  • MV Refl is the motion vector determined for the currently coded pixel block with respect to Refl
  • MV Ref2 is the motion vector determined for the currently coded pixel block with respect to Ref2
  • T ⁇ is a threshold employed for the reference frame loop truncation decision (in some embodiments, T w may be equal to 4).
  • "Cost" is a cost function that measures the cost of coding the currently coded pixel block as a difference relative to the reference pixel block pointed to in the respective reference frame by the motion vector determined for that frame.
  • the "Cost" function indicates a degree of block matching between the currently coded pixel block and the proposed reference pixel block for the respective reference frame. It will also be appreciated that a determination of whether the four conditions listed above have been satisfied constitutes an evaluation of a result of motion estimation performed with respect to the current frame (and specifically the current pixel block of the current frame) with reference to RefO, Refl and Ref2. In other embodiments, the evaluation of such motion estimation may be performed in other ways.
  • the reference frame loop ends if either the reference frame just considered is Ref4 or if the reference frame just considered is Ref2 and the conditions for truncating the reference frame loop are satisfied. If the reference frame loop does not end, the process of FIGS. 4A-4C loops back to 408 in FIG. 4A, and the next (i.e., next earlier) reference frame is considered. If the reference frame loop ends, then the process advances from decision block 430 (FIG. 4C) to decision block 432. [0050] It should be understood that in some embodiments, the total number of reference frames potentially considered may be other than five, and/or the number of reference frames skipped when warranted based on results of considering later reference frames may be other than two.
  • decision block 432 it is considered whether all of the different block sizes/shapes have been considered for the currently coded pixel macroblock. If not, the process of FIGS. 4A-4C loops back to 406 and the next block size/shape is considered. Otherwise (i.e., if all block sizes/shapes have been considered) the process advances to block 434 in FIG. 4C.
  • the best block size/shape (i.e., the block size/shape for which the best matching is found), is selected for purposes of coding the current pixel macroblock. In some embodiments this may be done in accordance with conventional practices. It will also be understood that the best matching reference block will have been selected for each size/shape of block from among the respective reference blocks for the various reference frames considered. This too may have been done in accordance with conventional practices. Thus motion estimation for the current macroblock is now complete, and the process of FIGS. 4A-4C may now be applied to the next macroblock of the current frame.
  • motion estimation may be performed more rapidly than with other "fast” motion estimation algorithms, with comparable results in terms of image quality.
  • the selection of a block-matching search pattern at block 424 need not be limited to selection between two search patterns, and may select between search patterns other than a hexagonal search pattern and a cross search pattern.

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é qui consiste à examiner une distribution statistique de vecteurs mouvement utilisés pour la compensation du mouvement dans une première trame de données d'image. L'examen permet d'obtenir un modèle de distribution des vecteurs mouvement dans la première trame. De plus, ce procédé consiste à sélectionner, sur la base, au moins en partie, du modèle de distribution, un motif de recherche d'adaptation de blocs utilisé conformément à une seconde trame de données d'image. La seconde trame suit la première trame selon une séquence de trames de données d'image.
PCT/CN2004/001172 2004-10-14 2004-10-14 Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives WO2006039843A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
CN200480044126.3A CN101061722B (zh) 2004-10-14 2004-10-14 采用自适应搜索策略的快速多帧运动估计
DE112004002977T DE112004002977T5 (de) 2004-10-14 2004-10-14 Schnelle Multi-Frame-Bewegungsabschätzung mit adaptiven Suchstrategien
PCT/CN2004/001172 WO2006039843A1 (fr) 2004-10-14 2004-10-14 Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives
US12/559,995 US8619855B2 (en) 2004-10-14 2009-09-15 Fast multi-frame motion estimation with adaptive search strategies
US14/086,385 US8879633B2 (en) 2004-10-14 2013-11-21 Fast multi-frame motion estimation with adaptive search strategies

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2004/001172 WO2006039843A1 (fr) 2004-10-14 2004-10-14 Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives

Publications (1)

Publication Number Publication Date
WO2006039843A1 true WO2006039843A1 (fr) 2006-04-20

Family

ID=36148039

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2004/001172 WO2006039843A1 (fr) 2004-10-14 2004-10-14 Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives

Country Status (3)

Country Link
CN (1) CN101061722B (fr)
DE (1) DE112004002977T5 (fr)
WO (1) WO2006039843A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102045568A (zh) * 2010-12-30 2011-05-04 福州瑞芯微电子有限公司 双斜栅扫描实现对角线匹配运动估计匹配电路结构和方法
CN106604028A (zh) * 2015-10-16 2017-04-26 中兴通讯股份有限公司 编码处理、解码处理方法及装置、编码器及解码器

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9609342B2 (en) 2010-02-19 2017-03-28 Skype Compression for frames of a video signal using selected candidate blocks
US9819358B2 (en) 2010-02-19 2017-11-14 Skype Entropy encoding based on observed frequency
US9313526B2 (en) 2010-02-19 2016-04-12 Skype Data compression for video
US20110206118A1 (en) 2010-02-19 2011-08-25 Lazar Bivolarsky Data Compression for Video
CN102387361B (zh) * 2010-09-02 2016-06-01 乐金电子(中国)研究开发中心有限公司 视频编解码的参考帧处理方法及视频编解码器
CN104811726B (zh) * 2015-04-24 2018-12-18 宏祐图像科技(上海)有限公司 帧率转换中运动估计的候选运动矢量选择方法
CN111652905B (zh) * 2020-04-27 2023-07-07 长春理工大学 一种一维块匹配运动估计方法和装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000014682A2 (fr) * 1998-09-07 2000-03-16 Thomson Multimedia Procede d'estimation de mouvements pour reduire le cout de transmission des vecteurs de mouvement
CN1272031A (zh) * 1999-04-27 2000-11-01 三星电子株式会社 实时运动图像编码的高速运动估计方法及其装置
WO2001054418A1 (fr) * 2000-01-21 2001-07-26 Nokia Corporation Procede et systeme d'estimation de mouvement pour un videocodeur
CN1381145A (zh) * 2000-03-23 2002-11-20 皇家菲利浦电子有限公司 运动估计算法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0955941A (ja) * 1995-08-16 1997-02-25 Sony Corp 画像符号化方法、画像符号化装置、及び画像符号化データの記録装置
JP2001285874A (ja) * 2000-03-28 2001-10-12 Nec Corp 動きベクトル探索装置、方法及びプログラムを記録した記録媒体
JP2004221757A (ja) * 2003-01-10 2004-08-05 Renesas Technology Corp 動き検出装置及び探索領域形状可変動き検出器

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000014682A2 (fr) * 1998-09-07 2000-03-16 Thomson Multimedia Procede d'estimation de mouvements pour reduire le cout de transmission des vecteurs de mouvement
CN1272031A (zh) * 1999-04-27 2000-11-01 三星电子株式会社 实时运动图像编码的高速运动估计方法及其装置
WO2001054418A1 (fr) * 2000-01-21 2001-07-26 Nokia Corporation Procede et systeme d'estimation de mouvement pour un videocodeur
CN1381145A (zh) * 2000-03-23 2002-11-20 皇家菲利浦电子有限公司 运动估计算法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102045568A (zh) * 2010-12-30 2011-05-04 福州瑞芯微电子有限公司 双斜栅扫描实现对角线匹配运动估计匹配电路结构和方法
CN106604028A (zh) * 2015-10-16 2017-04-26 中兴通讯股份有限公司 编码处理、解码处理方法及装置、编码器及解码器
US11272176B2 (en) 2015-10-16 2022-03-08 Zte Corporation Encoding processing method and device, decoding processing method and device, encoder, and decoder

Also Published As

Publication number Publication date
CN101061722B (zh) 2013-03-27
CN101061722A (zh) 2007-10-24
DE112004002977T5 (de) 2007-09-20

Similar Documents

Publication Publication Date Title
US8619855B2 (en) Fast multi-frame motion estimation with adaptive search strategies
US8073048B2 (en) Method and apparatus for minimizing number of reference pictures used for inter-coding
EP2250813B1 (fr) Procédé et appareil de sélection de trame prédictive pour une efficacité rehaussée et une qualité subjective
CN101379829B (zh) 用于运动补偿预测的自适应加权选择的方法和设备
JP4127818B2 (ja) 動画像符号化方法及びその装置
US8457198B2 (en) Method of and apparatus for deciding encoding mode for variable block size motion estimation
US5731850A (en) Hybrid hierarchial/full-search MPEG encoder motion estimation
US7532764B2 (en) Prediction method, apparatus, and medium for video encoder
US8311113B2 (en) Method and system for using motion prediction to equalize video quality across intra-coded frames
JP2007267414A (ja) フレーム内画像符号化方法及びその装置
US7092442B2 (en) System and method for adaptive field and frame video encoding using motion activity
KR20050119422A (ko) 움직임 보상에 기반한 입력 영상의 노이즈 예측 및 그장치와, 이를 사용한 노이즈 제거 및 동영상 부호화 방법,이를 수행하기 위한 프로그램이 기록된 기록 매체
US8705618B2 (en) Method and device for coding a video image with a coding error estimation algorithm
US20060193526A1 (en) Video encoder with low complexity noise reduction
US20050276331A1 (en) Method and apparatus for estimating motion
US20120163468A1 (en) Method of and apparatus for estimating motion vector based on sizes of neighboring partitions, encoder, decoding, and decoding method
WO2006039843A1 (fr) Estimation rapide du mouvement de trames multiples par strategies de recherche adaptatives
US20070092007A1 (en) Methods and systems for video data processing employing frame/field region predictions in motion estimation
US8654844B1 (en) Intra frame beating effect reduction
US7983339B2 (en) Method for coding an image sequence
US20160156905A1 (en) Method and system for determining intra mode decision in h.264 video coding
CN101754011B (zh) 采用自适应搜索策略的快速多帧运动估计方法
CN102685495B (zh) 采用自适应搜索策略的快速多帧运动估计
Choi et al. Adaptive image quantization using total variation classification
KR100207397B1 (ko) 영상 부호화 시스템의 움직임 예측장치 및 방법

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

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

AL Designated countries for regional patents

Kind code of ref document: A1

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

121 Ep: the epo has been informed by wipo that ep was designated in this application
DPE2 Request for preliminary examination filed before expiration of 19th month from priority date (pct application filed from 20040101)
WWE Wipo information: entry into national phase

Ref document number: 1120040029775

Country of ref document: DE

WWE Wipo information: entry into national phase

Ref document number: 200480044126.3

Country of ref document: CN

RET De translation (de og part 6b)

Ref document number: 112004002977

Country of ref document: DE

Date of ref document: 20070920

Kind code of ref document: P

122 Ep: pct application non-entry in european phase

Ref document number: 04789835

Country of ref document: EP

Kind code of ref document: A1

REG Reference to national code

Ref country code: DE

Ref legal event code: 8607

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载