Abstract: Methods and apparatus of encoding/decoding point cloud geometry may use data sensed by at least one sensor associated with a sensor index. The point cloud geometry data is represented by ordered coarse points occupying some discrete positions of a set of discrete positions of a two-dimensional space, each occupied coarse point is associated with a radius based on a distance of the point of the point cloud from a referential. The encoding/decoding method comprises encoding/decoding a data representative of a predicting radius, and encoding, into the bitstream, a residual radius between a radius associated with an occupied coarse point and the predicting radius.

Abstract: A method of encoding a motion vector predictor index, in particular a Merge index, comprises generating a list of motion vector predictor candidates, in particular merge candidates. The list includes an ATMVP candidate. One of the motion vector predictor candidates in the list is selected. A motion vector predictor index for the selected motion vector predictor candidate is generated using CABAC coding. One or more bits of the motion vector predictor index are bypass CABAC coded. For example, only the first bit of the motion vector predictor index is CABAC coded using a single context.

Abstract: A method of encoding point cloud data using a planar coding mode is disclosed. The planar coding mode may be signaled using a planar mode flag to signal that a current volume is planar. A volume is planar if all of its occupied child nodes are on one side of a plane bisecting the volume. A planar position flag may signal which side of the volume is occupied. Volume data for already-coded occupied volumes of the point cloud is tracked using a data structure stored in memory. Entropy coding may be used to code the planar mode flag and/or the planar position flag. Context determination for coding may take into account a distance between the volume and a closest already-coded occupied volume among those tracked already-coded occupied volumes that have a same index in the data structure as the current volume.

Abstract: A method of encoding a motion vector predictor index, in particular a Merge index, comprises generating a list of motion vector predictor candidates, in particular merge candidates. The list includes an ATMVP candidate. One of the motion vector predictor candidates in the list is selected. A motion vector predictor index for the selected motion vector predictor candidate is generated using CABAC coding. One or more bits of the motion vector predictor index are bypass CABAC coded. For example, only the first bit of the motion vector predictor index is CABAC coded using a single context.

Abstract: A method and apparatus is capable of encoding and decoding a point cloud sensed by any type of sensor following a sensing path. The method obtains coarse representations of sensed points and encodes controls points of a two-dimensional curve representing the sensing path and the coarse representations. The control points are decoded, the two-dimensional curve representing the sensing path is obtained by interpolation between the control points and coarse representations of points are decoded. Points of the point cloud are then reconstructed from the decoded two-dimensional curve representing the sensing path and the decoded coarse representations.

Abstract: A method of encoding, into a bitstream, point cloud geometry data sensed by at least one sensor associated with a sensor index, includes: obtaining a list of candidate radiuses (L={r2}) for a first occupied coarse point (P1) having a first sensor index (?1), a first sample index (s1) and being associated with a first radius (r1); selecting, for the first occupied coarse point (P1), a selected predicting radius (rpred) from the list of candidate radiuses (L={r2}); encoding, in the bitstream, a data (Ipred) representative of the selected predicting radius (rpred) in the list of candidate radiuses (L={r2}); and predictively encoding, in the bitstream, a residual radius (rres) between the first radius (r1) and the selected predicting radius (rpred).

Abstract: A method of filtering a block of pixels in an image, comprising obtaining a first clipping control parameter (tc) value based on a quantization parameter of the block; comparing a first value of a first pixel located on one side of an edge in said block and a second value of a second pixel located on the other side of the edge in said block with a predetermined threshold derived from the first clipping control parameter value; and determining whether to apply a strong filtering to the first pixel based on the result of the comparison, wherein: the strong filtering comprises filtering the first pixel value so that the filtered first pixel value differs from the first pixel value by no more than a range value based on the clipping control parameter (tc), the ration between two range values corresponding to successive values of bitdepths being strictly lower than 2.

Abstract: A method of filtering a block of pixels in an image, comprising obtaining a first clipping control parameter (tc) value based on a quantization parameter of the block; comparing a first value of a first pixel located on one side of an edge in said block and a second value of a second pixel located on the other side of the edge in said block with a predetermined threshold derived from the first clipping control parameter value; and determining whether to apply a strong filtering to the first pixel based on the result of the comparison, wherein: the strong filtering comprises filtering the first pixel value so that the filtered first pixel value differs from the first pixel value by no more than a range value based on the clipping control parameter (tc), the ration between two range values corresponding to successive values of bitdepths being strictly lower than 2.

Abstract: A method of filtering a block of pixels in an image, comprising obtaining a first clipping control parameter (tc) value based on a quantization parameter of the block; comparing a first value of a first pixel located on one side of an edge in said block and a second value of a second pixel located on the other side of the edge in said block with a predetermined threshold derived from the first clipping control parameter value; and determining whether to apply a strong filtering to the first pixel based on the result of the comparison, wherein: the strong filtering comprises filtering the first pixel value so that the filtered first pixel value differs from the first pixel value by no more than a range value based on the clipping control parameter (tc), the ration between two range values corresponding to successive values of bitdepths being strictly lower than 2.

Abstract: A method of filtering a block of pixels in an image, comprising obtaining a first clipping control parameter (tc) value based on a quantization parameter of the block; comparing a first value of a first pixel located on one side of an edge in said block and a second value of a second pixel located on the other side of the edge in said block with a predetermined threshold derived from the first clipping control parameter value; and determining whether to apply a strong filtering to the first pixel based on the result of the comparison, wherein: the strong filtering comprises filtering the first pixel value so that the filtered first pixel value differs from the first pixel value by no more than a range value based on the clipping control parameter (tc), the ratio between two range values corresponding to successive values of bitdepths being strictly lower than 2.

Abstract: Methods and devices for coding point cloud data using volume trees and predicted-point trees. In one embodiment of the disclosure, a method of encoding a point cloud data to generate a bitstream of compressed point cloud data representing a three-dimensional location of a physical object is provided, the point cloud data being located within a volumetric space. The method includes compressing a first part of the point cloud data represented by a first tree of a first type; determining for a given node of the first tree if an assignation to a second type of tree is enabled, said given node still being processed for the first tree; when the assignation is enabled, compressing a second part of the point cloud data represented by a second tree of the second type wherein, features associated with a root node of the second tree are at least partially obtained from the given node.

Abstract: A method of encoding a motion information predictor index for an Affine Merge mode, comprising: generating a list of motion information predictor candidates; selecting one of the motion information predictor candidates in the list as an Affine Merge mode predictor; and generating a motion information predictor index for the selected motion information predictor candidate using CABAC coding, one or more bits of the motion information predictor index being bypass CABAC coded.

Abstract: Methods and devices for coding point cloud data using volume trees and predicted-point trees. In one embodiment of the disclosure, a method of encoding a point cloud data to generate a bitstream of compressed point cloud data representing a three-dimensional location of a physical object is provided, the point cloud data being located within a volumetric space. The method includes compressing a first part of the point cloud data represented by a first tree of a first type; determining for a given node of the first tree if an assignation to a second type of tree is enabled, said given node still being processed for the first tree; when the assignation is enabled, compressing a second part of the point cloud data represented by a second tree of the second type wherein, features associated with a root node of the second tree are at least partially obtained from the given node.

Abstract: Methods and devices for coding point clouds using direct coding mode to code coordinates of a point within a sub-volume associated with a current node instead of a pattern of occupancy for child nodes. When direct coding is applied to two or more points in the sub-volume, the points are ordered based on one of their respective coordinate values in binary and pairwise coding of those coordinate values is carried out on a bit-by-bit basis starting from the most significant bit position. For example, the coordinate values relate to a direction in the Cartesian coordinate system, the location of the first point is represented by an x-direction coordinate value, a y-direction coordinate value and a z-direction coordinate value. The pairwise coding includes coding whether the bits are the same and, if so, coding the bit value.

Abstract: A method and apparatus for encoding/decoding a point cloud may use any type of sensor following a sensing path. The method obtains coarse representations of sensed points and encodes the sensing path and the coarse representations. The sensing path and coarse representations of points are decoded, and points of the point cloud are reconstructed from the decoded sensing path and the decoded coarse representations.

Abstract: A method of controlling an Adaptive Loop Filter comprises obtaining for a slice containing one or more coding tree blocks, data indicating a number of available alternative chroma filters, obtaining for a coding tree block in the slice, an alternative filter index identifying one of the available alternative chroma filters, and selecting the alternative chroma filter identified by the index to filter chroma image data in the coding tree block.

Abstract: A method of controlling an Adaptive Loop Filter comprises obtaining for a slice containing one or more coding tree blocks, data indicating a number of available alternative chroma filters, obtaining for a coding tree block in the slice, an alternative filter index identifying one of the available alternative chroma filters, and selecting the alternative chroma filter identified by the index to filter chroma image data in the coding tree block.

Abstract: A method of controlling an Adaptive Loop Filter comprises obtaining for a slice containing one or more coding tree blocks, data indicating a number of available alternative chroma filters, obtaining for a coding tree block in the slice, an alternative filter index identifying one of the available alternative chroma filters, and selecting the alternative chroma filter identified by the index to filter chroma image data in the coding tree block.

Abstract: The method of encoding/decoding a point cloud sensed by any type of sensor following a sensing path obtains coarse representations of sensed points and encodes the sensing path and the coarse representations. The sensing path and coarse representations of points are decoded, and points of the point cloud are reconstructed from the decoded sensing path and the decoded coarse representations. The coarse representations of sensed points of the point cloud are coarse points defined in a two-dimensional angular coordinate space, and a coarse point is obtained by shifting a sensing point in the two-dimensional angular coordinate space with shifting values that depend on the sensor index associated with the sensor that sensed the point P of the point cloud.

Abstract: A method of controlling an Adaptive Loop Filter comprises obtaining for a slice containing one or more coding tree blocks, data indicating a number of available alternative chroma filters, obtaining for a coding tree block in the slice, an alternative filter index identifying one of the available alternative chroma filters, and selecting the alternative chroma filter identified by the index to filter chroma image data in the coding tree block.