CN107948659A - For the adaptive energy consumption control strategies of HEVC SCC of game video content - Google Patents
For the adaptive energy consumption control strategies of HEVC SCC of game video content Download PDFInfo
- Publication number
- CN107948659A CN107948659A CN201711167098.XA CN201711167098A CN107948659A CN 107948659 A CN107948659 A CN 107948659A CN 201711167098 A CN201711167098 A CN 201711167098A CN 107948659 A CN107948659 A CN 107948659A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- mtr
- mtd
- jud
- 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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/625—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]
-
- 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/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/176—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 block, e.g. a macroblock
-
- 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/186—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 a colour or a chrominance component
Abstract
The invention discloses a kind of adaptive energy consumption control strategies of the HEVC SCC for game video content, and game video sequence image is divided into the block of 8x8, by series of preprocessing, sets the correspondence output valve of a block as Judb, all JudbDiscrimination matrix is formed, according to the element Jud in the size fusion discrimination matrix of input CUb, calculate the planarization of CU；Differentiated according to planarization, determine the region (similar natural image) of color complexity and very flat region.The adaptive energy consumption control strategies of the HEVC SCC for game video content of the present invention, the algorithm can improve the code rate for SC images coding, and the scramble time is reduced on the premise of coding quality is less influenced.
Description
Technical field
The present invention relates to technical field of video coding, more particularly to a kind of coding standard for Screen Content
The energy consumption control strategy of (the extension SCC of HEVC).
Background technology
SC images are refered in particular to by computer-generated image, and the continuous development recently as video content causes SC images to get over
More to go deep into the life of people.In January, 2014, MPEG Requirements subgroup have been issued to screen content
The demand (i.e. Call for Proposals, CfP) of coding, and finally HEVC Screen have been issued in July, 2014
First part of draft of Content Coding (HEVC-SCC).Four new coding works are mainly added on the basis of HEVC
Tool：Intra Block Copy；Palette Mode (pallet mode)；Adaptive Colour Transform；
Adaptive Motion Vector Resolution.
Compared to natural image, the color category meeting much less of SC images, that is, the pixel value in certain area are past
It is past to have larger repeatability and similitude.If appropriate quantization can be carried out, the color in a coding unit (CU) tends to
Show as a few peak value.The encoder that pallet mode is designed aiming at this characteristic of SC, it can be analyzed in CU
Each pixel and it is quantified, select several representative colors generation palettes, and each color is assigned
Give a pointer.Each color is represented to be made of tri- kinds of components of RGB or YUV.It is not belonging to represent indivedual face of color after quantifying
Color is noted as escape pixel, these pixel values and its pointer can be encoded directly.Pointer maps in palette return CU,
Pixel in CU is represented to be formed a CU color pointer figure with pointer value, and traverse scanning and entropy volume are carried out to this figure
Code.But the complexity of pallet mode is higher, particularly in face of the complex situation of color category, such as game true to nature and
Animated film, the natural image part in mixed image, the generation and prediction of palette all can be more difficult.
Now, this live video content of playing becomes more and more popular, but without people to this SC video of playing
Content carried out experiment, therefore of the invention this proposes a kind of fast algorithm to game video content.
The content of the invention
The present invention seeks to be a kind of offer adaptive energy consumption control strategies of HEVC-SCC for game video content, according to
Differentiate according to specific cycle tests, determine the region (similar natural image) of color complexity and very flat area
Domain, and both regions are closed with the policing algorithm of pallet mode.
A kind of adaptive energy consumption control strategies of HEVC-SCC for game video content of the present invention, including following step
Suddenly：
Step 1, pending game video sequence image is inputted；
Step 2, the monochrome information of game video sequence image image is obtained；
Step 3, each two field picture of game video sequence is averagely divided into the image block of 8 × 8 sizes；
Step 4, dct transform is carried out to weigh its color complexity to each piece, obtain the absolute value a of DCT coefficient；
Step 5, two parameters i and k are defined；I is constant, is a threshold value, and for being compared with a, k represents a block
Planarization；
Step 6,0≤a of satisfaction≤i is judged whether.If 0≤a≤i, i.e., when a is 0 or very small, k values accumulation 1；If absolutely
I is more than to value a, k values remain unchanged
Step 7, the relevant Upper threshold upK of average value aveK and Lower Threshold with all k values in a two field picture are calculated
lowK；Specific formula is as follows：
Wherein, α and β represents two weighted values, and pixX, pixY represent the horizontal pixel point number of a two field picture and indulge respectively
To pixel number, k1+k2+L+knumAll 8 × 8 pieces of corresponding k values in this frame are represented, num represents 8x8 in a two field picture
The number of block；
Step 8, the correspondence output valve of a block is set as Judb, all JudbForm discrimination matrix；JudbSpecific meter
Calculating formula is：
By k and upK, lowK compares：When the k values of a 8x8 block are more than upK, then this block corresponds to output valve JudbFor 0；
When the k values of a block are less than lowK, then output valve Jud is corresponded tobFor 1；
Step 9, the element Jud in the size fusion discrimination matrix of input CUb：Amalgamation mode is to all JudbInto
Row weighted average；The planarization calculation formula of CU is as follows：
Wherein, Scu×ScuRepresenting the size of CU, n represents that this CU has the block of several 8x8, and m represents to merge later number,
It is exactly the planarization of this CU；
Step 10, judge whether to meet 0 ＜ m ＜ 1.If meeting 0 ＜ m ＜ 1, the default palette pattern is enabled；It is if discontented
Foot, i.e., (as known to above-mentioned steps, m can not possibly be more than 1 or less than 0), then close pallet mode when current m is 1 or 0.
Compared with prior art, the adaptive energy consumption control strategies of the HEVC-SCC for game video content of the invention,
The algorithm can improve the code rate for SC images coding, when reducing coding on the premise of less influencing coding quality
Between.
Brief description of the drawings
Fig. 1 is the overall flow of the adaptive energy consumption control strategies of the HEVC-SCC for game video content of the present invention
Figure.
Embodiment
Embodiments of the present invention are described in further detail below in conjunction with attached drawing.
The Integral Thought of the present invention judges the color complexity of image, and the region higher to color complexity and extreme are flat
Region skip pallet mode, it is on the contrary then the default palette pattern can be enabled.
As shown in Figure 1, in a specific embodiment, various types of game video cycle tests are collected, respectively to
The sequence that one step is collected open and close experiment and the record of the default palette pattern；The present invention comprises the following steps：
Step 1, pending image is inputted；
Step 2, the monochrome information of image is obtained；
Step 3, image is divided into the block of 8x8；
Step 4, dct transform is carried out to weigh its color complexity to each piece, obtain the absolute value a of DCT coefficient；
Step 5, two parameters i and k are defined；I is constant, is a threshold value, and for being compared with a, k represents a block
Planarization；
Step 6,0≤a of satisfaction≤i is judged whether.If 0≤a≤i, i.e., when a is 0 or very small, k values accumulation 1；If absolutely
I is more than to value a, k values remain unchanged；
Step 7, the relevant Upper threshold upK of average value aveK and Lower Threshold with all k values in a two field picture are calculated
lowK；Specific formula is as follows：
Wherein, α and β represents two weighted values, and pixX, pixY represent the horizontal pixel point number of a two field picture and indulge respectively
To pixel number, k1+k2+L+knumAll 8 × 8 pieces of corresponding k values in this frame are represented, num represents 8x8 in a two field picture
The number of block；
Step 8, the correspondence output valve of a block is set as Judb, all JudbForm discrimination matrix；JudbSpecific meter
Calculating formula is：
By k and upK, lowK compares：When the k values of a 8x8 block are more than upK, then this block corresponds to output valve JudbFor 0；
When the k values of a block are less than lowK, then output valve Jud is corresponded tobFor 1；
Step 9, the element Jud in the size fusion discrimination matrix of input CUb：Amalgamation mode is to all JudbInto
Row weighted average；The planarization calculation formula of CU is as follows：
Wherein, Scu×ScuRepresenting the size of CU, n represents that this CU has the block of several 8x8, and m represents to merge later number,
It is exactly the planarization of this CU；
Step 10, judge whether to meet 0 ＜ m ＜ 1.If meeting 0 ＜ m ＜ 1, the default palette pattern is enabled；It is if discontented
Foot, i.e., (as known to above-mentioned steps, m can not possibly be more than 1 or less than 0), then perform step 13, close toning when current m is 1 or 0
Plate mode (skips pallet mode).
It is the description in relation to testing below.Encoder used in experiment is HM-16.6+SCM-5.0, and experiment porch is
Intel Core i7CPU-2.67GHz,6GRAM.Experiment condition uses all-intra-main-scc configuration files.QP is set
For 22,27,32,37.Constant value i is set to 8, aveKupAnd aveKlow62 and 48 are set to, so parameter thdK values are 55.Work as aveK
>=55, α are set to 0.7；As aveK ＜ 55, α is set to 0.75, β and is set to 0.1.As table 1 and table 2 show cycle tests.The survey of table 1
The all game video sequences of sequence are tried, the cycle tests of table 2 is disclosed cycle tests.Experimental result is as shown in table 3, table 4.
Table 1, game video sequence
| Sequancename | Resolution | FPS | YUV |
| XXL | 1920x1080 | 25 | 4:2:0 |
| KYBC8CC | 1280x720 | 25 | 4:2:0 |
| WZRYZDX | 1280x720 | 25 | 4:2:0 |
| NBA2K17 | 1280x720 | 25 | 4:2:0 |
| ChinaSpeed | 1024x768 | 30 | 4:2:0 |
Table 2, disclosed test video sequence
| Sequancename | Category | Resolution | FPS | YUV |
| MissionControlClip3 | M | 1920x1080 | 60 | 4:4:4 |
| Kimono1 | CC | 1920x1080 | 24 | 4:4:4 |
| sc_Robot | A | 1280x720 | 60 | 4:4:4 |
| sc_Programming | TGM | 1280x720 | 60 | 4:4:4 |
| sc_SlideShow | TGM | 1280x720 | 20 | 4:4:4 |
| sc_Web_Browsing | TGM | 1280x720 | 30 | 4:4:4 |
Table 3, game video sequential experimentation result
Table 4, open test video sequence experimental result
The BDPSNR gaps of all cycle tests are all in below 0.01dB.To cycle tests collection of playing, the present invention is with opening
The default palette pattern is compared, BDPSNR mean difference 0.0259dB, and the time saves 15.715%；To disclosed cycle tests collection,
BDPSNR mean difference 0.0402dB, time save 8.319%.Experimental result is preferable.
The present invention the once anticipation based on video content has been carried out before pallet mode is carried out, for video content compared with
Part for complexity or close to natural image, skips pallet mode, when reducing coding on the premise of ensureing coding quality
Between and required energy consumption.
Claims (1)
1. the adaptive energy consumption control strategies of a kind of HEVC-SCC for game video content, it is characterised in that including following step
Suddenly：
Step (1), inputs pending game video sequence image；
Step (2), obtains the monochrome information of game video sequence image；
Step (3), the image block of 8 × 8 sizes is averagely divided into by each two field picture of game video sequence；
Step (4), carries out dct transform to weigh its color complexity to each piece, obtains the absolute value a of DCT coefficient；
Step (5), defines two parameters i and k；I is constant, is a threshold value, for being compared with a, k one block of expression
Planarization；
Step (6), judges whether 0≤a of satisfaction≤i.If 0≤a≤i, i.e., when a is 0 or very small, k values accumulation 1；If definitely
Value a is more than i, and k values remain unchanged
Step (7), calculates the average value aveK relevant Upper threshold upK and Lower Threshold lowK with all k values in a two field picture；Tool
Body formula is as follows：
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mi>a</mi>
<mi>v</mi>
<mi>e</mi>
<mi>K</mi>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>k</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>k</mi>
<mn>2</mn>
</msub>
<mo>+</mo>
<mi>L</mi>
<mo>+</mo>
<msub>
<mi>k</mi>
<mrow>
<mi>n</mi>
<mi>u</mi>
<mi>m</mi>
</mrow>
</msub>
</mrow>
<mrow>
<mi>n</mi>
<mi>u</mi>
<mi>m</mi>
</mrow>
</mfrac>
</mtd>
</mtr>
<mtr>
<mtd>
<mi>u</mi>
<mi>p</mi>
<mi>K</mi>
<mo>=</mo>
<mi>a</mi>
<mi>v</mi>
<mi>e</mi>
<mi>K</mi>
<mo>&times;</mo>
<mi>&alpha;</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mi>l</mi>
<mi>o</mi>
<mi>w</mi>
<mi>K</mi>
<mo>=</mo>
<mi>a</mi>
<mi>v</mi>
<mi>e</mi>
<mi>K</mi>
<mo>&times;</mo>
<mi>&beta;</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mi>n</mi>
<mi>u</mi>
<mi>m</mi>
<mo>=</mo>
<mfrac>
<mrow>
<mi>p</mi>
<mi>i</mi>
<mi>x</mi>
<mi>X</mi>
<mo>&times;</mo>
<mi>p</mi>
<mi>i</mi>
<mi>x</mi>
<mi>Y</mi>
</mrow>
<mrow>
<mn>8</mn>
<mo>&times;</mo>
<mn>8</mn>
</mrow>
</mfrac>
</mtd>
</mtr>
</mtable>
</mfenced>
Wherein, α and β represents two weighted values, and pixX, pixY represent the horizontal pixel point number of a two field picture and longitudinal picture respectively
Vegetarian refreshments number, k1+k2+L+knumAll 8 × 8 pieces of corresponding k values in this frame are represented, num represents 8x8 blocks in a two field picture
Number；
Step (8), sets the correspondence output valve of a block as Judb, all JudbForm discrimination matrix；JudbSpecific calculating
Formula is：
<mrow>
<msub>
<mi>Jud</mi>
<mi>b</mi>
</msub>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mn>0</mn>
<mo>,</mo>
<mi>k</mi>
<mo>></mo>
<mi>u</mi>
<mi>p</mi>
<mi>K</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0.5</mn>
<mo>,</mo>
<mi>u</mi>
<mi>p</mi>
<mi>K</mi>
<mo>&GreaterEqual;</mo>
<mi>k</mi>
<mo>></mo>
<mi>l</mi>
<mi>o</mi>
<mi>w</mi>
<mi>K</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>1</mn>
<mo>,</mo>
<mi>k</mi>
<mo>&le;</mo>
<mi>l</mi>
<mi>o</mi>
<mi>w</mi>
<mi>K</mi>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow>
By k and upK, lowK compares：When the k values of a 8x8 block are more than upK, then this block corresponds to output valve JudbFor 0；When one
The k values of block are less than lowK, then correspond to output valve JudbFor 1；
Step (9), according to the element Jud in the size fusion discrimination matrix of input CUb：Amalgamation mode is to all JudbCarry out
Weighted average；The planarization calculation formula of CU is as follows：
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>m</mi>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>Jud</mi>
<mrow>
<mi>b</mi>
<mn>1</mn>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>Jud</mi>
<mrow>
<mi>b</mi>
<mn>2</mn>
</mrow>
</msub>
<mo>+</mo>
<mi>L</mi>
<mo>+</mo>
<msub>
<mi>Jud</mi>
<mrow>
<mi>b</mi>
<mi>n</mi>
</mrow>
</msub>
</mrow>
<mi>n</mi>
</mfrac>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>S</mi>
<mrow>
<mi>c</mi>
<mi>u</mi>
</mrow>
</msub>
<mo>&times;</mo>
<msub>
<mi>S</mi>
<mrow>
<mi>c</mi>
<mi>u</mi>
</mrow>
</msub>
</mrow>
<mrow>
<mn>8</mn>
<mo>&times;</mo>
<mn>8</mn>
</mrow>
</mfrac>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
Wherein, Scu×ScuRepresent the size of CU, n represents that this CU has the block of several 8x8, and m represents to merge later number, that is, this
The planarization of CU；
Step (10), judges whether to meet 0 ＜ m ＜ 1.If meeting 0 ＜ m ＜ 1, the default palette pattern is enabled；If not satisfied,
When i.e. current m is 1 or 0, then pallet mode is closed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711167098.XA CN107948659B (en) | 2017-11-21 | 2017-11-21 | HEVC-SCC adaptive energy consumption control strategy for game video content |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711167098.XA CN107948659B (en) | 2017-11-21 | 2017-11-21 | HEVC-SCC adaptive energy consumption control strategy for game video content |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107948659A true CN107948659A (en) | 2018-04-20 |
| CN107948659B CN107948659B (en) | 2020-07-31 |
Family
ID=61930502
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711167098.XA Expired - Fee Related CN107948659B (en) | 2017-11-21 | 2017-11-21 | HEVC-SCC adaptive energy consumption control strategy for game video content |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107948659B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150181223A1 (en) * | 2013-12-20 | 2015-06-25 | Canon Kabushiki Kaisha | Method and apparatus for transition encoding in video coding and decoding |
| CN106534846A (en) * | 2016-11-18 | 2017-03-22 | 天津大学 | Method for dividing and quickly encoding screen contents and natural contents |
| CN106716999A (en) * | 2014-06-20 | 2017-05-24 | 寰发股份有限公司 | Method of palette predictor signaling for video coding |
| CN107211148A (en) * | 2015-02-10 | 2017-09-26 | 高通股份有限公司 | The limitation of palette block size in video coding |
| CN107277509A (en) * | 2017-08-03 | 2017-10-20 | 重庆邮电大学 | A kind of fast intra-frame predicting method based on screen content |
-
2017
- 2017-11-21 CN CN201711167098.XA patent/CN107948659B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150181223A1 (en) * | 2013-12-20 | 2015-06-25 | Canon Kabushiki Kaisha | Method and apparatus for transition encoding in video coding and decoding |
| CN106716999A (en) * | 2014-06-20 | 2017-05-24 | 寰发股份有限公司 | Method of palette predictor signaling for video coding |
| CN107211148A (en) * | 2015-02-10 | 2017-09-26 | 高通股份有限公司 | The limitation of palette block size in video coding |
| CN106534846A (en) * | 2016-11-18 | 2017-03-22 | 天津大学 | Method for dividing and quickly encoding screen contents and natural contents |
| CN107277509A (en) * | 2017-08-03 | 2017-10-20 | 重庆邮电大学 | A kind of fast intra-frame predicting method based on screen content |
Non-Patent Citations (1)
| Title |
|---|
| 刘丹等: "屏幕内容编码方法研究进展", 《计算机研究与发展》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107948659B (en) | 2020-07-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101352046B (en) | Image encoding/decoding method and apparatus | |
| CN108495135A (en) | A kind of fast encoding method of screen content Video coding | |
| CN106937116B (en) | Low-complexity video coding method based on random training set adaptive learning | |
| CN104219525B (en) | Perception method for video coding based on conspicuousness and minimum discernable distortion | |
| CN101184221A (en) | Vision attention based video encoding method | |
| CN111432207A (en) | Perceptual high-definition video coding method based on salient target detection and salient guidance | |
| CN104243973B (en) | Video perceived quality non-reference objective evaluation method based on areas of interest | |
| CN105578181B (en) | The fast intra mode decision and block matching method of screen content compression in a kind of HEVC | |
| CN107623850A (en) | A kind of quick screen contents encoding method based on temporal correlation | |
| CN104994382B (en) | A kind of optimization method of perception rate distortion | |
| CN105791824B (en) | Screen content coding prediction mode fast selecting method based on edge dot density | |
| CN109040764A (en) | Fast coding algorithm in a kind of HEVC screen content frame based on decision tree | |
| CN107277509A (en) | A kind of fast intra-frame predicting method based on screen content | |
| CN104065962B (en) | The macroblock layer bit distribution optimization method that view-based access control model notes | |
| CN103379326B (en) | Method for video coding and device based on ROI and JND | |
| CN106303530A (en) | A kind of bit rate control method merging vision perception characteristic | |
| Yang et al. | An efficient intra coding algorithm based on statistical learning for screen content coding | |
| CN102663682B (en) | Adaptive image enhancement method based on interesting area | |
| CN108769696A (en) | A kind of DVC-HEVC video transcoding methods based on Fisher discriminates | |
| CN107105240A (en) | A kind of HEVC SCC complexity control methods and its system | |
| CN106060556A (en) | Detection method for HEVC prediction mode steganography | |
| CN107948659A (en) | For the adaptive energy consumption control strategies of HEVC SCC of game video content | |
| CN113079373A (en) | Video coding method based on HEVC-SCC | |
| CN102685491B (en) | Method and system for realizing video coding | |
| US8175150B1 (en) | Methods and/or apparatus for implementing rate distortion optimization in video compression |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200731 Termination date: 20211121 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |