CN104202612A - Coding unit dividing method and video coding method based on quad-tree constraint - Google Patents

Coding unit dividing method and video coding method based on quad-tree constraint Download PDF

Info

Publication number
CN104202612A
CN104202612A CN201410151037.4A CN201410151037A CN104202612A CN 104202612 A CN104202612 A CN 104202612A CN 201410151037 A CN201410151037 A CN 201410151037A CN 104202612 A CN104202612 A CN 104202612A
Authority
CN
China
Prior art keywords
coding unit
division
viewpoint
maximum coding
memory cell
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
Application number
CN201410151037.4A
Other languages
Chinese (zh)
Other versions
CN104202612B (en
Inventor
金欣
迟广晟
王兴政
戴琼海
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Graduate School Tsinghua University
Original Assignee
Shenzhen Graduate School Tsinghua University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Graduate School Tsinghua University filed Critical Shenzhen Graduate School Tsinghua University
Priority to CN201410151037.4A priority Critical patent/CN104202612B/en
Publication of CN104202612A publication Critical patent/CN104202612A/en
Application granted granted Critical
Publication of CN104202612B publication Critical patent/CN104202612B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention discloses a coding unit dividing method and a video coding method based on quad-tree constraint. The coding unit dividing method comprises the following steps of inputting a video texture image with more than two viewpoints and a depth image sequence; recording division level information of a maximum coding unit of each independent viewpoint; obtaining a matching unit of each storage unit in the maximum coding unit in the independent viewpoint; obtaining an initial division level graph of sub-blocks corresponding to the maximum coding unit; correcting the initial division level graph by utilizing a quad-tree constraint condition; and outputting division of each maximum coding unit of the current coding viewpoint. The coding unit dividing method is adopted to divide the coding units in the video coding method. By utilizing the division information of the coding units of the independent viewpoint to help the dependent viewpoint to carry out division of the coding units and utilizing the quad-tree constraint condition to correct the division level graph of the coding units, the existing complicated algorithm is avoided, the whole division process of the coding units is accelerated, and the efficiency is improved.

Description

Division methods and the method for video coding of the coding unit based on quaternary tree constraint
Technical field
The present invention relates to video coding technique, relate in particular to a kind of fast separating method of the multiple view video coding unit based on quaternary tree constraint, and use the multi-view point video encoding method of the method.
Background technology
Along with more and more stronger to the requirement of coding standard of supporting 3D video format (as " multi-view point video " and " multi-view point video+depth map " form), ITU-T VCEG (Video Coding Experts Group) and ISO/IEC MPEG (Moving Pictures Experts Group) have formed JCT-3V(Joint Collaborative Team on3D Video coding development) research and develop together the coding standard of 3D video.In current standard, 3D video encoding standard based on video standard HEVC of new generation (High Efficiency Video Coding), because it has adopted more complicated coding tools and has utilized correlation between viewpoint to encode, has obtained better performance.
In new HEVC standard, what coding layer adopted is the difference coding unit of macro block (MB) in the past, but new coding unit (CU, Coding Units) and code tree structure (CTU, Coding Tree Units).Compared with other 3D video encoding standard, 3D-HEVC provides higher compression efficiency and performance, but has also brought very high encoder complexity.Its main cause is the quad-tree structure that has adopted recurrence due to coding layer: each coding unit is divided into four sub-coding units, its size from maximum coding unit (LCU) 64 × 64 to 8 × 8 of minimum code unit, and to the CU of every kind of size carry out in frame, estimation and rate-distortion optimization between interframe and viewpoint.Wherein represent the quad-tree structure of CTU to divide hierarchical information: when the division information value of CU is as 0 time, maximum coding unit is divided into the CU of 64x64; In the time that the division information value of CU is 1, maximum coding unit is divided into the CU of 32x32; In the time that the division information value of CU is 2, maximum coding unit is divided into the CU of 16x16; In the time that the division information value of CU is 3, maximum coding unit is divided into the CU of 8x8.What on current HTM platform, adopt is limit iterative method, by a maximum coding unit from the CU of 64x64 through three layers of quad-tree structure the CU to 8x8, partition process computation complexity is very large, has limited its application in real-time scene.
Summary of the invention
For overcoming the defect of above-mentioned prior art, the invention provides a kind of division methods and method for video coding of the coding unit based on quad-tree structure, accelerate the process that coding unit is divided, greatly improve efficiency.
For achieving the above object, the present invention by the following technical solutions:
The division methods that the invention discloses a kind of coding unit based on quaternary tree constraint, comprises the following steps: A1: input more than two viewpoint video texture image and range image sequence; A2: the independent viewpoint texture image of encoding, records the division hierarchical information of the maximum coding unit of each independent viewpoint; A3: obtain the matching unit of each memory cell in described each independent viewpoint in the maximum coding unit of dependent viewpoint texture image to be encoded; A4: the Preliminary division hierarchy chart that obtains the sub-piecemeal that the maximum coding unit of current dependent viewpoint texture image to be encoded is corresponding according to the described division hierarchical information described in steps A 2; A5: utilize quaternary tree constraints to proofread and correct described Preliminary division hierarchy chart; A6: the division of the each maximum coding unit of output present encoding viewpoint.
Further, in described steps A 2, the division information of described each maximum coding unit is the hierarchical information k of quaternary tree cellular construction, and the value of k is 0,1,2 or 3.
Further, in described steps A 2, described division information is taking the memory cell of each maximum coding unit internal information as unit record.
Further, described steps A 3 specifically comprises: to each memory cell in the maximum coding unit of each dependent viewpoint texture image to be encoded, calculate disparity vector according to the depth information figure of present encoding viewpoint, obtain the coupling of each memory cell correspondence in independent viewpoint in current maximum coding unit; Wherein, each memory cell in current maximum coding unit is calculated to a disparity vector.
Further, in described steps A 4, the Preliminary division hierarchy chart of the sub-piecemeal that in current dependent viewpoint texture image to be encoded, each maximum coding unit to be encoded is corresponding is that the division of the matching unit of each memory cell by obtaining in steps A 3 forms.
Further, in described steps A 5, utilize quaternary tree constraints to proofread and correct the Preliminary division hierarchy chart obtaining in steps A 4, make it meet the quad-tree structure that coding unit is divided.
Further, the quad-tree structure of described coding unit can be represented by following formula:
If d i,j=k, i, j=0,1 ... 15,
∀ i ∈ ( i , i + 1 , . . . i + 16 2 k - 1 ) , j ∈ ( i , i + 1 , . . . j + 16 2 k - 1 ) d ′ i ′ , j ′ = k , i ′ ∈ ( i , i + 1 , . . . i + 16 2 k - 1 ) , j ′ ∈ ( j , j + 1 , . . . j + 16 2 k - 1 )
( i ′ , j ′ ) ≠ ( i , j ) - - - ( 1 ) ,
D i,jfor the present encoding dividing elements hierarchical information of top left corner pixel position storage in each memory cell in described steps A 2, d ＇ i ＇, j ＇for the depth value of other memory cell in present encoding dividing elements hierarchical information, k is the hierarchical information of quaternary tree cellular construction, and its satisfied quaternary tree constraints is represented by formula (1).
Utilize the quaternary tree constraints of formula (1), for the preliminary level division figure obtaining, top-down part of proofreading and correct step by step it and do not meet quad-tree structure; The like, until the matching unit in independent vide and current maximum coding unit are divided into the minimum code unit allowing in standard.
Further, described calculating disparity vector can adopt listed method in HEVC standard.
Further, the method that in described HEVC standard, listed method comprises disparity vector method of estimation, the disparity vector method of estimation based on encode disparity vector and motion vector, the method for estimation based on adjacent block disparity vector based on coding depth image and the depth map of having encoded based on different points of view calculates.
The invention also discloses a kind of method for video coding based on quaternary tree constraint, in this coding method, the division of coding unit is adopted to the division methods as described in above-mentioned any one.
The invention has the beneficial effects as follows: the present invention utilizes the correlation of texture between viewpoint, utilize the division information of the coding unit of independent viewpoint to help dependent viewpoint and carry out the division of coding unit.In the time of coding dependent viewpoint, utilize the coding unit division hierarchical information of the independent viewpoint of the synchronization of having encoded to help the division of the dependent viewpoint coding unit of present encoding, on calculating, omit the coding unit partitioning of the dependent viewpoint of limit iteration, the substitute is in statistics dependent viewpoint in current maximum coding unit each memory cell and correspond in independent viewpoint the division hierarchical information of coding unit in each memory cell in maximum coding unit position, tentatively obtain the hierarchy chart that dependent viewpoint coding unit is divided, and utilize quad-tree structure constraints to proofread and correct it, thereby avoid the calculating to every kind of coding unit partition mode in existing algorithm, and calculating to corresponding RDCost, accelerate the process that whole coding unit is divided, improve efficiency.Meanwhile, than other fast algorithm, algorithm provided by the present invention does not need to carry out complex calculations, only need proofread and correct according to quaternary tree constraints, the average load that algorithm provided by the present invention is introduced only has 0.0187%, and has saved for average 59.4% scramble time.
Brief description of the drawings
Fig. 1 is the division methods flow chart of the coding unit of one embodiment of the invention;
Fig. 2 is the Preliminary division hierarchy chart of maximum coding unit in dependent viewpoint to be encoded in example of the present invention;
Fig. 3 is the division hierarchy chart that utilizes the maximum coding unit of dependent viewpoint to be encoded that Preliminary division hierarchy chart in quaternary tree constraints correction chart 2 obtains.
Embodiment
By the correlation of texture between research viewpoint, can be by utilizing the division hierarchical information of the maximum coding unit in independent viewpoint, judge the division methods of the corresponding sub-piecemeal of maximum coding unit of current dependent viewpoint to be encoded.Because, between adjacent viewpoint, baseline is shorter, content in adjacent viewpoint is identical, its division in different points of view has very large similitude, thereby can tentatively obtain the division of each sub-piecemeal in maximum coding unit in dependent viewpoint, quaternary tree constraint is proofreaied and correct the division tentatively obtaining simultaneously, make it can be directly used in the division of instructing the maximum coding unit of dependent viewpoint, and need not pass through complicated calculating, the load that whole encoder is introduced can be ignored, can ensure under the prerequisite of coding quality, greatly reduce the complexity of cataloged procedure computing.
Contrast accompanying drawing below and in conjunction with preferred embodiment, the present invention be explained in detail.Concrete grammar described in implementation process is below all only for illustrating, and the scope that the present invention is contained is not limited to these cited methods.
Be the division methods flow chart of the coding unit of one embodiment of the invention as shown in Figure 1, it mainly comprises the steps:
A1: input more than two viewpoint video texture image and range image sequence.The multi-viewpoint three-dimensional video sequence of input is: gather gained by video camera, camera, or by the video sequence of PC Tools gained, data format is not limit, this sequence can be used for stereos copic viewing.
A2: the independent viewpoint texture image of encoding, records the division information of each maximum coding unit.In the time of the independent viewpoint texture image of coding, record the division information of each maximum coding unit of each frame in independent viewpoint.Wherein division information is taking the memory cell of each maximum coding unit internal information as unit record, and this division information is the hierarchical information k of quaternary tree cellular construction, and the value of k is 0,1,2 or 3.
A3: obtain the matching unit of each memory cell in each independent viewpoint in the maximum coding unit of dependent viewpoint texture image to be encoded.Calculate the disparity vector of its relatively independent viewpoint according to the depth information of the depth information figure of present encoding viewpoint, obtain the corresponding matching unit in independent viewpoint of each memory cell in the maximum coding unit of current dependent viewpoint to be encoded, for example: arbitrary location of pixels that can calculate each memory cell in the maximum coding unit of current dependent viewpoint to be encoded corresponds to the position in independent viewpoint, find the memory cell of its correspondence correspondence in independent viewpoint according to its positional information, as in HEVC: the information of utilizing each memory cell (as 4 × 4 memory cell) top left corner pixel in the maximum coding unit of current dependent viewpoint to be encoded, obtain its position corresponding in independent viewpoint by disparity vector, this position is right-hand is said matching unit here with coding units each 4 location of pixels corresponding 4 × 4 in below.Wherein, preferably way is that the each memory cell in the maximum coding unit of current dependent viewpoint to be encoded is recalculated to a disparity vector, because zones of different content difference in video, depth value is also different, recalculates a disparity vector make this disparity vector more accurate to present encoding unit for the maximum coding unit of each dependent viewpoint to be encoded.The computational process of concrete disparity vector can be taked to calculate disparity vector based on the depth map of having encoded, but be not limited to this, any computational methods that can calculate disparity vector all can adopt, the listed multiple disparity vector computational methods in HEVC standard such as the method that for example, disparity vector method of estimation, the disparity vector method of estimation based on encode disparity vector and motion vector, the method for estimation based on adjacent block disparity vector based on coding depth image and the depth map of having encoded based on different points of view calculate.
A4: the Preliminary division hierarchy chart that obtains the sub-piecemeal that in current dependent viewpoint texture image to be encoded, each maximum coding unit to be encoded is corresponding.
The Preliminary division hierarchy chart of the sub-piecemeal that in current dependent viewpoint texture image to be encoded, each maximum coding unit to be encoded is corresponding is that the division of the matching unit of each memory cell by obtaining in steps A 3 forms, but this division hierarchy chart tentatively obtaining not necessarily meets the quad-tree structure that coding unit is divided.
For example: in HEVC standard, maximum coding unit is 64 × 64, its memory cell size is 4 × 4, dividing hierarchical information is 0,1,2,3, can utilize Preliminary division hierarchy chart that disparity vector in steps A 3 obtains the sub-piecemeal that in current dependent viewpoint texture image to be encoded, each maximum coding unit to be encoded is corresponding as shown in Figure 2, the overstriking frame part wherein indicating in figure is not for meeting quaternary tree constraints part, as the value in upper left corner overstriking rectangle frame should be 2.
A5: utilize quaternary tree constraints to proofread and correct the Preliminary division hierarchy chart obtaining in steps A 4, wherein the quad-tree structure of quaternary tree constraints can be represented by following formula (1):
If d i,j=k, i, j=0,1 ... 15,
∀ i ∈ ( i , i + 1 , . . . i + 16 2 k - 1 ) , j ∈ ( i , i + 1 , . . . j + 16 2 k - 1 ) d ′ i ′ , j ′ = k , i ′ ∈ ( i , i + 1 , . . . i + 16 2 k - 1 ) , j ′ ∈ ( j , j + 1 , . . . j + 16 2 k - 1 )
( i ′ , j ′ ) ≠ ( i , j ) - - - ( 1 ) ,
D i,jfor the present encoding dividing elements hierarchical information of top left corner pixel position storage in each memory cell in described steps A 2, d ＇ i ＇, j ＇for the depth value of other memory cell in present encoding dividing elements hierarchical information, k is the hierarchical information of quaternary tree cellular construction, and its satisfied quaternary tree constraints is represented by formula (1).
Utilize formula (1) top-down, step by step the Preliminary division hierarchy chart shown in Fig. 2 is carried out to the correction of quaternary tree constraints, the division hierarchy chart that obtains the maximum coding unit of dependent viewpoint to be encoded after calibrated, as shown in Figure 3, the division hierarchy chart after correction meets quaternary tree constraints.
A6: repeatedly perform step A4 and A5, until stop on demand (for example having reached last maximum coding unit of present frame).
A7: last, the division of the each maximum coding unit of output present encoding viewpoint.
The method for video coding based on quaternary tree constraint of one embodiment of the invention, the division of coding unit is adopted to the division methods of coding unit as above, and other coding step can adopt the way of prior art.Utilize multi-view point video encoding method of the present invention, can obviously improve the coding rate of dependent viewpoint in free viewpoint video coding, avoid iteration to divide and judge coding unit, significantly reduce the computation complexity of free viewpoint video coding, accelerate the process that whole coding unit is divided, improved efficiency.Meanwhile, than other fast algorithm, algorithm provided by the present invention does not need to carry out complex calculations, only need proofread and correct according to quaternary tree constraints, the average load that algorithm provided by the present invention is introduced only has 0.0187%, and has saved for average 59.4% scramble time.
Above content is in conjunction with concrete preferred implementation further description made for the present invention, can not assert that specific embodiment of the invention is confined to these explanations.For those skilled in the art, without departing from the inventive concept of the premise, can also make some being equal to substitute or obvious modification, and performance or purposes identical, all should be considered as belonging to protection scope of the present invention.

Claims (11)

1. a division methods for the coding unit based on quaternary tree constraint, is characterized in that, comprises the following steps:
A1: input more than two viewpoint video texture image and range image sequence;
A2: the independent viewpoint texture image of encoding, records the division hierarchical information of the maximum coding unit of each independent viewpoint;
A3: obtain the matching unit of each memory cell in described each independent viewpoint in the maximum coding unit of dependent viewpoint texture image to be encoded;
A4: the Preliminary division hierarchy chart that obtains the sub-piecemeal that the maximum coding unit of current dependent viewpoint texture image to be encoded is corresponding according to the described division hierarchical information described in steps A 2;
A5: utilize quaternary tree constraints to proofread and correct described Preliminary division hierarchy chart;
A6: the division of the each maximum coding unit of output present encoding viewpoint.
2. division methods as claimed in claim 1, is characterized in that, in described steps A 2, the division information of described each maximum coding unit is the hierarchical information k of quaternary tree cellular construction, and the value of k is 0,1,2 or 3.
3. division methods as claimed in claim 1, is characterized in that, in described steps A 2, described division information is taking the memory cell of each maximum coding unit internal information as unit record.
4. division methods as claimed in claim 1, it is characterized in that, described steps A 3 specifically comprises: to each memory cell in the maximum coding unit of each dependent viewpoint texture image to be encoded, calculate disparity vector according to the depth information figure of present encoding viewpoint, obtain the coupling of each memory cell correspondence in independent viewpoint in current maximum coding unit; Wherein, each memory cell in current maximum coding unit is calculated to a disparity vector.
5. division methods as claimed in claim 1, it is characterized in that, in described steps A 4, the Preliminary division hierarchy chart of the sub-piecemeal that in current dependent viewpoint texture image to be encoded, each maximum coding unit to be encoded is corresponding is that the division of the matching unit of each memory cell by obtaining in steps A 3 forms.
6. division methods as claimed in claim 1, is characterized in that, in described steps A 5, utilizes quaternary tree constraints to proofread and correct the Preliminary division hierarchy chart obtaining in steps A 4, makes it meet the quad-tree structure that coding unit is divided.
7. division methods as claimed in claim 6, is characterized in that:
The quad-tree structure of described coding unit can be represented by following formula:
If d i,j=k, i, j=0,1 ... 15,
D i,jfor the present encoding dividing elements hierarchical information of top left corner pixel position storage in each memory cell in described steps A 2, d ＇ i ＇, j ＇for the depth value of other memory cell in present encoding dividing elements hierarchical information, k is the hierarchical information of quaternary tree cellular construction, and its satisfied quaternary tree constraints is represented by formula (1).
8. division methods as claimed in claim 7, is characterized in that, utilizes the quaternary tree constraints of formula (1), for the preliminary level division figure obtaining, and top-down part of proofreading and correct step by step it and do not meet quad-tree structure; The like, until the matching unit in independent vide and current maximum coding unit are divided into the minimum code unit allowing in standard.
9. division methods as claimed in claim 4, is characterized in that, described calculating disparity vector can adopt listed method in HEVC standard.
10. division methods as claimed in claim 9, it is characterized in that the method that in described HEVC standard, listed method comprises disparity vector method of estimation, the disparity vector method of estimation based on encode disparity vector and motion vector, the method for estimation based on adjacent block disparity vector based on coding depth image and the depth map of having encoded based on different points of view calculates.
11. 1 kinds of method for video coding based on quaternary tree constraint, is characterized in that, in this coding method, the division of coding unit are adopted to the division methods as described in claim 1 to 10 any one.
CN201410151037.4A 2014-04-15 2014-04-15 The division methods and method for video coding of coding unit based on quaternary tree constraint Active CN104202612B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410151037.4A CN104202612B (en) 2014-04-15 2014-04-15 The division methods and method for video coding of coding unit based on quaternary tree constraint

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410151037.4A CN104202612B (en) 2014-04-15 2014-04-15 The division methods and method for video coding of coding unit based on quaternary tree constraint

Publications (2)

Publication Number Publication Date
CN104202612A true CN104202612A (en) 2014-12-10
CN104202612B CN104202612B (en) 2018-11-02

Family

ID=52087828

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410151037.4A Active CN104202612B (en) 2014-04-15 2014-04-15 The division methods and method for video coding of coding unit based on quaternary tree constraint

Country Status (1)

Country Link
CN (1) CN104202612B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106134198A (en) * 2014-03-28 2016-11-16 庆熙大学校产学协力团 Utilize video coding apparatus and the method thereof of depth information
CN106165425A (en) * 2014-03-28 2016-11-23 庆熙大学校产学协力团 Utilize method for video coding and the device of depth information
WO2016192054A1 (en) * 2015-06-03 2016-12-08 富士通株式会社 Image coding method and apparatus using prediction information and image processing device
CN106954057A (en) * 2017-02-27 2017-07-14 华侨大学 A kind of 3D HEVC inter prediction fast schema selection methods based on correlation between viewpoint
CN107071418A (en) * 2017-05-05 2017-08-18 上海应用技术大学 A kind of quick division methods of HEVC intraframe coding units based on decision tree
CN107295336A (en) * 2017-06-21 2017-10-24 鄂尔多斯应用技术学院 Adaptive fast coding dividing elements method and device based on image correlation
CN108702505A (en) * 2017-12-14 2018-10-23 北京金山云网络技术有限公司 A kind of coding unit divides decision-making technique, device, encoder and storage medium
CN112040245A (en) * 2019-06-04 2020-12-04 万维数码有限公司 System and method for intra-coded depth map multi-layer representation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120236934A1 (en) * 2011-03-18 2012-09-20 Qualcomm Incorporated Signaling of multiview video plus depth content with a block-level 4-component structure
CN103108187A (en) * 2013-02-25 2013-05-15 清华大学 Coding method, decoding method, coder and decoder of three-dimension video
CN103414891A (en) * 2013-07-19 2013-11-27 北京交通大学 Bottom-up fast quad-tree clipping algorithm for HEVC intra-frame coding
CN103428499A (en) * 2013-08-23 2013-12-04 清华大学深圳研究生院 Coding unit partition method and multi-view video coding method using coding unit partition method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120236934A1 (en) * 2011-03-18 2012-09-20 Qualcomm Incorporated Signaling of multiview video plus depth content with a block-level 4-component structure
CN103108187A (en) * 2013-02-25 2013-05-15 清华大学 Coding method, decoding method, coder and decoder of three-dimension video
CN103414891A (en) * 2013-07-19 2013-11-27 北京交通大学 Bottom-up fast quad-tree clipping algorithm for HEVC intra-frame coding
CN103428499A (en) * 2013-08-23 2013-12-04 清华大学深圳研究生院 Coding unit partition method and multi-view video coding method using coding unit partition method

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106134198A (en) * 2014-03-28 2016-11-16 庆熙大学校产学协力团 Utilize video coding apparatus and the method thereof of depth information
CN106165425A (en) * 2014-03-28 2016-11-23 庆熙大学校产学协力团 Utilize method for video coding and the device of depth information
CN106134198B (en) * 2014-03-28 2019-03-12 庆熙大学校产学协力团 Utilize the video coding apparatus and its method of depth information
WO2016192054A1 (en) * 2015-06-03 2016-12-08 富士通株式会社 Image coding method and apparatus using prediction information and image processing device
CN106954057B (en) * 2017-02-27 2018-08-28 华侨大学 A kind of 3D-HEVC inter-prediction fast schema selection methods based on correlation between viewpoint
CN106954057A (en) * 2017-02-27 2017-07-14 华侨大学 A kind of 3D HEVC inter prediction fast schema selection methods based on correlation between viewpoint
CN107071418A (en) * 2017-05-05 2017-08-18 上海应用技术大学 A kind of quick division methods of HEVC intraframe coding units based on decision tree
CN107071418B (en) * 2017-05-05 2020-03-17 上海应用技术大学 HEVC intra-frame coding unit rapid partitioning method based on decision tree
CN107295336A (en) * 2017-06-21 2017-10-24 鄂尔多斯应用技术学院 Adaptive fast coding dividing elements method and device based on image correlation
CN107295336B (en) * 2017-06-21 2019-10-29 鄂尔多斯应用技术学院 Adaptive fast coding dividing elements method and device based on image correlation
CN108702505A (en) * 2017-12-14 2018-10-23 北京金山云网络技术有限公司 A kind of coding unit divides decision-making technique, device, encoder and storage medium
CN108702505B (en) * 2017-12-14 2020-12-11 北京金山云网络技术有限公司 Coding unit division decision method, device, coder and storage medium
US11375192B2 (en) 2017-12-14 2022-06-28 Beijing Kingsoft Cloud Network Technology Co., Ltd. Coding unit division decision method and device, encoder, and storage medium
CN112040245A (en) * 2019-06-04 2020-12-04 万维数码有限公司 System and method for intra-coded depth map multi-layer representation
CN112040245B (en) * 2019-06-04 2023-07-21 万维数码有限公司 System and method for intra-coded depth map multi-layer representation

Also Published As

Publication number Publication date
CN104202612B (en) 2018-11-02

Similar Documents

Publication Publication Date Title
CN104202612A (en) Coding unit dividing method and video coding method based on quad-tree constraint
CN103428499B (en) The division methods of coding unit and the multi-view point video encoding method of use the method
CN103703777B (en) Motion depth map to changing with depth bounds enters row decoding
CN103493483B (en) Decoding multi-view video plus depth content
CN102939763B (en) Calculating disparity for three-dimensional images
CN109863748A (en) For carrying out coding or decoded device and method to image
US10652577B2 (en) Method and apparatus for encoding and decoding light field based image, and corresponding computer program product
CN101980537B (en) Object and fractal-based binocular three-dimensional video compression coding and decoding method
Perra et al. JPEG 2000 compression of unfocused light field images based on lenslet array slicing
CN102291579B (en) Rapid fractal compression and decompression method for multi-cast stereo video
JP2016537869A (en) View synthesis prediction method and merge candidate list construction method using the same in multi-view video coding
CN102905150B (en) Novel multi-view video fractal coding, compressing and decompressing method
CN105556972B (en) The scene interior prediction method to depth image for cross-layer video decoding and encoding device and method
CN114079779B (en) Image processing method, intelligent terminal and storage medium
Gu et al. Fast bi-partition mode selection for 3D HEVC depth intra coding
CN105308956A (en) Predictor for depth map intra coding
CN101600108A (en) Motion in a kind of multiple view video coding and parallax combined estimation method
CN103402097B (en) A kind of free viewpoint video depth map encoding method and distortion prediction method thereof
CN111464814B (en) Virtual reference frame generation method based on parallax guide fusion
CN105191317A (en) Predictive coding of depth lookup tables within and across views
CN102685532A (en) Coding method for free view point four-dimensional space video coding system
RU2767771C1 (en) Method and equipment for encoding/decoding point cloud representing three-dimensional object
CN104754359A (en) Depth map coding distortion forecasting method for two-dimensional free viewpoint video
CN107005711A (en) Sample-by-sample predictive coding apparatus and method
CN102970529A (en) Multi-viewpoint video fractal coding compressing and uncompressing method based on objects

Legal Events

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