CN104853220B - A kind of HEVC encodes the recursion interpretation method of quaternary tree - Google Patents
A kind of HEVC encodes the recursion interpretation method of quaternary tree Download PDFInfo
- Publication number
- CN104853220B CN104853220B CN201510256658.3A CN201510256658A CN104853220B CN 104853220 B CN104853220 B CN 104853220B CN 201510256658 A CN201510256658 A CN 201510256658A CN 104853220 B CN104853220 B CN 104853220B
- Authority
- CN
- China
- Prior art keywords
- node
- present
- length
- index
- quaternary tree
- 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
Links
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses the recursion interpretation method that a kind of HEVC encodes quaternary tree, including step：Encoding block quaternary tree concordance list is constructed, the list item of concordance list describes the attribute information of node, and assigns initial value to concordance list；The present node in concordance list is read, and whether is further divided according to node description information decision node, so that it is to perform decoded operation to be also to continue with indexing child nodes to select；Index the attribute information such as position, the length of side, depth of four nodes one by one, first three node records brotgher of node index simultaneously, last node records father node because the brotgher of node is not present；Perform the decoding of present node（The computing defined containing standards such as motion prediction, inverse transformation, re-quantization, motion compensation）, then change present node index number；Calculate recursion decoding loop termination condition.The recursive structure decoded using the inventive method to quaternary tree is deployed, and can improve the universality of executing efficiency and design.
Description
Technical field
The invention belongs to video coding and decoding technology field, it is related to a kind of video decoding software design method, and in particular to one
Plant the method that the quaternary tree recursive structure of HEVC video encoding and decoding standards expands into recursion structure.
Technical background
HEVC is the video encoding standard of new generation that International Organization for standardization ITU and MPEG are developed jointly, compared to current
The H264 technologies generally used, compression efficiency is close to be doubled.In HEVC, the encoding block of maximum possible expands to 64x64 pixels
Coding unit, so as to greatly improve the code efficiency of shoulder.On the other hand, size block can not handle image well
Local detail, and complicated image needs fine prediction, therefore small size block is also what is needed.Therefore, HEVC coding
Unit includes the rectangle encoding block of four symmetrical cuttings, and each encoding block can be further divided into 4 four sub-blocks again, until most
Untill the length of side of small sub-block is not less than 4 pixels.This structure of HEVC coding units conveniently uses Quadtrees for Representing, from realization
Angle sees that quaternary tree natively has recursive iteration structure.Current representational HEVC reference softwares, such as HM, X265, FFMPEG
Deng being all to realize the coding and decoding of quad-tree structure using recursive fashion.However, some high-level programming languages do not support recursive program
Design, or even the C language compiler on some embedded platforms does not also support recurrence；Less supported close to hard-wired mode
Recurrence, such as compilation, chip design.Although in addition, Recursive programming realizes that conveniently, execution efficiency is not high.
Therefore, use some way by the quaternary tree recursive program structural modification in current HEVC software codecs to pass
The great practical value of selection structure.
The content of the invention
In order to solve above-mentioned technical problem, the invention provides a kind of quaternary tree recurrence of HEVC video encoding and decoding standards
The method that structure expands into recursion structure.
The technical solution adopted in the present invention is：A kind of HEVC encodes the recursion interpretation method of quaternary tree, it is characterised in that
Comprise the following steps：
Step 1：Encoding block quaternary tree concordance list is constructed, the list item of concordance list describes the attribute information of node, and to index
Table assigns initial value；
Step 2：The present node in concordance list is read, and whether is divided according to node description information decision node
If division, following step 3 is performed；
Otherwise, then following step 4 is performed；
Step 3：The position attribution, length of side attribute, depth attribute information of four nodes are indexed one by one, and first three node is simultaneously
Record right neighbours' brotgher of node index, last node records father node because the brotgher of node is not present；Then revolution is held
The described step 2 of row；
Step 4：Perform HEVC standard decoding (such as motion prediction, inverse transformation, re-quantization, the motion compensation of present node
Deng operation), then perform following judgements：
If code stream not enough decoding or decoding computing error, terminate circulation, this flow terminates；
Otherwise, following step 5 is performed；
Step 5：Present node is checked, and is judged：
If the right neighbor node of present node is not present and the brotgher of node of father node is also not present, or present node is
Root node, then terminate circulation, and this flow terminates；
Otherwise, following step 6 is performed；
Step 6：Present node index number is changed, and turns round the step 2 described in performing.
Preferably, step 1 is implemented including following sub-step：
Step 1.1：The list item of index of definition table, list item structure comprising encoding block position transverse and longitudinal coordinate, the length of side, depth,
Right neighbours, father node field, wherein, right neighbours are easy to index next brother node, and father node is easy to recall superior node；
Step 1.2：Distribution index table space, the total length of concordance list is by ((log2_ctb_size-log2_min_cb_
size)<<1)+1 provide, wherein log2_ctb_size is the power number of the coding unit length of side 2, and log2_min_cb_size is most
The power number of the lower Item block length of side 2；
Step 1.3：The description information for initializing first list item in concordance list, concordance list is respectively set to：Position is set
The position of the coding unit parsed in code stream is set to, the length of side is set to the coding unit length of side parsed in code stream, it is deep
It is 0 to spend initial value, and right neighbours and father node are set to -1；Other list item elements are all initialized as 0；Meanwhile, present node index
Numbering is set to 0.
Preferably, whether the decision node described in step 2 divides, its Rule of judgment is in two kinds of situation：
1. the encoding block corresponding to present node is more than the minimum code block length of side without departing from image range and the length of side, now from
Block splitting mark is read in code stream；
2. otherwise, determine division mark according to whether the encoding block length of side is more than the minimum code block length of side, more than when just sentence
Break as division.
Preferably, position attribution, length of side attribute, the depth attribute letter for indexing four nodes one by one described in step 3
Breath, it is implemented including following sub-step：
Step 3.1：Indexed sequential is carried out according to raster scan order；
Step 3.2：Position is (x0, y0), (x1, y0), (x0, y1), (x1, y1), wherein (x0, y0) is step 2 successively
The present node position of reading, (x1, y1) is that (x0, y0) adds the 1/2 of the present node length of side；The length of side is the 1/ of present node
2 units are pixel；Depth increases by 1；
Step 3.3：The right neighbours of first three node are the index number of the next node in scanning sequency, the 4th section
The father node of point is present node index number；
Step 3.4：Present node index number is incremented by 4.
Preferably, the modification present node index number described in step 6, its alteration ruler is：
If 1. right neighbours' leaf node is present, present node index points to it；
2. otherwise, the brotgher of node of father node is traced back to if father node is present.
The process that the HEVC quaternary tree recursive structures of the present invention expand into recursion structure is exactly according to depth-first strategy time
Go through the process of quadtree's node.The node of quaternary tree is divided into leaf node and nonleaf node, and not subdivisible encoding block is corresponded to respectively
With subdivisible encoding block, wherein this special nonleaf node correspondence coding unit of root node.The size of each encoding block is used
The length of side represents that the coordinate representation in the position upper left corner, unit is pixel.Quaternary tree has system hierarchy and structure, and root node arrives it
The path length of its node represents the decomposition depth of encoding block；Four encoding blocks in same depth and shared father node are again
With spatial structure.In quaternary tree ergodic process, when having access to leaf node, coding or decoding operate are performed in units of block；
Conversely, when having access to nonleaf node, then record needs the hierarchical structure and Space expanding of four blocks further divided.
The Recursive programming structure of quaternary tree with generally being used in current HEVC encoding and decoding software is compared, present invention tool
Have the advantage that and good effect：
(1) present invention carries out quaternary tree decoding by recursion iteration structure, significantly reduces computational complexity, is particularly suitable for
Realized in the decoder of low-power-consumption embedded platform；
(2) present invention is not support the compiler of Recursive programming, and there is provided realize HEVC decodings for such as Java, compilation
The possibility of device；
(3) instant invention overcomes the obstacle of HEVC decoder hardwares design, it is easy to FPGA or chip to realize the stream of quaternary tree
Waterline is decoded.
Brief description of the drawings
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 the accompanying drawings and embodiment is to this hair
It is bright to be described in further detail, it will be appreciated that implementation example described herein is merely to illustrate and explain the present invention, not
For limiting the present invention.
The recursion interpretation method of quaternary tree is encoded, is comprised the following steps see Fig. 1, a kind of HEVC that the present invention is provided：
Step 1：Encoding block quaternary tree concordance list is constructed, the list item of concordance list describes the attribute information of node, and to index
Table assigns initial value；It is implemented including following sub-step：
Step 1.1：Quaternary tree concordance list is defined, the data structure of list item is a structure type QuadtreeIdx, comprising
The field of following integer variable：The abscissa and ordinate in the upper left corner of X0, y0 difference presentation code block, log2_cb_size tables
Show the length of side (changing into the logarithm that bottom is 2 to represent) of block, the distinguishing hierarchy depth of cb_depth blocks, right represents that quaternary tree is right
Neighbours' brotgher of node is indexed, and parent represents parent node index.
Step 1.2：Concordance list is distributed, and represents that distribution address space length is with pointer variable pQuadtreeIdx
((log2_ctb_size-log2_min_cb_size)<<1)+1 concordance list, wherein log2_ctb_size is coding unit side
Long 2 power number, log2_min_cb_size is the power number of the minimum code block length of side 2.
Step 1.3：Concordance list is initialized, and position X0, y0 of first list item in concordance list are set to parse in code stream
The position of coding unit out, length of side log2_cb_size is set to parse the obtained coding unit length of side, depth cb_
Depth is set to 0, and right neighbours right and father node parent index numbers are initialized as -1.With nNodeIdx and nNodeCount
Present node index number and node counter are represented respectively, and initial value is set to 0.
Step 2：The present node in concordance list is read, and whether is divided according to node description information decision node
If division, following step 3 is performed；
Otherwise, then following step 4 is performed；
It is implemented including following sub-step：
Step 2.1：The formalized description for 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 encoding block corresponding to present node is without departing from image range and the length of side is more than the minimum code block length of side, now
Block splitting mark split_cu is read from code stream；Otherwise, when the encoding block length of side is more than minimum code block length of side season split_
Cu=1, not so split_cu=0.
Step 3：If quaternary tree can divide, i.e., division mark split_cu is 1, then indexes the position of four nodes one by one
Attribute, length of side attribute, depth attribute information, first three node record right neighbours' brotgher of node index, last node simultaneously
Record father node because the brotgher of node is not present；Then the step 2 described in execution is turned round；
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.
It is implemented including following sub-step：
Step 3.1：Indexed sequential is carried out according to raster scan order；
Step 3.2：Position is (x0, y0), (x1, y0), (x0, y1), (x1, y1), wherein (x0, y0) is step 2 successively
The present node position of reading, (x1, y1) is that (x0, y0) adds the 1/2 of the present node length of side；The length of side is the 1/ of present node
2 units are pixel；Depth increases by 1；
Step 3.3：The right neighbours of first three node are the index number of the next node in scanning sequency, the 4th section
The father node of point is present node index number；
Step 3.4：Present node index number is incremented by 4.
Step 4：If quaternary tree can not divide again, i.e., when division mark split_cu is 0, perform the HEVC of present node
Standard is decoded, and then performs following judgements：
If code stream not enough decoding or decoding computing error, terminate circulation, this flow terminates；
Otherwise, following step 5 is performed；
Step 5：Present node is checked, and is judged：
If the right neighbor node of present node is not present and the brotgher of node of father node is also not present, or present node is
Root node, then terminate circulation, and this flow terminates；
Otherwise, following step 6 is performed；
Step 6：Present node index number is changed, and turns round the step 2 described in performing；Modification modification present node index
The rule of numbering is：It is right neighbours by present node index modification if right neighbours' leaf node is present；Otherwise, if father saves
There is the right neighbor node for then tracing back to father node in point, present node index modification is the right neighbours of father node.Formalized description
It is as follows：
If neighbours' leaf node is present, i.e. pQuadtreeIdx [nNodeIdx] .right>0, then nNodeIdx=
pQuadtreeIdx[nNodeIdx].right；
Otherwise, if father node is present, i.e. pQuadtreeIdx [nNodeIdx] .parent>0, then when the right side of father node
In the presence of neighbor node, i.e. pQuadtreeIdx [nParentNodeIdx] .right>0, then nNodeIdx=
pQuadtreeIdx[nParentNodeIdx].right；Otherwise end loop.
It should be appreciated that the part that this specification is not elaborated belongs to prior art.
It should be appreciated that the above-mentioned description for preferred embodiment is more detailed, therefore it can not be considered to this
The limitation of invention patent protection scope, one of ordinary skill in the art is not departing from power of the present invention under the enlightenment of the present invention
Profit is required under protected ambit, can also be made replacement or be deformed, each fall within protection scope of the present invention, this hair
It is bright scope is claimed to be determined by the appended claims.
Claims (5)
1. a kind of HEVC encodes the recursion interpretation method of quaternary tree, it is characterised in that comprise the following steps：
Step 1：Encoding block quaternary tree concordance list is constructed, the list item of concordance list describes the attribute information of node, and is assigned to concordance list
Initial value；
Step 2：The present node in concordance list is read, and whether is divided according to node description information decision node
If division, following step 3 is performed；
Otherwise, then following step 4 is performed；
Step 3：The position attribution, length of side attribute, depth attribute information of four nodes are indexed one by one, and first three node is recorded simultaneously
Right neighbours' brotgher of node index, last node records father node because the brotgher of node is not present；Then revolution performs institute
The step 2 stated；
Step 4：The HEVC standard decoding of present node is performed, following judgements are then performed：
If code stream not enough decoding or decoding computing error, terminate circulation, this flow terminates；
Otherwise, following step 5 is performed；
Step 5：Present node is checked, and is judged：
If the right neighbor node of present node is not present and the brotgher of node of father node is also not present, or present node is root section
Point, then terminate circulation, and this flow terminates；
Otherwise, following step 6 is performed；
Step 6：Present node index number is changed, and turns round the step 2 described in performing.
2. HEVC according to claim 1 encodes the recursion interpretation method of quaternary tree, it is characterised in that step 1 it is specific
Realization includes following sub-step：
Step 1.1：The list item of index of definition table, list item structure includes encoding block position transverse and longitudinal coordinate, the length of side, depth, right neighbour
Residence, father node field, wherein, right neighbours are easy to index next brother node, and father node is easy to recall superior node；
Step 1.2：Distribution index table space, the total length of concordance list is by ((log2_ctb_size-log2_min_cb_size)<
<1)+1 provide, wherein log2_ctb_size is the power number of the coding unit length of side 2, and log2_min_cb_size is minimum code
The power number of the block length of side 2；
Step 1.3：The description information for initializing first list item in concordance list, concordance list is respectively set to：Position is set to
The position of the coding unit parsed in code stream, at the beginning of the length of side is set to the coding unit length of side parsed in code stream, depth
It is worth for 0, right neighbours and father node are set to -1；Other list item elements are all initialized as 0；Meanwhile, present node index number
It is set to 0.
3. HEVC according to claim 1 encodes the recursion interpretation method of quaternary tree, it is characterised in that：Described in step 2
Decision node whether divide, its Rule of judgment is in two kinds of situation：
1. the encoding block corresponding to present node is without departing from image range and the length of side is more than the minimum code block length of side, now from code stream
Middle reading block splitting mark；
2. otherwise, determine division mark according to whether the encoding block length of side is more than the minimum code block length of side, more than when be just judged as
Division.
4. HEVC according to claim 1 encodes the recursion interpretation method of quaternary tree, it is characterised in that：Described in step 3
Index the position attributions of four nodes, length of side attribute, depth attribute information one by one, it is implemented including following sub-step：
Step 3.1：Indexed sequential is carried out according to raster scan order；
Step 3.2：Position is (x0, y0), (x1, y0), (x0, y1), (x1, y1), wherein (x0, y0) reads for step 2 successively
Present node position, (x1, y1) be (x0, y0) add the present node length of side 1/2；The length of side is the 1/2 of present node, single
Position is pixel；Depth increases by 1；
Step 3.3：The right neighbours of first three node are the index number of the next node in scanning sequency, the 4th node
Father node is present node index number；
Step 3.4：Present node index number is incremented by 4.
5. HEVC according to claim 1 encodes the recursion interpretation method of quaternary tree, it is characterised in that：Described in step 6
Modification present node index number, its alteration ruler is：
If 1. right neighbours' leaf node is present, present node index points to it；
2. otherwise, the brotgher of node of father node is traced back to if father node is present.
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 CN104853220A (en) | 2015-08-19 |
| CN104853220B true 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) |
Families Citing this family (5)
| 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 |
| CN108668136A (en) * | 2017-03-28 | 2018-10-16 | 华为技术有限公司 | Image encoding/decoding method, video coder/decoder and video coding and decoding system |
| CN112601085A (en) | 2017-06-28 | 2021-04-02 | 华为技术有限公司 | Image data encoding and decoding methods and devices |
| CN110278443B (en) * | 2018-03-16 | 2022-02-11 | 华为技术有限公司 | Context modeling method and device for dividing zone bits |
| WO2019174567A1 (en) | 2018-03-16 | 2019-09-19 | 华为技术有限公司 | Context modelling method and device for partition flag bit |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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) |
Family Cites Families (2)
| 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 |
| US9462275B2 (en) * | 2012-01-30 | 2016-10-04 | Qualcomm Incorporated | Residual quad tree (RQT) coding for video coding |
-
2015
- 2015-05-18 CN CN201510256658.3A patent/CN104853220B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104853220A (en) | 2015-08-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104853220B (en) | A kind of HEVC encodes the recursion interpretation method of quaternary tree | |
| CN103858433B (en) | Layered entropy encoding and decoding | |
| CN105554510B (en) | The method and apparatus that video is decoded | |
| CN111405281A (en) | Point cloud attribute information encoding method, point cloud attribute information decoding method, storage medium and terminal equipment | |
| CN113473127B (en) | Point cloud geometric coding method, point cloud geometric decoding method, point cloud geometric coding equipment and point cloud geometric decoding equipment | |
| CN106488239B (en) | Low complex degree entropy coding/decoding method and apparatus | |
| CN111615791A (en) | Method and apparatus for using direct transcoding in point cloud compression | |
| CN111615792A (en) | Method and apparatus for entropy coding of point clouds | |
| US20230065156A1 (en) | Point cloud encoding/decoding method, encoder, decoder, and storage medium | |
| JP2015216656A (en) | Method of generating motion vector candidate set | |
| CN103814396A (en) | Method for adaptive entropy coding of tree structures | |
| JP6178798B2 (en) | Terminating spatial tree position encoding and decoding | |
| KR20140096298A (en) | Position coding based on spatial tree with duplicate points | |
| CN113784124B (en) | Block matching encoding and decoding method for fine division using multi-shape sub-blocks | |
| CN105027560A (en) | Method of determining binary codewords for transform coefficients | |
| FI3782369T3 (en) | Multi-type tree depth extension for picture boundary handling | |
| US20230019767A1 (en) | Point cloud encoding method and decoding method, encoder and decoder, and storage medium | |
| CN102547294A (en) | Context-based adaptive binary arithmetic coding (CABAC) hardware decoder architecture applied to H.264 and high efficiency video coding (HEVC) video standards | |
| CN111211787A (en) | Industrial data compression method, system, storage medium and terminal | |
| CN110278443A (en) | The context modeling method and device of division symbolizing position | |
| CN115297327A (en) | Semantic prior coding and decoding method and system based on semantic structural coding | |
| CN104682966A (en) | Non-destructive compressing method for list data | |
| CN102595108B (en) | Method and device for coding syntactic element | |
| Shoba et al. | A Study on Data Compression Using Huffman Coding Algorithms | |
| Quddus et al. | Binary text image compression using overlapping rectangular partitioning |
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 |