WO2015100729A1 - Improved merging candidate list construction in 3dvc - Google Patents

Improved merging candidate list construction in 3dvc Download PDF

Info

Publication number
WO2015100729A1
WO2015100729A1 PCT/CN2014/070082 CN2014070082W WO2015100729A1 WO 2015100729 A1 WO2015100729 A1 WO 2015100729A1 CN 2014070082 W CN2014070082 W CN 2014070082W WO 2015100729 A1 WO2015100729 A1 WO 2015100729A1
Authority
WO
WIPO (PCT)
Prior art keywords
candidate
merging
candidates
candidate list
merging candidate
Prior art date
Application number
PCT/CN2014/070082
Other languages
French (fr)
Inventor
Kai Zhang
Jicheng An
Xianguo Zhang
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
Application filed by Mediatek Singapore Pte. Ltd. filed Critical Mediatek Singapore Pte. Ltd.
Priority to PCT/CN2014/070082 priority Critical patent/WO2015100729A1/en
Publication of WO2015100729A1 publication Critical patent/WO2015100729A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/513Processing of motion vectors
    • H04N19/517Processing of motion vectors by encoding
    • H04N19/52Processing of motion vectors by encoding by predictive encoding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/46Embedding additional information in the video signal during the compression process
    • H04N19/463Embedding additional information in the video signal during the compression process by compressing encoding parameters before transmission
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/56Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/597Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103Selection of coding mode or of prediction mode
    • H04N19/105Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/157Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/172Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a picture, frame or field
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

  • the invention relates generally to Three-Dimensional (3D) video processing.
  • the presented invention relates to illumination compensation (IC).
  • illumination compensation only takes effects to disparity compensation prediction (DCP).
  • DCP disparity compensation prediction
  • ic flag is signaled even if the selected merging candidate does not employ DCP, to avoid the parsing dependency in merge blocks. Therefore, there is syntax redundancy for IC in merge blocks.
  • Fig. 1 is a diagram illustrating the merging candidate list construction depending on whether IC is applied;
  • Fig. 2 is a diagram illustrating to remove a candidate which does not employ DCP;
  • Fig. 3 is a diagram illustrating to insert a dummy candidate into the first position of the merging candidate list when IC is applied;
  • Fig. 4 is a diagram illustrating to append default candidates to the merging candidate list when IC is applied.
  • the merging candidate construction process is conducted in different ways depending on IC is applied or not as depicted in Fig. 1.
  • a candidate is considered as unavailable if it does not employ DCP, and IC is applied in the current merge block.
  • the redundancy is removed because there are no useless merging candidates taking positions in the merging candidate list when IC is applied.
  • there is still no parsing dependency problem because the merging candidate construction process does not affect the parsing process.
  • a merging candidate is not appended in the merging candidate list if it does not employ DCP and IC is applied in the merging candidate list construction process.
  • the merging candidate list is construed in the original way firstly if IC is applied. Then candidates in the list which does not employ DCP are removed. If one candidate is removed, the candidates following it will be shifted left orderly to take its position as depicted in Fig.2.
  • the merging candidate list is construed in the same way as specified in HEVC firstly if IC is applied. Then candidates in the list which does not employ DCP are removed. If one candidate is removed, the candidates following it will be shifted left orderly to take its position as depicted in Fig.2. Then candidates specified especially for 3DVC are inserted into the list. A candidate is inserted into the list only if it employs DCP.
  • a dummy candidate is inserted into the first position of the merging candidate list if IC is applied.
  • the original candidates will be shifted right orderly as depicted in Fig.3.
  • the dummy candidate cannot be selected if IC is applied.
  • default candidates employing DCP are appended to the list as depicted in Fig.4.
  • a default candidate is first set equal to the first candidate in the list, then its motion vector (MV) is added by a delta MV, such as (4, 0),(-4,0),(8,0), (-8,0) and so on.
  • the default candidate should not be equal to any existing candidate in the list. If there are more than one default candidate, they should be different to each other.
  • the maximum number is set to be N.
  • the candidate index can coded with the maximum value N-l instead of -1, which can save bits.
  • an embodiment of the present invention can be a circuit integrated into a video compression chip or program codes integrated into video compression software to perform the processing described herein.
  • An embodiment of the present invention may also be program codes 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).
  • 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 codes may be developed in different programming languages and different format or style.
  • the software code may also be compiled for different target platform.
  • 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)

Abstract

An improved merging candidate construction method is proposed. In the proposed method, the syntax redundancy caused by IC can be removed without imposing parsing dependency.

Description

IMPROVED MERGING CANDIDATE LIST
CONSTRUCTION IN 3DVC
TECHNICAL FIELD
[0001] The invention relates generally to Three-Dimensional (3D) video processing. In particular, the presented invention relates to illumination compensation (IC).
BACKGROUND
[0002] In the current 3D-HEVC, illumination compensation (IC) only takes effects to disparity compensation prediction (DCP). However, ic flag is signaled even if the selected merging candidate does not employ DCP, to avoid the parsing dependency in merge blocks. Therefore, there is syntax redundancy for IC in merge blocks.
SUMMARY
[0003] In light of the previously described problems, a method is proposed to remove such redundancy without imposing parsing dependency by modifying the merging candidate construction process.
[0004] Other aspects and features of the invention will become apparent to those with ordinary skill in the art upon review of the following descriptions of specific embodiments. BRIEF DESCRIPTION OF DRAWINGS
The invention can be more fully understood by reading the subsequent detailed description and examples with references made to the accompanying drawings, wherein:
[0005] Fig. 1 is a diagram illustrating the merging candidate list construction depending on whether IC is applied; [0006] Fig. 2 is a diagram illustrating to remove a candidate which does not employ DCP;
[0007] Fig. 3 is a diagram illustrating to insert a dummy candidate into the first position of the merging candidate list when IC is applied;
[0008] Fig. 4 is a diagram illustrating to append default candidates to the merging candidate list when IC is applied.
DETAILED DESCRIPTION
[0009] The following description is of the best-contemplated mode of carrying out the invention. This description is made for the purpose of illustrating the general principles of the invention and should not be taken in a limiting sense. The scope of the invention is best determined by reference to the appended claims.
[0010] It is proposed to remove the syntax redundancy by modify the merging candidate construction process. The merging candidate construction process is conducted in different ways depending on IC is applied or not as depicted in Fig. 1. In the merging candidate list construction process, a candidate is considered as unavailable if it does not employ DCP, and IC is applied in the current merge block. The redundancy is removed because there are no useless merging candidates taking positions in the merging candidate list when IC is applied. Moreover, there is still no parsing dependency problem because the merging candidate construction process does not affect the parsing process.
[0011] In one embodiment, a merging candidate is not appended in the merging candidate list if it does not employ DCP and IC is applied in the merging candidate list construction process.
[0012] In another embodiment, the merging candidate list is construed in the original way firstly if IC is applied. Then candidates in the list which does not employ DCP are removed. If one candidate is removed, the candidates following it will be shifted left orderly to take its position as depicted in Fig.2.
[0013] In still another embodiment, the merging candidate list is construed in the same way as specified in HEVC firstly if IC is applied. Then candidates in the list which does not employ DCP are removed. If one candidate is removed, the candidates following it will be shifted left orderly to take its position as depicted in Fig.2. Then candidates specified especially for 3DVC are inserted into the list. A candidate is inserted into the list only if it employs DCP.
[0014] In still another embodiment, a dummy candidate is inserted into the first position of the merging candidate list if IC is applied. The original candidates will be shifted right orderly as depicted in Fig.3. The dummy candidate cannot be selected if IC is applied.
[0015] In still another embodiment, if the number of candidates in the merging candidate list employing DCP is lower than the maximum number of merging candidates when IC is applied, default candidates employing DCP are appended to the list as depicted in Fig.4. In one example, a default candidate is first set equal to the first candidate in the list, then its motion vector (MV) is added by a delta MV, such as (4, 0),(-4,0),(8,0), (-8,0) and so on. The default candidate should not be equal to any existing candidate in the list. If there are more than one default candidate, they should be different to each other.
[0016] In still another embodiment, if the number N of candidates in the merging candidate list employing DCP is lower than the maximum number M of merging candidates when IC is applied, the maximum number is set to be N. Thus the candidate index can coded with the maximum value N-l instead of -1, which can save bits.
[0017] The methods described above can be used in a video encoder as well as in a video decoder. Embodiments of disparity vector derivation methods according to the present invention as described above may be implemented in various hardware, software codes, or a combination of both. For example, an embodiment of the present invention can be a circuit integrated into a video compression chip or program codes integrated into video compression software to perform the processing described herein. An embodiment of the present invention may also be program codes to be executed on a Digital Signal Processor (DSP) to perform the processing described herein. 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 codes may be developed in different programming languages and different format or style. The software code may also be compiled for different target platform. However, 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.
[0018] The invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described examples are to be considered in all respects only as illustrative and not restrictive. To the contrary, it is intended to cover various modifications and similar arrangements (as would be apparent to those skilled in the art). Therefore, the scope of the appended claims should be accorded the broadest interpretation so as to encompass all such modifications and similar arrangements.

Claims

1. A method of constructing a merging candidate list, wherein merging construction process is conducted in different ways depending on whether illumination compensation (IC) is applied or not.
2. The method as claimed in claim 1, wherein candidates in the merging candidate list employ disparity compensation prediction (DCP) if IC is applied.
3. The method as claimed in claim 2 wherein all candidates except the first one in the merging candidate list employ DCP if IC is applied.
4. The method as claimed in claim 2, wherein a merging candidate is not appended in the merging candidate list if it does not employ DCP and IC is applied in the merging candidate list construction process.
5. The method as claimed in claim 2, wherein the merging candidate list is construed in an original way firstly if IC is applied; candidates in the merging candidate list which does not employ DCP are removed; if one candidate is removed, candidates following the removed candidate are shifted orderly.
6. The method as claimed in claim 2, wherein the merging candidate list is construed in a specified way if IC is applied; candidates in the merging candidate list which does not employ DCP are removed; if one candidate is removed, candidates following the removed candidate will be shifted orderly; candidates specified especially for 3DVC are inserted into the merging candidate list; and a candidate is inserted into the merging candidate list only if the candidate employs DCP.
7. The method as claimed in claim 2, wherein a dummy candidate is inserted into the first position of the merging candidate list if IC is applied; original candidates are shifted right orderly; the dummy candidate cannot be selected if IC is applied.
8. The method as claimed in claim 2, wherein default candidates employing
DCP are appended to the merging candidate list if a number of candidates in the merging candidate list employing DCP is lower than a maximum number of merging candidates when IC is applied; a default candidate is first set equal to the first candidate in the list, then a motion vector (MV) of the default candidate is added by a delta MV.
9. The method as claimed in claim 8, wherein the default candidate is not equal to any existing candidate in the merging candidate list; if there are more than one default candidate, the default candidates are different to each other.
10. The method as claimed in claim 8, wherein the maximum number is set to be N if the number N of candidates in the merging candidate list employing DCP is lower than the maximum number M of merging candidates when IC is applied; and a candidate index is coded with the maximum value N-l instead of -l .
11. The method as claimed in claim 7, wherein ic flag is not signaled if the first merging candidate is selected and IC is not applied in a current block implicitly.
12. The method as claimed in claim 4, wherein the method does not apply to the first candidate in the merging candidate list.
13. The method as claimed in claim 5, wherein the method does not apply to the first candidate in the merging candidate list.
14. The method as claimed in claim 6, wherein the method does not apply to the first candidate in the merging candidate list.
PCT/CN2014/070082 2014-01-03 2014-01-03 Improved merging candidate list construction in 3dvc WO2015100729A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/070082 WO2015100729A1 (en) 2014-01-03 2014-01-03 Improved merging candidate list construction in 3dvc

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/070082 WO2015100729A1 (en) 2014-01-03 2014-01-03 Improved merging candidate list construction in 3dvc

Publications (1)

Publication Number Publication Date
WO2015100729A1 true WO2015100729A1 (en) 2015-07-09

Family

ID=53493037

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/070082 WO2015100729A1 (en) 2014-01-03 2014-01-03 Improved merging candidate list construction in 3dvc

Country Status (1)

Country Link
WO (1) WO2015100729A1 (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013001749A1 (en) * 2011-06-29 2013-01-03 パナソニック株式会社 Image encoding method, image decoding method, image encoding device, image decoding device, and image encoding/decoding device
CN103004206A (en) * 2010-07-20 2013-03-27 株式会社Ntt都科摩 Image prediction encoding device, image prediction encoding method, image prediction encoding program, image prediction decoding device, image prediction decoding method, and image prediction decoding program
US20130235926A1 (en) * 2012-03-07 2013-09-12 Broadcom Corporation Memory efficient video parameter processing
US20130336406A1 (en) * 2012-06-14 2013-12-19 Qualcomm Incorporated Redundancy removal for merge/skip mode motion information candidate list construction
CN103477635A (en) * 2010-10-08 2013-12-25 弗兰霍菲尔运输应用研究公司 Picture coding supporting block partitioning and block merging

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103004206A (en) * 2010-07-20 2013-03-27 株式会社Ntt都科摩 Image prediction encoding device, image prediction encoding method, image prediction encoding program, image prediction decoding device, image prediction decoding method, and image prediction decoding program
CN103477635A (en) * 2010-10-08 2013-12-25 弗兰霍菲尔运输应用研究公司 Picture coding supporting block partitioning and block merging
WO2013001749A1 (en) * 2011-06-29 2013-01-03 パナソニック株式会社 Image encoding method, image decoding method, image encoding device, image decoding device, and image encoding/decoding device
US20130235926A1 (en) * 2012-03-07 2013-09-12 Broadcom Corporation Memory efficient video parameter processing
US20130336406A1 (en) * 2012-06-14 2013-12-19 Qualcomm Incorporated Redundancy removal for merge/skip mode motion information candidate list construction

Similar Documents

Publication Publication Date Title
WO2015000108A1 (en) An improved texture merging candidate in 3dvc
WO2016165069A1 (en) Advanced temporal motion vector prediction in video coding
GB2588006A (en) Number of motion candidates in a look up table to be checked according to mode
WO2016008157A1 (en) Methods for motion compensation using high order motion model
US10142610B2 (en) Method for sub-range based coding a depth lookup table
BR112016017201B1 (en) ENCODING AND DECODING METHOD FOR ADAPTIVE MOTION VECTOR ACCURACY OF A BLOCK OF VIDEO DATA
WO2016008161A1 (en) Temporal derived bi-directional motion vector predictor
WO2017008255A1 (en) Advanced intra prediction mode signaling in video coding
WO2015139203A1 (en) Dlt signaling in 3d video coding
WO2016115708A1 (en) Methods for chroma component coding with separate intra prediction mode
WO2015100710A1 (en) Existence of inter-view reference picture and availability of 3dvc coding tools
WO2015006920A1 (en) An adaptive disparity vector derivation method
WO2015000168A1 (en) A simplified dc prediction method in intra prediction
KR20180134853A (en) Method and electronic device for encoding segments of inter frames
WO2014166109A1 (en) Methods for disparity vector derivation
WO2015135175A1 (en) Simplified depth based block partitioning method
JP2016514432A (en) How to encode a depth lookup table
WO2014029086A1 (en) Methods to improve motion vector inheritance and inter-view motion prediction for depth map
WO2015100729A1 (en) Improved merging candidate list construction in 3dvc
WO2015131404A1 (en) Methods for depth map coding
WO2014106346A1 (en) Method of signalling additional collocated picture for 3dvc
WO2013159326A1 (en) Inter-view motion prediction in 3d video coding
WO2016123749A1 (en) Deblocking filtering with adaptive motion vector resolution
WO2014106327A1 (en) Method and apparatus for inter-view residual prediction in multiview video coding
WO2015143603A1 (en) An improved method for temporal motion vector prediction in video coding

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14876422

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14876422

Country of ref document: EP

Kind code of ref document: A1