Geometry model for point cloud coding

    公开(公告)号:US11158116B2

    公开(公告)日:2021-10-26

    申请号:US16926110

    申请日:2020-07-10

    摘要: A method, computer program, and computer system for point cloud coding is provided. Data corresponding to a point cloud is received, and one or more geometric features are detected from among the data corresponding to the point cloud. A representation is determined for one or more of the detected geometric features, and the received data is encoded or decoded based on the determined representations whereby the point cloud is reconstructed based on the decoded data.

    Convolutional approach to fast and compact packing of 3D mesh into 2D maps

    公开(公告)号:US12112510B2

    公开(公告)日:2024-10-08

    申请号:US18050372

    申请日:2022-10-27

    IPC分类号: G06T9/00

    CPC分类号: G06T9/001

    摘要: This disclosure relates generally to coding and decoding of 3-dimensional (3D) mesh and specifically to fast and efficient packing of parts of a 3D mesh into a map in a 2-dimensional (2D) space. In one example, a 3D mesh frame is decomposed into charts. The charts are iteratively projected and packed into a 2D map to achieve improved compactness by using an image filtering technology. The image filtering technology may involve perform efficient convolution and correlation processing using fast Fourier transform.

    Method and apparatus for point cloud coding

    公开(公告)号:US11948336B2

    公开(公告)日:2024-04-02

    申请号:US17354834

    申请日:2021-06-22

    CPC分类号: G06T9/00 H04N19/184 H04N19/96

    摘要: Aspects of the disclosure provide methods and apparatuses for point cloud compression and decompression. In some examples, an apparatus for point cloud compression/decompression includes processing circuitry. In some examples, the processing circuitry receives a bitstream carrying compressed data for a point cloud. The processing circuitry determines that a current node in an octree structure is eligible for an isolated mode. The octree structure corresponds to three dimensional (3D) partitions of a space of the point cloud. Then the processing circuitry determines, based on information of one or more other nodes, a single isolated point flag for the current node that indicates whether the current node is coded with a single isolated point.

    MULTIPLE ATTRIBUTE MAPS MERGING
    34.
    发明公开

    公开(公告)号:US20240104783A1

    公开(公告)日:2024-03-28

    申请号:US18314307

    申请日:2023-05-09

    IPC分类号: G06T9/00 G06T7/40

    CPC分类号: G06T9/001 G06T7/40

    摘要: Method, apparatus, and system for merging multiple attribute maps for mesh compression may be provided. The process may include obtaining multiple attribute maps associated with a mesh including one or more texture maps. The multiple attribute maps may be concatenated into a single concatenated map and concatenated UV coordinates for each of the multiple attribute maps may be generated based on re-computing original UV coordinates of each of the multiple attribute maps within the single concatenated map.

    ON CODING OF BOUNDARY UV2XYZ INDEX FOR MESH COMPRESSION

    公开(公告)号:US20230334713A1

    公开(公告)日:2023-10-19

    申请号:US18191457

    申请日:2023-03-28

    IPC分类号: G06T9/00 H04N19/91

    CPC分类号: G06T9/001 H04N19/91

    摘要: A method performed in a decoder includes receiving a coded video bitstream that includes (i) one or more two dimensional (2D) meshes corresponding to a three dimensional (3D) mesh and (ii) a 2D to 3D index array that maps each vertex in the one or more 2D meshes to a respective vertex in the 3D mesh. The method further includes reconstructing the 3D mesh using the 2D to 3D index array to map each vertex in the one or more 2D meshes to the respective vertex in the 3D mesh. The 2D to 3D index array encoded in a tuple format in which each tuple in the 2D to 3D index array includes a first parameter that specifies a starting index of a run, a second parameter that specifies a length of the run, and a third parameter that specifies a direction of the run.

    Parallel encoding for point cloud compression

    公开(公告)号:US11736726B2

    公开(公告)日:2023-08-22

    申请号:US17742232

    申请日:2022-05-11

    摘要: Aspects of the disclosure provide methods, apparatuses, and a non-transitory computer-readable medium for point cloud compression and decompression. In a method, an octree partitioning structure for a bounding box of a point cloud is determined. Whether parallel encoding is to be performed on occupancy codes of nodes in a range of one or more partitioning depths in the octree partitioning structure is determined. The parallel encoding on the occupancy codes of the nodes is performed in response to the parallel encoding being determined to be performed on the occupancy codes of the nodes in the range of the one or more partitioning depths in the octree partitioning structure. A coded bitstream is generated based on the encoded occupancy codes of the nodes. The coded bitstream includes syntax information that indicates whether parallel decoding is to be performed on the occupancy codes of the nodes in the range.

    Method and apparatus for point cloud coding

    公开(公告)号:US11611775B2

    公开(公告)日:2023-03-21

    申请号:US17404740

    申请日:2021-08-17

    IPC分类号: H04N19/597 H04N19/70

    摘要: In some examples, an apparatus for point cloud compression/decompression includes processing circuitry. The processing circuitry determines a flag that indicates an enable/disable control for saving coding state in a largest coding unit (LCU) based coding of a point cloud. In some examples, the processing circuitry stores coding state information before a coding of a first LCU; and in response to the flag indicating an enable control, the processing circuitry restores, a coding state according to the stored coding state information before a coding of a second LCU. In some examples, in response to the flag indicating an enable control, the processing circuitry stores the coding state information before the coding of the first LCU. In some examples, in response to the flag indicating a disable control, the processing circuitry skip the storing/restoring of the coding state information.