CN109040756B - HEVC image content complexity-based rapid motion estimation method - Google Patents

HEVC image content complexity-based rapid motion estimation method Download PDF

Info

Publication number
CN109040756B
CN109040756B CN201810710378.9A CN201810710378A CN109040756B CN 109040756 B CN109040756 B CN 109040756B CN 201810710378 A CN201810710378 A CN 201810710378A CN 109040756 B CN109040756 B CN 109040756B
Authority
CN
China
Prior art keywords
mode
inter
search
current
block
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.)
Active
Application number
CN201810710378.9A
Other languages
Chinese (zh)
Other versions
CN109040756A (en
Inventor
刘倩
刘立程
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.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN201810710378.9A priority Critical patent/CN109040756B/en
Publication of CN109040756A publication Critical patent/CN109040756A/en
Application granted granted Critical
Publication of CN109040756B publication Critical patent/CN109040756B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122—Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/172—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a picture, frame or field
    • 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/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

Landscapes

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

Abstract

The invention provides a fast motion estimation method based on HEVC image content complexity. The method comprises the following steps: s1, coding a current CU block by using a Merge mode; s2, judging the motion complexity of the current CU block, and if max { | d1‑d2|，|d2‑d3|，|d3‑d1|}<dthAnd max { | [ theta ]1‑θ2|，|θ2‑θ3|，|θ3‑θ1|}<θthIf yes, go to step S3, otherwise, go to step S4; s3, coding the current CU block by using an Inter _2 Nx 2N mode, and only performing diamond search with the step length of 2; s4, coding the current CU block by using an Inter _2 Nx 2N mode, performing complete Test Zero (TZ) Search, judging whether an optimal Search point is near an initial Search point, if so, performing step S5, and if not, performing step S6; and S5, coding the current CU block by other modes (except Inter _2N multiplied by 2N), performing diamond search with the step length of 2, and determining the optimal MV in the sub-PU mode. And S6, coding the current CU block by using other modes, carrying out complete TZ Search, and determining the optimal MV in the sub-PU mode. The invention can effectively improve the coding efficiency of the original TZ Search in the HM.

Description

HEVC image content complexity-based rapid motion estimation method
Technical Field
The invention relates to the technical field of High Efficiency Video Coding (HEVC), in particular to a fast motion estimation method based on HEVC image content complexity.
Background
Vision is a main way for human beings to perceive the outside world, and in this information age, video information is always favored by people. The amount of uncompressed video information data, however, is quite dramatic and cannot be used at all for actual transmission and storage. The International telecommunications Union Telecommunication Standardization Sector (ITU-T) and the International organization for Standardization (IEC) have successively introduced a series of video coding standards, such as the h.26x series. The standards are widely applied to video communication based on network transmission, and the acquisition of video information by people is greatly facilitated. HEVC/h.265 is a latest generation Video Coding standard following Advanced Video Coding (AVC/h.264), which adopts many novel technologies to improve Coding quality, and further meets the requirements of people on high definition and very high definition Video. But at the same time, the computational complexity of video coding limits the further development of HEVC.
Many algorithms have been proposed to reduce the encoding time by sacrificing a certain bit rate. The method can be mainly divided into two parts of reducing the intra-frame prediction and inter-frame prediction coding time. For example, CN103327325 proposes a fast adaptive selection method for intra-frame prediction mode based on HEVC standard, which mainly performs SATD (absolute error and distortion) rough selection on a current prediction unit, compares a ratio of two adjacent cost difference values to a cost median in a candidate mode with a fixed threshold, thereby adaptively selecting the candidate mode, and then determines an optimal prediction mode through rate-distortion optimization. In CN104954787B, a HEVC inter-frame prediction mode selection method is proposed, which is: when the pixel size of a Coding Unit (CU) block of a current frame is determined to be in a set range, calculating and obtaining a first rate distortion Cost (SAD Cost0) of each inter prediction mode of the CU block based on a Sum of Absolute Differences (SAD) algorithm, obtaining an optimal first rate distortion Cost and a corresponding first inter prediction mode and a suboptimal first rate distortion Cost (SAD Cost1) and a corresponding second inter prediction mode according to the obtained first rate distortion Cost of each inter prediction mode, and selecting the first inter prediction mode as the optimal inter prediction mode of the CU block when determining that (SAD Cost1-SAD Cost0)/SAD Cost0 is greater than a threshold value.
These algorithms all reduce the coding complexity of HEVC, but we know that the most time consuming part in HEVC is the motion search part. Therefore, the motion search time is effectively reduced, and more efficient video coding can be realized. In HM standard code, the method of TZ Search has been proposed to replace the full Search algorithm, greatly reducing the encoding time. The motion search is divided into two steps: determining a starting search point and determining an optimal search point. In HEVC, an Advanced Motion Vector Predictor (AMVP) technique is used to determine a start search point, the AMVP provides a plurality of candidate predicted Motion Vectors (MVs), and an encoder selects a predicted MV with the smallest rate-distortion cost from the candidate predicted Motion Vectors (MVs) and uses the pointed position as the start search point. And then starting with step 1, searching in a searching range according to a diamond template (shown in figure 1) or a square template (shown in figure 2), wherein the step is increased in the form of the step which is 2 raised to the power of integer times, selecting a point with the lowest rate distortion as a searching result of the step, and then searching points which are not searched around the optimal searching point in a supplementing manner to determine the optimal searching point. If the step length corresponding to the optimal search point is larger than a certain threshold value, taking the optimal point as the center, performing full search in a certain range, selecting the optimal point with the minimum rate-distortion cost as the optimal point of the step, taking the optimal search point as a new initial search point, and refining the search. And stopping the refined search when the optimal points obtained by adjacent refined searches are consistent. The resulting MV is the final MV.
Disclosure of Invention
In order to overcome at least one of the defects in the prior art, the invention provides a fast motion estimation method based on the content complexity of the HEVC image. The invention can effectively reduce the time of motion Search loss, thereby effectively improving the coding efficiency of the original TZ Search in the HM.
In order to solve the technical problems, the invention adopts the technical scheme that: a fast motion estimation method based on HEVC image content complexity comprises the following steps:
s1, coding a current CU block by using a Merge mode;
s2, judging the motion complexity of the current CU block, and if max { | d1-d2|，|d2-d3|，|d3-d1|}<dthAnd max { | [ theta ]1-θ2|，|θ2-θ3|，|θ3-θ1|}<θthIf yes, go to step S3, otherwise, go to step S4;
wherein d is1，d2，d3Respectively the MV sizes of the coded CU blocks from the current CU block to the left direction, the upper direction and the upper right direction adjacent to the current CU block; theta1，θ2，θ3Are respectively d1，d2，d3The included angle with the horizontal line; dthAnd thetathIs a set threshold value;
s3, coding the current CU block by using an Inter _2 Nx 2N mode, and only performing diamond search with the step length of 2;
s4, coding the current CU block by using an Inter _2 Nx 2N mode, carrying out complete TZ Search, judging whether an optimal Search point is near an initial Search point, if so, carrying out step S5, and if not, carrying out step S6;
s5, coding the current CU block by using an Inter _2 NxN mode, an Inter _2 NxnU mode, an Inter _2 NxnD mode, an Inter _ nLx2N mode and an Inter _ nR x 2N mode respectively, performing diamond search with the step size of 2, and determining the optimal MV under the Inter _2 NxN mode, the Inter _ Nx2N mode, the Inter _ NxN mode, the Inter _2 NxnU mode, the Inter _2 NxnD mode, the Inter _ nL x 2N mode and the Inter _ nR x 2N mode.
S6, coding the current CU block by using an Inter _2 NxN mode, an Inter _ Nx2N mode, an Inter _ NxN mode, an Inter _2 NxnU mode, an Inter _2 NxnD mode, an Inter _ nLx2N mode and an Inter _ nR x 2N mode respectively, carrying out complete TZ Search, and determining the optimal MV under the Inter _2 NxN mode, the Inter _ Nx2N mode, the Inter _ NxN mode, the Inter _2 NxnU mode, the Inter _2 NxnD mode, the Inter _ nLx2N mode and the Inter _ nR x 2N mode.
It can be known from statistics that for an image with simple motion, its optimal search point is always near the initial search point or is (0, 0), so we can set a threshold to determine whether the motion is simple. Let the MV sizes of the neighboring coded CUs (left, top right) of the current CU block be d1，d2，d3If max { | d1-d2|，|d2-d3|，|d3-d1The value of is less than some threshold dthAnd the angular difference max { | [ theta ] of the MV1-θ2|，|θ2-θ3|，|θ3-θ1Is less than a certain threshold value thetathIn the meantime, we consider that the image motion is simpler, and the search omission of the current inter _2N × 2N mode is a diamond search with a step size of 2. Meanwhile, we assume the inter _2 Nx 2N mode as the parent PU and the other modes as the child PUs. Judging whether the optimal search point of the inter 2 Nx 2N mode isIn the vicinity of the initial search point, if the sub-PU only performs the diamond search with the step size of 2, the sub-PU is terminated, and the selected optimal search point is the point to which the sub-PU finally MV points. If not, a full TZ Search is performed to determine the final MV.
We assume the coding complexity of motion estimation to be MEcomplexityIt is defined as:
MEcomplexity＝(TME/Tencoder)×100％
wherein T isMEFor time of motion estimation in HM source code, TencoderThe time consumed by the entire encoding process in the HM source code.
Table 1 shows the complexity of each motion estimation for different QP (Quantization parameter) for different resolution video sequences.
TABLE 1 coding complexity ME for motion estimationcomplexity(％)
Figure BDA0001716387240000041
As can be seen from table 1, the time consumed by motion estimation in the whole encoding process is very large, and therefore, the time for motion estimation is effectively reduced, i.e. the encoding time can be greatly reduced.
Data results of Table 2P (A) (%)
Figure BDA0001716387240000042
Let us assume that event a is in an Inter _2N × 2N mode, and the probability that its optimal search point is near the initial search point or is (0, 0), the data of p (a) obtained by the experiment is shown in table 2. Through data analysis, the probability of the sequence with simpler motion can reach 95.02%, so that the method can be fully explained to be feasible for terminating the TZ Search in advance.
We assume that event B is the optimal search point for the sub-PU is near the initial search point or is (0, 0). We calculate the probability P (B | a) that event B occurs when event a holds,
Figure BDA0001716387240000043
wherein C represents the number of times of event B and A represents the number of times of event A during operation. Statistics show that the probability can reach more than 96.8%. It can be fully explained that if the parent PU, i.e. the optimal Search point of Inter _2N × 2N mode, is near the initial Search point, the optimal point Search step of its child PU (Inter _2N × N, Inter _ N × 2N, Inter _ N × N, Inter _2N × nU, Inter _2N × nD, Inter _ nL × 2N, Inter _ nR × 2N) can only be performed with a TZ Search of step size 2, and the remaining steps can be skipped.
Compared with the prior art, the invention has the beneficial effects that:
the estimation method of the invention can terminate the TZ Search in advance based on the judgment of the motion complexity, so as to further reduce the time of motion Search loss, and further effectively improve the coding efficiency of the original TZ Search in the HM.
Drawings
FIG. 1 is a schematic diagram of a diamond search in the present invention.
FIG. 2 is a schematic diagram of square search in the present invention.
Fig. 3 is a diagram of inter-prediction PU partitioning in the present invention.
Detailed Description
The drawings are for illustrative purposes only and are not to be construed as limiting the patent; for the purpose of better illustrating the embodiments, certain features of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted. The positional relationships depicted in the drawings are for illustrative purposes only and are not to be construed as limiting the present patent.
A fast motion estimation method based on HEVC image content complexity comprises the following steps:
s1, coding a current CU block by using a Merge mode;
s2, judging the motion complexity of the current CU blockIf max { | d1-d2|，|d2-d3|，|d3-d1|}<dthAnd max { | [ theta ]1-θ2|，|θ2-θ3|，|θ3-θ1|}<θthIf yes, go to step S3, otherwise, go to step S4;
wherein d is1，d2，d3Respectively the MV sizes of the coded CU blocks from the current CU block to the left direction, the upper direction and the upper right direction adjacent to the current CU block; theta1，θ2，θ3Are respectively d1，d2，d3The included angle with the horizontal line; dthAnd thetathIs a set threshold value;
s3, coding the current CU block by using an Inter _2 Nx 2N mode, and only performing diamond search with the step length of 2;
s4, coding the current CU block by using an Inter _2 Nx 2N mode, carrying out complete TZ Search, judging whether an optimal Search point is near an initial Search point, if so, carrying out step S5, and if not, carrying out step S6;
s5, coding the current CU block by using an Inter _2 NxN mode, an Inter _2 NxnU mode, an Inter _2 NxnD mode, an Inter _ nLx2N mode and an Inter _ nR x 2N mode respectively, performing diamond search with the step size of 2, and determining the optimal MV under the Inter _2 NxN mode, the Inter _ Nx2N mode, the Inter _ NxN mode, the Inter _2 NxnU mode, the Inter _2 NxnD mode, the Inter _ nL x 2N mode and the Inter _ nR x 2N mode.
S6, coding the current CU block by using an Inter _2 NxN mode, an Inter _ Nx2N mode, an Inter _ NxN mode, an Inter _2 NxnU mode, an Inter _2 NxnD mode, an Inter _ nLx2N mode and an Inter _ nR x 2N mode respectively, carrying out complete TZ Search, and determining the optimal MV under the Inter _2 NxN mode, the Inter _ Nx2N mode, the Inter _ NxN mode, the Inter _2 NxnU mode, the Inter _2 NxnD mode, the Inter _ nLx2N mode and the Inter _ nR x 2N mode.
It can be known from statistics that for an image with simple motion, its optimal search point is always near the initial search point or is (0, 0), so we can set a threshold to determine whether the motion is simple. Let the MV sizes of the neighboring coded CUs (left, top right) of the current CU block be d1，d2，d3If, ifmax{|d1-d2|，|d2-d3|，|d3-d1The value of is less than some threshold dthAnd the angular difference max { | [ theta ] of the MV1-θ2|，|θ2-θ3|，|θ3-θ1Is less than a certain threshold value thetathIn the meantime, we consider that the image motion is simpler, and the search omission of the current inter _2N × 2N mode is a diamond search with a step size of 2. Meanwhile, we assume the inter _2 Nx 2N mode as the parent PU and the other modes as the child PUs, as shown in FIG. 3. And judging whether the optimal search point of the inter-2 Nx 2N mode is near the initial search point, if so, terminating the diamond search of which the step length is 2 only by the sub-PU, and the selected optimal search point is the point to which the final MV of the sub-PU points. If not, a full TZ Search is performed to determine the final MV.
In this embodiment, when four different values of QP are calculated, respectively, 22, 27, 32, and 37, the coding time, the joint Bit Rate (BDBR), and the joint Peak Signal-to-Noise Ratio (BDPSNR) of the algorithm of the present invention and the HM16.16 standard code TZ Search are compared, the simulation platform is Visual Studio 2015, the number of coding frames is 50, and d is comparedth＝1，θth15 ° is set. The simulation results are shown in table 3, and it can be seen from the analysis of the simulation results that the algorithm of the present invention saves about 13.44% of the motion estimation time, increases the BDBR by about 0.26db, and decreases the BDPSNR by about 0.014% compared to the TZ Search in the HM. This data fully demonstrates that the algorithm of the present invention can effectively improve the coding efficiency of the original TZ Search in the HM.
TABLE 3 results of the algorithm of the invention/results of TZ Search in HM
Figure BDA0001716387240000071
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.

Claims (1)

1. A fast motion estimation method based on HEVC image content complexity is characterized by comprising the following steps:
s1, coding a current CU block by using a Merge mode;
s2, judging the motion complexity of the current CU block, and if max { | d1-d2|，|d2-d3|，|d3-d1|}<dthAnd max { | [ theta ]1-θ2|，|θ2-θ3|，|θ3-θ1|}<θthIf yes, go to step S3, otherwise, go to step S4;
wherein d is1，d2，d3Respectively the MV sizes of the coded CU blocks from the current CU block to the left direction, the upper direction and the upper right direction adjacent to the current CU block; theta1，θ2，θ3Are respectively d1，d2，d3The included angle with the horizontal line; dthAnd thetathIs a set threshold value;
s3, encoding the current CU block by using a parent PU mode, and only performing diamond search with the step length of 2;
s4, encoding the current CU block by using a parent PU mode, carrying out complete TZ Search, judging whether an optimal Search point is near an initial Search point, if so, carrying out step S5, otherwise, carrying out step S6;
s5, coding the current CU block by using a sub-PU mode, performing diamond search with the step length of 2, and determining the optimal MV under the sub-PU mode;
s6, coding the current CU block by using a sub-PU mode, carrying out complete TZ Search, and determining the optimal MV under the sub-PU mode;
in the step S3 and the step S4, the parent PU mode is Inter _2N × 2N mode;
in the steps S5 and S6, the sub-PU modes are Inter _2N × N, Inter _ N × 2N, Inter _ N × N, Inter _2N × nU, Inter _2N × nD, Inter _ nL × 2N, and Inter _ nR × 2N modes.
CN201810710378.9A 2018-07-02 2018-07-02 HEVC image content complexity-based rapid motion estimation method Active CN109040756B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810710378.9A CN109040756B (en) 2018-07-02 2018-07-02 HEVC image content complexity-based rapid motion estimation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810710378.9A CN109040756B (en) 2018-07-02 2018-07-02 HEVC image content complexity-based rapid motion estimation method

Publications (2)

Publication Number Publication Date
CN109040756A CN109040756A (en) 2018-12-18
CN109040756B true CN109040756B (en) 2021-01-15

Family

ID=65521284

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810710378.9A Active CN109040756B (en) 2018-07-02 2018-07-02 HEVC image content complexity-based rapid motion estimation method

Country Status (1)

Country Link
CN (1) CN109040756B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110213592B (en) * 2019-06-21 2021-04-09 山东大学 Circuit applicable to motion estimation in HEVC standard and working method thereof
CN113613012A (en) * 2021-08-19 2021-11-05 深圳市多为通讯科技有限公司 Mobile phone radio frequency signal pre-compression method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103873861A (en) * 2014-02-24 2014-06-18 西南交通大学 Coding mode selection method for HEVC (high efficiency video coding)
WO2015176678A1 (en) * 2014-05-22 2015-11-26 Mediatek Inc. Method of intra block copy with flipping for image and video coding
WO2016024142A1 (en) * 2014-08-12 2016-02-18 Intel Corporation System and method of motion estimation for video coding

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101888546B (en) * 2010-06-10 2016-03-30 无锡中感微电子股份有限公司 A kind of method of estimation and device
CN103237222B (en) * 2013-05-07 2015-12-02 河海大学常州校区 The method for estimating of multi-mode search
CN104995917B (en) * 2015-05-07 2019-03-15 北京大学深圳研究生院 A kind of adaptive movement estimation method and module
CN105959699B (en) * 2016-05-06 2019-02-26 西安电子科技大学 A kind of quick inter-frame prediction method based on estimation and time-space domain correlation

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103873861A (en) * 2014-02-24 2014-06-18 西南交通大学 Coding mode selection method for HEVC (high efficiency video coding)
WO2015176678A1 (en) * 2014-05-22 2015-11-26 Mediatek Inc. Method of intra block copy with flipping for image and video coding
WO2016024142A1 (en) * 2014-08-12 2016-02-18 Intel Corporation System and method of motion estimation for video coding

Also Published As

Publication number Publication date
CN109040756A (en) 2018-12-18

Similar Documents

Publication Publication Date Title
CN110087087B (en) VVC inter-frame coding unit prediction mode early decision and block division early termination method
CN114928744B (en) System and method for signaling motion merge mode in video codec
CN107483957B (en) Method for decoding video data
CN108235009B (en) Method for deriving motion information
CN108347616B (en) Depth prediction method and device based on optional time domain motion vector prediction
CN108781284A (en) The method and device of coding and decoding video with affine motion compensation
CN105959699B (en) A kind of quick inter-frame prediction method based on estimation and time-space domain correlation
CN104349164A (en) Method for deriving a temporal predictive motion vector, and apparatus using the method
US20200195956A1 (en) Motion compensation at a finer precision than motion vector differential
CN112637591B (en) Video predictive coding method and device
CN105681808A (en) Rapid decision-making method for SCC interframe coding unit mode
CN113810686B (en) Encoding and decoding method, device and equipment
CN110365975A (en) A kind of AVS2 video encoding and decoding standard prioritization scheme
CN109040756B (en) HEVC image content complexity-based rapid motion estimation method
CN104333755B (en) The CU based on SKIP/Merge RD Cost of B frames shifts to an earlier date terminating method in HEVC
CN113366831B (en) Coordination between overlapped block motion compensation and other tools
EP4162682A1 (en) Geometric partition mode with motion vector refinement
CN109889838B (en) HEVC (high efficiency video coding) rapid coding method based on ROI (region of interest)
CN107343199B (en) Rapid adaptive compensation method for sampling points in HEVC (high efficiency video coding)
Guan et al. VVC fast ME algorithm based on spatial texture features and time correlation
CN113242427B (en) Rapid method and device based on adaptive motion vector precision in VVC
CN109547798A (en) A kind of quick HEVC inter-frame mode selecting method
CN112954365A (en) HEVC interframe motion estimation pixel search improvement method
CN110113601B (en) HEVC intra-frame rapid algorithm selection method based on video picture texture features
KR20160106348A (en) Video Coding Method and Apparatus thereof

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant