CN109040756A - A kind of rapid motion estimating method based on HEVC image content complexity - Google Patents
A kind of rapid motion estimating method based on HEVC image content complexity Download PDFInfo
- Publication number
- CN109040756A CN109040756A CN201810710378.9A CN201810710378A CN109040756A CN 109040756 A CN109040756 A CN 109040756A CN 201810710378 A CN201810710378 A CN 201810710378A CN 109040756 A CN109040756 A CN 109040756A
- Authority
- CN
- China
- Prior art keywords
- inter
- block
- current
- search
- coding
- 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.)
- Granted
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/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
Abstract
The present invention provides a kind of rapid motion estimating method based on HEVC image content complexity.This method comprises the following steps: the S1. current CU block of Merge pattern-coding；S2. judge the motion complexity of current CU block, if max | d1‑d2|, | d2‑d3|, | d3‑d1|}<dth, and max | θ1‑θ2|, | θ2‑θ3|, | θ3‑θ1|}<θth, then step S3 is carried out, conversely, then carrying out step S4；S3. the current CU block of Inter_2N × 2N pattern-coding is used, and only carries out the diamond search that step-length is 2；S4. the current CU block of Inter_2N × 2N pattern-coding is used, complete Test Zero (TZ) Search is carried out, and judges optimum search point whether near initial search point, if carrying out step S5 if not existing and carrying out step S6；S5. current CU block is encoded with other modes (in addition to Inter_2N × 2N), carries out the diamond search that step-length is 2, and determine the optimal MV under sub- PU mode.S6. with the current CU block of other pattern-codings, complete TZ Search is carried out, and determines the optimal MV under sub- PU mode.The present invention can effectively improve the code efficiency of original TZ Search in HM.
Description
Technical field
The present invention relates to efficient video coding (High Efficient Video Coding, HEVC) technical fields, more
Body, it is related to a kind of rapid motion estimating method based on HEVC image content complexity.
Background technique
Vision is the main path in the human perception external world, and in this information-based epoch, video information always will receive people
Favor.However uncompressed video information data amount is very surprising, is not used to actual transimission and storage at all.State
Border telecommunication standardization sector of telecommunication union (International Telecommunication Union-
Telecommunication Standardization Sector, ITU-T) and International Organization for standardization (International
Electrotechnical Commission, IEC) a series of video encoding standard is had launched, it is such as H.26X serial.This
A little standards are widely used in the video communication based on network transmission, greatly facilitate acquisition of the people to video information.
HEVC/H.265 is that latest generation video is compiled after advanced video encoding (Advanced Video Coding, AVC/H.264)
Code standard, which employs many new techniques to improve coding quality, and further satisfaction people are to high definition, very HD video
Demand.But meanwhile the computation complexity of Video coding limits HEVC and further develops.
It is suggested at present there are many algorithm and reduces the scramble time by sacrificing certain bit rate.It mainly can be with
It is divided into and reduces two parts of intra prediction and inter prediction encoding time.In CN103327325, propose based on HEVC standard
The quick self-adapted selection method of intra prediction mode, mainly by current prediction unit carry out SATD (absolute error and
Distortion) selection roughly, compare the ratio and fixed threshold of two neighboring cost difference and cost intermediate value in candidate pattern, thus from
Selection candidate pattern is adapted to, then optimum prediction mode is determined by rate-distortion optimization.In CN104954787B, one kind is proposed
HEVC inter-frame forecast mode selection method, this method are as follows: determine the picture of coding unit (Coding Unit, CU) block of present frame
Plain size within the set range when, based on absolute error and (Sumof Absolute Differences, SAD) algorithm calculating obtain
The first rate distortion costs (Sad Cost0) of every kind of inter-frame forecast mode of the CU block are obtained, it is pre- according to each interframe obtained
First rate distortion costs of survey mode obtain the first optimal rate distortion costs and corresponding first inter-frame forecast mode and suboptimum
The first rate distortion costs (Sad Cost1) and corresponding second inter-frame forecast mode, determine (Sad Cost1-Sad
Cost0 when)/Sad Cost0 is greater than threshold value, select first inter-frame forecast mode as the optimal inter-prediction of the CU block
Mode.
These algorithms all reduce the encoder complexity of HEVC, but it is known that in HEVC, time-consuming longest part
It is motion search part.So effectively reducing the motion search time, it is just able to achieve more efficient Video coding.In HM standard
In code, it has been proposed that the method for TZ Search replaces full-search algorithm, greatly reduces the scramble time.Movement is searched
Rope is divided into two steps: determining initiating searches point and determines optimum search point.Advanced motion vector prediction (Advanced is used in HEVC
Motion Vector Predictor, AMVP) technology determines initiating searches point, AMVP can provide several candidate predictions fortune
Dynamic vector (Motion Vector, MV), encoder therefrom select rate distortion costs the smallest as prediction MV, and signified with it
To position as initiating searches point.Then with the beginning of step-length 1, (such as according to diamond shape template (as shown in Figure 1) or square templates
Shown in Fig. 2) it is searched in search range, wherein being incremented by the form of step-length is 2 integer number power, elimination factor distortion is the smallest
Search result of the point as the step, the point then not yet searched for around supplement search optimum search point, to determine optimum search
Point.It does search entirely in a certain range centered on the optimum point if the corresponding step-length of optimum search point is greater than some threshold value
Rope, the optimum point for selecting rate distortion costs the smallest as the step, using this optimum search point as new initiating searches point,
Search refinement.Stop search refinement when the adjacent optimum point obtained to this search refinement is consistent.The MV obtained at this time is most
Whole MV.
Summary of the invention
The present invention in order to overcome at least one of the drawbacks of the prior art described above, provides a kind of multiple based on HEVC picture material
The rapid motion estimating method of miscellaneous degree.The present invention can effectively reduce the time of motion search loss, and then effectively improve HM
In original TZ Search code efficiency.
In order to solve the above technical problems, the technical solution adopted by the present invention is that: one kind being based on HEVC image content complexity
Rapid motion estimating method, wherein include the following steps:
S1. the current CU block of Merge pattern-coding is used；
S2. judge the motion complexity of current CU block, if max | d1-d2|, | d2-d3|, | d3-d1|}<dth, and max |
θ1-θ2|, | θ2-θ3|, | θ3-θ1|}<θth, then step S3 is carried out, conversely, then carrying out step S4；
Wherein, d1, d2, d3Encoded CU block on respectively current CU block to left, upper, three directions of upper right adjacent thereto
MV size；θ1, θ2, θ3Respectively d1, d2, d3With horizontal angle；dthAnd θthFor the threshold value of setting；
S3. the current CU block of Inter_2N × 2N pattern-coding is used, and only carries out the diamond search that step-length is 2；
S4. the current CU block of Inter_2N × 2N pattern-coding is used, carries out complete TZ Search, and judge optimum search
Whether point is near initial search point, if carrying out step S5 if not existing and carrying out step S6；
S5. respectively use Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N ×
The current CU block of nD, Inter_nL × 2N and Inter_nR × 2N pattern-coding carries out the diamond search that step-length is 2, and determines
Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N × nD, Inter_nL × 2N and
Optimal MV under Inter_nR × 2N mode.
S6. respectively use Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N ×
The current CU block of nD, Inter_nL × 2N and Inter_nR × 2N pattern-coding carries out complete TZ Search, and determines
Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N × nD, Inter_nL × 2N and
Optimal MV under Inter_nR × 2N mode.
By statistics it is recognised that for moving relatively simple image, its optimum search point is always in initiating searches
It near point or is (0,0), therefore we can set a threshold value to judge whether movement is simple.If current CU block is adjacent
The MV size of encoded CU (left, on, upper right) is respectively d1, d2, d3If max | d1-d2|, | d2-d3|, | d3-d1| value it is small
In some threshold value dth, and MV angle difference max | θ1-θ2|, | θ2-θ3|, | θ3-θ1| it is less than some threshold θthWhen, we recognize
Relatively simple for image motion, then the search of current inter_2N × 2N mode saves the diamond search that slightly step-length is 2.While I
Assume inter_2N × 2N mode be father PU, other modes be sub- PU.Judge the optimum search point of inter_2N × 2N mode
Whether near initial search point, if sub- PU also only proceeds to the diamond search that step-length is 2 and just terminates, and selects at this time
Optimum search point out is point pointed by the sub- final MV of PU.If not existing, complete TZ Search is carried out to determine most
Whole MV.
We assume that the encoder complexity of estimation is MEcomplexity, is defined as:
MEcomplexity=(TME/Tencoder) × 100%
Wherein TMEFor the time of estimation in HM source code, TencoderIt is consumed by cataloged procedure entire in HM source code
Time.
Table 1 is the video sequence of different resolution different Q P's (Quantization parameter, quantization parameter)
In the case of each estimation complexity.
The encoder complexity ME of 1 estimation of tablecomplexity(%)
From in table 1 it is recognised that the time specific gravity that consumes in entire coding of estimation is very big, therefore effectively
Reduction estimation time, it can largely reduce the scramble time.
The data result (%) of table 2P (A)
We assume that event A is in Inter_2N × 2N mode, optimum search point is near initial search point or is
The probability of (0,0), the data that experiment obtains P (A) are as shown in table 2.It is analyzed by data it is recognised that more simple in movement
In single sequence, probability can be up to 95.02%, therefore can absolutely prove, the method for terminating TZ Search in advance
It is feasible.
We assume that the optimum search point that event B is sub- PU near initial search point or is (0,0).We, which calculate, works as
The probability P (B | A) that event B occurs when event A is set up,Wherein C is indicated in the process of running, thing
The number that part B occurs, A indicate the number that event A occurs.By counting it can be found that its probability can be up to 96.8% or more.
Therefore can absolutely prove, if father PU, that is, Inter_2N × 2N mode optimum search point near initial search point,
Sub- PU (Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N × nD, Inter_nL ×
2N, Inter_nR × 2N) optimum point search step can only carry out the TZ Search that step-length is 2, remaining step can be with
It skips.
Compared with prior art, beneficial effects of the present invention:
Estimation method of the invention can the judgement based on motion complexity terminate TZ Search in advance, so as into one
Step reduces the time of motion search loss, and then can effectively improve the code efficiency of original TZ Search in HM.
Detailed description of the invention
Fig. 1 is diamond search schematic diagram in the present invention.
Fig. 2 is square aearch schematic diagram in the present invention.
Fig. 3 is that inter-prediction PU divides schematic diagram in the present invention.
Specific embodiment
The attached figures are only used for illustrative purposes and cannot be understood as limitating the patent；In order to better illustrate this embodiment, attached
Scheme certain components to have omission, zoom in or out, does not represent the size of actual product；To those skilled in the art,
The omitting of some known structures and their instructions in the attached drawings are understandable.Being given for example only property of positional relationship is described in attached drawing
Illustrate, should not be understood as the limitation to this patent.
A kind of rapid motion estimating method based on HEVC image content complexity, wherein include the following steps:
S1. the current CU block of Merge pattern-coding is used；
S2. judge the motion complexity of current CU block, if max | d1-d2|, | d2-d3|, | d3-d1|}<dth, and max |
θ1-θ2|, | θ2-θ3|, | θ3-θ1|}<θth, then step S3 is carried out, conversely, then carrying out step S4；
Wherein, d1, d2, d3Encoded CU block on respectively current CU block to left, upper, three directions of upper right adjacent thereto
MV size；θ1, θ2, θ3Respectively d1, d2, d3With horizontal angle；dthAnd θthFor the threshold value of setting；
S3. the current CU block of Inter_2N × 2N pattern-coding is used, and only carries out the diamond search that step-length is 2；
S4. the current CU block of Inter_2N × 2N pattern-coding is used, carries out complete TZ Search, and judge optimum search
Whether point is near initial search point, if carrying out step S5 if not existing and carrying out step S6；
S5. respectively use Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N ×
The current CU block of nD, Inter_nL × 2N and Inter_nR × 2N pattern-coding carries out the diamond search that step-length is 2, and determines
Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N × nD, Inter_nL × 2N and
Optimal MV under Inter_nR × 2N mode.
S6. respectively use Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N ×
The current CU block of nD, Inter_nL × 2N and Inter_nR × 2N pattern-coding carries out complete TZ Search, and determines
Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_2N × nU, Inter_2N × nD, Inter_nL × 2N and
Optimal MV under Inter_nR × 2N mode.
By statistics it is recognised that for moving relatively simple image, its optimum search point is always in initiating searches
It near point or is (0,0), therefore we can set a threshold value to judge whether movement is simple.If current CU block is adjacent
The MV size of encoded CU (left, on, upper right) is respectively d1, d2, d3If max | d1-d2|, | d2-d3|, | d3-d1| value it is small
In some threshold value dth, and MV angle difference max | θ1-θ2|, | θ2-θ3|, | θ3-θ1| it is less than some threshold θthWhen, we recognize
Relatively simple for image motion, then the search of current inter_2N × 2N mode saves the diamond search that slightly step-length is 2.While I
Assume inter_2N × 2N mode be father PU, other modes be sub- PU, as shown in Figure 3.Judge inter_2N × 2N mode
Whether optimum search point is near initial search point, if it is just whole that sub- PU also only proceeds to the diamond search that step-length is 2
Only, the optimum search point selected at this time is point pointed by the sub- final MV of PU.If not existing, complete TZ is carried out
Search determines final MV.
In the present embodiment, calculate separately QP=22, in the case where 27,32,37 four different values, compare inventive algorithm with
The scramble time of HM16.16 standard code TZ Search, joint bit-rate (Bjontegaard Delta Bit Rate,
BDBR) and combine Y-PSNR (Bjontegaard Delta Peak Signal-to-Noise Ratio, BDPSNR),
Emulation platform is Visual Studio 2015, and coding frame number is 50, dth=1, θth=15 °.Simulation result is as shown in table 3, leads to
It crosses to analysis of simulation result it is found that compared to the TZ Search in HM, the motion estimation time that inventive algorithm is saved is about
13.44%, increased BDBR are about 0.26db, and the BDPSNR of reduction is about 0.014%.The data have absolutely proved calculation of the present invention
Method can effectively improve the code efficiency of original TZ Search in HM.
The result of TZ Search in 3 inventive algorithm result of table/HM
Obviously, the above embodiment of the present invention is just for the sake of clearly demonstrating examples made by the present invention, and is not
Restriction to embodiments of the present invention.For those of ordinary skill in the art, on the basis of the above description also
It can make other variations or changes in different ways.There is no necessity and possibility to exhaust all the enbodiments.It is all
Made any modifications, equivalent replacements, and improvements etc. within the spirit and principles in the present invention should be included in right of the present invention and want
Within the protection scope asked.
Claims (4)
1. a kind of rapid motion estimating method based on HEVC image content complexity, which comprises the steps of:
S1. the current CU block of Merge pattern-coding is used；
S2. judge the motion complexity of current CU block, if the movement of current CU block is simple motion, carry out step S3, it is on the contrary
Then carry out step S4；
S3. the current CU block of father PU pattern-coding is used, and only carries out the diamond search that step-length is 2；
S4. the current CU block of father PU pattern-coding is used, carries out complete TZ Search, and judge optimum search point whether initial
Near Searching point, if carrying out step S5 if not existing and carrying out step S6；
S5. with the current CU block of sub- PU pattern-coding, the diamond search that step-length is 2 is carried out, and determines the optimal MV under sub- PU mode；
S6. with the current CU block of sub- PU pattern-coding, complete TZ Search is carried out, and determines the optimal MV under sub- PU mode.
2. a kind of rapid motion estimating method based on HEVC image content complexity according to claim 1, feature
It is, in the step S2, judges the Rule of judgment of the motion complexity of current CU block are as follows: if max | d1-d2|, | d2-d3|, |
d3-d1|}<dth, and max | θ1-θ2|, | θ2-θ3|, | θ3-θ1|}<θth, then the movement of current CU block is simple motion, conversely, then
The movement of current CU block is not simple motion；
Wherein, d1, d2, d3Respectively current CU block is to left, upper, encoded CU block on three directions of upper right MV adjacent thereto
Size；θ1, θ2, θ3Respectively d1, d2, d3With horizontal angle；dthAnd θthFor the threshold value of setting.
3. a kind of rapid motion estimating method based on HEVC image content complexity according to claim 1, feature
It is, in the step S3 and step S4, father's PU mode is Inter_2N × 2N mode.
4. a kind of rapid motion estimating method based on HEVC image content complexity according to claim 1, feature
It is, in the step S5 and step S6, sub- PU mode is Inter_2N × N, Inter_N × 2N, Inter_N × N, Inter_
2N × nU, Inter_2N × nD, Inter_nL × 2N and Inter_nR × 2N mode.
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 true CN109040756A (en) | 2018-12-18 |
| CN109040756B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213592A (en) * | 2019-06-21 | 2019-09-06 | 山东大学 | The circuit and its working method of estimation suitable for HEVC standard |
| CN113613012A (en) * | 2021-08-19 | 2021-11-05 | 深圳市多为通讯科技有限公司 | Mobile phone radio frequency signal pre-compression method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888546A (en) * | 2010-06-10 | 2010-11-17 | 北京中星微电子有限公司 | Motion estimation method and device |
| CN103237222A (en) * | 2013-05-07 | 2013-08-07 | 河海大学常州校区 | Motion estimation method adopting multi-mode searching manner |
| CN103873861A (en) * | 2014-02-24 | 2014-06-18 | 西南交通大学 | Coding mode selection method for HEVC (high efficiency video coding) |
| CN104995917A (en) * | 2015-05-07 | 2015-10-21 | 北京大学深圳研究生院 | Self-adaption motion estimation method and module thereof |
| 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 |
| CN105959699A (en) * | 2016-05-06 | 2016-09-21 | 西安电子科技大学 | Fast inter-frame prediction method based on motion estimation and temporal-spatial correlation |
-
2018
- 2018-07-02 CN CN201810710378.9A patent/CN109040756B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888546A (en) * | 2010-06-10 | 2010-11-17 | 北京中星微电子有限公司 | Motion estimation method and device |
| CN103237222A (en) * | 2013-05-07 | 2013-08-07 | 河海大学常州校区 | Motion estimation method adopting multi-mode searching manner |
| 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 |
| CN104995917A (en) * | 2015-05-07 | 2015-10-21 | 北京大学深圳研究生院 | Self-adaption motion estimation method and module thereof |
| US20180109791A1 (en) * | 2015-05-07 | 2018-04-19 | Peking University Shenzhen Graduate School | A method and a module for self-adaptive motion estimation |
| CN105959699A (en) * | 2016-05-06 | 2016-09-21 | 西安电子科技大学 | Fast inter-frame prediction method based on motion estimation and temporal-spatial correlation |
Non-Patent Citations (1)
| Title |
|---|
| LONGFEI GAO ET AL: "A novel integer-pixel motion estimation algorithm based on quadratic prediction", 《2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING(ICIP)》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110213592A (en) * | 2019-06-21 | 2019-09-06 | 山东大学 | The circuit and its working method of estimation suitable for HEVC standard |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109040756B (en) | 2021-01-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103561263B (en) | Based on motion vector constraint and the motion prediction compensation method of weighted motion vector | |
| CN107147911B (en) | Quick interframe coding mode selection method and device based on local luminance compensation LIC | |
| CN104350749B (en) | The derivation of depth map estimation | |
| CN105959611B (en) | A kind of the interframe fast transcoding method and device of adaptive slave H264 to HEVC | |
| CN109792516A (en) | Method and device in image and coding and decoding video for coloration encoding and decoding in frame | |
| CN110087087A (en) | VVC interframe encode unit prediction mode shifts to an earlier date decision and block divides and shifts to an earlier date terminating method | |
| 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 | |
| CN107360419B (en) | A kind of movement forward sight video interprediction encoding method based on perspective model | |
| CN107277506B (en) | Motion vector accuracy selection method and device based on adaptive motion vector precision | |
| CN104639940B (en) | A kind of quick HEVC method for choosing frame inner forecast mode | |
| CN103248893A (en) | Method for quick inter-frame transcoding from H. 264/AVC standard to HEVC standard and transcoder thereof | |
| CN101917619A (en) | Quick motion estimation method of multi-view video coding | |
| CN104811729B (en) | A kind of video multi-reference frame coding method | |
| CN106454349B (en) | A kind of estimation block matching method based on H.265 Video coding | |
| CN104853191B (en) | A kind of HEVC fast encoding method | |
| CN105187826B (en) | For the fast intra mode decision method of high efficiency video encoding standard | |
| CN107222742B (en) | Video coding Merge mode quick selecting method and device based on time-space domain correlation | |
| Yuan et al. | Model based motion vector predictor for zoom motion | |
| CN105681808A (en) | Rapid decision-making method for SCC interframe coding unit mode | |
| CN110519591A (en) | A kind of prediction mode fast selecting method based on intraframe coding in multipurpose coding | |
| CN106412611B (en) | A kind of complexity control method of efficient video coding | |
| CN108769696A (en) | A kind of DVC-HEVC video transcoding methods based on Fisher discriminates | |
| CN110446052A (en) | The quick CU depth selection method of depth map in a kind of 3D-HEVC frame | |
| CN104333755B (en) | The CU based on SKIP/Merge RD Cost of B frames shifts to an earlier date terminating method in HEVC |
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 |