EP2944080A1 - Verfahren und vorrichtung zur effizienten codierung einer tiefensuchtabelle - Google Patents

Verfahren und vorrichtung zur effizienten codierung einer tiefensuchtabelle

Info

Publication number
EP2944080A1
EP2944080A1 EP14738282.4A EP14738282A EP2944080A1 EP 2944080 A1 EP2944080 A1 EP 2944080A1 EP 14738282 A EP14738282 A EP 14738282A EP 2944080 A1 EP2944080 A1 EP 2944080A1
Authority
EP
European Patent Office
Prior art keywords
dlt
value
depth
table value
maximum
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
EP14738282.4A
Other languages
English (en)
French (fr)
Other versions
EP2944080A4 (de
EP2944080B1 (de
Inventor
Kai Zhang
Jicheng An
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.)
HFI Innovation Inc
Original Assignee
MediaTek Singapore Pte Ltd
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
Priority claimed from PCT/CN2013/070377 external-priority patent/WO2014107885A1/en
Priority claimed from PCT/CN2013/077983 external-priority patent/WO2014205665A1/en
Priority claimed from PCT/CN2013/081455 external-priority patent/WO2015021614A1/en
Application filed by MediaTek Singapore Pte Ltd filed Critical MediaTek Singapore Pte Ltd
Publication of EP2944080A1 publication Critical patent/EP2944080A1/de
Publication of EP2944080A4 publication Critical patent/EP2944080A4/de
Application granted granted Critical
Publication of EP2944080B1 publication Critical patent/EP2944080B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N13/00—Stereoscopic video systems; Multi-view video systems; Details thereof
    • H04N13/10—Processing, recording or transmission of stereoscopic or multi-view image signals
    • H04N13/106—Processing image signals
    • H04N13/122—Improving the 3D impression of stereoscopic images by modifying image signal contents, e.g. by filtering or adding monoscopic depth cues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N13/00—Stereoscopic video systems; Multi-view video systems; Details thereof
    • H04N13/10—Processing, recording or transmission of stereoscopic or multi-view image signals
    • H04N13/106—Processing image signals
    • H04N13/128—Adjusting depth or disparity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46—Embedding additional information in the video signal during the compression process
    • H04N19/463—Embedding additional information in the video signal during the compression process by compressing encoding parameters before transmission
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/48—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using compressed domain processing techniques other than decoding, e.g. modification of transform coefficients, variable length coding [VLC] data or run-length data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/597—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N13/00—Stereoscopic video systems; Multi-view video systems; Details thereof
    • H04N13/10—Processing, recording or transmission of stereoscopic or multi-view image signals
    • H04N13/106—Processing image signals
    • H04N13/161—Encoding, multiplexing or demultiplexing different image signal components

Definitions

  • PCT/CN2013/070377 filed on January 11, 2013, entitled “An Efficient Coding Method for DLT in 3DVC”
  • PCT Patent Application, Serial No. PCT/CN2013/ 077983 filed on June 26, 2013, entitled “An Efficient Coding Method for DLT in 3DVC”
  • the PCT Patent Applications are hereby incorporated by reference in their entireties.
  • the present invention relates to three-dimensional video coding.
  • the present invention relates to coding the depth lookup table in three-dimensional and multi-view video coding.
  • Three-dimensional (3D) television has been a technology trend in recent years that intends to bring viewers sensational viewing experience.
  • Various technologies have been developed to enable 3D viewing.
  • the multi-view video is a key technology for 3D TV application among others.
  • the traditional video is a two-dimensional (2D) medium that only provides viewers a single view of a scene from the perspective of the camera.
  • the multi-view video is capable of offering arbitrary viewpoints of dynamic scenes and provides viewers the sensation of realism.
  • depth information associated with the underlying texture images is useful for improving the coding efficiency as well as for rendering of synthesized views.
  • the statistical distribution of depth data for typical scenes is usually sparse. Some depth values may not occur in depth maps.
  • SDC Simplified Depth Coding
  • DLT Depth Lookup Table
  • HTM HEVC-based Test Model
  • the prediction residual of depth data is usually transform coded.
  • the HTM also supports a transform skip mode for the depth data to bypass the transform.
  • the residual is formed accordingly.
  • the transform is not applied to the prediction residual either. Since the SDC prediction process always results in one or two depth segments per coded block, a single residual DC depth value is coded for each of these segments.
  • a DLT is used to map coded depth values in SDC to valid depth values of the original depth map. At the encoder side, the DLT can be constructed based on an initial analysis of the input depth map. The DLT is then coded in the sequence parameter set (SPS).
  • SPS sequence parameter set
  • the DLT is an optional coding tool for depth map coding. According to the current HTM, the encoder will not use the DLT coding tool if all depth values from 0 to the maximum depth value (e.g. 255) appear in the original depth map during the analysis step. Otherwise, the DLT will be coded in the sequence parameter set (SPS).
  • Fig. 1 illustrates an example of DLT coding process. In order to code the DLT, the number of valid depth values (i.e., 5 in this example) is coded using Exp-Golomb code first. Then, each valid depth value (i.e., a depth value selected from 50, 108, 110, 112 and 200 in this example) is coded using Exp-Golomb code as well.
  • Table 1 illustrates the syntax for DLT coding according to the HTM.
  • Exp-Golomb code is efficient when smaller values have higher probabilities of occurrence. However, that is not the case for valid depth values. As a result, Exp-Golomb codes may not be efficient for DLT coding.
  • four sequences i.e., Balloons, Kendo, Newspapercc and PoznanHall are determined to use the DLT coding tool, while the other three are determined not to use the DLT coding tool.
  • Statistics are collected based on the four sequences. As shown in Table 2, DLT requires 557.33 bits in average, which account for more than 65% bits of SPS for depth components. In other words, the DLT coding contributes a majority portion of bits in SPS for depth components. When the SPS carries the DLT, the SPS size becomes much larger than the SPS without the DLT.
  • a method and apparatus for encoding and decoding depth lookup table (DLT) in a three- dimensional or multi-view video coding using a constrained table value range are disclosed.
  • DLT depth lookup table
  • embodiments according to the present invention decode a constrained table value range from a minimum table value to a maximum table value of the DLT based on the coded DLT information.
  • the minimum table value is greater than a minimum depth value of a full- range DLT
  • the maximum table value is smaller than a maximum depth value of the full-range DLT
  • the minimum table value is greater than the minimum depth value and the maximum table value is smaller than the maximum depth value.
  • Bit map values for depth values in a depth range from (the minimum table value + 1) to (the maximum table value - 1) are then decoded.
  • the bit map values indicate whether the depth values are in the DLT respectively.
  • the DLT for the current depth map can be reconstructed based on the constrained table value range and the bit map values for the depth values in the depth range.
  • embodiments according to the present invention determine a constrained table value range from a minimum table value to a maximum table value of the DLT and encode the DLT into coded DLT information, wherein said encoding the DLT into the coded DLT information comprises encoding first information associated with the constrained table value range into the coded DLT information.
  • a flag can be used to indicate whether to use the full-range DLT or a constrained DLT.
  • the constrained table value range may be represented by the minimum table value and a maximum table difference, wherein the maximum table difference corresponds to the difference between the maximum table value and the minimum table value, and the minimum table value and the maximum table difference can be coded using unsigned integers.
  • the minimum table value and the maximum table value may use default values when the minimum table value and the maximum table difference are not coded. For example, the minimum table value may use -1 as a default value and the maximum table value may use MAX DEPTH VALUE + 1 as the default value, wherein MAX DEPTH VALUE corresponds to the maximum depth value.
  • the constrained table value range may also be represented by the minimum table value and the maximum table value, and the minimum table value and the maximum table value can be coded using unsigned integers.
  • bit map values for depth values in a depth range from (the minimum table value + 1) to (the maximum table value - 1) are also incorporated in the coded DLT information, where the bit map values indicate whether respective depth values are in the DLT or not.
  • the bit map values for the depth values in the depth range are coded using run-length coding on zero-runs or one- runs associated with the bit map values.
  • the bit map values for the depth values in the depth range are coded using differences between the zero-runs and a minimum zero-run or between the one-runs and a minimum one -run.
  • the differences can be encoded into the coded DLT information using /7-bit fixed length coding, where n is a positive integer.
  • the excess part of the second difference can be coded using Exp-Golomb.
  • An optimal value for n can be determined at the encoder side based on a lowest resulting bitrate for the coded DLT information.
  • a flag can be coded to signal whether the run-length coding is used for coding bit map values or the bit map values are coded as a bit-map directly.
  • bit map values for the depth values in the depth range are coded using inter-view coding when the current depth map is in a dependent view.
  • the inter-view bit map values are formed by applying Exclusive-OR operations between the depth values in the depth range and second bit map values associated with a second DLT of a second depth map in a base view.
  • Fig. 1 illustrates an example of a depth lookup table (DLT) consisting of table values 50, 108, 110, 112 and 200.
  • DLT depth lookup table
  • Fig. 2 illustrates an example of depth lookup table (DLT) coding according to an embodiment of the present invention, where a full map flag, the minimum table value, the maximum table value and the bit map for table values between the minimum table value and the maximum table value are coded.
  • DLT depth lookup table
  • Fig. 3 illustrates an example of depth lookup table (DLT) coding according to an embodiment of the present invention, where the bit map is coded using run-length coding.
  • DLT depth lookup table
  • Fig. 4 illustrates an example of depth lookup table (DLT) coding according to an embodiment of the present invention, where the inter-view bit map is derived based on the bit map of the base view.
  • DLT depth lookup table
  • Fig. 5 illustrates an example of depth lookup table (DLT) coding according to an embodiment of the present invention, where the differences of consecutive table values are coded.
  • DLT depth lookup table
  • Fig. 6 illustrates an exemplary flow chart for decoding a depth lookup table according to an embodiment of the present invention.
  • Fig. 7 illustrates an exemplary flow chart for encoding a depth lookup table according to an embodiment of the present invention.
  • the present invention discloses a coding method that indicates the range of the DLT for efficient DLT coding.
  • a Range Constrained Bit Map (RCBM) coding method is disclosed. According to RCBM, the DLT is coded in two steps.
  • the minimum table value i.e., min table value
  • the maximum table value difference i.e., diff max value
  • a flag, full map flag is used to signal whether to use a DLT with a constrained table value range, where the constrained table value range is identified by min table value and diff max value.
  • default values can be used.
  • min table value can use a default value of -1
  • max table value can use a default value of (MAX DEPTH VALUE + 1).
  • a full bit map without range constrained is coded in this case.
  • the full bit map requires (MAX DEPTH VALUE + 1) bits.
  • the encoder can decide whether to code the DLT table according to the RCBM depending on whether RCBM results in fewer bits. According to this embodiment, the maximum number of bits required to code the DLT is MAX DEPTH VALUE + 2 (e.g. 257 for 8-bit samples).
  • Fig. 2 illustrates exemplary coding process based on the RCBM for the DLT in Fig. 1.
  • code full_bit_map_[z] is a flag used to indicate whether a full map is used or not.
  • the minimum table value i.e., min_dlt_value[/ ' ]
  • the range value i.e., diff_max_dlt_value[/ ' ]
  • min_dlt_value i.e., -1 and diff max dlt value!
  • bit_map_flag i.e., bit_map_flag[/][/] is then coded.
  • the DLT is coded using an enhanced range constrained bit-map (ERCBM) coding method.
  • ERCBM enhanced range constrained bit-map
  • the DLT is represented by a range constrained bit-map as mentioned above, where min dlt value and diff max dlt value are coded as unsigned integers to constrain the table value to the range [MinDltValue, MaxDltValue] for the DLT. Values outside this range are not used in the DLT.
  • differential run-length coding is applied to code the bit-map.
  • the differential run-length coding is also referred to as run-length coding or differential coding in the following descriptions.
  • the bit-map can also be represented by the lengths of zero-runs (i.e., the number of consecutive zeroes) or one-runs (i.e., the number of consecutive ones). Run- length coding is efficient for underlying data having high probabilities of repeating symbols (i.e., 0 in this case). For the bit map of the DLT with a small number of table values, run length coding on zero-runs will be more efficient.
  • Fig. 3 illustrates exemplary differential run-length coding incorporating an embodiment of the present invention.
  • the lengths of zero-run are 3, 2, 2 and 3 sequentially for the DLT in Fig. 3, wherein the first zero-run (i.e., 3) corresponds to three O's between depth value 64 and depth value 60; the second zero-run corresponds to the two O's between depth value 67 and depth value 64; the third zero-run corresponds to the two O's between depth value 70 and depth value 67; and the fourth zero-run corresponds to the three O's between depth value 74 and depth value 70.
  • the zero-runs correspond to 3, 2, 2 and 3 respectively are coded along with the minimum table value and the range value (i.e. the difference between the maximum table value and the minimum table value).
  • the zero-runs can be coded by fixed-length coding with n bits. If a difference exceeds 2"-2, the excess will be coded with Exp-Golomb code, where n is signaled before the differences are coded.
  • the encoder can choose an optimal n that may result in the minimum number of bits.
  • the encoder can use the RCBM as a fall back mode.
  • 0, 1, ... 255 are included in the DLT.
  • diff value requires 8 bits
  • min value requires 0 bit
  • run length coding flag requires 1 bit
  • bit map flags requires 254 bits when RCBM is utilized. Accordingly, a DLT can be coded with 263 bits in the worst case for 8-bit depth data.
  • the differential run-length coding for the DLT as disclosed above can be combined with other DLT processing techniques.
  • the differential run-length coding can be used jointly with the delta-DLT method as disclosed in JCT3V-D0054 (Fabian Jager, "CE6.H related: Results on Updating Mechanism for Coding of Depth Lookup Table (Delta-DLT)", Joint Collaborative Team on 3D Video Coding Extensions of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1, 4th Meeting: Incheon, KR, 20-26 Apr. 2013, Document: JCT3V-D0054).
  • JCT3V-D0054 the inter-view correlation is utilized to improve the coding efficiency.
  • DLT0 and DLT1 correspond to the DLTs of the base view and the dependent view respectively. Both DLT0 and DLT1 are represented in the full bit-map form.
  • the DLT1 ' is coded instead of DLT1.
  • a differential coding method is disclosed where min dlt value and diff max dlt value are coded as unsigned integers to indicate the constrained table value range, [MinDltValue, MaxDltValue] of the DLT as before. Values outside this range are not used in the DLT. Differences between consecutive values in DLT can also be used to represent the DLT. Difference, i.e., DiffTJ] is defined as (DLTValue[/ ' +l] - DLTVlaue[/ ' ] - 1). For example, if table values in the DLT are 60, 64, 67, 70 and 74, the corresponding differences are 3, 2, 2 and 3. The differences between consecutive values can also be interpreted as the zero-runs.
  • the minimum difference i.e. the minimum zero-run
  • deltas between respective differences i.e. zero-runs
  • Fig. 5 demonstrates an example of a DLT, where differences are 3, 2, 2 and 3.
  • the minimum difference '2' is coded first, and then the deltas corresponding to the differences, i.e., 1, 0, 0 and 1 are coded in order.
  • the deltas are coded by fixed-length coding with n bits. If a difference exceeds 2"-2, the excess will be coded with Exp-Golomb code.
  • n The number of bits for the fixed-length coding, i.e., n is signaled before deltas are coded. Since n is always greater then 0, n-l instead of n is coded.
  • the encoder can choose the optimal n that results in the minimum number of bits for the DLT.
  • the coding process using the delta of the difference between an underlying value and the minimum value in the DLT can be described based on Fig. 5.
  • the encoding process is as follows:
  • DiffBoundary which is defined as 2"-l, is equal to 1.
  • diff minus min i.e., the delta between a current difference and the minimum difference
  • diff minus min rem i.e., the excess part of the delta
  • the decoding process is as follows:
  • Table 5 Exemplary syntax incorporating deltas of differences based on an embodiment of the present invention is shown in Table 5.
  • Flag DLTDeduced is used to indicate whether the DLT can be deduced from diff max dlt value and min dlt value. If diff max dlt value is 0, there will be only one value in the DLT (i.e., min dlt value) and the flag DLTDeduced is set to 1. Furthermore, if diff max dlt value is 1, there will be only two values in the DLT (i.e., min dlt value and min_dlt_value+l), DLTDeduced is also set to 1. In all other cases, DLTDeduced is set to 0. Table 5
  • a flag is coded to signal whether the differential run-length coding is used for coding bit map values of the DLT.
  • the encoder and the decoder apply the bit map coding method to code the bit map values of the DLT as a bit-map directly when the flag is 0, and apply the differential run-length coding method to code the bit map values of the DLT when the flag is 1.
  • the bit map values indicate whether the depth values are in the DLT respectively.
  • Fig. 6 illustrates an exemplary flowchart for depth lookup table (DLT) decoding in a three- dimensional or multi-view video coding system incorporating a constrained table value range according to an embodiment of the present invention.
  • the system receives input data associated with coded DLT information of a current depth map as shown in step 610.
  • the input data may also be received from a processor such as a controller, a central processing unit, a digital signal processor or electronic circuits that produce the input data.
  • a constrained table value range from a minimum table value to a maximum table value of the DLT is decoded based on the coded DLT information as shown in step 620.
  • the minimum table value is greater than a minimum depth value of a full-range DLT, the maximum table value is smaller than a maximum depth value of the full-range DLT, or the minimum table value is greater than the minimum depth value and the maximum table value is smaller than the maximum depth value.
  • Bit map values for depth values in a depth range from (the minimum table value + 1) to (the maximum table value - 1) are then decoded as shown in step 630, where the bit map values indicate whether the depth values are in the DLT respectively.
  • the DLT for the current depth map is then reconstructed based on the constrained table value range and the bit map values for the depth values in the depth range.
  • Fig. 7 illustrates an exemplary flowchart for depth lookup table (DLT) encoding in a three- dimensional or multi-view video coding system incorporating a constrained table range according to an embodiment of the present invention.
  • the system receives input data associated with the DLT of a current depth map as shown in step 710.
  • the input data may also be received from a processor such as a controller, a central processing unit, a digital signal processor or electronic circuits that produce the input data.
  • a constrained table value range from a minimum table value to a maximum table value of the DLT is determined as shown in step 720.
  • the minimum table value is greater than a minimum depth value of a full-range DLT, the maximum table value is smaller than a maximum depth value of the full-range DLT, or the minimum table value is greater than the minimum depth value and the maximum table value is smaller than the maximum depth value.
  • the DLT is then encoded into coded DLT information as shown in step 730, wherein said encoding the DLT into the coded DLT information comprises encoding first information associated with the constrained table value range into the coded DLT information.
  • Embodiment of the present invention as described above may be implemented in various hardware, software codes, or a combination of both.
  • an embodiment of the present invention can be a circuit integrated into a video compression chip or program code integrated into video compression software to perform the processing described herein.
  • An embodiment of the present invention may also be program code to be executed on a Digital Signal Processor (DSP) to perform the processing described herein.
  • DSP Digital Signal Processor
  • the invention may also involve a number of functions to be performed by a computer processor, a digital signal processor, a microprocessor, or field programmable gate array (FPGA). These processors can be configured to perform particular tasks according to the invention, by executing machine-readable software code or firmware code that defines the particular methods embodied by the invention.
  • the software code or firmware code may be developed in different programming languages and different formats or styles.
  • the software code may also be compiled for different target platforms.
  • different code formats, styles and languages of software codes and other means of configuring code to perform the tasks in accordance with the invention will not depart from the spirit and scope of the invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
EP14738282.4A 2013-01-11 2014-01-10 Verfahren und vorrichtung zur effizienten codierung einer tiefensuchtabelle Active EP2944080B1 (de)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
PCT/CN2013/070377 WO2014107885A1 (en) 2013-01-11 2013-01-11 An efficient coding method for dlt in 3dvc
PCT/CN2013/077983 WO2014205665A1 (en) 2013-06-26 2013-06-26 An efficient coding method for dlt in 3dvc
PCT/CN2013/081455 WO2015021614A1 (en) 2013-08-14 2013-08-14 An efficient differential coding method for dlt in 3dvc
PCT/CN2014/070428 WO2014108088A1 (en) 2013-01-11 2014-01-10 Method and apparatus for efficient coding of depth lookup table

Publications (3)

Publication Number Publication Date
EP2944080A1 true EP2944080A1 (de) 2015-11-18
EP2944080A4 EP2944080A4 (de) 2016-08-03
EP2944080B1 EP2944080B1 (de) 2018-09-12

Family

ID=51166537

Family Applications (1)

Application Number Title Priority Date Filing Date
EP14738282.4A Active EP2944080B1 (de) 2013-01-11 2014-01-10 Verfahren und vorrichtung zur effizienten codierung einer tiefensuchtabelle

Country Status (5)

Country Link
US (1) US9762882B2 (de)
EP (1) EP2944080B1 (de)
KR (1) KR101740630B1 (de)
CA (1) CA2893011C (de)
WO (1) WO2014108088A1 (de)

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105009575B (zh) * 2013-03-13 2018-12-07 华为技术有限公司 一种基于子范围编码深度查询表的方法
CN104079941B (zh) * 2013-03-27 2017-08-25 中兴通讯股份有限公司 一种深度信息编解码方法、装置及视频处理播放设备
KR101702802B1 (ko) * 2013-04-10 2017-02-03 지티이 코포레이션 깊이 정보 인코딩 및 디코딩 방법, 시스템, 및 장치
WO2014166119A1 (en) * 2013-04-12 2014-10-16 Mediatek Inc. Stereo compatibility high level syntax
WO2015054812A1 (en) 2013-10-14 2015-04-23 Microsoft Technology Licensing, Llc Features of base color index map mode for video and image coding and decoding
US10542274B2 (en) 2014-02-21 2020-01-21 Microsoft Technology Licensing, Llc Dictionary encoding and decoding of screen content
WO2015139203A1 (en) * 2014-03-18 2015-09-24 Mediatek Singapore Pte. Ltd. Dlt signaling in 3d video coding
KR102330740B1 (ko) 2014-09-30 2021-11-23 마이크로소프트 테크놀로지 라이센싱, 엘엘씨 파면 병렬 프로세싱이 인에이블되는 경우의 인트라 픽쳐 예측 모드에 대한 규칙
EP3178229A4 (de) * 2014-09-30 2018-03-14 HFI Innovation Inc. Verfahren zur nachschlagetabellengrössenreduzierung für einen tiefenmodellierungsmodus in der tiefencodierung
US10659783B2 (en) 2015-06-09 2020-05-19 Microsoft Technology Licensing, Llc Robust encoding/decoding of escape-coded pixels in palette mode
CN105915917A (zh) * 2015-07-24 2016-08-31 乐视云计算有限公司 深度信息编码方法、解码方法及装置
US10623723B2 (en) * 2016-09-29 2020-04-14 Intel Corporation Hybrid stereo rendering for depth extension in dynamic light field displays
JP7460617B2 (ja) 2018-06-29 2024-04-02 北京字節跳動網絡技術有限公司 Ｌｕｔ更新条件
TWI719523B (zh) 2018-06-29 2021-02-21 大陸商北京字節跳動網絡技術有限公司 哪個查找表需要更新或不更新
CN110662053B (zh) 2018-06-29 2022-03-25 北京字节跳动网络技术有限公司 使用查找表的视频处理方法、装置和存储介质
WO2020003284A1 (en) 2018-06-29 2020-01-02 Beijing Bytedance Network Technology Co., Ltd. Interaction between lut and amvp
KR20210025537A (ko) 2018-06-29 2021-03-09 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 하나 또는 다수의 룩업 테이블들을 사용하여 이전에 코딩된 모션 정보를 순서대로 저장하고 이를 사용하여 후속 블록들을 코딩하는 개념
EP3791585A1 (de) 2018-06-29 2021-03-17 Beijing Bytedance Network Technology Co. Ltd. Teil-/voll-pruning beim hinzufügen eines hmvp-kandidaten zu fusion/amvp
SG11202012293RA (en) 2018-06-29 2021-01-28 Beijing Bytedance Network Technology Co Ltd Update of look up table: fifo, constrained fifo
JP7328330B2 (ja) 2018-06-29 2023-08-16 北京字節跳動網絡技術有限公司 Ｌｕｔにおける動き候補のチェック順序
CN110677669B (zh) 2018-07-02 2021-12-07 北京字节跳动网络技术有限公司 具有lic的lut
WO2020053800A1 (en) 2018-09-12 2020-03-19 Beijing Bytedance Network Technology Co., Ltd. How many hmvp candidates to be checked
KR102648159B1 (ko) 2019-01-10 2024-03-18 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 Lut 업데이트의 호출
CN113383554B (zh) 2019-01-13 2022-12-16 北京字节跳动网络技术有限公司 LUT和共享Merge列表之间的交互
WO2020147773A1 (en) 2019-01-16 2020-07-23 Beijing Bytedance Network Technology Co., Ltd. Inserting order of motion candidates in lut
CN113615193A (zh) 2019-03-22 2021-11-05 北京字节跳动网络技术有限公司 Merge列表构建和其他工具之间的交互
CN112398484B (zh) * 2019-08-15 2024-04-23 华为技术有限公司 一种编码方法及相关设备
EP4026320A1 (de) * 2019-09-03 2022-07-13 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Konfigurierbarer nal- und scheibencodepunktmechanismus zum zusammenführen von strömen

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2051527A1 (de) * 2007-10-15 2009-04-22 Thomson Licensing Verstärkungsschichtrestvorhersage für die Bittiefenskalierbarkeit mittel hierarchischer LUTs
KR101367282B1 (ko) * 2007-12-21 2014-03-12 삼성전자주식회사 깊이 정보에 대한 적응적 정보 표현 방법 및 그 장치
KR101520624B1 (ko) * 2008-12-31 2015-05-15 삼성전자주식회사 비트 맵 방식의 영상 인코딩/디코딩 방법 및 장치
CN105009576B (zh) * 2013-03-13 2018-12-14 华为技术有限公司 深度查询表的编码方法

Also Published As

Publication number Publication date
US9762882B2 (en) 2017-09-12
US20150350623A1 (en) 2015-12-03
KR20150094729A (ko) 2015-08-19
CA2893011C (en) 2017-11-21
CA2893011A1 (en) 2014-07-17
KR101740630B1 (ko) 2017-05-26
EP2944080A4 (de) 2016-08-03
WO2014108088A1 (en) 2014-07-17
EP2944080B1 (de) 2018-09-12

Similar Documents

Publication Publication Date Title
CA2893011C (en) Method and apparatus for efficient coding of depth lookup table
US10587859B2 (en) Method of sub-predication unit inter-view motion prediction in 3D video coding
US9743110B2 (en) Method of 3D or multi-view video coding including view synthesis prediction
JP5775083B2 (ja) モード情報を符号化、復号化する方法及びその装置
CN105981385B (zh) 帧内预测编码方法及其装置
CN108259900B (zh) 针对视频的上下文自适应二进制熵编码的变换系数编码
US20090219985A1 (en) Systems and Methods for Processing Multiple Projections of Video Data in a Single Video File
KR20180035881A (ko) 이미지 예측 방법 및 장치
US9596484B2 (en) Method of depth intra prediction using depth map modelling
WO2015007159A1 (en) Method of disparity derived depth coding in 3d video coding
JP5935695B2 (ja) 埋め込みグラフィック符号化：並列復号に向けて並べ替えられたビットストリーム
US9813735B2 (en) Method for encoding a current block of a first image component relative to a reference block of at least one second image component, encoding device and corresponding computer program
EP2920970A1 (de) Verfahren und vorrichtung zur vorhersage einer wertableitung in der intracodierung
JP2016508331A (ja) Ｊｃｔｖｃ−ｌ０２２６：ｖｐｓ及びｖｐｓ＿ｅｘｔｅｎｓｉｏｎ更新
JP4954473B2 (ja) デジタルビデオ信号を符号化する方法及び装置
WO2014166423A1 (en) Method and apparatus for direct simplified depth coding
US20150358643A1 (en) Method of Depth Coding Compatible with Arbitrary Bit-Depth
US20120287237A1 (en) Method and apparatus for processing video signals, related computer program product, and encoded signal
CN104904199A (zh) 深度查找表的高效编码方法及装置
CN114375577A (zh) 联合分量二次变换
Hanca et al. Lossy contour-coding in segmentation-based intra-depth map coding
WO2014205665A1 (en) An efficient coding method for dlt in 3dvc
KR20110011504A (ko) 모드 정보를 부호화, 복호화하는 방법 및 장치
Sajiyya et al. Information Hiding in H. 264 Compressed Video
Wong et al. Improvements of data embedding in DCT compressed domain

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20150811

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20160706

RIC1 Information provided on ipc code assigned before grant

Ipc: H04N 19/463 20140101ALI20160630BHEP

Ipc: H04N 19/597 20140101AFI20160630BHEP

Ipc: H04N 13/00 20060101ALI20160630BHEP

Ipc: H04N 19/14 20140101ALI20160630BHEP

Ipc: H04N 19/48 20140101ALI20160630BHEP

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: HFI INNOVATION INC.

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20180124

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602014032253

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04N0013000000

Ipc: H04N0019597000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: H04N 19/463 20140101ALI20180425BHEP

Ipc: H04N 19/597 20140101AFI20180425BHEP

Ipc: H04N 13/00 20060101ALI20180425BHEP

INTG Intention to grant announced

Effective date: 20180515

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

GRAR Information related to intention to grant a patent recorded

Free format text: ORIGINAL CODE: EPIDOSNIGR71

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

INTC Intention to grant announced (deleted)
AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

INTG Intention to grant announced

Effective date: 20180808

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602014032253

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1042007

Country of ref document: AT

Kind code of ref document: T

Effective date: 20181015

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20180912

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181213

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20181212

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1042007

Country of ref document: AT

Kind code of ref document: T

Effective date: 20180912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190112

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20190112

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602014032253

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

26N No opposition filed

Effective date: 20190613

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20190110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190110

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20190131

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190131

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190131

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190131

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190131

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20190110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20140110

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20180912

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240129

Year of fee payment: 11