CN104853220A - HEVC coding quadtree recursive decoding method - Google Patents
HEVC coding quadtree recursive decoding method Download PDFInfo
- Publication number
- CN104853220A CN104853220A CN201510256658.3A CN201510256658A CN104853220A CN 104853220 A CN104853220 A CN 104853220A CN 201510256658 A CN201510256658 A CN 201510256658A CN 104853220 A CN104853220 A CN 104853220A
- Authority
- CN
- China
- Prior art keywords
- node
- length
- index
- present node
- present
- 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
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses an HEVC coding quadtree recursive decoding method comprising the steps that a coding block quadtree index table is constructed, the table items of the index table describe attribute information of nodes, and an initial value is assigned to the index table; the current node in the index table is read, and whether the node is further split is judged according to the node description information so that selection is performed between performing decoding operation and continuously indexing children nodes; the attribute information of the position, side length and depth of the four nodes is indexed one by one, brother node indexing is recorded for the previous three nodes simultaneously, and the father node is recorded for the last node because of inexistence of the brother node; decoding (including standard definition of operation of motion prediction, inverse transformation, inverse quantization and motion compensation) of the current node is performed, and then the index number of the current node is modified; and the recursive decoding loop termination condition is calculated. The quadtree decoding recursive structure is expanded by the method so that program execution efficiency and design universality can be enhanced.
Description
Technical field
The invention belongs to video coding and decoding technology field, relate to a kind of video decode software design approach, the quaternary tree recursive structure being specifically related to a kind of HEVC video encoding and decoding standard expands into the method for recursion structure.
Technical background
HEVC is the video encoding standard of new generation that International Organization for standardization ITU and MPEG develops jointly, and compared to the H264 technology generally used at present, compression efficiency is close to doubling.In HEVC, the encoding block of maximum possible expands to the coding unit of 64x64 pixel, thus greatly improves the code efficiency of shoulder.On the other hand, size block well can not process the local detail of image, and the image of complexity needs meticulous prediction, and therefore small size block is also needs.Therefore, the coding unit of HEVC comprises the rectangle encoding block of four symmetrical cuttings, and each encoding block can Further Division be 4 four sub-blocks again, until the length of side of minimum sub-block is not less than 4 pixels.This structure convenience Quadtrees for Representing of HEVC coding unit, from the angle of realization, quaternary tree has recursive iteration structure natively.Current representational HEVC reference software, as HM, X265, FFMPEG etc., is all the coding and decoding adopting recursive fashion to realize quad-tree structure.But some high-level programming languages do not support Recursive programming, the C language compiler even on some embedded platforms does not also support recurrence; Recurrence is not supported, as compilation, chip design close to hard-wired mode.In addition, although Recursive programming realizes conveniently, execution efficiency is not high.
Therefore, adopting is that recursion structure has practical value by the quaternary tree recursive program structural modification in current HEVC software codec someway.
Summary of the invention
In order to solve above-mentioned technical problem, the quaternary tree recursive structure that the invention provides a kind of HEVC video encoding and decoding standard expands into the method for recursion structure.
The technical solution adopted in the present invention is: the recursion interpretation method of a kind of HEVC coding quaternary tree, is characterized in that, comprise the following steps:
Step 1: structure encoding block quaternary tree concordance list, the attribute information of the list item description node of concordance list, and give concordance list initialize;
Step 2: read the present node in concordance list, and divide according to node descriptor decision node?
If division, then perform following step 3;
Otherwise, then following step 4 is performed;
Step 3: position attribution, length of side attribute, the depth attribute information of index four nodes one by one, first three node records right neighbours' brotgher of node index simultaneously, last node record father node because the brotgher of node does not exist; Then the step 2 described in revolution execution;
Step 4: HEVC standard decoding operations such as () such as motion prediction, inverse transformation, re-quantization, motion compensation performing present node, then performs following judgement:
If code stream is decoded not or computing of decoding makes mistakes, then stop circulation, this flow process terminates;
Otherwise, perform following step 5;
Step 5: check present node, and judge:
If the right neighbor node of present node does not exist and the brotgher of node of father node does not also exist, or present node is root node, then stop circulation, this flow process terminates;
Otherwise, perform following step 6;
Step 6: amendment present node index number, and the step 2 described in revolution execution.
As preferably, the specific implementation of step 1 comprises following sub-step:
Step 1.1: the list item of index of definition table, list item structure comprises encoding block position transverse and longitudinal coordinate, the length of side, the degree of depth, right neighbours, father node field, and wherein, right neighbours are convenient to index next brother node, and father node is convenient to recall superior node;
Step 1.2: allocation index table space, the total length of concordance list is provided by ((log2_ctb_size-log2_min_cb_size) <<1)+1, wherein log2_ctb_size is the power number of the coding unit length of side 2, and log2_min_cb_size is the power number of the minimum code block length of side 2;
Step 1.3: initialization concordance list, the descriptor of first list item in concordance list is set to respectively: position is set to the position of the coding unit parsed in code stream, the length of side is set to the coding unit length of side parsed in code stream, degree of depth initial value is 0, and right neighbours and father node are all set to-1; Other list item element is all initialized as 0; Meanwhile, present node index number is set to 0.
As preferably, whether the decision node described in step 2 divides, its Rule of judgment in two kinds of situation:
1. the encoding block corresponding to present node does not exceed image range and the length of side is greater than the minimum code block length of side, from code stream, now read block splitting mark;
2. otherwise, whether be greater than the minimum code block length of side according to the encoding block length of side and determine division mark, be just judged as when being greater than dividing.
As preferably, position attribution, length of side attribute, the depth attribute information of four nodes of index one by one described in step 3, its specific implementation comprises following sub-step:
Step 3.1: indexed sequential carries out according to raster scan order;
Step 3.2: position is (x0, y0) successively, (x1, y0), (x0, y1), (x1, y1), wherein (x0, y0) the present node position of reading for step 2, (x1, y1) is that (x0, y0) adds 1/2 of the present node length of side; The length of side is 1/2 of present node; The degree of depth all increases by 1;
Step 3.3: the right neighbours of first three node are the index number of next node in scanning sequency, the father node of the 4th node is present node index number;
Step 3.4: present node index number increases progressively 4.
As preferably, the amendment present node index number described in step 6, its alteration ruler is:
If 1. right neighbours' leaf node exists, then present node index point it;
2. otherwise, if father node exist; trace back to the brotgher of node of father node.
The process that HEVC quaternary tree recursive structure of the present invention expands into recursion structure is exactly the process according to depth-first strategy traversal quadtree's node.The node of quaternary tree is divided into leaf node and nonleaf node, respectively the not subdivisible encoding block of correspondence and subdivisible encoding block, wherein the corresponding coding unit of this special nonleaf node of root node.The size of each encoding block represents by the length of side, and the position coordinate in the upper left corner represents, unit is pixel.Quaternary tree has system hierarchy and structure, and root node represents the decomposition degree of depth of encoding block to the path of other node; Be in the same degree of depth and share four encoding blocks of father node and again there is spatial structure.In quaternary tree ergodic process, when having access to leaf node, in units of block, perform coding or decode operation; Otherwise when having access to nonleaf node, then record needs the hierarchical structure of four blocks of Further Division and Space expanding.
With the Recursive programming structure comparison of the quaternary tree generally adopted in current HEVC encoding and decoding software, the present invention has the following advantages and good effect:
(1) the present invention carries out quaternary tree decoding by recursion iteration structure, significantly reduces computational complexity, and the decoder being particularly suitable for low-power-consumption embedded platform realizes;
(2) the present invention is the compiler not supporting Recursive programming, as Java, compilation, provides the possibility realizing HEVC decoder;
(3) instant invention overcomes the obstacle of HEVC decoder hardware design, be convenient to the pipeline decoding that FPGA or chip realize quaternary tree.
Accompanying drawing explanation
Fig. 1: the schematic diagram of the specific embodiment of the invention.
Embodiment
Understand for the ease of those of ordinary skill in the art and implement the present invention, below in conjunction with drawings and Examples, the present invention is described in further detail, should be appreciated that exemplifying embodiment described herein is only for instruction and explanation of the present invention, is not intended to limit the present invention.
Ask for an interview Fig. 1, the recursion interpretation method of a kind of HEVC coding quaternary tree provided by the invention, comprises the following steps:
Step 1: structure encoding block quaternary tree concordance list, the attribute information of the list item description node of concordance list, and give concordance list initialize; Its specific implementation comprises following sub-step:
Step 1.1: definition quaternary tree concordance list, the data structure of list item is a structure type QuadtreeIdx, comprise the field of following integer variable: the abscissa in the upper left corner of X0, y0 difference presentation code block and ordinate, log2_cb_size represent block the length of side (change into the end be 2 logarithm represent), the distinguishing hierarchy degree of depth of cb_depth block, right represents quaternary tree right neighbours' brotgher of node index, and parent represents parent node index.
Step 1.2: concordance list distributes, represent that allocation address space length is the concordance list of ((log2_ctb_size-log2_min_cb_size) <<1)+1 with pointer variable pQuadtreeIdx, wherein log2_ctb_size is the power number of the coding unit length of side 2, and log2_min_cb_size is the power number of the minimum code block length of side 2.
Step 1.3: concordance list initialization, position X0, the y0 of first list item in concordance list are set to the position of the coding unit parsed in code stream, length of side log2_cb_size is set to resolve the coding unit length of side obtained, degree of depth cb_depth sets to 0, and right neighbours right and father node parent index number are all initialized as-1.Represent present node index number and node counter respectively with nNodeIdx and nNodeCount, initial value sets to 0.
Step 2: read the present node in concordance list, and divide according to node descriptor decision node?
If division, then perform following step 3;
Otherwise, then following step 4 is performed;
Its specific implementation comprises following sub-step:
Step 2.1: the formalized description reading current node information from concordance list is as follows:
x0 = pQuadtreeIdx[nNodeIdx].x0;
y0 = pQuadtreeIdx[nNodeIdx].y0;
log2_cb_size = pQuadtreeIdx[nNodeIdx].log2_cb_size;
cb_size = 1 << log2_cb_size;
cb_depth = pQuadtreeIdx[nNodeIdx].cb_depth。
Step 2.2: judge splitting condition.
If the encoding block corresponding to present node does not exceed image range and the length of side is greater than the minimum code block length of side, from code stream, now read block splitting mark split_cu; Otherwise, when the encoding block length of side is greater than the minimum code block length of side season split_cu=1, not so split_cu=0.
Step 3: if quaternary tree can be divided, namely division mark split_cu is 1, then position attribution, length of side attribute, the depth attribute information of index four nodes one by one, first three node records right neighbours' brotgher of node index simultaneously, last node record father node because the brotgher of node does not exist; Then the step 2 described in revolution execution;
This process and formalized description is:
nNodeCount++;
pQuadtreeIdx[nNodeCount].x0 = x0;
pQuadtreeIdx[nNodeCount].y0 = y0;
pQuadtreeIdx[nNodeCount].log2_cb_size = log2_cb_size_split;
pQuadtreeIdx[nNodeCount].cb_depth = cb_depth_split;
pQuadtreeIdx[nNodeCount].right = nNodeCount + 1;
nNodeCount++;
pQuadtreeIdx[nNodeCount].x0 = x1;
pQuadtreeIdx[nNodeCount].y0 = y0;
pQuadtreeIdx[nNodeCount].log2_cb_size = log2_cb_size_split;
pQuadtreeIdx[nNodeCount].cb_depth = cb_depth_split;
pQuadtreeIdx[nNodeCount].right = nNodeCount + 1;
nNodeCount++;
pQuadtreeIdx[nNodeCount].x0 = x0;
pQuadtreeIdx[nNodeCount].y0 = y1;
pQuadtreeIdx[nNodeCount].log2_cb_size = log2_cb_size_split;
pQuadtreeIdx[nNodeCount].cb_depth = cb_depth_split;
pQuadtreeIdx[nNodeCount].right = nNodeCount + 1;
nNodeCount++;
pQuadtreeIdx[nNodeCount].x0 = x1;
pQuadtreeIdx[nNodeCount].y0 = y1;
pQuadtreeIdx[nNodeCount].log2_cb_size = log2_cb_size_split;
pQuadtreeIdx[nNodeCount].cb_depth = cb_depth_split;
pQuadtreeIdx[nNodeCount].parent = nNodeIdx;
nNodeIdx = nNodeCount – 3。
Its specific implementation comprises following sub-step:
Step 3.1: indexed sequential carries out according to raster scan order;
Step 3.2: position is (x0, y0) successively, (x1, y0), (x0, y1), (x1, y1), wherein (x0, y0) the present node position of reading for step 2, (x1, y1) is that (x0, y0) adds 1/2 of the present node length of side; The length of side is 1/2 of present node; The degree of depth all increases by 1;
Step 3.3: the right neighbours of first three node are the index number of next node in scanning sequency, the father node of the 4th node is present node index number;
Step 3.4: present node index number increases progressively 4.
Step 4: if quaternary tree can not be divided again, when namely division mark split_cu is 0, performs the HEVC standard decoding of present node, then performs following judgement:
If code stream is decoded not or computing of decoding makes mistakes, then stop circulation, this flow process terminates;
Otherwise, perform following step 5;
Step 5: check present node, and judge:
If the right neighbor node of present node does not exist and the brotgher of node of father node does not also exist, or present node is root node, then stop circulation, this flow process terminates;
Otherwise, perform following step 6;
Step 6: amendment present node index number, and the step 2 described in revolution execution; The rule of amendment amendment present node index number is: if right neighbours' leaf node exists, be then right neighbours by present node index modification; Otherwise if father node exists, trace back to the right neighbor node of father node, present node index modification is the right neighbours of father node.Formalized description is as follows:
If neighbours' leaf node exists, i.e. pQuadtreeIdx [nNodeIdx] .right > 0, then nNodeIdx=pQuadtreeIdx [nNodeIdx] .right;
Otherwise, if father node exists, i.e. pQuadtreeIdx [nNodeIdx] .parent > 0, then when the right neighbor node of father node exists, i.e. pQuadtreeIdx [nParentNodeIdx] .right>0, then nNodeIdx=pQuadtreeIdx [nParentNodeIdx] .right; Otherwise end loop.
Should be understood that, the part that this specification does not elaborate all belongs to prior art.
Should be understood that; the above-mentioned description for preferred embodiment is comparatively detailed; therefore the restriction to scope of patent protection of the present invention can not be thought; those of ordinary skill in the art is under enlightenment of the present invention; do not departing under the ambit that the claims in the present invention protect; can also make and replacing or distortion, all fall within protection scope of the present invention, request protection range of the present invention should be as the criterion with claims.
Claims (5)
1. a recursion interpretation method for HEVC coding quaternary tree, is characterized in that, comprise the following steps:
Step 1: structure encoding block quaternary tree concordance list, the attribute information of the list item description node of concordance list, and give concordance list initialize;
Step 2: read the present node in concordance list, and divide according to node descriptor decision node?
If division, then perform following step 3;
Otherwise, then following step 4 is performed;
Step 3: position attribution, length of side attribute, the depth attribute information of index four nodes one by one, first three node records right neighbours' brotgher of node index simultaneously, last node record father node because the brotgher of node does not exist; Then the step 2 described in revolution execution;
Step 4: the HEVC standard decoding performing present node, then performs following judgement:
If code stream is decoded not or computing of decoding makes mistakes, then stop circulation, this flow process terminates;
Otherwise, perform following step 5;
Step 5: check present node, and judge:
If the right neighbor node of present node does not exist and the brotgher of node of father node does not also exist, or present node is root node, then stop circulation, this flow process terminates;
Otherwise, perform following step 6;
Step 6: amendment present node index number, and the step 2 described in revolution execution.
2. the recursion interpretation method of HEVC coding quaternary tree according to claim 1, it is characterized in that, the specific implementation of step 1 comprises following sub-step:
Step 1.1: the list item of index of definition table, list item structure comprises encoding block position transverse and longitudinal coordinate, the length of side, the degree of depth, right neighbours, father node field, and wherein, right neighbours are convenient to index next brother node, and father node is convenient to recall superior node;
Step 1.2: allocation index table space, the total length of concordance list is provided by ((log2_ctb_size-log2_min_cb_size) <<1)+1, wherein log2_ctb_size is the power number of the coding unit length of side 2, and log2_min_cb_size is the power number of the minimum code block length of side 2;
Step 1.3: initialization concordance list, the descriptor of first list item in concordance list is set to respectively: position is set to the position of the coding unit parsed in code stream, the length of side is set to the coding unit length of side parsed in code stream, degree of depth initial value is 0, and right neighbours and father node are all set to-1; Other list item element is all initialized as 0; Meanwhile, present node index number is set to 0.
3. HEVC according to claim 1 encodes the recursion interpretation method of quaternary tree, it is characterized in that: whether the decision node described in step 2 divides, its Rule of judgment in two kinds of situation:
1. the encoding block corresponding to present node does not exceed image range and the length of side is greater than the minimum code block length of side, from code stream, now read block splitting mark;
2. otherwise, whether be greater than the minimum code block length of side according to the encoding block length of side and determine division mark, be just judged as when being greater than dividing.
4. the recursion interpretation method of HEVC coding quaternary tree according to claim 1, it is characterized in that: position attribution, length of side attribute, the depth attribute information of four nodes of index one by one described in step 3, its specific implementation comprises following sub-step:
Step 3.1: indexed sequential carries out according to raster scan order;
Step 3.2: position is (x0, y0) successively, (x1, y0), (x0, y1), (x1, y1), wherein (x0, y0) the present node position of reading for step 2, (x1, y1) is that (x0, y0) adds 1/2 of the present node length of side; The length of side is 1/2 of present node; The degree of depth all increases by 1;
Step 3.3: the right neighbours of first three node are the index number of next node in scanning sequency, the father node of the 4th node is present node index number;
Step 3.4: present node index number increases progressively 4.
5. the recursion interpretation method of HEVC coding quaternary tree according to claim 1, it is characterized in that: the amendment present node index number described in step 6, its alteration ruler is:
If 1. right neighbours' leaf node exists, then present node index point it;
2. otherwise, if father node exist; trace back to the brotgher of node of father node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510256658.3A CN104853220B (en) | 2015-05-18 | 2015-05-18 | A kind of HEVC encodes the recursion interpretation method of quaternary tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510256658.3A CN104853220B (en) | 2015-05-18 | 2015-05-18 | A kind of HEVC encodes the recursion interpretation method of quaternary tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104853220A true CN104853220A (en) | 2015-08-19 |
| CN104853220B CN104853220B (en) | 2017-08-25 |
Family
ID=53852518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510256658.3A Active CN104853220B (en) | 2015-05-18 | 2015-05-18 | A kind of HEVC encodes the recursion interpretation method of quaternary tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104853220B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105373835A (en) * | 2015-10-14 | 2016-03-02 | 国网湖北省电力公司 | Link information management method based on tree model construction |
| WO2018177254A1 (en) * | 2017-03-28 | 2018-10-04 | 华为技术有限公司 | Image coding/decoding method, video coder/decoder, and video coding and decoding system |
| CN109151468A (en) * | 2017-06-28 | 2019-01-04 | 华为技术有限公司 | A kind of coding of image data, coding/decoding method and device |
| CN110278443A (en) * | 2018-03-16 | 2019-09-24 | 华为技术有限公司 | The context modeling method and device of division symbolizing position |
| US11323746B2 (en) | 2018-03-16 | 2022-05-03 | Huawei Technologies Co., Ltd. | Context modeling method and apparatus of split flag |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120114034A1 (en) * | 2010-11-08 | 2012-05-10 | Mediatek Inc. | Method and Apparatus of Delta Quantization Parameter Processing for High Efficiency Video Coding |
| US20130195199A1 (en) * | 2012-01-30 | 2013-08-01 | Qualcomm Incorporated | Residual quad tree (rqt) coding for video coding |
| JP2013162395A (en) * | 2012-02-07 | 2013-08-19 | Nippon Telegr & Teleph Corp <Ntt> | Image coding method, image coding device, and image coding program |
| CN103414891A (en) * | 2013-07-19 | 2013-11-27 | 北京交通大学 | Bottom-up fast quad-tree clipping algorithm for HEVC intra-frame coding |
| CN103747272A (en) * | 2014-01-09 | 2014-04-23 | 西安电子科技大学 | Fast transformation method for residual quadtree coding in HEVC (high efficiency video coding) |
-
2015
- 2015-05-18 CN CN201510256658.3A patent/CN104853220B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120114034A1 (en) * | 2010-11-08 | 2012-05-10 | Mediatek Inc. | Method and Apparatus of Delta Quantization Parameter Processing for High Efficiency Video Coding |
| US20130195199A1 (en) * | 2012-01-30 | 2013-08-01 | Qualcomm Incorporated | Residual quad tree (rqt) coding for video coding |
| JP2013162395A (en) * | 2012-02-07 | 2013-08-19 | Nippon Telegr & Teleph Corp <Ntt> | Image coding method, image coding device, and image coding program |
| CN103414891A (en) * | 2013-07-19 | 2013-11-27 | 北京交通大学 | Bottom-up fast quad-tree clipping algorithm for HEVC intra-frame coding |
| CN103747272A (en) * | 2014-01-09 | 2014-04-23 | 西安电子科技大学 | Fast transformation method for residual quadtree coding in HEVC (high efficiency video coding) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105373835B (en) * | 2015-10-14 | 2021-07-02 | 国网湖北省电力公司 | Link information management method based on structure tree model |
| CN105373835A (en) * | 2015-10-14 | 2016-03-02 | 国网湖北省电力公司 | Link information management method based on tree model construction |
| TWI678104B (en) * | 2017-03-28 | 2019-11-21 | 華為技術有限公司 | Image codec method, video codec and video codec system |
| WO2018177254A1 (en) * | 2017-03-28 | 2018-10-04 | 华为技术有限公司 | Image coding/decoding method, video coder/decoder, and video coding and decoding system |
| CN108668136A (en) * | 2017-03-28 | 2018-10-16 | 华为技术有限公司 | Image encoding/decoding method, video coder/decoder and video coding and decoding system |
| US10834430B2 (en) | 2017-06-28 | 2020-11-10 | Huawei Technologies Co., Ltd. | Picture data encoding method and apparatus and picture data decoding method and apparatus |
| CN109151468B (en) * | 2017-06-28 | 2020-12-08 | 华为技术有限公司 | Image data encoding and decoding methods and devices |
| CN109151468A (en) * | 2017-06-28 | 2019-01-04 | 华为技术有限公司 | A kind of coding of image data, coding/decoding method and device |
| US11277648B2 (en) | 2017-06-28 | 2022-03-15 | Huawei Technologies Co., Ltd. | Picture data encoding method and apparatus and picture data decoding method and apparatus |
| US11695968B2 (en) | 2017-06-28 | 2023-07-04 | Huawei Technologies Co., Ltd. | Picture data encoding method and apparatus and picture data decoding method and apparatus |
| CN110278443A (en) * | 2018-03-16 | 2019-09-24 | 华为技术有限公司 | The context modeling method and device of division symbolizing position |
| CN110278443B (en) * | 2018-03-16 | 2022-02-11 | 华为技术有限公司 | Context modeling method and device for dividing zone bits |
| US11323746B2 (en) | 2018-03-16 | 2022-05-03 | Huawei Technologies Co., Ltd. | Context modeling method and apparatus of split flag |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104853220B (en) | 2017-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102602375B1 (en) | Method and apparatus for processing duplicate points in point cloud compression | |
| CN104853220A (en) | HEVC coding quadtree recursive decoding method | |
| US20200260117A1 (en) | Methods and Apparatuses for Coding and Decoding Depth Map | |
| US20210118188A1 (en) | Point Cloud Encoding Method, Point Cloud Decoding Method, Encoder, and Decoder | |
| US20180192047A1 (en) | Image prediction method and device | |
| US20200280718A1 (en) | Image encoding and decoding method and device | |
| US11451835B2 (en) | Method and device for entropy coding and decoding using mapping of matching relationship parameters | |
| CN103858433A (en) | Hierarchical entropy encoding and decoding | |
| EP4149114A1 (en) | Point cloud encoding/decoding method, encoder, decoder, and storage medium | |
| FI3782369T3 (en) | Multi-type tree depth extension for picture boundary handling | |
| Masmoudi et al. | A new arithmetic coding model for a block-based lossless image compression based on exploiting inter-block correlation | |
| CN105163126A (en) | Hardware decoding method and device based on HEVC protocol | |
| EP3761646A1 (en) | Context modelling method and device for partition flag bit | |
| CN104394415A (en) | Method for distributed decoding of video big data | |
| KR20200007733A (en) | Encoding/decoding method and apparatus for efficient compression of point cloud coding(pcc) data | |
| CN104935933A (en) | Video coding and decoding method | |
| CN104754343A (en) | Image processing method and system, decoding method, encoder and decoder | |
| CN111767280A (en) | Data processing method, device and storage medium | |
| CN104682966A (en) | Non-destructive compressing method for list data | |
| CN104216890A (en) | Method and system for compressing ELF file | |
| KR102618063B1 (en) | Method and apparatus for compressioning 3-dimension point cloud | |
| KR20240027756A (en) | Point cloud attribute coding method, point cloud attribute decoding method, and terminal | |
| KR102154580B1 (en) | Image processing apparatus and method | |
| CN105637865A (en) | Image prediction method and related equipment | |
| CN105072447A (en) | Motion vector prediction method and device used for VP9 decoder |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20171225 Address after: 610000 Sichuan city of Chengdu province high tech Zone 387 days Renlu Building No. 3 unit 1 28 floor No. 2803 Patentee after: Chengdu Suirui cloud Technology Co. Ltd. Address before: 430070 Hubei Province, Wuhan city Hongshan District Luoshi road future city D block 2404 Patentee before: Wuhan is with sharp hundred million mountain Science and Technology Ltd.s |
|
| TR01 | Transfer of patent right |