EP3514966A1 - Procédés et dispositifs de codage entropique binaire de nuages de points - Google Patents

Procédés et dispositifs de codage entropique binaire de nuages de points Download PDF

Info

Publication number
EP3514966A1
EP3514966A1 EP18290112.4A EP18290112A EP3514966A1 EP 3514966 A1 EP3514966 A1 EP 3514966A1 EP 18290112 A EP18290112 A EP 18290112A EP 3514966 A1 EP3514966 A1 EP 3514966A1
Authority
EP
European Patent Office
Prior art keywords
occupancy
nodes
sub
neighbouring
point cloud
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
EP18290112.4A
Other languages
German (de)
English (en)
Other versions
EP3514966B1 (fr
Inventor
Sébastien Lasserre
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.)
BlackBerry Ltd
Original Assignee
BlackBerry 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 BlackBerry Ltd filed Critical BlackBerry Ltd
Priority to EP23169774.9A priority Critical patent/EP4231241A1/fr
Publication of EP3514966A1 publication Critical patent/EP3514966A1/fr
Priority to KR1020217010900A priority patent/KR102690193B1/ko
Priority to JP2021517937A priority patent/JP7504086B2/ja
Priority to US17/280,750 priority patent/US12020460B2/en
Priority to CN201980065237.9A priority patent/CN112789804B/zh
Priority to PCT/EP2019/076710 priority patent/WO2020070191A1/fr
Application granted granted Critical
Publication of EP3514966B1 publication Critical patent/EP3514966B1/fr
Priority to JP2024094293A priority patent/JP2024114718A/ja
Priority to US18/750,557 priority patent/US20240346708A1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/4031—Fixed length to variable length coding
    • H03M7/4037—Prefix coding
    • H03M7/4043—Adaptive prefix coding
    • H03M7/405—Tree adaptation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/10—Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/001—Model-based coding, e.g. wire frame
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6005—Decoder aspects
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/60—General implementation details not specific to a particular type of compression
    • H03M7/6011—Encoder aspects
    • 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/102—Methods 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/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection 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
    • 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/102—Methods 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/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • 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/169—Methods 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/1883—Methods 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 relating to sub-band structure, e.g. hierarchical level, directional tree, e.g. low-high [LH], high-low [HL], high-high [HH]
    • 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
    • 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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
    • 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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2207/00—Indexing scheme for image analysis or image enhancement
    • G06T2207/10—Image acquisition modality
    • G06T2207/10028—Range image; Depth image; 3D point clouds
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/005—Statistical coding, e.g. Huffman, run length coding
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/40—Tree coding, e.g. quadtree, octree

Definitions

  • the present application generally relates to point cloud compression and, in particular to methods and devices for binary entropy coding of point clouds.
  • Three-dimensional objects or spaces may be represented using a point cloud, which is a set of points each having a three coordinate location (X, Y, Z) and, in some cases, other attributes like colour data (e.g . luminance and chrominance), transparency, reflectance, normal vector, etc.
  • Point clouds can be static (a stationary object or a snapshot of an environment/object at a single point in time) or dynamic (a time-ordered sequence of point clouds).
  • Example applications for point clouds include topography and mapping applications.
  • Autonomous vehicle and other machine-vision applications may rely on point cloud sensor data in the form of 3D scans of an environment, such as from a LiDAR scanner.
  • Virtual reality simulations may rely on point clouds.
  • point clouds can involve large quantities of data and compressing (encoding and decoding) that data quickly and accurately is of significant interest. Accordingly, it would be advantageous to provide for methods and devices that more efficiently and/or effectively compress data for point clouds. Moreover, it would be advantageous to find methods and devices for coding point clouds that can be implemented using context-adaptive binary entropy coding without requiring the management of an excessive number of contexts.
  • a bit sequence signalling an occupancy pattern for sub-volumes of a volume may be coded using entropy coding (e.g., binary entropy coding). Probabilities associated with respective entropy coders for use in the entropy coding the occupancy pattern may be selected based on occupancy data for neighbouring sub-volumes of a current sub-volume and further based on occupancy data for child sub-volumes of at least one of the neighbouring sub-volumes.
  • entropy coding e.g., binary entropy coding
  • contexts may be based on neighbour configuration and a partial sequence of previously-coded bits of the bit sequence.
  • a determination may be made as to whether to apply a context reduction operation and, if so, the operation reduces the number of available contexts.
  • Example context reduction operations include reducing neighbour configurations based on shielding by sub-volumes associated with previously-coded bits, special handling for empty neighbour configurations, and statistics-based context consolidation. The reduction may be applied in advance of coding and a determination may be made during coding as to whether the circumstances for using a reduced context set are met.
  • the present application provides a method of encoding a point cloud to generate a bitstream of compressed point cloud data, the point cloud being defined in a tree structure having a plurality of nodes having parent-child relationships and that represent the geometry of a volumetric space recursively split into sub-volumes and containing the points of the point cloud.
  • the method includes, for a current node associated with a sub-volume split into further sub-volumes, each further sub-volume corresponding to a child node of the current node, determining an occupancy pattern for the current node based on occupancy statuses of the child nodes.
  • the method further includes selecting one or more probabilities associated with respective entropy coders for entropy encoding the occupancy pattern, wherein the selecting is based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one of the plurality of neighbouring nodes.
  • the method further includes entropy encoding the occupancy pattern based on the selected one or more probabilities, using the associated one or more entropy coders, to produce encoded data for the bitstream.
  • the present application provides a method of decoding a bitstream of compressed point cloud data to produce a reconstructed point cloud, the point cloud being defined in a tree structure having a plurality of nodes having parent-child relationships and that represent the geometry of a volumetric space recursively split into sub-volumes and containing the points of the point cloud.
  • the method includes, for a current node associated with a sub-volume split into further sub-volumes, each further sub-volume corresponding to a child node of the current node, selecting one or more probabilities associated with respective entropy coders for entropy decoding the occupancy pattern, wherein the selecting is based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data of child nodes of at least one of the plurality of neighbouring nodes.
  • the method further includes entropy decoding the bitstream based on the selected one or more probabilities, using the one or more associated entropy coders, to produce a reconstructed occupancy pattern for the current node signalling occupancy of the child nodes.
  • the selecting the one or more probabilities may be based on a neighbouring configuration that is determined based on an occupancy status of each of the neighbouring nodes of the current node.
  • a neighbouring node of the current node may be considered as occupied for the purpose of determining the neighbouring configuration if its occupancy data indicates that it is occupied and the occupancy data for its child nodes indicates that at least one of its occupied child nodes neighbours the current node.
  • a neighbouring node of the current node may be considered as not occupied for the purpose of determining the neighbouring configuration if its occupancy data indicates that it is occupied and the occupancy data for its child nodes indicates that none of its occupied child nodes neighbours the current node. This may correspond to (deliberately/artificially) setting the occupancy bit for that neighbouring node to zero in the determination of the neighbouring configuration.
  • a neighbouring node of the current node may be considered as occupied for the purpose of determining the neighbouring configuration if its occupancy data indicates that it is occupied and if it has not yet been coded.
  • the decoder has not yet information on the occupancy of its child nodes, thus such information cannot be used in considering the neighbouring node as occupied or not for the purpose of determining the neighbouring configuration.
  • a neighbouring node of the current node may be considered as not occupied for the purpose of determining the neighbouring configuration if its occupancy data indicates that it is not occupied.
  • the neighbouring nodes of the current nodes may be those nodes that are at the same depth in the tree structure as the current node and whose associated sub-volumes intersect the sub-volume of the current node.
  • child nodes neighbouring the current node may be those nodes that are at a lower depth by one in the tree structure than the current node and whose associated sub-volumes intersect the sub-volume of the current node.
  • the occupancy data for the plurality of neighbouring nodes may include occupancy statuses for each of the plurality of neighbouring nodes.
  • the tree structure may represent an octree.
  • the method of encoding may further include encoding a flag indicating that the one or more probabilities associated with respective entropy coders for entropy encoding the occupancy pattern have been selected based on the occupancy data for the plurality of neighbouring nodes of the current node and on the occupancy data of the child nodes of at least one of the plurality neighbouring nodes.
  • the method of decoding may further include decoding a flag indicating that the one or more probabilities associated with respective entropy coders for entropy decoding the occupancy pattern should be selected based on the occupancy data for the plurality of neighbouring nodes of the current node and on the occupancy data of the child nodes of at least one of the plurality neighbouring nodes.
  • the present application provides a method of encoding a point cloud to generate a bitstream of compressed point cloud data, the point cloud being defined in a tree structure having a plurality of nodes having parent-child relationships and that represent the geometry of a volumetric space recursively split into sub-volumes and containing the points of the point cloud, wherein occupancy of sub-volumes of a volume is indicated using a bit sequence with each bit of the bit sequence indicating occupancy of a respective sub-volume in a scan order within the volume, and wherein a volume has a plurality of neighbouring volumes, a pattern of occupancy of the neighbouring volumes being a neighbour configuration.
  • the method includes, for at least one bit in the bit sequence of the volume, determining that a context reduction condition is met and, on that basis, selecting a reduced context set that contains fewer contexts than the product of a count of neighbour configurations and a number of previously-coded bits in the sequence; selecting, for coding the at least one bit, a context from the reduced context set based on an occupancy status of at least some of the neighbouring volumes and at least one previously-coded bit of the bit sequence; entropy encoding the at least one bit based on the selected context using a binary entropy encoder to produce encoded data for the bitstream; and updating the selected context.
  • the present application provides a method of decoding a bitstream of compressed point cloud data to produce a reconstructed point cloud, the point cloud being defined in a tree structure having a plurality of nodes having parent-child relationships and that represent the geometry of a volumetric space recursively split into sub-volumes and containing the points of the point cloud, wherein occupancy of sub-volumes of a volume is indicated using a bit sequence with each bit of the bit sequence indicating occupancy of a respective sub-volume in a scan order within the volume, and wherein a volume has a plurality of neighbouring volumes, a pattern of occupancy of the neighbouring volumes being a neighbour configuration.
  • the method of decoding includes, for at least one bit in the bit sequence of the volume, determining that a context reduction condition is met and, on that basis, selecting a reduced context set that contains fewer contexts than the product of a count of neighbour configurations and a number of previously-coded bits in the sequence; selecting, for coding the at least one bit, a context from the reduced context set based on an occupancy status of at least some of the neighbouring volumes and at least one previously-coded bit of the bit sequence; entropy decoding the at least one bit based on the selected context using a binary entropy decoder to produce a reconstructed bit from the bitstream; and updating the selected context.
  • the context reduction condition may include determining that one or more previously-coded occupancy bits is associated with one or more respective sub-volumes positioned between the sub-volume associated with the at least one bit and the one or more of the neighbouring volumes. In some cases, this may include determining that four sub-volumes associated with previously-encoded bits share a face with a particular neighbour volume.
  • the context reduction condition may include determining that at least four bit of the bit sequence have been previously coded.
  • determining that the context reduction condition is met may include determining that the pattern of occupancy of the neighbouring volumes indicates that the plurality of neighbouring volumes is unoccupied.
  • the selected reduced context set may include a number of contexts corresponding to the number of previously-coded bits in the bit sequence and, optionally, selecting the context may include selecting the context based on a sum of previously-coded bits in the bit sequence.
  • the context reduction condition may include determining that at least a threshold number of bits in the bit sequence have been previously-coded, and the reduced context set may include a look-up table mapping each possible combination of neighbour configuration and pattern of previously-coded bits in the bit sequence to the fewer contexts.
  • the look-up table may be generated based on an iterative grouping of available contexts into a plurality of classes on the basis of determining that a distance measurement between respective pairs of available contexts is less than a threshold value, and each class in the plurality of classes may include a respective context in the smaller set, and there may be an available contexts for each the possible combination of neighbour configuration and pattern of previously-coded bits in the bit sequence.
  • At least some of the neighbouring volumes are neighbouring volumes that share at least one face with the volume.
  • the present application describes encoders and decoders configured to implement such methods of encoding and decoding.
  • the present application describes non-transitory computer-readable media storing computer-executable program instructions which, when executed, cause one or more processors to perform the described methods of encoding and/or decoding.
  • the present application describes a computer-readable signal containing program instructions which, when executed by a computer, cause the computer to perform the described methods of encoding and/or decoding.
  • the present application further describes computer-implemented applications, including topography application, cartography applications, automotive industry applications, autonomous driving applications, virtual reality applications, and cultural heritage applications, etc.
  • These computer-implemented applications include processes of receiving a data stream or data file, unpacking the data stream or data file to obtain a bitstream of compressed point cloud data, and decoding the bitstream as described in the above aspects and its implementations.
  • these computer-implemented applications make use of a point cloud compression technique according to aspects and their implementations described throughout the present application.
  • a receiving unit receives multiplexed data which is obtained by multiplexing coded point cloud data with other coded data types such as metadata, image, video, audio and/or graphics.
  • the receiving unit comprises a demultiplexing unit to separate the multiplexed data into coded point data and other coded data, and at least one decoding unit (or decoder) to decode the coded point cloud data.
  • an emitting unit emits multiplexed data which is obtained by multiplexing coded point cloud data with other coded data types such as metadata, image, video, audio and/or graphics.
  • the emitting unit comprises at least one encoding unit (or encoder) to encode the point cloud data, and a multiplexing unit to combine coded point cloud data and other coded data into the multiplexed data.
  • node is associated with a volume or sub-volume.
  • the node is a particular point on the tree that may be an internal node or a leaf node.
  • the volume or sub-volume is the bounded physical space that the node represents.
  • the term "volume” may, in some cases, be used to refer to the largest bounded space defined for containing the point cloud.
  • a volume may be recursively divided into sub-volumes for the purpose of building out a tree-structure of interconnected nodes for coding the point cloud data.
  • the phrase "at least one of ... or" is intended to cover any one or more of the listed elements, including any one of the listed elements alone, any sub-combination, or all of the elements, without necessarily excluding any additional elements, and without necessarily requiring all of the elements.
  • a point cloud is a set of points in a three-dimensional coordinate system.
  • the points are often intended to represent the external surface of one or more objects.
  • Each point has a location (position) in the three-dimensional coordinate system.
  • the position may be represented by three coordinates (X, Y, Z), which can be Cartesian or any other coordinate system.
  • the points may have other associated attributes, such as colour, which may also be a three component value in some cases, such as R, G, B or Y, Cb, Cr.
  • Other associated attributes may include transparency, reflectance, a normal vector, etc ., depending on the desired application for the point cloud data.
  • Point clouds can be static or dynamic.
  • a detailed scan or mapping of an object or topography may be static point cloud data.
  • the LiDAR-based scanning of an environment for machine-vision purposes may be dynamic in that the point cloud (at least potentially) changes over time, e.g. with each successive scan of a volume.
  • the dynamic point cloud is therefore a time-ordered sequence of point clouds.
  • Point cloud data may be used in a number of applications, including conservation (scanning of historical or cultural objects), mapping, machine vision (such as autonomous or semi-autonomous cars), and virtual reality systems, to give some examples.
  • Dynamic point cloud data for applications like machine vision can be quite different from static point cloud data like that for conservation purposes.
  • Automotive vision typically involves relatively small resolution, non-coloured, highly dynamic point clouds obtained through LiDAR (or similar) sensors with a high frequency of capture. The objective of such point clouds is not for human consumption or viewing but rather for machine object detection/classification in a decision process.
  • typical LiDAR frames contain on the order of tens of thousands of points, whereas high quality virtual reality applications require several millions of points. It may be expected that there will be a demand for higher resolution data over time as computational speed increases and new applications are found.
  • point cloud data is useful, a lack of effective and efficient compression, i . e . encoding and decoding processes, may hamper adoption and deployment.
  • One of the more common mechanisms for coding point cloud data is through using tree-based structures.
  • a tree-based structure the bounding three-dimensional volume for the point cloud is recursively divided into sub-volumes. Nodes of the tree correspond to sub-volumes. The decision of whether or not to further divide a sub-volume may be based on resolution of the tree and/or whether there are any points contained in the sub-volume.
  • a leaf node may have an occupancy flag that indicates whether its associated sub-volume contains a point or not.
  • Splitting flags may signal whether a node has child nodes ( i . e . whether a current volume has been further split into sub-volumes). These flags may be entropy coded in some cases and in some cases predictive coding may be used.
  • a commonly-used tree structure is an octree.
  • the volumes/sub-volumes are all cubes and each split of a sub-volume results in eight further sub-volumes/sub-cubes.
  • Another commonly-used tree structure is a KD-tree, in which a volume (cube or rectangular cuboid) is recursively divided in two by a plane orthogonal to one of the axes.
  • Octrees are a special case of KD-trees, where the volume is divided by three planes, each being orthogonal to one of the three axes. Both these examples relate to cubes or rectangular cuboids; however, the present application is not restricted to such tree structures and the volumes and sub-volumes may have other shapes in some applications.
  • the partitioning of a volume is not necessarily into two sub-volumes (KD-tree) or eight sub-volumes (octree), but could involve other partitions, including division into non-rectangular shapes or involving non-adjacent sub-volumes.
  • the present application may refer to octrees for ease of explanation and because they are a popular candidate tree structure for automotive applications, but it will be understood that the methods and devices described herein may be implemented using other tree structures.
  • FIG. 1 shows a simplified block diagram of a point cloud encoder 10 in accordance with aspects of the present application.
  • the point cloud encoder 10 includes a tree building module 12 for receiving point cloud data and producing a tree (in this example, an octree) representing the geometry of the volumetric space containing point cloud and indicating the location or position of points from the point cloud in that geometry.
  • a tree in this example, an octree
  • the basic process for creating an octree to code a point cloud may include:
  • the above process might be described as an occupancy-equals-splitting process, where splitting implies occupancy, with the constraint that there is a maximum depth or resolution beyond which no further splitting will occur.
  • a single flag signals whether a node is split and hence whether it is occupied by at least one point, and vice versa.
  • the flag At the maximum depth, the flag signals occupancy, with no further splitting possible.
  • splitting and occupancy are independent such that a node may be occupied and may or may not be split.
  • splitting and occupancy are independent such that a node may be occupied and may or may not be split.
  • the point cloud encoder 10 includes a binarizer 14 for binarizing the octree to produce a bitstream of binarized data representing the tree.
  • This sequence of bits may then be encoded using an entropy encoder 16 to produce a compressed bitstream.
  • the entropy encoder 16 may encode the sequence of bits using a context model 18 that specifies probabilities for coding bits based on a context determination by the entropy encoder 16.
  • the context model 18 may be adaptively updated after coding of each bit or defined set of bits.
  • the entropy encoder 16 may, in some cases, be a binary arithmetic encoder.
  • the binary arithmetic encoder may, in some implementations, employ context-adaptive binary arithmetic coding (CABAC).
  • CABAC context-adaptive binary arithmetic coding
  • coders other than arithmetic coders may be used.
  • the entropy encoder 16 may not be a binary coder, but instead may operate on non-binary data.
  • the output octree data from the tree building module 12 may not be evaluated in binary form but instead may be encoded as non-binary data.
  • the eight flags within a sub-volume e.g. occupancy flags
  • the eight flags within a sub-volume may be considered a 2 8 -1 bit number (e.g. an integer having a value between 1 and 255 since the value 0 is not possible for a split sub-volume, i . e . it would not have been split if it was entirely unoccupied).
  • This number may be encoded by the entropy encoder using a multi-symbol arithmetic coder in some implementations.
  • a sub-volume e.g . a cube
  • the sequence of flags that defines this integer may be termed a "pattern".
  • point cloud coding can include predictive operations in which efforts are made to predict the pattern for a sub-volume. Predictions may be spatial (dependent on previously coded sub-volumes in the same point cloud) or temporal (dependent on previously coded point clouds in a time-ordered sequence of point clouds).
  • FIG. 2 A block diagram of an example point cloud decoder 50 that corresponds to the encoder 10 is shown in Figure 2 .
  • the point cloud decoder 50 includes an entropy decoder 52 using the same context model 54 used by the encoder 10.
  • the entropy decoder 52 receives the input bitstream of compressed data and entropy decodes the data to produce an output sequence of decompressed bits. The sequence is then converted into reconstructed point cloud data by a tree reconstructor 56.
  • the tree reconstructor 56 rebuilds the tree structure from the decompressed data and knowledge of the scanning order in which the tree data was binarized. The tree reconstructor 56 is thus able to reconstruct the location of the points from the point cloud (subject to the resolution of the tree coding).
  • FIG. 3 An example partial sub-volume 100 is shown in Figure 3 .
  • a sub-volume 100 is shown in two-dimensions for ease of illustration, and the size of the sub-volume 100 is 16x16.
  • the sub-volume has been divided into four 8x8 sub-squares, and two of those have been further subdivided into 4x4 sub-squares, three of which are further divided to 2x2 sub-squares, and one of the 2x2 sub-square is then divided into 1x1 squares.
  • the 1x1 squares are the maximum depth of the tree and represent the finest resolution for positional point data.
  • the points from the point cloud are shown as dots in the figure.
  • the structure of the tree 102 is shown to the right of the sub-volume 100.
  • These sequences may be entropy encoded.
  • Figure 4 illustrates the recursive splitting and coding of an octree 150. Only a portion of the octree 150 is shown in the figure.
  • a FIFO 152 is shown as processing the nodes for splitting to illustrate the breadth-first nature of the present process.
  • the FIFO 152 outputs an occupied node 154 that was queued in the FIFO 152 for further splitting after processing of its parent node 156.
  • the tree builder splits the sub-volume associated with the occupied node 154 into eight sub-volumes (cubes) and determines their occupancy. The occupancy may be indicated by an occupancy flag for each sub-volume.
  • the flags may be referred to as the occupancy pattern for the node 154.
  • the pattern may be specified by the integer representing the sequence of occupancy flags associated with the sub-volumes in the pre-defined scan order. In the case of an octree, the pattern is an integer in the range [1, 255].
  • the entropy encoder then encodes that pattern using a non-binary arithmetic encoder based on probabilities specified by the context model.
  • the probabilities may be a pattern distribution based on an initial distribution model and adaptively updated.
  • the pattern distribution is effectively a counter of the number of times each pattern (integer from 1 to 255) has been encountered during coding.
  • the pattern distribution may be updated after each sub-volume is coded.
  • the pattern distribution may be normalized, as needed, since the relative frequency of the patterns is germane to the probability assessment and not the absolute count.
  • Figure 5 shows an example cube 180 from an octree.
  • the cube 180 is subdivided into eight sub-cubes.
  • the scan order for reading the flags results in an eight bit string, which can be read as an integer [1, 255] in binary. Based on the scan order and the resulting bit position of each sub-cube's flag in the string, the sub-cubes have the values shown in Figure 5 .
  • the scan order may be any sequence of the sub-cubes, provided both the encoder and decoder use the same scan order.
  • Figure 6 shows the cube 180 in which the four "front" sub-cubes are occupied. This would correspond to pattern 85, on the basis that the sub-cubes occupied are cubes 1+4+16+64.
  • the integer pattern number specifies the pattern of occupancy in the sub-cubes.
  • An octree representation or more generally any tree representation, is efficient at representing points with a spatial correlation because trees tend to factorize the higher order bits of the point coordinates.
  • each level of depth refines the coordinates of points within a sub-volume by one bit for each component at a cost of eight bits per refinement.
  • Further compression is obtained by entropy coding the split information, i . e . pattern, associated with each tree node. This further compression is possible because the pattern distribution is not uniform - non-uniformity being another consequence of the correlation.
  • the pattern distribution (e.g. the histogram of pattern numbers seen in previously-coded nodes of the tree) is developed over the course of coding the point cloud.
  • the pattern distribution may be initialized as equiprobable, or may be initialized to some other pre-determined distribution; but the use of one pattern distribution means that the context model does not account for, or exploit, local geometric correlation.
  • European patent application no. 18305037.6 the present applicants described methods and devices for selecting among available pattern distributions to be used in coding a particular node's pattern of occupancy based on some occupancy information from previously-coded nodes near the particular node.
  • the occupancy information is obtained from the pattern of occupancy of the parent to the particular node.
  • the occupancy information is obtained from one or more nodes neighbouring the particular node.
  • FIG. 7 shows, in flowchart form, one example method 200 of encoding a point cloud.
  • the method 200 in this example involves recursive splitting of occupied nodes (sub-volumes) and a breadth-first traversal of the tree for coding.
  • the encoder determines the pattern of occupancy for the current node.
  • the current node is an occupied node that has been split into eight child nodes, each corresponding to a respective sub-cube.
  • the pattern of occupancy for the current node specifies the occupancy of the eight child nodes in scan order. As described above, this pattern of occupancy may be indicated using an integer between 1 and 255, e.g. an eight-bit binary string.
  • the encoder selects a probability distribution from among a set of probability distributions.
  • the selection of the probability distribution is based upon some occupancy information from nearby previously-coded nodes, i.e. at least one node that is a neighbour to the current node.
  • Two nodes are neighbouring, in some embodiments, if they are associated with respective sub-volumes that share at least one face.
  • nodes are neighbouring if they share at least one edge.
  • two nodes are neighbouring if they share at least one vertex.
  • the parent pattern within which the current node is a child node provides occupancy data for the current node and the seven sibling nodes to the current node.
  • the occupancy information is the parent pattern.
  • the occupancy information is occupancy data for a set of neighbour nodes that include nodes at the same depth level of the tree as the current node, but having a different parent node. In some cases, combinations of these are possible.
  • a set of neighbour nodes may include some sibling nodes and some non-sibling nodes.
  • the encoder then entropy encodes the occupancy pattern for the current node using the selected probability distribution, as indicated by operation 206. It then updates the selected probability distribution in operation 208 based on the occupancy pattern, e.g. it may increment the count corresponding to that occupancy pattern. In operation 210, the encoder evaluates whether there are further nodes to code and, if so, returns to operation 202 to code the next node.
  • the probability distribution selection in operation 204 is to be based on occupancy data for nearby previously-coded nodes. This allows both the encoder and decoder to independently make the same selection.
  • Figure 8 diagrammatically illustrates a partial octree 300, including a current node 302.
  • the current node 302 is an occupied node and is being evaluated for coding.
  • the current node 302 is one of eight children of a parent node 306, which in turn is a child to a grand-parent node (not shown).
  • the current node 302 is divided into eight child nodes 304.
  • the occupancy pattern for the current node 302 is based on the occupancy of the child nodes 304. For example, as illustrated, using the convention that a black dot is an occupied node, the occupancy pattern may be 00110010, i.e. pattern 50.
  • the current node 302 has sibling nodes 308 that have the same parent node 306.
  • the parent pattern is the occupancy pattern for the parent node 306, which as illustrated would be 00110000, i . e . pattern 48.
  • the parent pattern may serve as the basis for selecting a suitable probability distribution for entropy encoding the occupancy pattern for the current node.
  • Figure 9 illustrates a set of neighbours surrounding a current node, where neighbour is defined as nodes sharing a face.
  • the nodes/sub-volumes are cubes and the cube at the center of the image has six neighbours, one for each face.
  • neighbours to the current node will include three sibling nodes. It will also include three nodes that do not have the same parent node. Accordingly, occupancy data for some of the neighbouring nodes will be available because they are siblings, but occupancy data for some neighbouring nodes may or may not be available, depending on whether those nodes were previously coded. Special handling may be applied to deal with missing neighbours.
  • the missing neighbour may be presumed to be occupied or may be presumed to be unoccupied. It will be appreciated that the neighbour definition may be broadened to include neighbouring nodes based on a shared edge or based on a shared vertex to include additional adjacent sub-volumes in the assessment.
  • the foregoing processes look at the occupancy of nearby nodes in an attempt to determine the likelihood of occupancy of the current node 302 so as to select more suitable context(s) and use more accurate probabilities for entropy coding the occupancy data of the current node 302.
  • the occupancy status of neighbouring nodes that share a face with the current node 302 may be a more accurate assessment of whether the current node 302 is likely to be isolated or not than basing that assessment on the occupancy status of sibling nodes, three of which will only share an edge and one of which will only share a vertex (in the case of an octree).
  • the assessment of occupancy status of siblings has the advantage of being modular in that all the relevant data for the assessment is part of the parent node, meaning it has a smaller memory footprint for implementation, whereas assessment of neighbour occupancy status involves buffering tree occupancy data in case it is needed when determining neighbour occupancy status in connection with coding a future nearby node.
  • the occupancy of the neighbours may be read in a scan order that effectively assigns a value to each neighbour, much like as is described above with respect to occupancy patterns.
  • the neighbouring nodes effectively take values of 1, 2, 4, 8, 16 or 32, and there are therefore 64 (0 to 63) possible neighbour occupancy configurations. This value may be termed the "neighbour configuration" herein.
  • Figure 10 illustrates an example of neighbour configuration 15, in which neighbours 1, 2, 4 and 8 are occupied and neighbours 16 and 32 are empty.
  • the two above criteria may be both applied or may be selected between. For example, if neighbours are available then the probability distribution selection may be made based on the neighbouring nodes; however, if one or more of the neighbours are unavailable because they are from nodes not-yet coded, then the probability distribution selection may revert to an analysis based on sibling nodes (parent pattern).
  • the probability distribution selection may be alternatively, or additionally, be based on the grandparent pattern. In other words, the probability distribution selection may be based on the occupancy status of the uncle nodes that are siblings to the parent node 306.
  • additional or alternative assessments may be factored into the probability distribution selection.
  • the probability distribution selection may look at the occupancy status of neighbour nodes to the parent node, or neighbour nodes to the grand-parent node.
  • the occupancy data for the current node may be coded by selecting a probability distribution.
  • similar patterns may be grouped so as to use the same probability distribution. For example, separate distributions may be used for patterns corresponding to fully occupied, vertically-oriented, horizontally-oriented, mostly empty, and then all other cases. This could reduce the number of probability distributions to about five. It will be appreciated that different groupings of patterns could be formed to result in a different number of probability distributions.
  • FIG. 11 diagrammatically shows one illustrative embodiment of a process 400 of point cloud entropy encoding using parent-pattern-dependent context.
  • a current node 402 has been split into eight child nodes and its occupancy pattern 404 is to be encoded using a non-binary entropy encoder 406.
  • the non-binary entropy encoder 406 uses a probability distribution selected from one of six possible probability distributions 408. The selection is based on the parent pattern - that is the selection is based on occupancy information from the parent node to the current node 402.
  • the parent pattern is identified by an integer between 1 and 255.
  • the example patterns indicated for the different categories are merely examples.
  • the "horizontal" category may include patterns involving two or three occupied cubes on the same horizontal level.
  • the "vertical” category may include patterns involving three or four occupied cubes in a wall-like arrangement. It will also be appreciated that finer gradations may be used.
  • the "horizontal” category may be further subdivided into horizontal in the upper part of the cube and horizontal in the bottom part of the cube with different probability distributions for each. Other groupings of occupancy patterns having some correlation may be made and allocated to a corresponding probability distribution. Further discussion regarding grouping of patterns in the context of neighbour configurations, and invariance between neighbour configurations is set out further below.
  • Figure 12 shows an illustrative embodiment of a process 500 of point cloud entropy encoding using neighbour-configuration-dependent context.
  • This example assumes the definition of neighbour and neighbour configuration numbering used above in connection with Figure 9 .
  • This example also presumes that each neighbour configuration has a dedicated probability distribution, meaning there are 64 different probability distributions.
  • a current node 502 has an occupancy pattern 504 to be encoded. The probability distribution is selected based on the neighbouring nodes to the current node 502. That is, the neighbour configuration NC in [0, 63] is found and used to select the associated probability distribution.
  • neighbour configurations may be grouped such that more than one neighbour configuration uses the same probability distribution based on similarities in the patterns.
  • the process may use a different arrangement of neighbours for contextualisation (selection) of the distributions. Additional neighbours may be added such as the eight neighbours diagonally adjacent on all three axes, or the twelve diagonally adjacent on two axes. Embodiments that avoid particular neighbours may also be used, for example to avoid using neighbours that introduce additional dependencies in a depth-first scan, or only introduce dependencies on particular axes so as to reduce codec state for large trees.
  • NO NumberOccupied
  • Figure 13 shows, in flowchart form, one example method 600 for decoding a bitstream of encoded point cloud data.
  • the decoder selects one of the probability distributions based on occupancy information from one or more nodes near the current node.
  • the occupancy information may be a parent pattern from the parent node to the current node, i.e. occupancy of the current node and its siblings, or it may be occupancy of neighbouring nodes to the current node, which may include some of the sibling nodes. Other or additional occupancy information may be used in some implementations.
  • the decoder entropy decodes a portion of the bitstream using the selected probability distribution to reconstruct the occupancy pattern for the current node.
  • the occupancy pattern is used by the decoder in reconstructing the tree so as to reconstruct the encoded point cloud data.
  • the point cloud data may be output from the decoder for use, such as for rendering a view, segmentation/classification, or other applications.
  • the decoder updates the probability distribution based on the reconstructed occupancy pattern, and then if there are further nodes to decode, then it moves to the next node in the buffer and returns to operation 602.
  • Example implementations of the above-described methods have proven to provide a compression improvement with a negligible increase in coding complexity.
  • the neighbour-based selection shows a better compression performance than the parent-pattern based selection, although it has a greater computational complexity and memory usage.
  • the relative improvement in bits-per-point over the MPEG Point Cloud Test Model is between 4 and 20%. It has been noted that initializing the probability distributions based on a distribution arrived at with test data leads to improved performance as compared to initializing with a uniform distribution.
  • the number of distributions may be reduced by exploiting the symmetry of the neighbourhood.
  • By permuting the neighbourhood or permuting the pattern distribution structurally similar configurations having a line of symmetry can re-use the same distribution.
  • neighbour configurations that can use the same pattern distribution may be grouped into a class.
  • a class containing more than one neighbour configuration may be referred to herein as a "neighbour configuration" in that one of the neighbour configurations effectively subsumes other neighbour configurations by way of reflection or permutation of those other configurations.
  • An encoder derives the pattern number of a node based on the occupancy of the child nodes.
  • the encoder selects a distribution and a permutation function according to the neighbour configuration.
  • the encoder reorders the probabilities contained within the distribution according to the permutation function, and subsequently uses the permuted distribution to arithmetically encode the pattern number. Updates to the probabilities of the permuted distribution by the arithmetic encoder are mapped back to the original distribution by way of an inverse permutation function.
  • a corresponding decoder first selects the same distribution and permutation function according to the neighbour configuration.
  • a permuted distribution is produced in an identical manner to the encoder, with the permuted distribution being used by the arithmetic decoder to entropy decode the pattern number.
  • the bits comprising the pattern number are then each assigned to the corresponding child.
  • permutation may be achieved without reordering the data of the distribution itself, but rather introducing a level of indirection and using the permutation function to permute the lookup of a given index in the distribution.
  • Figure 16 shows three rotations 2102, 2104 and 2106 along the Z, Y and X axes, respectively.
  • the angle of these three rotations is 90 degrees, i . e . they perform a rotation along their respective axis by a quarter of a turn.
  • Figure 17 shows classes of invariance of neighbour configuration under one or several iterations of the rotation 2102 along the Z axis.
  • This invariance is representative of the same statistical behaviour of the point cloud geometry along any direction belonging to the XY plane. This is particularly true for the use-case of a car moving on the Earth surface that is locally approximated by the XY plane.
  • a horizontal configuration is the given occupancy of the four neighbours (located at the left, right, front and back of the current cube) independently of the occupancy of the above neighbour (2202) and the below neighbour (2204).
  • the four horizontal configurations 2206, 2208, 2210 and 2212 belong to the same class of invariance under the rotation 2102.
  • the two configurations 2214 and 2216 belong to the same class of invariance.
  • a vertical configuration is the given occupancy of the two neighbours 2202 and 2204 independently of the occupancy of the four neighbours located at the left, right, front and back of the current cube.
  • There are four possible vertical configurations as shown on Figure 18 . Consequently, if one considers invariance relatively to the rotation 2102 along the Z axis, there are 6x4 24 possible configurations.
  • the reflection 2108 along the Z axis is shown on Figure 16 .
  • the vertical configurations 2302 and 2304 depicted on Figure 18 belong to the same class of invariance under the reflection 2108.
  • the invariance under reflection 2108 means that upward and downward directions behave essentially the same in term of point cloud geometry statistics. It is an accurate assumption for a moving car on a road.
  • the two configurations 2401 and 2402 belong to the same class of invariance. Furthermore, the two configurations 2411 and 2412, the two configurations 2421 and 2422, the three configurations 2431, 2432 and 2433, the two configurations 2441 and 2442, the two configurations 2451 and 2452, and finally the two configurations 2461 and 2462 belong to same classes. Consequently, invariance under the three rotations (2102, 2104 and 2106) and the reflection 2108 leads to 10 classes of invariance as shown on Figure 20 .
  • the number of effective neighbour configurations i . e . classes into which the 64 neighbour configuration may be grouped, is either 64, 24, 18 or 10.
  • the pattern Prior to entropy coding, the pattern undergoes the same transformation, i . e . rotations and reflection, as the neighbour configuration does to belong to one of the invariance classes. This preserves the statistical consistency between the invariant neighbour configuration and the coded pattern.
  • a child node will have certain neighbouring nodes at the same tree depth that have been previously visited and may be causally used as dependencies. For these same-level neighbours (i.e., at the same level as the child node), instead of consulting the parent collocated neighbour, the same-level neighbours may be used. Since the same-level neighbours have halved dimensions of the parent, one configuration considers the neighbour occupied if any of the four directly adjacent neighbouring child nodes (i.e., the four sharing a face with the current node) is occupied.
  • the neighbour configuration of a current node may be determined based on the occupancy data of the neighbouring nodes of the current node and further based on occupancy data for child nodes of at least one of the neighbouring nodes.
  • one or more probabilities associated with respective entropy coders for entropy coding e.g., binary entropy coding
  • the occupancy pattern of the current node may be selected not only based on occupancy data for a plurality of (same-level, i.e., at the same level as the current node) neighbouring nodes of the current node, but also on occupancy data for child nodes of at least one (possibly all) of the plurality of (same-level) neighbouring nodes.
  • FIG. 27 shows a current node (i.e. its associated (sub-)volume, or current (sub-)volume) 4000 and its six neighbours 4010, 4020, 4030, 4040, 4050 and 4060.
  • neighbours of the current node may be those nodes (at the same level or depth of the tree) whose associated volumes share a face with the current volume.
  • neighbours of the current node may be those nodes (at the same level or depth of the tree) whose associated volumes share an edge (or a vertex) with the current volume.
  • neighbouring nodes may be those nodes (at the same level or depth of the tree) whose associated volumes intersect with the current volume.
  • volume and sub-volume may be used somewhat interchangeably, in the sense that each sub-volume is itself a volume that can be sub-divided into sub-volumes.
  • volume/sub-volume relationship is understood to be clear by specification of a parent-child relationship between the nodes/volumes involved.
  • Figure 28 shows an exemplary current volume with all three already coded neighbours (i.e., neighbours 4010, 4030 and 4050) being occupied.
  • the occupied sub-volumes of the neighbour 4010 are sub-volumes 4011, 4012 and 4013;
  • the occupied sub-volumes of the neighbour 4030 are sub-volumes 4031, 4032 and 4033;
  • the occupied sub-volumes of the neighbour 4050 are sub-volumes 4051 and 4052.
  • all the three already coded neighbours are occupied, but it is understood that in general only two or one of them may actually be occupied, or even none of them.
  • FIG. 30 shows, in flowchart form, an example of a method 4100 of encoding a point cloud to generate a bitstream of compressed point cloud data.
  • the point cloud is defined as a tree structure (e.g., an octree) having a plurality of nodes having parent-child relationships and that represents the geometry of a volumetric space recursively split into sub-volumes and containing the points of the point cloud.
  • the operations of method 4100 described below are each performed for a current node associated with a (sub-)volume split into further sub-volumes, each further sub-volume corresponding to a child node of the current node.
  • an occupancy pattern for the current node is determined based on occupancy statuses of the child nodes.
  • one or more probabilities e.g., contexts
  • the occupancy pattern is entropy encoded based on the selected one or more probabilities, using the associated one or more entropy coders, to produce encoded data for the bitstream.
  • method 4100 may further include an operation (not shown in Figure 30 ) of updating the one or more selected probabilities based on the occupancy pattern.
  • the occupancy pattern of the current node may be entropy coded using a non-binary entropy coder.
  • selecting the one or more probabilities in operation 4120 of method 4100 may correspond to or involve selecting a probability distribution (and an associated non-binary entropy coder) for entropy coding the occupancy pattern. Updating the one or more selected probabilities then may correspond to or involve updating the selected probability distribution.
  • the occupancy pattern of the current node may be entropy coded using a cascade of one or more binary entropy coders. Accordingly, operation 4120 of method 4100 may involve, for each bit of the bit sequence representing the occupancy pattern, selecting a respective probability (and correspondingly, an associated entropy coder) for coding that bit. Selecting this probability may be based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes. In addition, selecting this probability may be based on a partial sequence of already coded bits of the bit sequence.
  • a context may be selected based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes.
  • selecting the context may be based on a partial sequence of already coded bits of the bit sequence.
  • operation 4120 of method 4100 may be said to relate to selecting a context for entropy coding the occupancy pattern based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes. Then, in some implementations this context may be updated based on the occupancy pattern.
  • FIG. 31 shows, in flowchart form, an example of a method 4200 of decoding a bitstream of compressed point cloud data to produce a reconstructed point cloud.
  • the point cloud is defined in a tree structure (e.g., an octree) having a plurality of nodes having parent-child relationships and that represent the geometry of a volumetric space recursively split into sub-volumes and containing the points of the point cloud.
  • the operations of method 4200 described below are each performed for a current node associated with a sub-volume split into further sub-volumes, each further sub-volume corresponding to a child node of the current node.
  • one or more probabilities associated with respective entropy coders for entropy decoding the occupancy pattern are selected. This selecting is based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data of child nodes of at least one of the plurality of neighbouring nodes.
  • the bitstream is entropy decoded based on the selected one or more probabilities, using the one or more associated entropy coders, to produce a reconstructed occupancy pattern for the current node signalling occupancy of the child nodes.
  • method 4200 may further include an operation (not shown in Figure 31 ) of updating the one or more selected probabilities based on the reconstructed occupancy pattern.
  • the occupancy pattern of the current node may be entropy coded using a non-binary entropy coder.
  • selecting the one or more probabilities in operation 4210 of method 4200 may correspond to or involve selecting a probability distribution (and an associated non-binary entropy coder) for entropy coding the occupancy pattern. Updating the one or more selected probabilities then may correspond to or involve updating the selected probability distribution.
  • the occupancy pattern of the current node may be entropy coded using a cascade of one or more binary entropy coders. Then, in the same manner as for encoding, operation 4210 of method 4200 may involve, for each bit of the bit sequence representing the occupancy pattern, selecting a respective probability (and correspondingly, an associated entropy coder) for coding that bit. Selecting this probability may be based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes. In addition, selecting this probability may be based on a partial sequence of already coded bits in the bit sequence.
  • a context may be selected based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes.
  • selecting the context may be based on a partial sequence of already coded bits in the bit sequence.
  • operation 4210 of method 4200 may be said to relate to selecting a context for entropy coding the occupancy pattern based on occupancy data for a plurality of neighbouring nodes of the current node and on occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes. Then, in some implementations this context may be updated based on the reconstructed occupancy pattern.
  • respective selections at operation 4120 and 4210 may be based on the neighbouring configuration.
  • the neighbouring configuration can be determined based on the occupancy data for the (same-level) neighbouring nodes of the current node.
  • the occupancy data for child nodes of at least one (possibly all) of the plurality of neighbouring nodes may be used for adapting the calculation of the neighbour configuration.
  • the occupancy data for child nodes of a given one of the plurality of neighbouring nodes may be used to determine whether the given neighbouring node should be considered as occupied or not for the purpose of calculating the neighbour configuration.
  • One example of such adaptation of the calculation of the neighbouring configuration will be described with reference to Figure 32 .
  • FIG 32 shows, in flowchart form, one example method 4300 for deciding the occupancy of neighbours (neighbouring nodes) in the computation of the neighbour configuration.
  • the method is performed for a current volume, to determine the current volume's neighbour configuration.
  • a neighbour of the current volume is selected.
  • the occupancy of the neighbour is checked in operation 4330. If the neighbour is not occupied (no in operation 4330), the method proceeds to operation 4340 and the selected neighbour will be considered as non-occupied (e.g., having an occupancy bit that is zero) in the computation of the neighbour occupancy configuration. That is, the occupancy of such a neighbour is taken as it is for the determination of the neighbour configuration.
  • the method subsequently proceeds to operation 4320.
  • the selected neighbour is occupied (yes in operation 4330), it is checked in operation 4350 whether or not this neighbour has already been coded. If it has not already been coded (no in operation 4350), the method proceeds to operation 4360 and the not yet coded neighbour will be considered as occupied in the computation of the neighbour occupancy configuration. Also for such a neighbour, its occupancy is taken as it is for the determination of the neighbour configuration. The method subsequently proceeds to operation 4320. If the selected neighbour has already been coded (yes in operation 4350), it is checked in operation 4370 whether at least one of the occupied sub-volumes of the already coded neighbour shares a face with the current volume.
  • operation 4370 it is checked in operation 4370 whether at least one of the occupied sub-volumes of the already coded neighbour intersects with the current volume. If it does (yes in operation 4370), the method proceeds to operation 4360 and the already coded neighbour will be considered as occupied in the computation of the neighbour configuration. Thus, also for such a neighbour, its occupancy is taken as it is for the determination of the neighbour configuration. Otherwise (no in operation 4370), the method proceeds to operation 4340 and the already coded neighbour will be considered as non-occupied in the computation of the neighbour configuration. That is, the occupancy bit of that neighbour will be (deliberately/artificially) set to zero in the determination of the neighbour configuration. The method subsequently proceeds to operation 4320.
  • operation 4320 it is checked whether there are neighbours of the current volume that have not been selected. If so (yes in operation 4320), the method returns to operation 4310 to select the next neighbour of the current volume.
  • the neighbour configuration is computed in operation 4380 depending on the neighbours' respective occupancies (e.g., occupancy bits) decided on in operation 4340 or in operation 4360. This computation may proceed in the same manner as described above, however taking into account the occupancies of the neighbours of the current volume as determined in operations 4340 and 4360.
  • operation 4340 may be said to modify the occupancy relative to the direct determination based only on occupancy data of the respective neighbour.
  • the determined neighbour configuration may be said to be modified relative to the direct determination without considering the occupancy data for the sub-volumes of the already coded neighbours.
  • the (modified) neighbour configuration that is determined using the neighbours' modified occupancies may be used for selecting the one or more probabilities in operation 4120 of method 4100 and operation 4210 of method 4200, respectively, unless a deactivation flag in the bitstream indicates that the original neighbour configuration should be used. This is described in more detail below.
  • Methods 4100, 4200, and 4300 have proved to provide compression gains, on the geometry of point clouds, above 1% relative to the direct determination of the neighbour configuration without considering the already-coded occupied neighbours' sub-volumes.
  • neighbours to a current volume may be all those same-level volumes that share a face or an edge with the current volume.
  • the criterion in operation 4370 of method 4300 would have to be replaced by a check of whether the neighbour has an occupied sub-volume sharing a face or an edge with the current volume. Examples of such a neighbour definition are illustrated in Figure 33 .
  • neighbours to a current volume may be all those same-level volumes that share a face, an edge, or a vertex with the current volume.
  • the criterion in operation 4370 of method 4300 would have to be replaced by a check of whether the neighbour has an occupied sub-volume sharing a face, an edge, or a vertex with the current volume. Examples of such a neighbour definition are illustrated in Figure 34 .
  • neighbours of the current volume may be all those same-level volumes that intersect with the current volume.
  • the criterion in operation 4370 of method 4300 may be replaced by a check of whether the neighbour has an occupied sub-volume intersecting with the current volume.
  • the methods 4100, 4200, and 4300 can be applied to any tree of nodes with associated volumes wherein a neighbouring node of a current node is defined as a node, having the same depth (level) as the current node, for which the associated volume has a non-empty intersection with the current volume associated with the current node.
  • this intersection may be a face, an edge, a vertex or any non-empty set of points.
  • An already-coded occupied neighbour will be considered as occupied in the computation of the neighbour occupancy configuration if and only if at least one of its occupied child nodes has an associated volume that has a non-empty intersection with the current volume.
  • Figure 33 shows a neighbouring volume 4070 sharing an edge with a current volume 4000.
  • the neighbour 4070 has occupied sub-volumes 4071 and 4072, and none of them shares an edge with the current volume 4000. In this case, the neighbour 4070 is considered as non-occupied in the computation of the neighbour occupancy configuration.
  • Figure 33(b) at least one of the sub-volumes 4073 and 4074 of the neighbour 4070 shares an edge with the current volume 4000. In this case, the neighbour 4070 is considered as occupied in the computation of the neighbour occupancy configuration.
  • Figure 34 shows a neighbouring volume 4080 sharing a vertex with a current volume 4000.
  • the neighbour 4080 has occupied sub-volumes 4081 and 4082, and none of them shares a vertex with the current volume 4000. In this case, the neighbour 4080 is considered as non-occupied in the computation of the neighbour occupancy configuration.
  • Figure 34(b) at least one of the sub-volumes 4083 and 4084 of the neighbour 4070 shares a vertex with the current volume 4000. In this case, the neighbour 4078 is considered as occupied in the computation of the neighbour occupancy configuration.
  • Methods 4100, 4200, and 4300 have been observed to provide more than 1% compression gain, i.e. a reduction of more than 1% of the compressed bitstream size, on dense Virtual Reality oriented point clouds. These are interesting gains relative to the simplicity of the method.
  • the occupancy pattern i . e . bit sequence X
  • a binary coder e.g. CABAC
  • the bit sequence may be split into the eight binary information bits b 0 ...b 7 .
  • the coding may use the neighbour configuration N (or NC) for determining context.
  • N is an integer belonging to ⁇ 0,1,2,...,9 ⁇ .
  • the "classes of invariant neighbour configurations” may be referred to herein, at times, simply as the "neighbour configurations", although it will be appreciated that this reduced number of neighbour configurations may be realized based on the class-based grouping of neighbour configurations based on invariance.
  • Figure 21 illustrates the splitting of an eight-bit pattern or sequence into eight individual bits for binary entropy coding.
  • the first bit of the sequence is encoded based on the neighbour configuration, so there are ten total contexts available.
  • the next bit of the sequence is encoded based on the neighbour configuration and any previously-encoded bits, i . e . bit b 0 .
  • the final bit, b 7 is entropy encoded using a context selected from 1280 available contexts: obtained as the product of 10 from N and 128 from the partial pattern given by the previously-encoded bits b 0 ,...,b 6 .
  • the number of contexts i.e. possible combinations of conditions/dependencies
  • the number of neighbour configurations is the product of the number of neighbour configurations defined (10, in this example, based on grouping of the 64 neighbour configurations into classes), and the number of partial patterns possible from the ordered sequence of n -1 previously-encoded bits (given by 2 n -1 ).
  • the present application discloses encoders and decoders that determine whether the set of contexts can be reduced and, if so, apply a context reduction operation to realize a smaller set of available contexts for entropy coding at least part of an occupancy pattern using a binary coder.
  • the present application further discloses encoders and decoders that apply one or more rounds of state reduction using the same context reduction operations in order to perform effective context selection from a fixed number of contexts.
  • the context reduction is applied a priori in generating look-up tables of contexts and/or algorithmic conditionals that are then used by the encoder or decoder in selecting a suitable context. The reduction is based on a testable condition that the encoder and decoder evaluate to determine which look-up table to select from or how to index/select from that look-up table to obtain a selected context.
  • FIG. 22 shows, in flowchart form, one example method 3000 for coding occupancy patterns in a tree-based point cloud coder using binary coding.
  • the method 3000 may by implemented by an encoder or a decoder.
  • the coding operations are encoding
  • the coding operations are decoding.
  • the encoding and decoding is context-based entropy encoding and decoding.
  • the example method 3000 is for entropy coding an occupancy pattern, i.e. a bit sequence, for a particular node/volume.
  • the occupancy pattern signals the occupancy status of the child nodes (sub-volumes) of the node/volume. In the case of an octree, there are eight child nodes/sub-volumes.
  • the neighbour configuration is determined.
  • the neighbour configuration is the occupancy status of one or more volumes neighbouring the volume for which an occupancy pattern is to be coded. As discussed above, there are various possible implementations for determining neighbour configuration. In some examples, there are 10 neighbour configurations, and the neighbour configurations for a current volume is identified based on the occupancy of the six volumes that share a face with the current volume.
  • an index i to the child nodes of the current volume is set to 0.
  • an assessment is made as to whether context reduction is possible. Different possible context reduction operations are discussed in more detail below. The assessment of whether context reduction is possible may be based, for example, on which bit in the bit sequence is being coded (e.g. the index value). In some cases, context reduction may be possible for later bits in the sequence but not for the first few bits. The assessment of whether context reduction is possible may be based, for example, on the neighbour configuration as certain neighbour configurations may allow for simplifications. Additional factors may be used in assessing whether context reduction is possible in some implementations.
  • an upper bound Bo may be provided as the maximum number of contexts a binary coder can use to code a bit, and if the initial number of contexts to code a bit is higher than Bo then context reduction is applied (otherwise it is not) such that the number of contexts after reduction is at most Bo.
  • a bound Bo may be defined in an encoder and/or decoder specification in order to ensure that a software or hardware implementation capable to deal with Bo contexts will always be able to encode and/or decode a point cloud without generating an overflow in term of the number of contexts. Knowing the bound Bo beforehand also allows for anticipating the complexity and the memory footprint induced by the binary entropy coder, thus facilitating the design of hardware. Typical values for Bo are from ten to a few hundred.
  • a context reduction operation reduces the number of available contexts in a set of available contexts to a smaller set containing fewer total contexts. It will be recalled, that the number of available contexts may depend, in part, on the bit position in the sequence, i . e . the index, since the context may depend on a partial pattern of previously-coded bits from the bits sequence. In some implementations, the number of contexts available in the set, before reduction, may be based on the number of neighbour configurations multiplied by the number of partial patterns possible with the previously-coded bits. For a bit at index i , where i ranges from 0 to n , the number of partial patterns may be given by 2 i .
  • the context reduction operations are carried out prior to the coding, and the resulting reduced context sets are the context sets available for use by the encoder and decoder during the coding operation.
  • Use and/or selection of the reduced context set during coding may be based on evaluation of one or more conditions precedent to use of those reduced sets that correspond to the conditions evaluated in operation 3006 for determining that the number of contexts can be reduced. For example, in the case of a specific neighbour configuration that permits use of reduced context set, the encoder and/or decoder may first determine whether that neighbour configuration condition is met and then, if so, use the corresponding reduced context set.
  • the context for bit b i is determined, i.e. selected from the set (or reduced set, if any) of available contexts based on the neighbour configuration and the partial pattern of previously-coded bits in the bit sequence.
  • the current bit is then entropy encoded by a binary coder using the selected context in operation 3012.
  • the coding process advances to the next node. Otherwise, the index i is incremented in operation 3016 and the process returns to operation 3006.
  • context selection may not depend on neighbour configuration. In some cases, it may only depend on the partial pattern of previously-coded bits in the sequence, if any.
  • FIG. 23 A simplified block diagram of part of an example encoder 3100 is illustrated in Figure 23 .
  • the occupancy pattern 3102 is obtained as the corresponding volume is partitioned into child nodes and cycled through a FIFO buffer 3104 that holds the geometry of the point cloud. Coding of the occupancy pattern 3102 is illustrated as involving a cascade of binary coders 3106, one for each bit of the pattern. Between at least some of the binary coders 3106 is a context reduction operation 3108 that operates to reduce the available contexts to a smaller set of available contexts.
  • Figure 23 illustrates a series of binary coders 3106, in some implementations only one binary coder is used. In the case where more than one coder is used, the coding may be (partly) parallelized. Given the context dependence of one bit on preceding bits in the bit sequence, the coding of the pattern cannot necessarily be fully parallelized, but it may be possible to improve pipelining through using cascading binary coders for a pattern to achieve some degree of parallelization and speed improvement.
  • the coding process include a context reduction operation with respect to at least one bit of the occupancy pattern so as to reduce the set of available contexts to a smaller set of available contexts.
  • the "context reduction operation” may be understood as identifying and consolidating contexts that may be deemed duplicative or redundant in the circumstances of a particular bit b i .
  • the reduced context set may be determined in advance of coding and may be provided to the encoder and decoder, and the encoder and decoder determine whether to use the reduced context set based on the same conditions described below for reducing the context set.
  • a first example context reduction operation involves reducing the number of neighbour configurations based on screening/shielding.
  • the neighbour configuration factors occupancy status of neighbouring volumes into the context selection process on the basis that the neighbouring volumes help indicate whether the current volume or sub-volume is likely to be occupied or not.
  • the bits associated with sub-volumes in the current volume are decoded, then they are also factored into the context selection; however, the information from nearby sub-volumes may be more significant and more informative than the occupancy information of a neighbouring volume that is located on the other side of the sub-volumes from the current sub-volume. In this sense, the previously-decoded bits are associated with sub-volumes that "screen” or "shield" the neighbouring volume.
  • FIG. 24 diagrammatically shows an example context reduction operation based on neighbour screening.
  • the example involves coding the occupancy pattern for a volume 3200.
  • the occupancy pattern signals the occupancy status of the eight sub-volumes within the volume 3200.
  • the four sub-volumes in the top half of the volume 3200 have been coded, so their occupancy status is known.
  • the bit of the occupancy pattern being coded is associated with a fifth sub-volume 3204 that is located in the bottom half of the volume 3200, below the four previously-coded sub-volumes.
  • the coding in this example includes determining context based on neighbour configuration.
  • the 10 neighbour configurations 3202 are shown.
  • the volume 3200 containing the fifth sub-volume 3204 to be coded is shown in light grey and indicated by reference numeral 3200.
  • the neighbour configurations 3202 are based on the occupancy status of the volumes adjacent to the volume 3200 and sharing a face with it.
  • the neighbouring volumes include a top neighbouring volume 3206.
  • the number of neighbour configurations can be reduced from 10 to 7 by ignoring the top neighbouring volume 3206 in at least some of the configurations.
  • three of the four configurations in which the top neighbouring volume 3206 is shown can be subsumed under equivalent configurations that do not factor in the top neighbouring volume 3206, thereby reducing the number of neighbour configurations to 7 total. It may be still be advantageous to keep the configuration showing all six neighbouring volumes since there is no existing 5-volume neighbour configuration that the 6-volume configuration can be consolidated with (having eliminated the 5-element one) meaning that even if the top neighbouring volume is removed a new 5-element neighbour configuration results and no overall reduction in contexts occurs.
  • the top neighbouring volume 3206 can be eliminated from the neighbour configurations in this example because the context determination for coding of an occupancy bit associated with the fifth sub-volume 3204 will already take into account the occupancy status of the four previously-coded sub-volumes directly above it, which are a better indication of likelihood and directionality of occupancy for the fifth sub-volume than the occupancy status of the more-distant top neighbouring volume 3206.
  • top neighbouring volume 3206 is screened or shielded by the previously-coded sub-volumes when coding the occupancy bit corresponding to the fifth sub-volume 3204 is only one example.
  • a number of other possible screening/shielding situations may be realized and exploited to reduce the available neighbour configurations.
  • FIG. 25 shows a second example of screening/shielding.
  • the occupancy pattern for the volume 3200 is nearly completely coded.
  • the sub-volume to be coded is the eighth sub-volume and is hidden in the figure at the back bottom corner (not visible).
  • the occupancy status of all seven other sub-volumes has been coded.
  • the sub-volumes along the top (hence the reduction in neighbour configurations to seven total) and along the right side and front side.
  • the sub-volumes with previously-coded occupancy bits shield a front neighbouring volume 3210 and a right-side neighbouring volume 3212. This may permit the reduction of neighbour configurations from seven total to five total, as illustrated.
  • shielding are illustrative and that in some cases different configurations may be consolidated to account for different shielding situations.
  • the context reduction operation based on shielding/screening by previously-coded sub-volumes is general and not limited to these two examples, although it will be appreciated that it cannot be applied in the case of the first sub-volume to be coded since it requires that there by at least one previously-coded occupancy bit associated with a nearby sub-volume in order for there to be any shielding/screening.
  • the degree of shielding/screening to justify neighbour configuration reduction may be different in different implementations.
  • all four sub-volumes sharing a face with a neighbouring volume were previously-coded before that neighbouring volume was considered shielded/screened and thus removed from the neighbour configurations.
  • partial shielding/screening may be sufficient, e.g. from one to three previously-coded sub-volumes that share a face.
  • the context for coding one of the bits of the bit sequence is based on the previously-coded bits, but not on their ordered pattern, just on their sum.
  • the entropy expression in this special case may be expressed as: H b
  • a similar observation may be made with respect to a full neighbour configuration.
  • a full neighbour configuration lacks directionality, meaning the order of previously-coded bits need not be taken into account in determining context.
  • this context reduction operation may be applied to only some of the bits in the bit sequence, such as some of the later bits in the sequence. In some cases, the application of this context reduction operation to later bits may be conditional on determining that the earlier bits associated with previously-coded sub-volumes were also all occupied.
  • a statistical analysis may be used to reduce contexts through determining which ones lead to roughly the same statistical behaviour and then combining them. This analysis may be performed a priori using test data to develop a reduced context set that is then provided to both the encoder and decoder. In some cases, the analysis may be performed on a current point cloud using two-pass coding to develop a custom reduced context set for the specific point cloud data. In some such cases, the mapping from the non-reduced context set to the custom reduced context set may be signalled to the decoder by using a dedicated syntax coded into the bitstream.
  • a first context c has a probability p of a bit b being equal to zero
  • a second context c' has a probability p' of a bit b' being equal to zero.
  • the contexts may then be grouped in a process, such as:
  • the brute force reduction function for mapping a set of contexts to a smaller set of contexts may be stored in memory to be applied by the encoder/decoder as a context reduction operation during coding.
  • the mapping may be stored as a look-up table or other data structure.
  • the brute force reduction function may be applied only for later bits in the bit sequence (pattern), for example.
  • Figure 26 shows one example, in flowchart form, of a method 3300 of occupancy pattern binary coding involving combined context reduction.
  • the method 3300 codes the 8-bit binary pattern b 0 , b 1 , ..., b 7 , given a 10-element neighbour configuration N 10 in ⁇ 0, 1, 2, ..., 9 ⁇ .
  • bits are coded as per normal until bit b 4 , at which point the encoder and decoder begin applying brute force context reduction functions, BR i , to reduce the number of contexts by mapping the set of contexts defined by the neighbour configuration and the partial pattern of previously-coded bits to a smaller set of contexts having substantially similar statistical outcomes.
  • BR i brute force context reduction functions
  • the last two bits, b 6 and b 7 are coded using reduced neighbour configurations, based on shielding/screening.
  • All functions may be implemented as look-up tables (LUTs) for reducing the size of the set of contexts.
  • all the reductions are factorised in reduction functions, i . e . simply LUTs, that take the contexts as input and provide reduced contexts as output.
  • the total number of contexts has been reduced from 2550 to 576, with the output size of each reduction function BR i being 70, 106, 110 and 119, respectively.
  • Each of the previously described context reduction operations may be further used in a compression system with a static (fixed) minimal number of contexts.
  • one or more reduction operations are applied to determine the context probability model with which to encode or decode the symbol.
  • the encoder 1100 includes a processor 1102, memory 1104, and an encoding application 1106.
  • the encoding application 1106 may include a computer program or application stored in memory 1104 and containing instructions that, when executed, cause the processor 1102 to perform operations such as those described herein.
  • the encoding application 1106 may encode and output bitstreams encoded in accordance with the processes described herein. It will be understood that the encoding application 1106 may be stored on a non-transitory computer-readable medium, such as a compact disc, flash memory device, random access memory, hard drive, etc.
  • the processor 1102 When the instructions are executed, the processor 1102 carries out the operations and functions specified in the instructions so as to operate as a special-purpose processor that implements the described process(es). Such a processor may be referred to as a "processor circuit” or “processor circuitry” in some examples.
  • the decoder 1200 includes a processor 1202, a memory 1204, and a decoding application 1206.
  • the decoding application 1206 may include a computer program or application stored in memory 1204 and containing instructions that, when executed, cause the processor 1202 to perform operations such as those described herein. It will be understood that the decoding application 1206 may be stored on a computer-readable medium, such as a compact disc, flash memory device, random access memory, hard drive, etc.
  • the processor 1202 carries out the operations and functions specified in the instructions so as to operate as a special-purpose processor that implements the described process(es).
  • Such a processor may be referred to as a "processor circuit” or “processor circuitry” in some examples.
  • the decoder and/or encoder may be implemented in a number of computing devices, including, without limitation, servers, suitably-programmed general purpose computers, machine vision systems, and mobile devices.
  • the decoder or encoder may be implemented by way of software containing instructions for configuring a processor or processors to carry out the functions described herein.
  • the software instructions may be stored on any suitable non-transitory computer-readable memory, including CDs, RAM, ROM, Flash memory, etc.
  • decoder and/or encoder described herein and the module, routine, process, thread, or other software component implementing the described method/process for configuring the encoder or decoder may be realized using standard computer programming techniques and languages.
  • the present application is not limited to particular processors, computer languages, computer programming conventions, data structures, other such implementation details.
  • Those skilled in the art will recognize that the described processes may be implemented as a part of computer-executable code stored in volatile or non-volatile memory, as part of an application-specific integrated chip (ASIC), etc.
  • ASIC application-specific integrated chip
  • the present application also provides for a computer-readable signal encoding the data produced through application of an encoding process in accordance with the present application.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Physics (AREA)
  • Computational Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Software Systems (AREA)
  • Geometry (AREA)
  • Operations Research (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Biology (AREA)
  • Algebra (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Databases & Information Systems (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Computer Graphics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Image Generation (AREA)
  • Complex Calculations (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)
EP18290112.4A 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points Active EP3514966B1 (fr)

Priority Applications (8)

Application Number Priority Date Filing Date Title
EP23169774.9A EP4231241A1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points
CN201980065237.9A CN112789804B (zh) 2018-01-18 2019-10-02 用于点云的二进制熵编解码的方法和设备
JP2021517937A JP7504086B2 (ja) 2018-01-18 2019-10-02 点群のバイナリエントロピコーディングのための方法およびデバイス
US17/280,750 US12020460B2 (en) 2018-01-18 2019-10-02 Methods and devices for binary entropy coding of point clouds
KR1020217010900A KR102690193B1 (ko) 2018-01-18 2019-10-02 포인트 클라우드의 이진 엔트로피 코딩 방법 및 디바이스
PCT/EP2019/076710 WO2020070191A1 (fr) 2018-01-18 2019-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points
JP2024094293A JP2024114718A (ja) 2018-01-18 2024-06-11 点群のバイナリエントロピコーディングのための方法およびデバイス
US18/750,557 US20240346708A1 (en) 2018-01-18 2024-06-21 Methods and Devices for Binary Entropy Coding of Point Clouds

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP18305037.6A EP3514968B1 (fr) 2018-01-18 2018-01-18 Procédés et dispositifs de codage entropique de nuages de points

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP23169774.9A Division EP4231241A1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points

Publications (2)

Publication Number Publication Date
EP3514966A1 true EP3514966A1 (fr) 2019-07-24
EP3514966B1 EP3514966B1 (fr) 2023-04-26

Family

ID=61094362

Family Applications (6)

Application Number Title Priority Date Filing Date
EP23160508.0A Pending EP4213096A1 (fr) 2018-01-18 2018-01-18 Procédés et dispositifs pour le codage entropique de nuages de points
EP18305037.6A Active EP3514968B1 (fr) 2018-01-18 2018-01-18 Procédés et dispositifs de codage entropique de nuages de points
EP18290113.2A Active EP3514967B1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points
EP23169774.9A Pending EP4231241A1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points
EP18290112.4A Active EP3514966B1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points
EP21195127.2A Pending EP3937140A1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points

Family Applications Before (4)

Application Number Title Priority Date Filing Date
EP23160508.0A Pending EP4213096A1 (fr) 2018-01-18 2018-01-18 Procédés et dispositifs pour le codage entropique de nuages de points
EP18305037.6A Active EP3514968B1 (fr) 2018-01-18 2018-01-18 Procédés et dispositifs de codage entropique de nuages de points
EP18290113.2A Active EP3514967B1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points
EP23169774.9A Pending EP4231241A1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP21195127.2A Pending EP3937140A1 (fr) 2018-01-18 2018-10-02 Procédés et dispositifs de codage entropique binaire de nuages de points

Country Status (7)

Country Link
US (7) US11455749B2 (fr)
EP (6) EP4213096A1 (fr)
JP (4) JP7504086B2 (fr)
KR (3) KR102627394B1 (fr)
CN (4) CN118433384A (fr)
FI (2) FI3514968T3 (fr)
WO (3) WO2019140510A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021207947A1 (fr) * 2020-04-14 2021-10-21 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de traitement d'un nuage de points
US11206426B2 (en) * 2018-06-27 2021-12-21 Panasonic Intellectual Property Corporation Of America Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device using occupancy patterns
CN114004902A (zh) * 2021-11-02 2022-02-01 中国联合网络通信集团有限公司 一种点云压缩方法、装置及计算机可读存储介质
WO2022134752A1 (fr) * 2020-12-23 2022-06-30 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage entropique de données de géométrie de nuage de points capturées par une tête de capteurs de filage
WO2022150680A1 (fr) * 2021-01-11 2022-07-14 Interdigital Patent Holdings, Inc. Appareil et procédé de traitement de nuage de points
WO2022213570A1 (fr) * 2021-04-08 2022-10-13 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage de nuage de points de données géométriques capturé par une tête de capteur rotative
CN115474050A (zh) * 2021-06-11 2022-12-13 维沃移动通信有限公司 熵编码、解码方法及装置
WO2023059727A1 (fr) * 2021-10-05 2023-04-13 Interdigital Vc Holdings, Inc. Procédé et appareil de compression de nuage de points à l'aide d'un codage d'entropie profonde hybride
WO2023151170A1 (fr) * 2022-02-11 2023-08-17 北京大学深圳研究生院 Procédé de compression de nuage de points et procédé de décompression de nuage de points

Families Citing this family (39)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI3514968T3 (fi) 2018-01-18 2023-05-25 Blackberry Ltd Menetelmiä ja laitteita pistepilvien entropiakoodausta varten
EP3745355A4 (fr) * 2018-01-26 2021-03-24 Panasonic Intellectual Property Corporation of America Procédé de codage de données tridimensionnelles, procédé de décodage de données tridimensionnelles, dispositif de codage de données tridimensionnelles et dispositif de décodage de données tridimensionnelles
JP7348078B2 (ja) * 2018-02-08 2023-09-20 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ 三次元データ符号化方法、三次元データ復号方法、三次元データ符号化装置、及び三次元データ復号装置
WO2019182102A1 (fr) * 2018-03-23 2019-09-26 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Procédé de codage et de décodage de données tridimensionnelles et dispositif de codage et de décodage de données tridimensionnelles
EP3595180B1 (fr) * 2018-07-10 2021-12-08 BlackBerry Limited Procédés et dispositifs de prédiction d'occupation à base de voisinage dans une compression de nuage de points
WO2020032004A1 (fr) 2018-08-06 2020-02-13 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Procédé de stockage de données tridimensionnelles, procédé d'acquisition de données tridimensionnelles, dispositif de stockage de données tridimensionnelles et dispositif d'acquisition de données tridimensionnelles
EP4002277A4 (fr) 2019-08-14 2023-02-22 LG Electronics Inc. Dispositif de transmission de données de nuage de points, procédé de transmission de données de nuage de points, dispositif de réception de données de nuage de points, et procédé de réception de données de nuage de points
KR102423498B1 (ko) * 2019-08-14 2022-07-22 엘지전자 주식회사 포인트 클라우드 데이터 송신 장치, 포인트 클라우드 데이터 송신 방법, 포인트 클라우드 데이터 수신 장치 및 포인트 클라우드 데이터 수신 방법
JP2022172413A (ja) * 2019-09-26 2022-11-16 シャープ株式会社 三次元表現変換装置、および、三次元表現逆変換装置
US11676310B2 (en) * 2019-11-16 2023-06-13 Uatc, Llc System and methods for encoding octree structured point cloud data using an entropy model
US11223836B2 (en) * 2019-12-02 2022-01-11 Tencent America LLC Method and apparatus for point cloud coding
CN114930823A (zh) * 2020-01-06 2022-08-19 Oppo广东移动通信有限公司 帧内预测方法、装置、编码器、解码器、及存储介质
EP4078957A4 (fr) * 2020-02-12 2024-01-03 Google LLC Codage entropique multi-contexte pour la compression de graphes
KR20220157490A (ko) 2020-03-24 2022-11-29 광동 오포 모바일 텔레커뮤니케이션즈 코포레이션 리미티드 인트라 예측 방법, 장치, 인코더, 디코더 및 저장 매체
WO2021232251A1 (fr) * 2020-05-19 2021-11-25 Oppo广东移动通信有限公司 Procédé de codage et de décodage de nuages de points, codeur, décodeur et support de stockage
KR102592986B1 (ko) * 2020-06-03 2023-10-20 텐센트 아메리카 엘엘씨 포인트 클라우드 코딩을 위한 점유 코딩의 콘텍스트 모델링
US11615556B2 (en) 2020-06-03 2023-03-28 Tencent America LLC Context modeling of occupancy coding for point cloud coding
US11438628B2 (en) * 2020-06-03 2022-09-06 Tencent America LLC Hash-based accessing of geometry occupancy information for point cloud coding
WO2021246843A1 (fr) * 2020-06-05 2021-12-09 엘지전자 주식회사 Dispositif de transmission de données de nuage de points, procédé de transmission de données de nuage de points, dispositif de réception de données de nuage de points, et procédé de réception de données de nuage de points
US20230224506A1 (en) * 2020-06-24 2023-07-13 Beijing Xiaomi Mobile Software Co., Ltd. Method for encoding and decoding, encoder, and decoder
US20230410377A1 (en) * 2020-10-06 2023-12-21 Beijing Xiaomi Mobile Software Co., Ltd. Method of encoding and decoding, encoder, decoder
WO2022109885A1 (fr) * 2020-11-25 2022-06-02 Oppo广东移动通信有限公司 Procédé de codage et de décodage de nuages de points, codeur, décodeur et support de stockage informatique
WO2022126326A1 (fr) * 2020-12-14 2022-06-23 Oppo广东移动通信有限公司 Procédé de codage de nuages de points, procédé de décodage de nuages de points, codeur, décodeur et support de stockage informatique
EP4020816A1 (fr) 2020-12-23 2022-06-29 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage de données géométriques de nuages de points capturées par une tête de capteur rotative
CN115086716B (zh) * 2021-03-12 2023-09-08 腾讯科技（深圳）有限公司 点云中邻居点的选择方法、装置及编解码器
CN113395603B (zh) * 2021-06-25 2022-04-01 合肥工业大学 一种基于模型预测控制的点云视频流自适应传输方法
WO2023287220A1 (fr) * 2021-07-15 2023-01-19 엘지전자 주식회사 Procédé de transmission de données de nuage de points, dispositif de transmission de données de nuage de points, procédé de réception de données de nuage de points, et dispositif de réception de données de nuage de points
CN113676738B (zh) * 2021-08-19 2024-03-29 上海交通大学 一种三维点云的几何编解码方法及装置
EP4195158A1 (fr) * 2021-12-10 2023-06-14 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage d'une série de données
CN116309896A (zh) * 2021-12-20 2023-06-23 华为技术有限公司 数据编解码方法、装置和设备
WO2023133710A1 (fr) * 2022-01-11 2023-07-20 Oppo广东移动通信有限公司 Procédé de codage, procédé de décodage, codeur, décodeur et système de codage et de décodage
KR20240117567A (ko) * 2022-01-12 2024-08-01 엘지전자 주식회사 포인트 클라우드 데이터 송신 방법, 포인트 클라우드 데이터 송신 장치, 포인트 클라우드 데이터 수신 방법 및 포인트 클라우드 데이터 수신 장치
KR20230153312A (ko) * 2022-04-28 2023-11-06 인텔렉추얼디스커버리 주식회사 포인트 클라우드 압축 방법 및 장치
US20240013399A1 (en) * 2022-07-05 2024-01-11 Alibaba (China) Co., Ltd. Pyramid architecture for multi-scale processing in point cloud segmentation
EP4345752A1 (fr) * 2022-09-28 2024-04-03 Beijing Xiaomi Mobile Software Co., Ltd. Codage/décodage de positions de points d'un nuage de points compris dans des volumes cuboïde
WO2024148491A1 (fr) * 2023-01-09 2024-07-18 Oppo广东移动通信有限公司 Procédé de codage, procédé de décodage, flux de code, codeur, décodeur et support d'enregistrement
WO2024151132A1 (fr) * 2023-01-13 2024-07-18 엘지전자 주식회사 Dispositif de transmission de données de nuage de points, procédé de transmission de données de nuage de points, dispositif de réception de données de nuage de points et procédé de réception de données de nuage de points
CN116320503A (zh) * 2023-03-14 2023-06-23 腾讯科技（深圳）有限公司 几何模式的确定方法、装置、设备及存储介质
CN115951589B (zh) * 2023-03-15 2023-06-06 中科院南京天文仪器有限公司 基于最大化Kozachenko-Leonenko熵的恒星均匀选取方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030214502A1 (en) * 2001-11-27 2003-11-20 Samsung Electronics Co., Ltd. Apparatus and method for depth image-based representation of 3-dimensional object
US20110310976A1 (en) * 2010-06-17 2011-12-22 Qualcomm Incorporated Joint Coding of Partition Information in Video Coding
WO2013067673A1 (fr) * 2011-11-07 2013-05-16 Thomson Licensing Décodage de position prédictif
US20170347100A1 (en) * 2016-05-28 2017-11-30 Microsoft Technology Licensing, Llc Region-adaptive hierarchical transform and entropy coding for point cloud compression, and corresponding decompression

Family Cites Families (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5742892A (en) * 1995-04-18 1998-04-21 Sun Microsystems, Inc. Decoder for a software-implemented end-to-end scalable video delivery system
KR20020030101A (ko) 2000-06-30 2002-04-22 요트.게.아. 롤페즈 비디오 시퀀스의 압축을 위한 인코딩 방법
KR100969764B1 (ko) * 2008-02-13 2010-07-13 삼성전자주식회사 메쉬 모델로 구현된 3차원 데이터의 부호화 및 복호화 방법
EP2362658A1 (fr) * 2010-02-26 2011-08-31 Research In Motion Limited Procédés de codage et de décodage, et dispositifs utilisant des ensembles de codes doubles
US8942282B2 (en) * 2010-04-12 2015-01-27 Qualcomm Incorporated Variable length coding of coded block pattern (CBP) in video compression
CA2799763A1 (fr) 2010-07-13 2012-01-19 Research In Motion Limited Procedes et dispositifs de compression de donnees utilisant un ordre de codage base sur le contexte
EP2749023A4 (fr) * 2011-08-25 2016-04-06 Thomson Licensing Codage et décodage hiérarchique par entropie
IN2014CN03598A (fr) 2011-11-04 2015-07-31 Sharp Kk
WO2013067674A1 (fr) * 2011-11-07 2013-05-16 Thomson Licensing Codage de position prédictif
KR20130085389A (ko) * 2012-01-19 2013-07-29 삼성전자주식회사 서브영역별로 엔트로피 부호화의 병렬 처리가 가능한 비디오 부호화 방법 및 장치, 서브영역별로 엔트로피 복호화의 병렬 처리가 가능한 비디오 복호화 방법 및 장치
DK3416292T3 (da) 2012-04-15 2020-03-09 Samsung Electronics Co Ltd Videoafkodningsapparat ved anvendelse af parameteropdatering til de-binærisering af en entropikodet transformationskoefficient og indkodnings-fremgangsmåde anvendende det samme til binærisering
JP6826368B2 (ja) 2016-01-14 2021-02-03 キヤノン株式会社 符号化装置及びその制御方法
US20170214943A1 (en) * 2016-01-22 2017-07-27 Mitsubishi Electric Research Laboratories, Inc. Point Cloud Compression using Prediction and Shape-Adaptive Transforms
US10694210B2 (en) 2016-05-28 2020-06-23 Microsoft Technology Licensing, Llc Scalable point cloud compression with transform, and corresponding decompression
CN106095968A (zh) * 2016-06-20 2016-11-09 山东理工大学 n维海量点云的R树形位多目标结点分裂方法
EP3301914A1 (fr) 2016-09-30 2018-04-04 Thomson Licensing Procédé et appareil de codage et de décodage d'une vidéo à champ de vision large
US10496336B2 (en) * 2016-11-17 2019-12-03 Google Llc K-D tree encoding for point clouds using deviations
CN107403456B (zh) * 2017-07-28 2019-06-18 北京大学深圳研究生院 一种基于kd树和优化图变换的点云属性压缩方法
US10897269B2 (en) * 2017-09-14 2021-01-19 Apple Inc. Hierarchical point cloud compression
US10861196B2 (en) 2017-09-14 2020-12-08 Apple Inc. Point cloud compression
US10607373B2 (en) * 2017-11-22 2020-03-31 Apple Inc. Point cloud compression with closed-loop color conversion
FI3514968T3 (fi) 2018-01-18 2023-05-25 Blackberry Ltd Menetelmiä ja laitteita pistepilvien entropiakoodausta varten
EP3745355A4 (fr) 2018-01-26 2021-03-24 Panasonic Intellectual Property Corporation of America Procédé de codage de données tridimensionnelles, procédé de décodage de données tridimensionnelles, dispositif de codage de données tridimensionnelles et dispositif de décodage de données tridimensionnelles
WO2019182102A1 (fr) * 2018-03-23 2019-09-26 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Procédé de codage et de décodage de données tridimensionnelles et dispositif de codage et de décodage de données tridimensionnelles
US11010928B2 (en) 2018-04-10 2021-05-18 Apple Inc. Adaptive distance based point cloud compression
WO2019240215A1 (fr) 2018-06-13 2019-12-19 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Procédé de codage de données tridimensionnelles, procédé de décodage de données tridimensionnelles, dispositif de codage de données tridimensionnelles et dispositif de décodage de données tridimensionnelles
EP3816939A4 (fr) * 2018-06-15 2021-06-30 Panasonic Intellectual Property Corporation of America Procédé de codage de données tridimensionnelles, procédé de décodage de données tridimensionnelles, dispositif de codage de données tridimensionnelles, et dispositif de décodage de données tridimensionnelles
JP7322020B2 (ja) * 2018-06-27 2023-08-07 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ 三次元データ符号化方法、三次元データ復号方法、三次元データ符号化装置、及び三次元データ復号装置
KR102423499B1 (ko) 2020-01-07 2022-07-22 엘지전자 주식회사 포인트 클라우드 데이터 송신 장치, 포인트 클라우드 데이터 송신 방법, 포인트 클라우드 데이터 수신 장치 및 포인트 클라우드 데이터 수신 방법
US11417030B2 (en) * 2020-02-10 2022-08-16 Tencent America LLC Context modeling of occupancy coding for point cloud coding
US11450031B2 (en) * 2020-04-14 2022-09-20 Apple Inc. Significant coefficient flag encoding for point cloud attribute compression

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030214502A1 (en) * 2001-11-27 2003-11-20 Samsung Electronics Co., Ltd. Apparatus and method for depth image-based representation of 3-dimensional object
US20110310976A1 (en) * 2010-06-17 2011-12-22 Qualcomm Incorporated Joint Coding of Partition Information in Video Coding
WO2013067673A1 (fr) * 2011-11-07 2013-05-16 Thomson Licensing Décodage de position prédictif
US20170347100A1 (en) * 2016-05-28 2017-11-30 Microsoft Technology Licensing, Llc Region-adaptive hierarchical transform and entropy coding for point cloud compression, and corresponding decompression

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ARMIN HORNUNG ET AL: "OctoMap: an efficient probabilistic 3D mapping framework based on octrees", AUTONOMOUS ROBOTS, vol. 34, no. 3, 7 February 2013 (2013-02-07), pages 189 - 206, XP055147395, ISSN: 0929-5593, DOI: 10.1007/s10514-012-9321-0 *
JINGLIANG PENG ET AL: "Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition", 20050701; 20050731 - 20050804, 1 July 2005 (2005-07-01), pages 609 - 616, XP058335247, DOI: 10.1145/1186822.1073237 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11206426B2 (en) * 2018-06-27 2021-12-21 Panasonic Intellectual Property Corporation Of America Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device using occupancy patterns
WO2021207947A1 (fr) * 2020-04-14 2021-10-21 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de traitement d'un nuage de points
CN113812164A (zh) * 2020-04-14 2021-12-17 北京小米移动软件有限公司 用于处理点云的方法和装置
WO2022134752A1 (fr) * 2020-12-23 2022-06-30 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage entropique de données de géométrie de nuage de points capturées par une tête de capteurs de filage
WO2022150680A1 (fr) * 2021-01-11 2022-07-14 Interdigital Patent Holdings, Inc. Appareil et procédé de traitement de nuage de points
WO2022213570A1 (fr) * 2021-04-08 2022-10-13 Beijing Xiaomi Mobile Software Co., Ltd. Procédé et appareil de codage/décodage de nuage de points de données géométriques capturé par une tête de capteur rotative
CN115474050A (zh) * 2021-06-11 2022-12-13 维沃移动通信有限公司 熵编码、解码方法及装置
WO2023059727A1 (fr) * 2021-10-05 2023-04-13 Interdigital Vc Holdings, Inc. Procédé et appareil de compression de nuage de points à l'aide d'un codage d'entropie profonde hybride
CN114004902A (zh) * 2021-11-02 2022-02-01 中国联合网络通信集团有限公司 一种点云压缩方法、装置及计算机可读存储介质
WO2023151170A1 (fr) * 2022-02-11 2023-08-17 北京大学深圳研究生院 Procédé de compression de nuage de points et procédé de décompression de nuage de points

Also Published As

Publication number Publication date
US12020460B2 (en) 2024-06-25
KR20210068041A (ko) 2021-06-08
FI3514968T3 (fi) 2023-05-25
WO2020070191A1 (fr) 2020-04-09
EP3937140A1 (fr) 2022-01-12
EP3514968B1 (fr) 2023-03-08
CN112789804A (zh) 2021-05-11
US20240078714A1 (en) 2024-03-07
US20220392118A1 (en) 2022-12-08
CN111615792A (zh) 2020-09-01
US20210343046A1 (en) 2021-11-04
US11900641B2 (en) 2024-02-13
JP2022501744A (ja) 2022-01-06
KR102627394B1 (ko) 2024-01-18
CN111615792B (zh) 2024-05-28
JP2022503986A (ja) 2022-01-12
JP7507750B2 (ja) 2024-06-28
US20240185474A1 (en) 2024-06-06
KR20200109334A (ko) 2020-09-22
JP7504086B2 (ja) 2024-06-21
JP2024114718A (ja) 2024-08-23
EP3514967A1 (fr) 2019-07-24
US20240346708A1 (en) 2024-10-17
KR102690193B1 (ko) 2024-07-30
WO2019140510A1 (fr) 2019-07-25
WO2020070192A1 (fr) 2020-04-09
EP4231241A1 (fr) 2023-08-23
FI3514966T3 (fi) 2023-06-28
CN118433384A (zh) 2024-08-02
EP3514968A1 (fr) 2019-07-24
EP3514967B1 (fr) 2021-09-08
US11741638B2 (en) 2023-08-29
CN112789803A (zh) 2021-05-11
CN112789803B (zh) 2024-10-01
US11455749B2 (en) 2022-09-27
KR102690197B1 (ko) 2024-07-30
KR20210068040A (ko) 2021-06-08
EP3514966B1 (fr) 2023-04-26
EP4213096A1 (fr) 2023-07-19
US20210350583A1 (en) 2021-11-11
JP2024119999A (ja) 2024-09-03
CN112789804B (zh) 2024-08-16
US20210004992A1 (en) 2021-01-07

Similar Documents

Publication Publication Date Title
US12020460B2 (en) Methods and devices for binary entropy coding of point clouds
US11861869B2 (en) Methods and devices for binary entropy coding of point clouds
EP3595180B1 (fr) Procédés et dispositifs de prédiction d'occupation à base de voisinage dans une compression de nuage de points

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

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

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

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

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20200121

RBV Designated contracting states (corrected)

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

REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 40012184

Country of ref document: HK

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: 20210311

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

Free format text: STATUS: EXAMINATION IS IN PROGRESS

RIC1 Information provided on ipc code assigned before grant

Ipc: G06T 9/40 20060101ALN20220902BHEP

Ipc: G06T 9/00 20060101ALN20220902BHEP

Ipc: H04N 19/91 20140101ALI20220902BHEP

Ipc: H04N 19/96 20140101ALI20220902BHEP

Ipc: H03M 7/40 20060101AFI20220902BHEP

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: G06T 9/40 20060101ALN20221007BHEP

Ipc: G06T 9/00 20060101ALN20221007BHEP

Ipc: H04N 19/91 20140101ALI20221007BHEP

Ipc: H04N 19/96 20140101ALI20221007BHEP

Ipc: H03M 7/40 20060101AFI20221007BHEP

INTG Intention to grant announced

Effective date: 20221116

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

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

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

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: DE

Ref legal event code: R096

Ref document number: 602018048853

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1563569

Country of ref document: AT

Kind code of ref document: T

Effective date: 20230515

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1563569

Country of ref document: AT

Kind code of ref document: T

Effective date: 20230426

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

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: 20230828

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: 20230726

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: 20230426

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: 20230426

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

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: 20230426

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: 20230426

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: 20230426

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: 20230426

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: 20230826

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: 20230426

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: 20230727

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

Ref country code: NL

Payment date: 20231026

Year of fee payment: 6

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

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: 20230426

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

Ref country code: GB

Payment date: 20231027

Year of fee payment: 6

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602018048853

Country of ref document: DE

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: 20230426

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: 20230426

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: 20230426

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: 20230426

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: 20230426

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: 20230426

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

Ref country code: SE

Payment date: 20231027

Year of fee payment: 6

Ref country code: FR

Payment date: 20231025

Year of fee payment: 6

Ref country code: FI

Payment date: 20231025

Year of fee payment: 6

Ref country code: DE

Payment date: 20231027

Year of fee payment: 6

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

26N No opposition filed

Effective date: 20240129

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602018048853

Country of ref document: DE

Ref country code: DE

Ref legal event code: R081

Ref document number: 602018048853

Country of ref document: DE

Owner name: MALIKIE INNOVATIONS LTD., IE

Free format text: FORMER OWNER: BLACKBERRY LIMITED, WATERLOO, ONTARIO, CA

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

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: 20230426

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

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: 20230426

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: 20230426

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: 20230426

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20231031

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: 20231002

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20240530 AND 20240605

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: 20231002

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: 20231031

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: 20231031

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: 20231031

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: 20231002