This Application is a Section 371 National Stage Application of International Application No. PCT/FR2018/051579, filed Jun. 28, 2018, which is incorporated by reference in its entirety and published as WO 2019/008253 A1 on Jan. 10, 2019, not in English.
The present invention pertains generally to the field of image processing, and more precisely to the coding and to the decoding of parameters of digital images, whether these digital images are fixed or form part of a sequence of digital images.
The coding/decoding of such image parameters applies notably to images arising from at least one video sequence comprising:
The present invention applies in a similar manner to the coding/decoding of parameters of images of 2D or 3D type.
The invention can notably, but not exclusively, apply to the video coding implemented in the current AVC (English abbreviation of “Advanced Video Coding”) and HEVC (English abbreviation of “High Efficiency Video Coding”) video coders and their extensions (MVC, 3D-AVC, MV-HEVC, 3D-HEVC, etc), and to the corresponding decoding.
The current video coders (MPEG, H.264, HEVC, . . . ) use a block-wise representation of the video sequence. The images are split up into blocks, which might be split up again, for example in a recursive manner as in the HEVC standard.
For a current block to be coded, the image parameters associated with this block are coded in the form of bits with the aid of an adapted coding scheme implemented by a coder, such as for example an entropy coder whose aim is to code these parameters without loss.
Such parameters are for example:
The bits obtained after entropy coding are written into a data signal which is intended to be transmitted to the decoder.
Once the coded-data signal has been received by the decoder, the decoding is done image by image, and for each image, block by block. For each block, the bits representative of the image parameters associated with the block are read, and then decoded with the aid of a decoding scheme implemented by a decoder.
For each image type or format considered, a specific coding is implemented. Thus for example, the AVC and HEVC coders/decoders are adapted to code/decode 2D images arising from one and the same camera and following one another temporally. Such coders/decoders are also adapted to code/decode:
According to another example, the 3D-HEVC coders/decoders are adapted to code/decode 3D images, such as 3D images arising from various cameras oriented according to different views, corresponding texture components and depth components, images arising from a mono 360° video, etc. . . . .
By thus proposing a very specific type of coding/decoding for an image format or type considered, the coding/decoding performance obtained by current coders/decoders is not satisfactory.
The invention therefore envisages a coder/decoder which proposes to use two different coding/decoding schemes for a current image arising from a video content of a given type or format, while making it possible to optimize the coding/decoding performance for the current image.
One of the aims of the invention is to remedy drawbacks of the aforementioned prior art.
To this effect, a subject of the present invention relates to a method for coding an image split up into blocks, said image containing first and second distinct zones.
Such a coding method is noteworthy in that it implements the following, for at least one current block of the image:
Such a provision makes it possible within one and the same encoder to select a coding scheme which is best adapted to the way in which the scene that the image represents was initially captured.
For example, if the current image is a two-dimensional image, it is decided:
By virtue of the invention, it is thus possible to propose an adaptive coding of video contents which takes account of their format. Furthermore, for certain types of content format, the invention advantageously makes it possible to apply an adaptive coding to the current image according to the zone of the image to be coded at the current instant, at least one current block of a first zone being coded according to a first coding scheme, and at least one current block of a second zone of this image being coded according to a second coding scheme.
Advantageously, the second coding scheme used makes it possible to exploit the spatial correlations which exist between the second zone and the first zone of the current image, the value of at least one coding parameter of a block situated in the first zone being copied for a current block of the second zone. It is thus not necessary to code the value of such a coding parameter for the current block. This results in higher-performance coding of the image since it is more precise, less complex and less expensive in bitrate.
According to a particular embodiment, the second coding scheme is applied to all the blocks of the second zone of the current image.
Such a provision makes it possible to optimize the reduction in complexity and the reduction in cost in terms of bitrate of the coding implemented at the encoder.
According to another particular embodiment, the coding method implements the following:
Having regard to the fact that the first and second coding schemes are set into competition, though the second coding scheme has been initially applied to the encoder at the current block, the coding method is rendered more flexible, thereby improving the efficiency of the coding.
According to yet another particular embodiment, the first and second zones of the image have the same shape, the first zone being situated above the second zone and separated from the latter by a horizontal boundary extending along the middle of the image.
Such a spatial arrangement of the first and second zones of the current image makes it possible to optimize coding performance, by precisely predefining the location of an already coded and then decoded block of the first zone of the image, as a function of the position of the current block of the second zone.
The various aforementioned modes or characteristics of embodiment can be added independently or in combination with one another, to the operations implemented in the course of the coding method such as is defined hereinabove.
Correlatively, the invention relates to a device for coding at least one image split up into blocks, said image containing first and second distinct zones.
Such a coding device is noteworthy in that it comprises a processing circuit which is designed to implement the following, for at least one current block of the image:
In a corresponding manner, the invention also relates to a method for decoding a data signal representative of an image split up into blocks which has been coded, said at least one image containing first and second distinct zones.
Such a decoding method is noteworthy in that it implements the following, for at least one current block to be decoded of the image:
According to a particular embodiment, the second decoding scheme is applied to all the blocks of the second zone of the current image.
According to another particular embodiment, the second decoding scheme is applied to the current block of the second zone if, for the current block, an item of information in respect of selection of the second decoding scheme is read in the data signal, the first decoding scheme being applied to the current block of the second zone if, for the current block, an item of information in respect of selection of said first decoding scheme is read in the data signal.
According to yet another particular embodiment, the first and second zones of the image have the same shape, the first zone being situated above the second zone and separated from the latter by a horizontal boundary extending along the middle of the image.
The various aforementioned modes or characteristics of embodiment can be added independently or in combination with one another, to the operations implemented in the course of the decoding method such as is defined hereinabove.
Correlatively, the invention relates to a device for decoding a data signal representative of an image split up into blocks which has been coded, said at least one image containing first and second distinct zones.
Such a decoding device is characterized in that it comprises a processing circuit which is designed to implement the following, for at least one current block to be decoded of the image:
The invention further relates to a computer program comprising instructions for implementing one of the coding and decoding methods according to the invention, when it is executed on a computer.
Such a program can use any programming language, and be in the form of source code, object code, or of code intermediate between source code and object code, such as in a partially compiled form, or in any other desirable form.
Yet another subject of the invention also envisages a recording medium readable by a computer, and comprising computer program instructions, such as mentioned hereinabove.
The recording medium can be any entity or device capable of storing the program. For example, the medium can comprise a storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or else a magnetic recording means, a digital recording means, for example a USB key or a hard disk.
Moreover, such a recording medium can be a transmissible medium such as an electrical or optical signal, which can be conveyed via an electrical or optical cable, by radio or by other means. The program according to the invention can in particular be downloaded over a network of Internet type.
Alternatively, such a recording medium can be an integrated circuit in which the program is incorporated, the circuit being adapted to execute the method in question or to be used in the execution of the latter.
Other characteristics and advantages will become apparent on reading preferred embodiments described with reference to the figures in which:
A first embodiment of the invention will now be described, in which the coding method according to the invention is used to code an image or a sequence of images according to a binary stream close to that obtained by a coding implemented in a coder complying with any one of the current or forthcoming video coding standards.
In this embodiment, the coding method according to the invention is for example implemented in a software or hardware manner by modifications of such a coder. The coding method according to the first embodiment of the invention is represented in the form of an algorithm comprising operations C1 to C6a) or C1 to C6b) such as are represented in
According to the first embodiment of the invention, the coding method is implemented in a coding device or coder CO represented in
As illustrated in
The coding method represented in
The current image ICj arises from at least one video sequence comprising, by way of non-exhaustive examples:
With reference to
It should be noted that within the meaning of the invention, the term “block” signifies coding unit. The latter terminology is used notably in the HEVC standard “ISO/IEC/23008-2 Recommendation ITU-T H.265 High Efficiency Video Coding (HEVC)”.
In particular, such a coding unit groups together sets of pixels of rectangular or square shape, also called blocks, macroblocks, or else sets of pixels exhibiting other geometric shapes.
Said blocks B1, B2, . . . , Bu, . . . , BS are intended to be coded according to a predetermined order of traversal, which is for example of the lexicographic type. This signifies that the blocks are coded one after the other, from left to right.
Other types of traversal are of course possible. Thus, it is possible to split the image ICj into several sub-images called slices and to apply a splitting of this type independently to each sub-image. It is also possible to code not a succession of lines, as explained hereinabove, but a succession of columns. It is also possible to traverse the lines or columns in either direction.
According to an example, the blocks B1, B2, . . . , Bu, . . . , BS have a square shape and all contain K pixels, with K≤1. By way of non-exhaustive example, the blocks have a size of 64×64 pixels and/or 32×32 and/or 16×16 and/or 8×8 pixels.
As a function of the size of the image which is not necessarily a multiple of the size of the blocks, the last blocks on the left and the last blocks at the bottom might not be square. In an alternative embodiment, the blocks may be for example of rectangular size and/or not aligned with one another.
In an optional manner, as represented dashed in
The syntax element activateStereoReuse is a high-level syntax element of a video sequence comprising the current image ICj. To this effect, as a function of the coding context, this element can be coded:
The syntax element activateStereoReuse is intended to indicate the type of format of current image to be coded. According to a preferred embodiment, the syntax element activateStereoReuse is coded to the value 1 if the current image to be coded has been obtained by projection of a stereo video, 360°, 180° or other, and if the current image is composed of several views captured at the same temporal instant and arranged in the current image so as to form a single view (rectangle of pixels). A method for composing such an image uses for example the technique called “Frame Packing” (FP). The syntax element activateStereoReuse is on the other hand coded to the value 0 if the current image to be coded is of 2D type or else has been obtained by projection of a mono video, 360°, 180° or other.
The coding C2 is for example an entropy coding of CABAC (“Context Adaptive Binary Arithmetic Coding” in English) type or else an entropy coding of arithmetic or Huffman type. This coding is implemented by a coding device MC_C represented in
Such a coding C2 is not necessary in the case where the coder CO makes a distinction in an autonomous manner between:
In the subsequent description, it is considered that the current image to be coded has been obtained by projection of a stereo video, 360°, 180° or other, and that the current image is composed of several views captured at the same temporal instant and arranged in the current image so as to form a single view (rectangle of pixels).
With reference to
At C4, there is undertaken the location of the current block Bu of the image ICj for example by determining its coordinates with respect to the first pixel situated at the top left of the image ICj, and which has coordinates (0,0). The effect of such location is to determine whether the current block belongs to a first zone or a second zone of the current image ICj, the first and second zones being distinct. According to the invention, the first and second zones are distinct, in the sense that they do not overlap.
The location C4 is implemented by a calculation device CAL1_C such as represented in
According to a first embodiment represented in
According to a second embodiment represented in
According to a third embodiment represented in
Other configurations are of course possible. For example, the zones Z1 and Z2 may be swapped. Furthermore the zones Z1 and Z2 may or may not have the same shape.
If the current block Bu belongs to the first zone Z1 of the image ICj, with reference to
With reference to
In a manner known per se, the current block Bu is predicted with respect to a plurality of candidate predictor blocks. Each of the candidate predictor blocks is a block of pixels which has been already coded and then decoded.
On completion of the prediction C51a), an optimal predictor block BPopt is obtained subsequent to a setting into competition of said predetermined prediction techniques, according to a predetermined coding performance criterion, for example by minimizing a distortion bitrate criterion well known to the person skilled in the art. The block BPopt is considered to be an approximation of the current block Bu. The information relating to this prediction is intended to be written, in the form of syntax elements, into a data signal or stream to be transmitted to a decoder.
There is thereafter undertaken conventionally at C52a) the comparison of the data relating to the current block Bu with the data of the predictor block BPopt. Such a comparison consists in calculating the difference between the predictor block obtained BPopt and the current block Bu.
A data set, called residual block Bru, is then obtained.
The operations C51a) and C52a) are implemented by a predictive coding device PRED_C represented in
With reference again to
According to a nonlimiting exemplary embodiment, such a coding C53a) implements the application C531a) of a transform to the pixels of the current residual block Bru.
In a manner known per se, as a function of the context or of the coding standard used, such a transform is for example a transform of DCT (English abbreviation of “Discrete Cosine Transform”), DST (English abbreviation of “Discrete Sine Transform”) type, of DWT (English abbreviation of “Discrete Wavelet Transform”) type or else of LT (English abbreviation of “Lapped Transform”) type. These transforms are stored previously in a list LTS1, in the buffer memory MT_C of the coder CO of
On completion of the application of this transform, a current transformed data block Btu is obtained.
Such an operation is performed by a transform calculation device MTR_C, such as represented in
The coding C53a) furthermore implements a quantization C532a) of the data of the transformed block Btu according to a conventional quantization operation, such as for example a scalar or vector quantization. A block Bqu of quantized coefficients is then obtained.
The quantization C532a) is implemented by a quantization device MQ_C such as represented in
The transform calculation device MTR_C and the quantization device MQ_C are contained in a device for coding blocks MCB_C which is represented in
The coding C53a) furthermore implements a coding C533a) of the data of the block Bqu of quantized coefficients. The coding C533a) is implemented by the coding device MC_C of
With reference to
In accordance with the invention, the stream F optionally contains the value 0/1 of the syntax element activateStereoReuse, if the latter is coded at the image level.
The construction of the stream F is implemented by a data signal construction device MCF, such as represented in
If on completion of the location C4, the current block Bu belongs to the second zone Z2 of the image ICj, there is undertaken at C5b) the coding of the current block with the aid of a second coding scheme MC2. According to the first embodiment, the second coding scheme MC2 is applied to any current block situated in the second zone Z2.
According to the invention, with reference to
The identification C51b) is implemented by a calculation device CAL2_C such as represented in
According to a preferred embodiment, if the current block which has been located in the second zone Z2 has its first pixel at the top left which has coordinates (xu, Yu) in the current image ICj, then a reference block B′ref is determined in the first zone Z1, as being the block whose first pixel p′ref at the top left has coordinates (x′ref, y′ref), such that x′ref=xu and y′ref=yu−h/2, where h is the height of the current image ICj.
Of course, there exist other schemes for selecting the neighboring reference block, when the block B′ref overlaps neighboring reference blocks in the first zone Z1 of the current image ICj.
According to another example, in the case of
According to yet another exemplary embodiment, the reference block B′ref is determined in the first zone Z1, as being the block which contains the pixel with coordinates x′ref=xc and y′ref=yc−h/2, where (xc, yc) are the coordinates of the center of the current block.
The reference block Bref having been identified in the first zone Z1, with reference to
The reading C52b) is implemented by a reading device LEC_C such as represented in
By way of non-exhaustive examples, the list LST2 contains a number K of coding parameters PRC1, PRC2, . . . , PRCK associated with the identified reference block Bref, among which are:
In the course of the reading C52b), one or more of the aforementioned coding parameters associated with the block Bref may thus be read.
With reference to
According to one embodiment, there is undertaken at C54b) the coding of a syntax element ES_PRC1 which indicates whether or not the coding parameter PRC1 of the reference block Bref is a parameter whose value has been copied for the current block.
The coding C54b) is for example an entropy coding of CABAC type or else an entropy coding of arithmetic or Huffman type. This coding is implemented by the coding device MC_C of
For example, the syntax element ES_PRC1 is coded:
In the case where the syntax element ES_PRC1 is coded to the value 0, the coding parameter PRC1 is coded in a conventional manner.
According to one embodiment, in the course of the coding C54b), K syntax elements ES_PRC1, ES_PRC2, . . . , ES_PRCK are coded, these indicating whether or not each of the coding parameters PRC1, PRC2, . . . , PRCK associated with the reference block Bref is a parameter whose value has been copied for the current block.
Of course, it may be decided to code only some of the K syntax elements hereinabove. According to one embodiment, by assuming that the syntax element activateStereoReuse has been coded at C2 to the value 1, the binary sequence 1101 signifies for example that:
With reference to
The signal portion F also contains all the data of the current block which have been coded in a conventional manner.
In accordance with the invention, the stream F optionally contains the value 0/1 of the syntax element activateStereoReuse, if the latter is coded at the image level.
The data signal F is thereafter transmitted by a communication network (not represented) to a remote terminal. The latter comprises the decoder DO represented in
According to the first embodiment which has just been described with reference to
We shall now describe a second embodiment of the coding method according to the invention, with reference to
According to this second embodiment of the invention, the coding method is implemented in a coding device or coder CO′ represented in
According to the second embodiment, the first coding scheme MC1 is applied to any current block situated in the first zone Z1, exactly in the same way as in the first embodiment of
With reference to
The setting into competition C200b) is implemented by a calculation device CPT such as represented in
On completion of the setting into competition C200b), an optimal coding scheme MCopt is obtained, such that MCopt=MC1 or MCopt=MC2. A syntax element ES_MCopt is then coded at C300b).
The coding C300b) is for example an entropy coding of CABAC type or else an entropy coding of arithmetic or Huffman type. This coding is implemented by the coding device MC_C of
For example, the syntax element ES_MCopt is coded:
With reference to
The signal portion F′ is thereafter transmitted by a communication network (not represented) to a remote terminal. The latter comprises the decoder DO represented in
According to the second embodiment of the coding method which has just been described:
A first embodiment of the invention will now be described, in which the decoding method according to the invention is used to decode a data signal or stream representative of an image or of a sequence of images which is able to be decoded by a decoder complying with any one of the current or forthcoming video decoding standards.
In this embodiment, the decoding method according to the invention is for example implemented in a software or hardware manner by modifications of such a decoder.
The decoding method according to the first embodiment of the invention is represented in the form of an algorithm comprising operations D1 to D7a) or D1 to D7b) such as represented in
According to this first embodiment, the decoding method according to the invention is implemented in a decoding device or decoder DO represented in
As illustrated in
The decoding method represented in
The current image ICj to be decoded arises from at least one video sequence comprising, by way of non-exhaustive examples:
In an optional manner, as represented dashed in
According to a preferred embodiment, the syntax element activateStereoReuse which is read takes for example:
The reading D1 is implemented by a stream analysis device PARS_D, such as represented in
In case of identification, with reference to
Such a decoding D2 is implemented by a decoding device MD_D represented in
The decoding is for example an entropy decoding of CABAC type or else an entropy decoding of arithmetic or Huffman type.
Such a decoding D2 is not necessary in the case where the decoder DO makes a distinction in an autonomous manner between:
In the subsequent description, it is considered that the current image to be decoded has been obtained by projection of a stereo video, 360°, 180° or other, and that the current image is composed of several views captured at the same temporal instant and arranged in the current image so as to form a single view (rectangle of pixels).
With reference to
Such an identification D3 is implemented by the stream analysis device PARS_D of
Other types of traversal than that which has just been described hereinabove are of course possible and depend on the order of traversal chosen on coding.
According to an example, the blocks B1, B2, . . . , Bu, . . . , BS have a square shape and all contain K pixels, with K≥1. By way of non-exhaustive example, the blocks have a size of 64×64 pixels and/or 32×32 and/or 16×16 and/or 8×8 pixels.
As a function of the size of the image which is not necessarily a multiple of the size of the blocks, the last blocks on the left and the last blocks at the bottom might not be square. In an alternative embodiment, the blocks may be for example of rectangular size and/or not aligned with one another.
With reference to
At D5, there is undertaken the location of the current block Bu to be decoded of the image ICj, for example by determining its coordinates with respect to the first reconstructed pixel of the image ICj, which pixel is situated at the top left of the latter and has coordinates (0,0).
The location D5 is implemented by a calculation device CAL1_D such as represented in
If the current block Bu belongs to the first zone Z1 of the image ICj, with reference to
With reference to
On completion of the decoding D61a), the predictor block BPopt associated with the decoded index is obtained.
The coded data DCu of the current block Bu are decoded at D62a). Such a decoding is implemented by a device for decoding blocks MDB_D which is represented in
The decoding D62a) implements, at D621a), a decoding of the data DCu associated with the current block Bu to be decoded and which have been coded at C5a) in
The decoding D621a) is implemented by the decoding device MD_D represented in
The decoding D62a) furthermore implements a dequantization D622a) of the block of quantized coefficients Bqu, according to a conventional dequantization operation which is the operation inverse to the quantization C532a) of
The decoding D62a) furthermore implements the application D623a) of a transform to the current set of dequantized coefficients BDqu obtained at D622a). In a manner known per se, such a transform is a transform inverse to that applied to the coding at C531a) in
The type of transform to be applied can be determined at the decoder conventionally, by reading, in the data signal F, the index of the transform applied to the coding.
The transform application D623a) is performed by a transform calculation device MTR−1_D, such as represented in
The inverse quantization device MQ−1_D and the transform calculation device MTR−1_D are contained in a device for decoding blocks MDB_D which is represented in
A current decoded residual block BDru is obtained on completion of the decoding D62a) of the data of the current block.
With reference to
The operation D63a) is implemented by a predictive decoding device PRED_D represented in
A current decoded block BDu is obtained on completion of the operation D63a).
With reference again to
The writing D7a) is implemented by an image reconstruction device URI such as represented in
With reference to
According to the invention, with reference to
The identification D61b) is implemented by a calculation device CAL2_D such as represented in
According to a preferred embodiment, if the current block which has been located in the second zone Z2 has its first pixel at the top left which has coordinates (xu, Yu) in the current image ICj, then a reference block B′ref is determined in the first zone Z1, as being the block whose first pixel p′ref at the top left has coordinates (X′ref, y′ref), such that x′ref=xu and y′ref=yu−h/2, where h is the top of the current image ICj.
Examples of determination of the reference block B′ref have already been explained with reference to
The reference block Bref having been identified in the first zone Z1, with reference to
There is then undertaken at D63b) the decoding of the syntax element ES_PRC1.
The decoding D63b) is for example an entropy decoding of CABAC type or else an entropy decoding of arithmetic or Huffman type. This decoding is implemented by the coding device MD_D of
For example:
According to one embodiment, in the course of the coding D63b), K syntax elements ES_PRC1, ES_PRC2, . . . , ES_PRCK are decoded, these indicating whether or not each of the coding parameters PRC1, PRC2, . . . , PRCK associated with the reference block Bref is a parameter whose value has been copied during the coding of the current block.
Of course, it may be decided to decode only some of the K syntax elements hereinabove if only some of the K syntax elements have been coded on coding at C54b) (
With reference to
By way of non-exhaustive example, the list LST2 of the decoder DO of
With reference to
On completion of the application of the second decoding scheme MD2 to the current block, a current decoded block BDu is obtained.
The image reconstruction device URI of
According to the first embodiment which has just been described with reference to
We shall now describe a second embodiment of the decoding method according to the invention, with reference to
According to this second embodiment of the invention, the decoding method is implemented in a decoding device or decoder DO′ represented in
According to the second embodiment, the first decoding scheme MD1 is applied to any current block situated in the first zone Z1, exactly in the same way as in the first embodiment of
There is then undertaken at D200b) the decoding of the syntax element ES_MCopt.
The decoding D200b) is for example an entropy decoding of CABAC type or else an entropy decoding of arithmetic or Huffman type. This decoding is implemented by the coding device MD_D of
If the decoded value of the syntax element ES_MCopt is equal to 1, the current block is decoded with the aid of the second decoding scheme MD2, exactly in the same way as at D5b) in
If the decoded value of the syntax element ES_MCopt is equal to 0, the current block is decoded at D300b) with the aid of the first decoding scheme MD1 which has been applied to each current block of the first zone Z1 of the current image, exactly in the same way as at D5a) in
The decoding scheme MD1 is for example the decoding scheme represented in
On completion of the application of the first decoding scheme MD1 or of the second decoding scheme MD2 to the current block, a current decoded block BDu is obtained.
The image reconstruction device URI of
According to the second embodiment which has just been described with reference to
It goes without saying that the embodiments which have been described hereinabove have been given purely by way of wholly nonlimiting indication, and that numerous modifications can easily be made by the person skilled in the art without however departing from the scope of the invention.
Number | Date | Country | Kind |
---|---|---|---|
1756317 | Jul 2017 | FR | national |
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/FR2018/051579 | 6/28/2018 | WO | 00 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2019/008253 | 1/10/2019 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
6215898 | Woodfill et al. | Apr 2001 | B1 |
20140028793 | Wiegand et al. | Jan 2014 | A1 |
20140092998 | Zhu et al. | Apr 2014 | A1 |
20140098189 | Deng et al. | Apr 2014 | A1 |
20140354771 | Wang | Dec 2014 | A1 |
20160234510 | Lin et al. | Aug 2016 | A1 |
20160330471 | Zhu et al. | Nov 2016 | A1 |
20160353117 | Seregin et al. | Dec 2016 | A1 |
20170134743 | Sim et al. | May 2017 | A1 |
20170310994 | Seo et al. | Oct 2017 | A1 |
20180302645 | Laroche et al. | Oct 2018 | A1 |
Entry |
---|
International Search Report dated Oct. 9, 2018, for corresponding International Application No. PCT/FR2018/051579, filed Jun. 28, 2018. |
English translation of the International Written Opinion dated Oct. 22, 2018, for corresponding International Application No. PCT/FR2018/051579, filed Jun. 28, 2018. |
International Search Report dated Oct. 9, 2018, for corresponding International Application No. PCT/FR2018/051580 filed Jun. 28, 2018. |
English translation of the International Written Opinion dated Oct. 22, 2018, for corresponding International Application No. PCT/FR2018/051580, filed Jun. 28, 2018. |
Laroche G. et al., “AHG10: On IBC memory reduction”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 20th Meeting: Geneva, CH, 10-18, Document JCTVC-T0051, dated Feb. 9, 2015. |
Ralf Schäfer et al., “The Emerging H.264/AVC Standard”, Audio/Vido Coding, EBU Technical Review—Jan. 2003. |
Corrected Notice of Allowance dated Jun. 14, 2021 for corresponding U.S. Appl. No. 16/628,486, filed Jan. 3, 2020. |
Final Office Action dated Dec. 16, 2020 for corresponding U.S. Appl. No. 16/628,470, filed Jan. 3, 2020. |
Final Office Action dated Dec. 14, 2020 for corresponding U.S. Appl. No. 16/628,486, filed Jan. 3, 2020. |
Notice of Allowance dated Apr. 27, 2021 for corresponding U.S. Appl. No. 16/628,486, filed Jan. 3, 2020. |
Office Action dated May 27, 2021 for U.S. Appl. No. 16/628,470, filed Jan. 3, 2020. |
ISO/IEC/23008-2 Recommendation ITU-T H.265 High Efficiency Video Coding (HEVC). |
Office Action dated Jun. 19, 2020 for corresponding U.S. Appl. No. 16/628,486, filed Jan. 3, 2020. |
Office Action dated Jul. 13, 2020 for corresponding U.S. Appl. No. 16/628,470, filed Jan. 3, 2020. |
International Search Report dated Jan. 8, 2019 for corresponding International Application No. PCT/FR2018/051581, filed Jun. 28, 2018. |
Written Opinion of the International Searching Authority dated Jan. 8, 2019 for corresponding International Application No. PCT/FR2018/051581, filed Jun. 28, 2018. |
English translation of the Written Opinion of the International Searching Authority dated Jan. 18, 2019 for corresponding International Application No. PCT/FR2018/051581, filed Jun. 28, 2018. |
Shan Liu et al., “Overview of HEVC extensions on screen content coding”, 11-15 APSIPA Transactions on Signal and Information Processing, vol. 4, Jan. 1, 2015 (Jan. 1, 2015), XP055454972. |
Gary J. Sullivan et al., “Overview of the High Efficiency Video Coding (HEVC) Standard”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, No. 12, Dec. 2012. |
Detlev Marpe, Heiko Schwarz, and Thomas Wiegand “Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, No. 7, Jul. 2003. |
Samelak Jaroslaw et al:., “Efficient frame-compatible stereoscopic video coding using HEVC screen content coding”, 2017 International Conference on Systems, Signals and Image Processing (IWSSIP), IEEE, May 22, 2017 (May 22, 2017), pp. 1-5, XP033112648. |
“Chen Y et al., ““AHG10: Motion related hooks for HEVC multiview/3DV extension based on long-term reference pictures””, 10. JCT-VC Meeting; 101. MPEG Meeting; Jul. 11, 2012-Jul. 20, 2012, Stockholm, (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-T SG.16 );URL: http://wftp3.itu.int/av-arch/jctvc-site/,, No. JCTVC-J0121. Jul. 3, 2012 (Jul. 3, 2012), XP030112483.” |
“Chen Y et al., ““Test Model 11 of 3D-HEVC and MV-HEVC””, 11. JCT-3V Meeting; Feb. 12, 2015-Feb. 18, 2015; Geneva; (The Joint Collaborative Team on 3D Video Coding Extension Development OFISO/IEC JTC1/SC29/WG11 and ITU-T SG.16 ); URL: http://phenix.int-evry.fr/jct2/,, No. JCT3V-K1003, May 1, 2015 (May 1, 2015), XP030132748.” |
Philipp Helle et al., “BLock Merging for Quadtree-Based Partitioning in HEVC”, IEEE Transaction on Circuits and Systems for Video Technology, Institut of Electrical and Electronics Engineers, USA, vol. 22, No. 12, Dec. 1, 2012 (Dec. 1, 2012), pp. 1720-1731, XP011487155. |
Anonymous: “Study Text of ISO/IEC 14496-10:200X/FPDAM 1”, 88. MPEG Meeting; Apr. 20, 2009-Apr. 24, 2009; MAUI; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11),, No. N10540, Apr. 25, 2009 (Apr. 25, 2009), XP030017039. |
Li B. et al., “Non-SCCE1: Unification of intro BC and inter modes”, 18. JCT-VC Meeting; Jun. 30, 2014-Jul. 9, 2014; Sapporo; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-T SG.16); URL: Http://WFTP3.ITU.INT/AV-ARCH/JCTVC-SITE/,, No. JCTVC-R0100-v2, Jun. 29, 2014 (Jun. 29, 2014), XP030116357. |
Jaroslaw Samelak et al., “Experimental Results for Frame Compatible Multiview Video Coding Using HEVC SCC” 26. JCT-VC Meeting; Jan. 12, 2017-Jan. 20, 2017; Geneva; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-T SG.16); URL: Http://WFTP3.ITU.INT/AV-ARCH/JCTVC-SITE/,, No. JCTVC-Z0041, Jan. 13, 2017 (Jan. 13, 2017), XP030118149. |
Notice of Allowance dated Oct. 25, 2021 for corresponding U.S. Appl. No. 16/628,470, filed Jan. 3, 2020. |
Number | Date | Country | |
---|---|---|---|
20200128251 A1 | Apr 2020 | US |