EP4792296A1 - Octree feature for deep-feature based point cloud compression - Google Patents

Octree feature for deep-feature based point cloud compression

Info

Publication number
EP4792296A1
EP4792296A1 EP24800968.0A EP24800968A EP4792296A1 EP 4792296 A1 EP4792296 A1 EP 4792296A1 EP 24800968 A EP24800968 A EP 24800968A EP 4792296 A1 EP4792296 A1 EP 4792296A1
Authority
EP
European Patent Office
Prior art keywords
feature
octree
passing
processor
obtaining
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.)
Pending
Application number
EP24800968.0A
Other languages
German (de)
French (fr)
Inventor
Jiahao PANG
Junghyun Ahn
Muhammad Asad LODHI
Dong Tian
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.)
InterDigital VC Holdings Inc
Original Assignee
InterDigital VC Holdings Inc
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 InterDigital VC Holdings Inc filed Critical InterDigital VC Holdings Inc
Publication of EP4792296A1 publication Critical patent/EP4792296A1/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding
    • G06T9/001—Model-based coding, e.g. wire frame
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/597—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/045—Combinations of networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Health & Medical Sciences (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Computation (AREA)
  • Artificial Intelligence (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Some embodiments of an encoding method may include: obtaining information including a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and aggregating a feature based on the second feature. Some embodiments of an decoding method may include: obtaining an octree feature from an octree coding process; obtaining an input feature; determining a new input feature by fusing the octree feature with the input feature; and aggregating a feature based on the new input feature.

Description

OCTREE FEATURE FOR DEEP-FEATURE BASED POINT CLOUD COMPRESSION
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] The present application claims benefit of U.S. Provisional Patent Application No. 63/543,466, entitled “OCTREE FEATURE FOR DEEP-FEATURE BASED POINT CLOUD COMPRESSION” and filed October 10, 2023, which is hereby incorporated by reference in its entirety.
INCORPORATION BY REFERENCE
[0002] The present application incorporates by reference in their entirety International Application No. PCT/US2022/045790, entitled “METHOD AND APPARATUS FOR POINT CLOUD COMPRESSION USING HYBRID DEEP ENTROPY CODING” and filed October 5, 2022 (“790 application”), which claims benefit under 35 U.S.C. § 119(e) from U.S. Provisional Patent Application Serial No. 63/252,482, entitled “METHOD AND APPARATUS FOR POINT CLOUD COMPRESSION USING HYBRID DEEP ENTROPY CODING” and filed October 5, 2021 (‘“482 application”); International Application No. PCT/US2023/027509, entitled “LEARNING BASED OCTREE ENTROPY CODING COMPRESSION AND PROCESSING IN LIGHT DETECTION AND RANGING (LIDAR) AND OTHER SYSTEMS” and filed July 12, 2023 (“‘609 application”), which claims benefit under 35 U.S.C. § 119(e) from U.S. Provisional Patent Application Serial No. 63/388,462, entitled “LEARNING BASED BITWISE OCTREE ENTROPY CODING COMPRESSION AND PROCESSING IN LIGHT DETECTION AND RANGING (LIDAR) AND OTHER SYSTEMS” and tiled July 12, 2022 (“‘462 application”); U.S. Provisional Patent Application Serial No. 63/388,600, entitled “Deep Distribution-Aware Point Feature Extractor for Al-Based Point Cloud Compression” and filed July 12, 2022 (“‘600 application”); and U.S. Provisional Patent Application Serial No. 63/438,212, entitled “Context-Aware Voxel-Based Upsampling for Point Cloud Processing” and filed January 10, 2023 (“‘212 application”). BACKGROUND
[0003] A point cloud is a data format used across several business domains from autonomous driving, robotics, AR/VR, civil engineering, computer graphics, to the animation /movie industry. 3D LiDAR sensors have been deployed in self-driving cars, and affordable LiDAR sensors are released from, e.g., Velodyne Velabit, Apple iPad Pro 2020, and Intel RealSense LiDAR camera L515. With advances in sensing technologies, 3D point cloud data becomes more practical than ever and is expected to be an ultimate enabler in the applications mentioned.
[0004] Point cloud data is also believed to consume a large portion of network traffic, e.g., immersive communications (VR/AR) and cars connected over a 5G network. Efficient representation formats may be used with point clouds and communication. In particular, raw point cloud data is organized and processed for the purposes of world modeling & sensing. Compression of raw point clouds may be used with storage and transmission of data in related scenarios.
SUMMARY
[0005] A first example method in accordance with some embodiments may include: obtaining information including a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and aggregating a feature based on the second feature.
[0006] For some embodiments of the first example method, the octree feature is used on at least one of an encoder process and a decoder process.
[0007] Some embodiments of the first example method may further include: transmitting a first bitstream encapsulating the aggregated feature; and transmitting a second bitstream encapsulating a block map from the octree coding process.
[0008] For some embodiments of the first example method, obtaining the octree feature from the octree coding process is based on a block map corresponding to the first feature.
[0009] For some embodiments of the first example method, obtaining the octree feature from the octree coding process includes: using a block map corresponding to the first feature as an input; and passing the block map through the octree coding process to generate the octree feature. [0010] For some embodiments of the first example method, aggregating the feature based on the second feature includes: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through a transformer process to generate the aggregated feature.
[0011] For some embodiments of the first example method, the transformer process includes one or more multi-layer perceptron (MLP) blocks.
[0012] For some embodiments of the first example method, aggregating the feature based on the second feature includes: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through an Inception-ResNet (IRN) process to generate the aggregated feature.
[0013] For some embodiments of the first example method, the IRN process includes one or more multi-layer perceptron (MLP) blocks.
[0014] For some embodiments of the first example method, aggregating the feature based on the second feature includes: performing an iterative process one or more times, wherein the iterative process includes: passing a fused feature through a multi-layer perceptron (MLP) block; passing an output of the MLP though one or more feature aggregation layers to generate an output feature; and fusing the output feature with the octree feature to generate the fused feature for a next pass through the iterative process, wherein the second feature is used as the fused feature for a first pass through the iterative process, and wherein the output feature becomes the aggregated feature for a final pass through the iterative process.
[0015] A first example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any of the methods listed above.
[0016] A second example method in accordance with some embodiments may include: obtaining an octree feature from an octree coding process; obtaining an input feature; determining a new input feature by fusing the octree feature with the input feature; and aggregating a feature based on the new input feature.
[0017] For some embodiments of the second example method, the octree feature is used on at least one of an encoder process and a decoder process. [0018] For some embodiments of the second example method, obtaining the octree feature from the octree coding process is based on a block map corresponding to the first feature.
[0019] For some embodiments of the second example method, obtaining the octree feature from the octree coding process includes: obtaining a bitstream including a block map previously-passed through an encoder octree coding process; using the bitstream as an input; and passing the bitstream through the octree coding process to generate the octree feature.
[0020] For some embodiments of the second example method, aggregating the feature based on the second feature includes: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through a transformer process to generate the aggregated feature.
[0021] For some embodiments of the second example method, the transformer process includes one or more multi-layer perceptron (MLP) blocks.
[0022] For some embodiments of the second example method, aggregating the feature based on the second feature includes: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through an I nception-ResNet (IRN) process to generate the aggregated feature.
[0023] For some embodiments of the second example method, the IRN process includes one or more multilayer perceptron (MLP) blocks.
[0024] For some embodiments of the second example method, aggregating the feature based on the second feature includes: performing an iterative process one or more times, wherein the iterative process includes: passing a fused feature through a multi-layer perceptron (MLP) block; passing an output of the MLP though one or more feature aggregation layers to generate an output feature; and fusing the output feature with the octree feature to generate the fused feature for a next pass through the iterative process, wherein the second feature is used as the fused feature for a first pass through the iterative process, and wherein the output feature becomes the aggregated feature for a final pass through the iterative process.
[0025] Some embodiments of the second example method may further include passing the octree feature and the aggregated feature through a point synthesis process to generate an output point cloud. [0026] A second example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any of the methods listed above.
[0027] A third example method in accordance with some embodiments may include: obtaining a first bitstream including an encoded block map; using the bitstream as an input to an octree decoding process; obtaining an octree feature and decoded block map from the octree decoding process; obtaining an input feature from a second bitstream; determining a new input feature by fusing the decoded block map with the input feature; and aggregating a feature based on the new input feature; and passing the octree feature and the aggregated feature through a point synthesis process to generate an output point cloud.
[0028] For some embodiments of the third example method, determining the new input feature further includes: determining the new input feature by fusing the octree feature with the decoded block map and the input feature.
[0029] For some embodiments of the third example method, a bitstream includes the first bitstream and the second bitstream.
[0030] A third example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any of the methods listed above.
[0031] A fourth example method in accordance with some embodiments may include: obtaining information including a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and passing the second feature through a feature aggregation process to generate a third feature.
[0032] A fourth example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any of the methods listed above.
[0033] A fifth example method in accordance with some embodiments may include: obtaining an octree feature from an octree coding process; obtaining a first feature as an input; generating a second feature by fusing the octree feature with the first feature; and passing the second feature through a feature aggregation process to generate a third feature.
[0034] A fifth example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any of the methods listed above.
[0035] A sixth example apparatus in accordance with some embodiments may include at least one processor configured to perform any of the methods listed above.
[0036] A seventh example apparatus in accordance with some embodiments may include a computer- readable medium storing instructions for causing one or more processors to perform any of the methods listed above.
[0037] An eighth example apparatus in accordance with some embodiments may include: at least one processor and at least one non-transitory computer-readable medium storing instructions for causing the at least one processor to perform any of the methods listed above.
[0038] An example signal in accordance with some embodiments may include a bitstream generated according to any of the methods listed above.
BRIEF DESCRIPTION OF THE DRAWINGS
[0039] FIG. 1A is a system diagram illustrating an example communications system according to some embodiments.
[0040] FIG. 1 B is a system diagram illustrating an example wireless transmit/receive unit (WTRU) that may be used within the communications system illustrated in FIG. 1 A according to some embodiments.
[0041] FIG. 1 C is a system diagram illustrating an example set of interfaces for a system according to some embodiments.
[0042] FIG. 2A is a functional block diagram of block-based video encoder, such as an encoder used for Versatile Video Coding (WC), according to some embodiments.
[0043] FIG. 2B is a functional block diagram of a block-based video decoder, such as a decoder used for WC, according to some embodiments. [0044] FIG. 3A is a schematic side view illustrating an example waveguide display that may be used with extended reality (XR) applications according to some embodiments.
[0045] FIG. 3B is a schematic side view illustrating an example alternative display type that may be used with extended reality applications according to some embodiments.
[0046] FIG. 3C is a schematic side view illustrating an example alternative display type that may be used with extended reality applications according to some embodiments.
[0047] FIG. 4 is a process diagram illustrating an example learning-based point cloud codec according to some embodiments.
[0048] FIG. 5 is a process diagram illustrating an example learning-based point cloud codec according to some embodiments.
[0049] FIG. 6 is a process diagram illustrating an example learning-based point cloud codec according to some embodiments.
[0050] FIG. 7 is a process diagram illustrating an example process to address an increase in dimensions and to compute a fused feature based on the octree feature according to some embodiments.
[0051] FIG. 8 is a process diagram illustrating an example feature extraction during encoding and feature aggregation during decoding according to some embodiments.
[0052] FIG. 9 is a process diagram illustrating an example feature aggregation I point synthesis during decoding according to some embodiments.
[0053] FIG. 10 is a process diagram illustrating an example deep octree-based encoding according to some embodiments.
[0054] FIG. 11 is a process diagram illustrating an example deep octree-based decoding according to some embodiments.
[0055] FIG. 12 is a process diagram illustrating an example Inception-ResNet block for feature aggregation according to some embodiments.
[0056] FIG. 13 is a process diagram illustrating an example transformer block for feature aggregation according to some embodiments. [0057] FIG. 14 is a process diagram illustrating an example self-attention block according to some embodiments.
[0058] FIG. 15 is a flowchart illustrating an example encoding process according to some embodiments.
[0059] FIG. 16 is a flowchart illustrating an example decoding process according to some embodiments.
[0060] The entities, connections, arrangements, and the like that are depicted in— and described in connection with— the various figures are presented by way of example and not byway of limitation. As such, any and all statements or other indications as to what a particular figure “depicts,” what a particular element or entity in a particular figure “is” or “has,” and any and all similar statements— that may in isolation and out of context be read as absolute and therefore limiting— may only properly be read as being constructively preceded by a clause such as “In at least one embodiment, ... " For brevity and clarity of presentation, this implied leading clause is not repeated ad nauseum in the detailed description.
DETAILED DESCRIPTION
[0061] FIG. 1A is a diagram illustrating an example communications system 100 in which one or more disclosed embodiments may be implemented. The communications system 100 may be a multiple access system that provides content, such as voice, data, video, messaging, broadcast, etc., to multiple wireless users. The communications system 100 may enable multiple wireless users to access such content through the sharing of system resources, including wireless bandwidth. For example, the communications systems 100 may employ one or more channel access methods, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), single-carrier FDMA (SC-FDMA), zero-tail unique-word DFT-Spread OFDM (ZT UW DTS-s OFDM), unique word OFDM (UW-OFDM), resource block-filtered OFDM, filter bank multicarrier (FBMC), and the like.
[0062] As shown in FIG. 1A, the communications system 100 may include wireless transmit/receive units (WTRUs) 102a, 102b, 102c, 102d, a RAN 104/113, a ON 106, a public switched telephone network (PSTN) 108, the Internet 110, and other networks 112, though it will be appreciated that the disclosed embodiments contemplate any number of WTRUs, base stations, networks, and/or network elements. Each of the WTRUs 102a, 102b, 102c, 102d may be any type of device configured to operate and/or communicate in a wireless environment. By way of example, the WTRUs 102a, 102b, 102c, 102d, any of which may be referred to as a “station” and/or a “STA”, may be configured to transmit and/or receive wireless signals and may include a user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit, a pager, a cellular telephone, a personal digital assistant (PDA), a smartphone, a laptop, a netbook, a personal computer, a wireless sensor, a hotspot or Mi-Fi device, an Internet of Things (loT) device, a watch or other wearable, a head-mounted display (HMD), a vehicle, a drone, a medical device and applications (e.g., remote surgery), an industrial device and applications (e.g., a robot and/or other wireless devices operating in an industrial and/or an automated processing chain contexts), a consumer electronics device, a device operating on commercial and/or industrial wireless networks, and the like. Any of the WTRUs 102a, 102b, 102c and 102d may be interchangeably referred to as a UE.
[0063] The communications systems 100 may also include a base station 114a and/or a base station 114b. Each of the base stations 114a, 114b may be any type of device configured to wirelessly interface with at least one of the WTRUs 102a, 102b, 102c, 102d to facilitate access to one or more communication networks, such as the CN 106, the Internet 110, and/or the other networks 112. By way of example, the base stations 114a, 114b may be a base transceiver station (BTS), a Node-B, an eNode B, a Home Node B, a Home eNode B, a gNB, a NR NodeB, a site controller, an access point (AP), a wireless router, and the like. While the base stations 114a, 114b are each depicted as a single element, it will be appreciated that the base stations 114a, 114b may include any number of interconnected base stations and/or network elements.
[0064] The base station 114a may be part of the RAN 104/113, which may also include other base stations and/or network elements (not shown), such as a base station controller (BSC), a radio network controller (RNC), relay nodes, etc. The base station 114a and/or the base station 114b may be configured to transmit and/or receive wireless signals on one or more carrier frequencies, which may be referred to as a cell (not shown). These frequencies may be in licensed spectrum, unlicensed spectrum, or a combination of licensed and unlicensed spectrum. A cell may provide coverage for a wireless service to a specific geographical area that may be relatively fixed or that may change over time. The cell may further be divided into cell sectors. For example, the cell associated with the base station 114a may be divided into three sectors. Thus, in one embodiment, the base station 114a may include three transceivers, i.e., one for each sector of the cell. In an embodiment, the base station 114a may employ multiple-input multiple output (MIMO) technology and may utilize multiple transceivers for each sector of the cell. For example, beamforming may be used to transmit and/or receive signals in desired spatial directions. [0065] The base stations 114a, 114b may communicate with one or more of the WTRUs 102a, 102b, 102c, 102d over an air interface 116, which may be any suitable wireless communication link (e.g., radio frequency (RF), microwave, centimeter wave, micrometer wave, infrared (IR), ultraviolet (UV), visible light, etc.). The air interface 116 may be established using any suitable radio access technology (RAT).
[0066] More specifically, as noted above, the communications system 100 may be a multiple access system and may employ one or more channel access schemes, such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA, and the like. For example, the base station 114a in the RAN 104/113 and the WTRUs 102a, 102b, 102c may implement a radio technology such as Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access (UTRA), which may establish the air interface 116 using wideband CDMA (WCDMA). WCDMA may include communication protocols such as High-Speed Packet Access (HSPA) and/or Evolved HSPA (HSPA+). HSPA may include High-Speed Downlink (DL) Packet Access (HSDPA) and/or High-Speed UL Packet Access (HSUPA).
[0067] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as Evolved UMTS Terrestrial Radio Access (E-UTRA), which may establish the air interface 116 using Long Term Evolution (LTE) and/or LTE-Advanced (LTE-A) and/or LTE-Advanced Pro (LTE-A Pro).
[0068] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as NR Radio Access , which may establish the air interface 116 using New Radio (NR).
[0069] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement multiple radio access technologies. For example, the base station 114a and the WTRUs 102a, 102b, 102c may implement LTE radio access and NR radio access together, for instance using dual connectivity (DC) principles. Thus, the air interface utilized by WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and/or transmissions sent to/from multiple types of base stations (e.g., a eNB and a gNB).
[0070] In other embodiments, the base station 114a and the WTRUs 102a, 102b, 102c may implement radio technologies such as IEEE 802.11 (i.e., Wireless Fidelity (WiFi), IEEE 802.16 (i.e., Worldwide Interoperability for Microwave Access (WiMAX)), CDMA2000, CDMA2000 1X, CDMA2000 EV-DO, Interim Standard 2000 (IS- 2000), Interim Standard 95 (IS-95), Interim Standard 856 (IS-856), Global System for Mobile communications (GSM), Enhanced Data rates for GSM Evolution (EDGE), GSM EDGE (GERAN), and the like.
[0071] The base station 114b in FIG. 1A may be a wireless router, Home Node B, Home eNode B, or access point, for example, and may utilize any suitable RAT for facilitating wireless connectivity in a localized area, such as a place of business, a home, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a roadway, and the like. In one embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology such as IEEE 802.11 to establish a wireless local area network (WLAN). In an embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology such as IEEE 802.15 to establish a wireless personal area network (WPAN). In yet another embodiment, the base station 114b and the WTRUs 102c, 102d may utilize a cellular-based RAT (e.g., WCDMA, CDMA2000, GSM, LTE, LTE-A, LTE-A Pro, NR etc.) to establish a picocell or femtocell. As shown in FIG. 1 A, the base station 114b may have a direct connection to the Internet 110. Thus, the base station 114b may not be required to access the Internet 110 via the CN 106.
[0072] The RAN 104/113 may be in communication with the CN 106, which may be any type of network configured to provide voice, data, applications, and/or voice over internet protocol (VoIP) services to one or more of the WTRUs 102a, 102b, 102c, 102d. The data may have varying quality of service (QoS) requirements, such as differing throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, and the like. The CN 106 may provide call control, billing services, mobile location-based services, pre-paid calling, Internet connectivity, video distribution, etc., and/or perform high-level security functions, such as user authentication. Although not shown in FIG. 1A, it will be appreciated that the RAN 104/113 and/or the CN 106 may be in direct or indirect communication with other RANs that employ the same RAT as the RAN 104/113 or a different RAT. For example, in addition to being connected to the RAN 104/113, which may be utilizing a NR radio technology, the CN 106 may also be in communication with another RAN (not shown) employing a GSM, UMTS, CDMA 2000, WiMAX, E-UTRA, or WiFi radio technology.
[0073] The CN 106 may also serve as a gateway for the WTRUs 102a, 102b, 102c, 102d to access the PSTN 108, the Internet 110, and/or the other networks 112. The PSTN 108 may include circuit-switched telephone networks that provide plain old telephone service (POTS). The Internet 110 may include a global system of interconnected computer networks and devices that use common communication protocols, such as the transmission control protocol (TCP), user datagram protocol (UDP) and/or the internet protocol (IP) in the TCP/IP internet protocol suite. The networks 112 may include wired and/or wireless communications networks owned and/or operated by other service providers. For example, the networks 112 may include another CN connected to one or more RANs, which may employ the same RAT as the RAN 104/113 or a different RAT. [0074] Some or all of the WTRUs 102a, 102b, 102c, 102d in the communications system 100 may include multi-mode capabilities (e.g., the WTRUs 102a, 102b, 102c, 102d may include multiple transceivers for communicating with different wireless networks over different wireless links). For example, the WTRU 102c shown in FIG. 1A may be configured to communicate with the base station 114a, which may employ a cellularbased radio technology, and with the base station 114b, which may employ an IEEE 802 radio technology.
[0075] FIG. 1B is a system diagram illustrating an example WTRU 102. As shown in FIG. 1 B, the WTRU 102 may include a processor 118, a transceiver 120, a transmit/receive element 122, a speaker/microphone 124, a keypad 126, a display/touchpad 128, non-removable memory 130, removable memory 132, a power source 134, a global positioning system (GPS) chipset 136, and/or other peripherals 138, among others. It will be appreciated that the WTRU 102 may include any sub-combination of the foregoing elements while remaining consistent with an embodiment.
[0076] The processor 118 may be a general purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) circuits, any other type of integrated circuit (IC), a state machine, and the like. The processor 118 may perform signal coding, data processing, power control, input/output processing, and/or any other functionality that enables the WTRU 102 to operate in a wireless environment. The processor 118 may be coupled to the transceiver 120, which may be coupled to the transmit/receive element 122. While FIG. 1 B depicts the processor 118 and the transceiver 120 as separate components, it will be appreciated that the processor 118 and the transceiver 120 may be integrated together in an electronic package or chip.
[0077] The transmit/receive element 122 may be configured to transmit signals to, or receive signals from, a base station (e.g., the base station 114a) over the air interface 116. For example, in one embodiment, the transmit/receive element 122 may be an antenna configured to transmit and/or receive RF signals. In an embodiment, the transmit/receive element 122 may be an emitter/detector configured to transmit and/or receive IR, UV, or visible light signals, for example. In yet another embodiment, the transmit/receive element 122 may be configured to transmit and/or receive both RF and light signals. It will be appreciated that the transmit/receive element 122 may be configured to transmit and/or receive any combination of wireless signals.
[0078] Although the transmit/receive element 122 is depicted in FIG. 1 B as a single element, the WTRU 102 may include any number of transmit/receive elements 122. More specifically, the WTRU 102 may employ MIMO technology. Thus, in one embodiment, the WTRU 102 may include two or more transmit/receive elements 122 (e.g., multiple antennas) for transmitting and receiving wireless signals over the air interface 116.
[0079] The transceiver 120 may be configured to modulate the signals that are to be transmitted by the transmit/receive element 122 and to demodulate the signals that are received by the transmit/receive element 122. As noted above, the WTRU 102 may have multi-mode capabilities. Thus, the transceiver 120 may include multiple transceivers for enabling the WTRU 102 to communicate via multiple RATs, such as NR and IEEE 802.11, for example.
[0080] The processor 118 of the WTRU 102 may be coupled to, and may receive user input data from, the speaker/microphone 124, the keypad 126, and/or the display/touchpad 128 (e.g., a liquid crystal display (LCD) display unit or organic light-emitting diode (OLED) display unit). The processor 118 may also output user data to the speaker/microphone 124, the keypad 126, and/or the display/touchpad 128. In addition, the processor 118 may access information from, and store data in, any type of suitable memory, such as the non-removable memory 130 and/or the removable memory 132. The non-removable memory 130 may include random-access memory (RAM), read-only memory (ROM), a hard disk, or any other type of memory storage device. The removable memory 132 may include a subscriber identity module (SIM) card, a memory stick, a secure digital (SD) memory card, and the like. In other embodiments, the processor 118 may access information from, and store data in, memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown).
[0081 ] The processor 118 may receive power from the power source 134, and may be configured to distribute and/or control the power to the other components in the WTRU 102. The power source 134 may be any suitable device for powering the WTRU 102. For example, the power source 134 may include one or more dry cell batteries (e.g., nickel-cadmium (NiCd), nickel-zinc (NiZn), nickel metal hydride (NiMH), lithium-ion (Li-ion), etc.), solar cells, fuel cells, and the like.
[0082] The processor 118 may also be coupled to the GPS chipset 136, which may be configured to provide location information (e.g., longitude and latitude) regarding the current location of the WTRU 102. In addition to, or in lieu of, the information from the GPS chipset 136, the WTRU 102 may receive location information over the air interface 116 from a base station (e.g., base stations 114a, 114b) and/or determine its location based on the timing of the signals being received from two or more nearby base stations. It will be appreciated that the WTRU 102 may acquire location information by way of any suitable location-determination method while remaining consistent with an embodiment.
[0083] The processor 118 may further be coupled to other peripherals 138, which may include one or more software and/or hardware modules that provide additional features, functionality and/or wired or wireless connectivity. For example, the peripherals 138 may include an accelerometer, an e-compass, a satellite transceiver, a digital camera (for photographs and/or video), a universal serial bus (USB) port, a vibration device, a television transceiver, a hands free headset, a Bluetooth® module, a frequency modulated (FM) radio unit, a digital music player, a media player, a video game player module, an Internet browser, a Virtual Reality and/or Augmented Reality (VR/AR) device, an activity tracker, and the like. The peripherals 138 may include one or more sensors, the sensors may be one or more of a gyroscope, an accelerometer, a hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geolocation sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a gesture sensor, a biometric sensor, and/or a humidity sensor.
[0084] The WTRU 102 may include a full duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for both the UL (e.g., for transmission) and downlink (e.g., for reception) may be concurrent and/or simultaneous. The full duplex radio may include an interference management unit to reduce and or substantially eliminate self-interference via either hardware (e.g., a choke) or signal processing via a processor (e.g., a separate processor (not shown) or via processor 118). In an embodiment, the WTRU 102 may include a half-duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for either the UL (e.g., for transmission) or the downlink (e.g., for reception)).
[0085] Although the WTRU is described in FIGs. 1 A-1 B as a wireless terminal, it is contemplated that in certain representative embodiments that such a terminal may use (e.g., temporarily or permanently) wired communication interfaces with the communication network.
[0086] In representative embodiments, the other network 112 may be a WLAN.
[0087] In view of FIGs. 1 A-1 B, and the corresponding description, one or more, or all, of the functions described herein may be performed by one or more emulation devices (not shown). The emulation devices may be one or more devices configured to emulate one or more, or all, of the functions described herein. For example, the emulation devices may be used to test other devices and/or to simulate network and/or WTRU functions. [0088] The emulation devices may be designed to implement one or more tests of other devices in a lab environment and/or in an operator network environment. For example, the one or more emulation devices may perform the one or more, or all, functions while being fully or partially implemented and/or deployed as part of a wired and/or wireless communication network in order to test other devices within the communication network. The one or more emulation devices may perform the one or more, or all, functions while being temporarily implemented/deployed as part of a wired and/or wireless communication network. The emulation device may be directly coupled to another device for purposes of testing and/or may performing testing using over-the-air wireless communications.
[0089] The one or more emulation devices may perform the one or more, including all, functions while not being implemented/deployed as part of a wired and/or wireless communication network. For example, the emulation devices may be utilized in a testing scenario in a testing laboratory and/or a non-deployed (e.g., testing) wired and/or wireless communication network in order to implement testing of one or more components. The one or more emulation devices may be test equipment. Direct RF coupling and/or wireless communications via RF circuitry (e.g., which may include one or more antennas) may be used by the emulation devices to transmit and/or receive data.
[0090] FIG. 1 C is a system diagram illustrating an example set of interfaces for a system according to some embodiments. An extended reality display device, together with its control electronics, may be implemented for some embodiments. System 150 can be embodied as a device including the various components described below and is configured to perform one or more of the aspects described in this document. Examples of such devices, include, but are not limited to, various electronic devices such as personal computers, laptop computers, smartphones, tablet computers, digital multimedia set top boxes, digital television receivers, personal video recording systems, connected home appliances, and servers. Elements of system 150, singly or in combination, can be embodied in a single integrated circuit (IC), multiple ICs, and/or discrete components. For example, in at least one embodiment, the processing and encoder/decoder elements of system 150 are distributed across multiple ICs and/or discrete components. In various embodiments, the system 150 is communicatively coupled to one or more other systems, or other electronic devices, via, for example, a communications bus or through dedicated input and/or output ports. In various embodiments, the system 150 is configured to implement one or more of the aspects described in this document. [0091] The system 150 includes at least one processor 152 configured to execute instructions loaded therein for implementing, for example, the various aspects described in this document. Processor 152 may include embedded memory, input output interface, and various other circuitries as known in the art. The system 150 includes at least one memory 154 (e.g. , a volatile memory device, and/or a non-volatile memory device). System 150 may include a storage device 158, which can include non-volatile memory and/or volatile memory, including, but not limited to, Electrically Erasable Programmable Read-Only Memory (EEPROM), Read-Only Memory (ROM), Programmable Read-Only Memory (PROM), Random Access Memory (RAM), Dynamic Random Access Memory (DRAM), Static Random Access Memory (SRAM), flash, magnetic disk drive, and/or optical disk drive. The storage device 158 can include an internal storage device, an attached storage device (including detachable and non-detachable storage devices), and/or a network accessible storage device, as non-limiting examples.
[0092] System 150 includes an encoder/decoder module 156 configured, for example, to process data to provide an encoded video or decoded video, and the encoder/decoder module 156 can include its own processor and memory. The encoder/decoder module 156 represents module(s) that can be included in a device to perform the encoding and/or decoding functions. As is known, a device can include one or both of the encoding and decoding modules. Additionally, encoder/decoder module 156 can be implemented as a separate element of system 150 or can be incorporated within processor 152 as a combination of hardware and software as known to those skilled in the art.
[0093] Program code to be loaded onto processor 152 or encoder/decoder 156 to perform the various aspects described in this document can be stored in storage device 158 and subsequently loaded onto memory 154 for execution by processor 152. In accordance with various embodiments, one or more of processor 152, memory 154, storage device 158, and encoder/decoder module 156 can store one or more of various items during the performance of the processes described in this document. Such stored items can include, but are not limited to, the input video, the decoded video or portions of the decoded video, the bitstream, matrices, variables, and intermediate or final results from the processing of equations, formulas, operations, and operational logic.
[0094] In some embodiments, memory inside of the processor 152 and/or the encoder/decoder module 156 is used to store instructions and to provide working memory for processing that is needed during encoding or decoding. In other embodiments, however, a memory external to the processing device (for example, the processing device can be either the processor 152 or the encoder/decoder module 152) is used for one or more of these functions. The external memory can be the memory 154 and/or the storage device 158, for example, a dynamic volatile memory and/or a non-volatile flash memory. In several embodiments, an external non-volatile flash memory is used to store the operating system of, for example, a television. In at least one embodiment, a fast external dynamic volatile memory such as a RAM is used as working memory for video coding and decoding operations, such as for MPEG-2 (MPEG refers to the Moving Picture Experts Group, MPEG-2 is also referred to as ISO/IEC 13818, and 13818-1 is also known as H.222, and 13818-2 is also known as H.262), HEVC (HEVC refers to High Efficiency Video Coding, also known as H.265 and MPEG-H Part 2), or WC (Versatile Video Coding, a new standard being developed by JVET, the Joint Video Experts Team).
[0095] The input to the elements of system 150 can be provided through various input devices as indicated in block 172. Such input devices include, but are not limited to, (i) a radio frequency (RF) portion that receives an RF signal transmitted, for example, over the air by a broadcaster, (ii) a Component (COMP) input terminal (or a set of COMP input terminals), (iii) a Universal Serial Bus (USB) input terminal, and/or (iv) a High Definition Multimedia Interface (HDMI) input terminal. Other examples, not shown in FIG. 1 C, include composite video.
[0096] In various embodiments, the input devices of block 172 have associated respective input processing elements as known in the art. For example, the RF portion can be associated with elements suitable for (i) selecting a desired frequency (also referred to as selecting a signal, or band-limiting a signal to a band of frequencies), (ii) downconverting the selected signal, (iii) band-limiting again to a narrower band of frequencies to select (for example) a signal frequency band which can be referred to as a channel in certain embodiments, (iv) demodulating the downconverted and band-limited signal, (v) performing error correction, and (vi) demultiplexing to select the desired stream of data packets. The RF portion of various embodiments includes one or more elements to perform these functions, for example, frequency selectors, signal selectors, bandlimiters, channel selectors, filters, downconverters, demodulators, error correctors, and demultiplexers. The RF portion can include a tuner that performs various of these functions, including, for example, downconverting the received signal to a lower frequency (for example, an intermediate frequency or a near-baseband frequency) or to baseband. In one set-top box embodiment, the RF portion and its associated input processing element receives an RF signal transmitted over a wired (for example, cable) medium, and performs frequency selection by filtering, downconverting, and filtering again to a desired frequency band. Various embodiments rearrange the order of the above-described (and other) elements, remove some of these elements, and/or add other elements performing similar or different functions. Adding elements can include inserting elements in between existing elements, such as, for example, inserting amplifiers and an analog-to-digital converter. In various embodiments, the RF portion includes an antenna.
[0097] Additionally, the USB and/or HDMI terminals can include respective interface processors for connecting system 150 to other electronic devices across USB and/or HDMI connections. It is to be understood that various aspects of input processing, for example, Reed-Solomon error correction, can be implemented, for example, within a separate input processing IC or within processor 152 as necessary. Similarly, aspects of USB or HDMI interface processing can be implemented within separate interface ICs or within processor 152 as necessary. The demodulated, error corrected, and demultiplexed stream is provided to various processing elements, including, for example, processor 152, and encoder/decoder 156 operating in combination with the memory and storage elements to process the datastream as necessary for presentation on an output device.
[0098] Various elements of system 150 can be provided within an integrated housing, Within the integrated housing, the various elements can be interconnected and transmit data therebetween using suitable connection arrangement 174, for example, an internal bus as known in the art, including the I nter-IC (I2C) bus, wiring, and printed circuit boards.
[0099] The system 150 includes communication interface 160 that enables communication with other devices via communication channel 162. The communication interface 160 can include, but is not limited to, a transceiver configured to transmit and to receive data over communication channel 162. The communication interface 160 can include, but is not limited to, a modem or network card and the communication channel 162 can be implemented, for example, within a wired and/or a wireless medium.
[0100] Data is streamed, or otherwise provided, to the system 150, in various embodiments, using a wireless network such as a Wi-Fi network, for example IEEE 802.11 (IEEE refers to the Institute of Electrical and Electronics Engineers). The Wi-Fi signal of these embodiments is received over the communications channel 162 and the communications interface 160 which are adapted for Wi-Fi communications. The communications channel 162 of these embodiments is typically connected to an access point or router that provides access to external networks including the Internet for allowing streaming applications and other over-the-top communications. Other embodiments provide streamed data to the system 150 using a set-top box that delivers the data over the HDMI connection of the input block 172. Still other embodiments provide streamed data to the system 150 using the RF connection of the input block 172. As indicated above, various embodiments provide data in a non-streaming manner. Additionally, various embodiments use wireless networks other than Wi-Fi, for example a cellular network or a Bluetooth network.
[0101] The system 150 can provide an output signal to various output devices, including a display 176, speakers 178, and other peripheral devices 180. The display 176 of various embodiments includes one or more of, for example, a touchscreen display, an organic light-emitting diode (OLED) display, a curved display, and/or a foldable display. The display 176 can be for a television, a tablet, a laptop, a cell phone (mobile phone), or other device. The display 176 can also be integrated with other components (for example, as in a smart phone), or separate (for example, an external monitor for a laptop). The other peripheral devices 180 include, in various examples of embodiments, one or more of a stand-alone digital video disc (or digital versatile disc) (DVR, for both terms), a disk player, a stereo system, and/or a lighting system. Various embodiments use one or more peripheral devices 180 that provide a function based on the output of the system 150. For example, a disk player performs the function of playing the output of the system 150.
[0102] In various embodiments, control signals are communicated between the system 150 and the display 176, speakers 178, or other peripheral devices 180 using signaling such as AV.Link, Consumer Electronics Control (CEC), or other communications protocols that enable device-to-device control with or without user intervention. The output devices can be communicatively coupled to system 150 via dedicated connections through respective interfaces 164, 166, and 168. Alternatively, the output devices can be connected to system 150 using the communications channel 162 via the communications interface 160. The display 176 and speakers 178 can be integrated in a single unit with the other components of system 150 in an electronic device such as, for example, a television. In various embodiments, the display interface 164 includes a display driver, such as, for example, a timing controller (T Con) chip.
[0103] The display 176 and speaker 178 can alternatively be separate from one or more of the other components, for example, if the RF portion of input 172 is part of a separate set-top box. In various embodiments in which the display 176 and speakers 178 are external components, the output signal can be provided via dedicated output connections, including, for example, HDMI ports, USB ports, or COMP outputs.
[0104] The system 150 may include one or more sensor devices 168. Examples of sensor devices that may be used include one or more GPS sensors, gyroscopic sensors, accelerometers, light sensors, cameras, depth cameras, microphones, and/or magnetometers. Such sensors may be used to determine information such as user’s position and orientation. Where the system 150 is used as the control module for an extended reality display (such as control modules 124, 132), the user’s position and orientation may be used in determining how to render image data such that the user perceives the correct portion of a virtual object or virtual scene from the correct point of view. In the case of head-mounted display devices, the position and orientation of the device itself may be used to determine the position and orientation of the user for the purpose of rendering virtual content. In the case of other display devices, such as a phone, a tablet, a computer monitor, or a television, other inputs may be used to determine the position and orientation of the user for the purpose of rendering content. For example, a user may select and/or adjust a desired viewpoint and/or viewing direction with the use of a touch screen, keypad or keyboard, trackball, joystick, or other input. Where the display device has sensors such as accelerometers and/or gyroscopes, the viewpoint and orientation used for the purpose of rendering content may be selected and/or adjusted based on motion of the display device.
[0105] The embodiments can be carried out by computer software implemented by the processor 152 or by hardware, or by a combination of hardware and software. As a non-limiting example, the embodiments can be implemented by one or more integrated circuits. The memory 154 can be of any type appropriate to the technical environment and can be implemented using any appropriate data storage technology, such as optical memory devices, magnetic memory devices, semiconductor-based memory devices, fixed memory, and removable memory, as non-limiting examples. The processor 152 can be of any type appropriate to the technical environment, and can encompass one or more of microprocessors, general purpose computers, special purpose computers, and processors based on a multi-core architecture, as non-limiting examples.
Block-Based Video Coding
[0106] Like HEVC, the WC is built upon the block-based hybrid video coding framework. FIG. 2A gives the block diagram of a block-based hybrid video encoding system 200. Variations of this encoder 200 are contemplated, but the encoder 200 is described below for purposes of clarity without describing all expected variations.
[0107] Before being encoded, a video sequence may go through pre-encoding processing (204), for example, applying a color transform to an input color picture (e.g., conversion from RGB 4:4:4 to YCbCr 4:2:0), or performing a remapping of the input picture components in order to get a signal distribution more resilient to compression (for instance using a histogram equalization of one of the color components). Metadata can be associated with the pre-processing and attached to the bitstream. [0108] The input video signal 202 including a picture to be encoded is partitioned (206) and processed block by block in units of, for example, CUs. Different CUs may have different sizes. In VTM-1.0, a CD can be up to 128x128 pixels. However, different from the HEVC which partitions blocks only based on quad-trees, in the VTM- 1.0, a coding tree unit (CTU) is split into CUs to adapt to varying local characteristics based on quad/binary/ternary-tree. Additionally, the concept of multiple partition unit type in the HEVC is removed, such that the separation of CU, prediction unit (PU) and transform unit (TU) does not exist in the VVC-1.0 anymore; instead, each CU is always used as the basic unit for both prediction and transform without further partitions. In the multi-type tree structure, a CTU is firstly partitioned by a quad-tree structure. Then, each quad-tree leaf node can be further partitioned by a binary and ternary tree structure. Different splitting types may be used, such as quaternary partitioning, vertical binary partitioning, horizontal binary partitioning, vertical ternary partitioning, and horizontal ternary partitioning.
[0109] In the encoder of FIG. 2A, spatial prediction (208) and/or temporal prediction (210) may be performed. Spatial prediction (or “intra prediction”) uses pixels from the samples of already coded neighboring blocks (which are called reference samples) in the same video picture/slice to predict the current video block. Spatial prediction reduces spatial redundancy inherent in the video signal. Temporal prediction (also referred to as “inter prediction” or “motion compensated prediction”) uses reconstructed pixels from the already coded video pictures to predict the current video block. Temporal prediction reduces temporal redundancy inherent in the video signal. A temporal prediction signal for a given CU may be signaled by one or more motion vectors (MVs) which indicate the amount and the direction of motion between the current CU and its temporal reference. Also, if multiple reference pictures are supported, a reference picture index may additionally be sent, which is used to identify from which reference picture in the reference picture store (212) the temporal prediction signal comes.
[0110] The mode decision block (214) in the encoder chooses the best prediction mode, for example based on a rate-distortion optimization method. This selection may be made after spatial and/or temporal prediction is performed. The intra/inter decision may be indicated by, for example, a prediction mode flag. The prediction block is subtracted from the current video block (216) to generate a prediction residual. The prediction residual is de-correlated using transform (218) and quantized (220). (For some blocks, the encoder may bypass both transform and quantization, in which case the residual may be coded directly without the application of the transform or quantization processes.) The quantized residual coefficients are inverse quantized (222) and inverse transformed (224) to form the reconstructed residual, which is then added back to the prediction block (226) to form the reconstructed signal of the CU. Further in-loop filtering, such as deblocking/SAO (Sample Adaptive Offset) filtering, may be applied (228) on the reconstructed CD to reduce encoding artifacts before it is put in the reference picture store (212) and used to code future video blocks. To form the output video bit-stream 230, coding mode (inter or intra), prediction mode information, motion information, and quantized residual coefficients are all sent to the entropy coding unit (108) to be further compressed and packed to form the bitstream.
[0111] FIG. 2B gives a block diagram of a block-based video decoder 250. In the decoder 250, a bitstream is decoded by the decoder elements as described below. Video decoder 250 generally performs a decoding pass reciprocal to the encoding pass as described in FIG. 2A. The encoder 200 also generally performs video decoding as part of encoding video data.
[0112] In particular, the input of the decoder includes a video bitstream 252, which can be generated by video encoder 200. The video bit-stream 252 is first unpacked and entropy decoded at entropy decoding unit 254 to obtain transform coefficients, motion vectors, and other coded information. Picture partition information indicates how the picture is partitioned. The decoder may therefore divide (256) the picture according to the decoded picture partitioning information. The coding mode and prediction information are sent to either the spatial prediction unit 258 (if intra coded) or the temporal prediction unit 260 (if inter coded) to form the prediction block. The residual transform coefficients are sent to inverse quantization unit 262 and inverse transform unit 264 to reconstruct the residual block. The prediction block and the residual block are then added together at 266 to generate the reconstructed block. The reconstructed block may further go through in-loop filtering 268 before it is stored in reference picture store 270 for use in predicting future video blocks.
[0113] The decoded picture 272 may further go through post-decoding processing (274), for example, an inverse color transform (e.g. conversion from YCbCr 4:2:0 to RGB 4:4:4) or an inverse remapping performing the inverse of the remapping process performed in the pre-encoding processing (204). The post-decoding processing can use metadata derived in the pre-encoding processing and signaled in the bitstream. The decoded, processed video may be sent to a display device 276. The display device 276 may be a separate device from the decoder 250, or the decoder 250 and the display device 276 may be components of the same device.
[0114] Various methods and other aspects described in this application can be used to modify modules of a video encoder 200 or decoder 250. Moreover, the systems and methods disclosed herein are not limited to WC or HEVC, and can be applied, for example, to other standards and recommendations, whether pre-existing or future-developed, and extensions of any such standards and recommendations (including WC and HEVC). Unless indicated otherwise, or technically precluded, the aspects described in this application can be used individually or in combination.
[0115] FIG. 3A is a schematic side view illustrating an example waveguide display that may be used with extended reality (XR) applications according to some embodiments. An image is projected by an image generator 302. The image generator 302 may use one or more of various techniques for projecting an image. For example, the image generator 302 may be a laser beam scanning (LBS) projector, a liquid crystal display (LCD), a lightemitting diode (LED) display (including an organic LED (OLED) or micro LED (pLED) display), a digital light processor (DLP), a liquid crystal on silicon (LCoS) display, or other type of image generator or light engine.
[0116] Light representing an image 312 generated by the image generator 302 is coupled into a waveguide 304 by a diffractive in-coupler 306. The in-coupler 306 diffracts the light representing the image 312 into one or more diffractive orders. For example, light ray 308, which is one of the light rays representing a portion of the bottom of the image, is diffracted by the in-coupler 306, and one of the diffracted orders 310 (e.g. the second order) is at an angle that is capable of being propagated through the waveguide 304 by total internal reflection. The image generator 302 displays images as directed by a control module 324, which operates to render image data, video data, point cloud data, or other displayable data.
[0117] At least a portion of the light 310 that has been coupled into the waveguide 304 by the diffractive incoupler 306 is coupled out of the waveguide by a diffractive out-coupler 314. At least some of the light coupled out of the waveguide 304 replicates the incident angle of light coupled into the waveguide. For example, in the illustration, out-coupled light rays 316a, 316b, and 316c replicate the angle of the in-coupled light ray 308. Because light exiting the out-coupler replicates the directions of light that entered the in-coupler, the waveguide substantially replicates the original image 312. A user’s eye 318 can focus on the replicated image.
[0118] In the example of FIG. 3A, the out-coupler 314 out-couples only a portion of the light with each reflection allowing a single input beam (such as beam 308) to generate multiple parallel output beams (such as beams 316a, 316b, and 316c). In this way, at least some of the light originating from each portion of the image is likely to reach the user’s eye even if the eye is not perfectly aligned with the center of the out-coupler. For example, if the eye 318 were to move downward, beam 316c may enter the eye even if beams 316a and 316b do not, so the user can still perceive the bottom of the image 312 despite the shift in position. The out-coupler 314 thus operates in part as an exit pupil expander in the vertical direction. The waveguide may also include one or more additional exit pupil expanders (not shown in FIG. 3A) to expand the exit pupil in the horizontal direction. [0119] In some embodiments, the waveguide 304 is at least partly transparent with respect to light originating outside the waveguide display. For example, at least some of the light 320 from real-world objects (such as object 322) traverses the waveguide 304, allowing the user to see the real-world objects while using the waveguide display. As light 320 from real-world objects also goes through the diffraction grating 314, there will be multiple diffraction orders and hence multiple images. To minimize the visibility of multiple images, it is desirable for the diffraction order zero (no deviation by 314) to have a great diffraction efficiency for light 320 and order zero, while higher diffraction orders are lower in energy. Thus, in addition to expanding and out-coupling the virtual image, the out-coupler 314 is preferably configured to let through the zero order of the real image. In such embodiments, images displayed by the waveguide display may appear to be superimposed on the real world.
[0120] FIG. 3B is a schematic side view illustrating an example alternative display type that may be used with extended reality applications according to some embodiments. In an XR head-mounted display device 330, a control module 332 controls a display 334, which may be an LCD, to display an image. The head-mounted display includes a partly-reflective surface 336 that reflects (and in some embodiments, both reflects and focuses) the image displayed on the LCD to make the image visible to the user. The partly-reflective surface 336 also allows the passage of at least some exterior light, permitting the user to see their surroundings.
[0121] FIG. 3C is a schematic side view illustrating an example alternative display type that may be used with extended reality applications according to some embodiments. In an XR head-mounted display device 340, a control module 342 controls a display 344, which may be an LCD, to display an image. The image is focused by one or more lenses of display optics 346 to make the image visible to the user. In the example of FIG. 3C, exterior light does not reach the user’s eyes directly. However, in some such embodiments, an exterior camera 348 may be used to capture images of the exterior environment and display such images on the display 344 together with any virtual content that may also be displayed.
[0122] The embodiments described herein are not limited to any particular type or structure of XR display device.
[0123] This application belongs to the field of point cloud compression and processing. This field aims to develop the tools for compression, analysis, interpolation, representation and understanding of point cloud signals. [0124] Point cloud is a universal data format across several business domains from autonomous driving, robotics, AR/VR, civil engineering, computer graphics, to the animation /movie industry. 3D LiDAR sensors have been deployed in self-driving cars, and affordable LiDAR sensors are released from Velodyne Velabit, Apple iPad Pro 2020 and Intel RealSense LiDAR camera L515. With advances in sensing technologies, 3D point cloud data becomes more practical than ever and is expected to be an ultimate enabler in the applications mentioned.
[0125] Point cloud data is also believed to consume a large portion of network traffic, e.g., among connected cars over 5G network, and immersive communications (VR/AR). Efficient representation formats are necessary for point cloud understanding and communication. In particular, raw point cloud data need to be properly organized and processed for the purposes of world modeling & sensing. Compression on raw point clouds is essential when storage and transmission of the data are required in the related scenarios.
[0126] Furthermore, point clouds may represent a sequential scan of the same scene, which contains multiple moving objects. They are called dynamic point clouds as compared to static point clouds captured from a static scene or static objects. Dynamic point clouds are typically organized into frames, with different frames being captured at different time. Dynamic point clouds may require the processing & compression to be in real-time or with low delay.
[0127] The automotive industry and autonomous car are domains in which point clouds may be used. Autonomous cars should be able to “probe” their environment to make good driving decisions based on the reality of their immediate surroundings. Typical sensors like LiDARs produce (dynamic) point clouds that are used by the perception engine. These point clouds are not intended to be viewed by human eyes and they are typically sparse, not necessarily colored, and dynamic with a high frequency of capture. They may have other attributes like the reflectance ratio provided by the LiDAR as this attribute is indicative of the material of the sensed object and may help in making a decision.
[0128] Virtual Reality (VR) and immersive worlds have become a hot topic and foreseen by many as the future of 2D flat video. The basic idea is to immerse the viewer in an environment all around him as opposed to standard TV where he can only look at the virtual world in front of him. There are several gradations in the immersivity depending on the freedom of the viewer in the environment. Point cloud is a good format candidate to distribute VR worlds. They may be static or dynamic and are typically of averaged size, say no more than millions of points at a time. [0129] Point clouds may also be used for various purposes such as culture heritage/buildings in which objects like statues or buildings are scanned in 3D in order to share the spatial configuration of the object without sending or visiting it. Also, it is a way to ensure preserving the knowledge of the object in case it may be destroyed; for instance, a temple by an earthquake. Such point clouds are typically static, colored, and huge.
[0130] Another use case is in topography and cartography in which using 3D representations, maps are not limited to the plane and may include the relief. Google Maps is now a good example of 3D maps but uses meshes instead of point clouds. Nevertheless, point clouds may be a suitable data format for 3D maps and such point clouds are typically static, colored, and huge.
[0131] World modeling & sensing via point clouds could be an essential technology to allow machines to gain knowledge about the 3D world around them, which is crucial for the applications discussed above.
[0132] The present invention has been devised with the foregoing in mind.
[0133] 3D point cloud data are essentially discrete samples on the surfaces of objects or scenes. To fully represent the real world with point samples, in practice it requires a huge number of points. For instance, a typical VR immersive scene contains millions of points, while point clouds typically contain hundreds of millions of points. Therefore, the processing of such large-scale point clouds is computationally expensive, especially for consumer devices, e.g., smartphone, tablet, and automotive navigation system, that have limited computational power.
[0134] The first step for any processing or inference on the point cloud is to have efficient storage methodologies. To store and process the input point cloud with affordable computational cost, one solution is to down-sample it first, where the down-sampled point cloud summarizes the geometry of the input point cloud while having much fewer points. The down-sampled point cloud is then fed to the subsequent machine task for further consumption. However, further reduction in storage space can be achieved by converting the raw point cloud data (original or downsampled) into a bitstream through entropy coding techniques for lossless compression. Better entropy models result in a smaller bitstream and hence more efficient compression. Additionally, the entropy models can also be paired with downstream tasks which allow the entropy encoder to maintain the task specific information while compressing.
[0135] In addition to lossless coding, many scenarios seek for lossy coding for significantly improved compression ratio while maintaining the induced distortion under certain quality levels. [0136] The spliting of occupied voxels continues until the last octree depth level. The leaves of the octree finally represent a point cloud.
[0137] On encoder side, the octree nodes (node values) are typically sent to an entropy coder to generate a bitstream. A decoder then uses the decoded octree node values to reconstruct the octree structure, and finally reconstruct a point cloud based on the leaf nodes of the octree structure.
[0138] To efficiently entropy code the octree nodes, a probability distribution model is typically utilized to allocate a shorter symbol for octree node values with appearing with higher probability.
[0139] With a typical learning-based point cloud coding, the encoder would transform the input point clouds into a feature map that is to be entropy coded. The learning-based decoder would perform an inverse transform and reconstruct the point cloud. Each feature in the feature map may be associated with a point cloud block. Such point cloud blocks are typically built via a hierarchical octree decomposition. In case the octree (decomposition) is coded via a learning-based approach, the codec will produce a feature descriptor for each octree block. Such octree feature descriptors would be simply dumped and are not employed in the feature aggregation pipelines of the encoder or decoder. This application provides a method to utilize the octree features to benefit the feature aggregation.
[0140] In this application, the octree features are utilized not only for octree coding, but also to assist with deep feature coding. This application discusses improvements to learning-based point cloud coding. The idea is to use the octree features generated during deep octree coding for the improved deep feature coding. Such octree features are available during learning-based octree coding and are further used in deep feature-based coding with a limited complexity increase. Compared to existing bottom-up features in the deep feature-based pipeline, the octree feature may be viewed as a top-down feature that includes global information of the point cloud frame. Hence, the octree feature benefits feature aggregations for compression.
Deep Feature Coding
[0141] FIG. 4 is a process diagram illustrating an example learning-based point cloud codec according to some embodiments. FIG. 4 shows a typical high-level learning-based point cloud compression system 400. On the left side of FIG. 4 is the point cloud encoder 402. An input point cloud PC at a higher resolution is fed to the point cloud encoder. The input point cloud undergoes a series of feature extractions 404 and feature aggregations 406 with possible downsampling “ 4 ” of the point cloud. Each step of such feature extraction/aggregation produces a feature map that is associated with a set of blocks, also known as octree voxels, if such downsampling is aligned with the octree decomposition. During this procedure, the features produced are called bottom-up features in this application because the processing begins with the finest details at the original resolution. The feature map is coded into a bitstream BS, . This branch is called deep feature coding in this application.
Deep Octree Coding
[0142] In parallel to the deep feature coding is a second branch for coding of the positions of the blocks. The second branch is called deep octree coding 408 in this application. The intention is to code the locations of the blocks where the feature maps are associated. In FIG. 4, the “Octree Coding” process 408 takes as an input a set of blocks, which is labeled in FIG. 4 as block map BM and which is associated with feature map FM . In some embodiments, the octree coding may code the blocks at the end of deep feature coding, which is the block for feature map FM2. This may be viewed as merging the “Feature Aggregation” block into “Feature Extraction” block. The reason to have the octree coding is that the basic shape of the point cloud needs to be accurately or lossless transmitted. The octree coding 408 generates a bitstream BS2, which sets a (basic) quality of the reconstructed point cloud.
[0143] For some embodiments, deep learning approaches may be employed for the octree coding block 408. Octree coding uses a strategy to code the octree decomposition structure from the root node. Deep learning approaches are used to aggregate features and then predict the probability of occupancies of octree nodes. See the 790 application and the ‘609 application for more detail regarding octree feature aggregation. For some embodiments, all such learning-based octree coding is generated as a feature descriptor before predicting the occupancy probability. Such a feature descriptor is referenced as an octree feature in this application.
Decoding
[0144] On the right side of FIG. 4 is a point cloud decoder 410. The decoder 410 has two branches corresponding to the deep feature coding and octree coding at encoder: a deep feature based decoding branch and an octree decoding branch. The deep feature decoding branch is composed of a series of feature aggregation 412 and/or point synthesis 416. Each step in the feature aggregation I point synthesis may involve an upsampling operation “T”. The deep feature coding branch takes bitstream BS± as its input. [0145] In the decoding section of FIG. 4, the octree coding block 414 takes BS2 as an input and outputs a block map BM. The block map serves as an additional input for the “Feature Aggregation” process. The “Octree Decoding” block 416 is basically identical to the “Octree Coding” block 408 for some embodiments. Both blocks include a series of steps to construct the octree structure, except that the “Octree Decoding” block 416 takes the octree bitstream and uses the predicted context to perform adaptive arithmetic decoding, while the “Octree Coding” (or “Octree Encoding” for some embodiments) block 408 performs arithmetic encoding.
Using Octree Feature for Deep Feature Coding
[0146] FIG. 5 is a process diagram illustrating an example learning-based point cloud codec according to some embodiments. In a typical framework of learning-based point cloud coding, the octree feature is limited to being used for coding of octree voxel occupancy. In this application, the octree features may be used to enhance the deep feature coding branch. Compared to the existing bottom-up features in the deep feature-based pipeline, the octree feature may be viewed as a top-down feature that includes global information of the point cloud frame. Hence, the octree feature may benefit feature aggregations for compression.
[0147] FIG. 5 shows an example design 500 of how to use the octree feature in deep feature coding. Compared to FIG. 4, in FIG. 5, a new connection 502 from the octree branch (or block 504) to the feature branch (or block 506) is introduced.
[0148] For some embodiments, as shown on the right side of FIG. 5, the octree features (OF) 510 from the Octree Decoding block 514 are exported to the Point Synthesis block 508. In some embodiments, the octree feature OF (510) serves as an input to the Point Synthesis block 508 in addition to the feature map FMt (512). Both features (OF (510) and FM^ (512)) are associated with the same block map BM (516). Hence, the octree feature OF 510 (in do-dimension) is concatenated on top of the original feature descriptor FMr 512 (in didimension) and the (d0 + d1)-dimension feature is used as a new input to the first layer of the Point Synthesis block 508. The direct concatenation provides a way to fuse the information from the octree feature and original feature.
[0149] In some embodiment, the point cloud encoder side may be designed as shown on the left side of FIG. 5. The octree features OF (502) are exported from the Octree Coding block 504 to the Feature Aggregation block 506. For some embodiments, the octree feature OF (502) serves as an input to the Feature Aggregation block 506 in addition to the feature map FM (518). Both features (OF (502) and FM (518)) are associated with the same block map BM. Similarly, in some embodiments, the octree feature OF 502 (in do-dimension) is concatenated on top of the original feature descriptor FMt 518 (in di -dimension), and the (d0 + d1) - dimension feature is used as a new input to the first layer of the Feature Aggregation block 506. The direct concatenation provides a way to fuse the information from the octree feature and original feature. See FIG. 7, for example, which is described below with regard to another way to fuse the octree feature OF and the feature map FM together for some embodiments.
[0150] In some embodiments, new OF connections are made to both the encoder and decoder sides simultaneously. Although both connections are illustrated in FIG. 5, an OF connection may be present on the decoder side and not on the encoder side and vice versa.
Using Octree Feature for Deep Feature Coding
[0151] FIG. 6 is a process diagram illustrating an example learning-based point cloud codec according to some embodiments. Compared to the frameworks using octree features for deep feature coding discussed in the previous subsection, FIG. 6 shows a further addition.
[0152] In some embodiments, the only difference compared to the framework of FIG. 5 is on the decoder side of FIG. 6. The octree feature OF 602, 604 is exported to both the Point Synthesis block 608 and to the Feature Aggregation block 606. Also, the block map 612 may be provided to the Feature Aggregation block 606 for some embodiments. Octree decoding generates a hierarchical feature along with the octree structure until the resolution of feature map FMr This statement means that the Octree Decoding block 610 may provide octree features for every feature map from resolution FM2 to FM1. In some embodiments, the appropriate octree features are concatenated to the original input features at every corresponding layer in the Feature Aggregation block 606.
[0153] On the encoder side, the block map (BM) is different from the feature map (FM . The feature map FM±. is a sparse tensor with coordinates equal to BM and a set of feature vectors living/defined on these coordinates. The feature map FM includes the block map plus the features on top of the coordinates of the block map.
[0154] Comparing the design 600 of FIG. 6 with the design of FIG. 5, the octree feature of FIG. 6 may have a higher impact on the final reconstruction quality because the octree feature of FIG. 6 starts to affect the feature aggregation in a much earlier stage of the decoding. Stated differently, for some embodiments, since OF is injected into the decoder system of FIG. 6 earlier compared to FIG. 5, the effect due to the injection of OF is more significant. Although three OF connections 602, 604, 614 are shown in FIG. 6, with two of them on the decoder side, any combination of OF connections may be used. For example, the OF connection from the octree decoding block may be provided to the feature aggregation block and not to the point synthesis block.
[0155] Limited additional complexity is required to use the octree features to enhance the deep feature coding branch. The major reason is that the octree features are generated during octree coding branch, and it is a free resource for the deep feature coding branch. For some embodiments, the only additional complexity is that the dimension of the input features of deep feature coding is increased from the concatenation designs. Such an increase in dimensions may be reduced when they cause concerns.
[0156] FIG. 7 is a process diagram illustrating an example process to address an increase in dimensions and to compute a fused feature based on the octree feature according to some embodiments. One way is to introduce a fully connected layer or an MLP to fuse the octree features and original input features of deep feature coding. This is shown in the example feature aggregation block 700 of FIG. 7. The “®” symbol 702 means concatenation, and the MLP 704 is newly proposed before the original feature aggregation module for the fuse purpose. The few FA layers 706, 708, 710 represent the structure of the earlier feature aggregation module. The new input feature f2 (712) is set to the same dimension of the earlier input feature (714). This would at least avoid any change in the earlier feature aggregation design. For some embodiments, the information in the input feature (714) and the octree feature OF (716) are fused into a new feature f2 (712).
[0157] In some embodiments, the “©” operator 702 may be replaced by an addition operator “+”, which adds (714) and OF (716) instead of doing a concatenation. To make the addition operation possible, the octree feature 716 may be processed I transformed using an additional MLP module.
[0158] FIG. 8 is a process diagram illustrating an example feature extraction during encoding and feature aggregation during decoding according to some embodiments. FIG. 8 shows an example implementation of the feature extraction/aggregation blocks. In some embodiments, a feature extraction/aggregation block 800 takes a feature map (802) as an input and starts with a convolution layer 804 to downsample by 2x in each of the x, y, and z directions. Two convolutional layers 806, 808 and a transformer block 810 are followed to enhance the representability of the feature, and a new feature map f2 (812) is outputted. See Zhao, Hengshuang, et al., Point Transformer, ICCV 16239-16248 (2021) (“Zhao”); Mao, Jiageng, et al., Voxel transformer for 3d object detection, In Proceedings of the IEEE/CVF International Conference on Computer Vision 3164-3173 (2021) (“/Wao”); and Zhang, Cheng, et al., PVT: Point-Voxel Transformer for Point Cloud Learning, arXiv preprint arXiv: 2108.06076 (2021) ^Zhan ’}.
[0159] FIG. 9 is a process diagram illustrating an example feature aggregation I point synthesis during decoding according to some embodiments. FIG. 9 shows an example implementation of the feature aggregation I point synthesis. In some embodiments, a feature extraction/aggregation block 900 takes a feature map fa (902) as input and starts with a convolutional layer 904 to upsample by 2x in each of the x, y, and z directions. Two convolutional layers 906, 908 and one transformer block 910 are followed to enhance the representability of the feature. Finally, a new feature map fa 912 is outputted. For the point synthesis case, the new feature map fa (912) is 3-dimensional and has the (x, y, z) coordinates of the reconstructed point cloud.
[0160] FIG. 10 is a process diagram illustrating an example deep octree-based encoding according to some embodiments. FIG. 10 shows an example diagram 1000 of deep octree coding. P (1002) and PC2 (1004) stand forthe point clouds at a previous and current octree level. A serialization process 1006 traverses the voxels to be encoded sequentially and outputs a series of occupancy bits, O2 (1008). With O2 (1008), the point cloud at the current octree level, PC2 (1004), may be fully represented. Next, each bit/voxel in O2 (1008) is processed by a context modeling block 1010, followed by an adaptive arithmetic encoder block 1012 for encoding. For a current voxel, the context modeling block 1010 first estimates its probability being occupied (denoted by p), based on the context of the neighboring voxels that have already been encoded. Particularly, the context may be n binary occupancy bits of the neighboring voxels in the current octree level and/or the previous octree level. The arithmetic coder encodes the current occupancy bit based on the estimated probability p. By repeating this procedure for each bit in O2, the current bitstream BS2 (1014) is generated.
[0161] FIG. 11 is a process diagram illustrating an example deep octree-based decoding according to some embodiments. FIG. 11 shows an example diagram 1100 of deep octree-based decoding. The adaptive arithmetic decoder block 1102 decodes each occupancy bits from the received bitstream BS2, to obtain O2. To decode an occupancy bit, the arithmetic decoder takes as input not only BS2 (1104) but also an occupancy probability p 1106 estimated by a context modeling block 1108. Similar to the case of encoder, the context modeling block 1108 also takes as input the context of the already decoded voxels (from current octree level and/or previous octree level) and outputs the probability p 1108. The occupancy bits O2 (1110) are assigned to voxel grids at the current octree level by a deserialization block 1112, which performs this assignment by checking the already decoded octree level P (1114). The deserialization block outputs the decoded point cloud at the current octree level, PC2 (1116).
Feature Aggregation
[0162] In the application, MLPs and convolutional layers may be replaced or appended with advanced feature aggregation micro-architectures, for example Inception ResNets (IRNs) or transformer blocks. See Szegedy, Christian, et al., Inception-v4, inception-resnet and the impact of residual connections on learning, 31 :1 IN PROCEEDINGS OF THE AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (2017) ‘Szeged}/’),- Zhao,- Mao,- and Zhang.
Inception ResNet (IRN)
[0163] FIG. 12 is a process diagram illustrating an example Inception-ResNet block for feature aggregation according to some embodiments. The IRN architecture 1200 is provided in FIG. 12. This example shows the architecture of an IRN block 1200 to aggregate features with D channels. Here “CONV /V” means a convolutional layer that accepts an input with N channels. In this example, each CONV D/4 block 1202, 1204, 1208 is followed by a Recti-Li near Unit (ReLU) block 1214, 1216, 1218. The output of each of the CONV D/2 blocks 1206, 1210 concatenated together by concatenation block 1220. The plus symbol (“©”) 1222 denotes summation.
Transformer
[0164] FIG. 13 is a process diagram illustrating an example transformer block for feature aggregation according to some embodiments. The diagram of a transformer block 1300 is shown in FIG. 13, where again, (1304, 1308) denotes summation. FIG. 13 shows the basic diagram of a transformer block 1300, which consists of a self-attention block 1302 with residual connection, and a MLP block 1306 (consisting of a few MLP layers) with residual connection.
[0165] FIG. 14 is a process diagram illustrating an example self-attention block according to some embodiments. The block diagram of the self-attention block 1400 is shown in FIG. 14. Its details are described below.
[0166] Given a current feature vector fA (1402) associated with a voxel location A, and its neighboring k features f^. associated with voxel locations At, where At (0 < i < k - 1) are the k nearest neighbors of A in the input sparse tensor, the self-attention block 1400 endeavors to update the feature fA (1402) based on all the neighboring features fAj (1410). Firstly, the points At (1404) are obtained by passing the feature f (1402) through a kNN block 1426 to perform a k nearest neighbor (kNN) search based on the coordinate of A. Then, the query embedding QA for A is computed with:
QA = MLP^f , in which the current feature vector (1402) is passed through an MLP block 1406 to generate QA (1408). [0167] After that, the key embedding KA. (1420) and the value embedding VA. (1422) of all the nearest neighbors of A are computed: where MLPQ( ) (1406), MLPK( ) (1412), and MLPv( ) (1414) are MLP layers to obtain the query, key, and value entities, respectively, and EA. (1418) is the positional encoding between the voxels A and Ab calculated by:
F^ MLPpfa - P , where MLPp(-) (1416) is MLP layers to obtain the positional encoding, PA and PAI are 3-D coordinates, they are centers of the voxels A and Ai: respectively. The output feature of location A by the self-attention block is: where <?(•) is the Softmax normalization function 1424, d is the length of the feature vector fA and c is a predefined constant.
[0168] The transformer block updates the feature map for all locations in the same way and then outputs the updated feature map. Note that in a simplified embodiment, MLPQ(-), MLPK( ), MLP i/( ), and MLPp(-) may contain only one fully-connected layer, which corresponds to linear projections.
[0169] FIG. 15 is a flowchart illustrating an example encoding process according to some embodiments. For some embodiments, an example process 1500 may include obtaining 1502 information including a point cloud. For some embodiments, the example process 1500 may further include passing 1504 the point cloud through a feature extraction process to generate a first feature. For some embodiments, the example process 1500 may further include obtaining 1506 an octree feature from an octree coding process. For some embodiments, the example process 1500 may further include generating 1508 a second feature by fusing the octree feature with the first feature. For some embodiments, the example process 1500 may further include aggregating 1510 a feature based on the second feature. [0170] FIG. 16 is a flowchart illustrating an example decoding process according to some embodiments. For some embodiments, an example process 1600 may include obtaining 1602 an octree feature from an octree coding process. For some embodiments, the example process 1600 may further include obtaining 1604 an input feature. For some embodiments, the example process 1600 may further include determining 1606 a new input feature by fusing the octree feature with the input feature. For some embodiments, the example process 1600 may further include aggregating 1608 a feature based on the new input feature.
[0171] While the methods and systems in accordance with some embodiments are generally discussed in context of extended reality (XR), some embodiments may be applied to any XR contexts such as, e.g., virtual reality (VR) / mixed reality (MR) / augmented reality (AR) contexts. Also, although the term “head mounted display (HMD)” is used herein in accordance with some embodiments, some embodiments may be applied to a wearable device (which may or may not be attached to the head) capable of, e.g., XR, VR, AR, and/or MR for some embodiments.
[0172] A first example method in accordance with some embodiments may include: obtaining information including a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and aggregating a feature based on the second feature.
[0173] For some embodiments of the first example method, the octree feature is used on only one of an encoder process and a decoder process.
[0174] For some embodiments of the first example method, obtaining the octree feature from the octree coding process is based on a block map corresponding to the first feature.
[0175] For some embodiments of the first example method, obtaining the octree feature from the octree coding process includes: using a block map corresponding to the first feature as an input; and passing the block map through the octree coding process to generate the octree feature.
[0176] For some embodiments of the first example method, the octree feature corresponds to the first feature.
[0177] For some embodiments of the first example method, aggregating the feature based on the second feature includes: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through a transformer process to generate the aggregated feature. [0178] For some embodiments of the first example method, the transformer process includes one or more multi-layer perceptron (MLP) blocks.
[0179] For some embodiments of the first example method, aggregating the feature based on the second feature includes: performing an iterative process one or more times, wherein the iterative process includes: passing a fused feature through a multi-layer perceptron (MLP) block; passing an output of the MLP though one or more feature aggregation layers to generate an output feature; and fusing the output feature with the octree feature to generate the fused feature for a next pass through the iterative process, wherein the second feature is used as the fused feature for a first pass through the iterative process, and wherein the output feature becomes the aggregated feature for a final pass through the iterative process.
[0180] For some embodiments of the first example method, the MLP block includes an Inception-ResNet block.
[0181] A first example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any one of the methods listed above.
[0182] A second example method in accordance with some embodiments may include: obtaining an octree feature from an octree coding process; obtaining an input feature; determining a new input feature by fusing the octree feature with the input feature; and aggregating a feature based on the new input feature.
[0183] For some embodiments of the second example method, the octree feature is used on only one of an encoder process and a decoder process.
[0184] For some embodiments of the second example method, obtaining the octree feature from the octree coding process is based on a block map corresponding to the first feature.
[0185] For some embodiments of the second example method, obtaining the octree feature from the octree coding process includes: obtaining a bitstream including a block map previously-passed through an encoder octree coding process; using the bitstream as an input; and passing the bitstream through the octree coding process to generate the octree feature.
[0186] For some embodiments of the second example method, the octree feature corresponds to the first feature. [0187] For some embodiments of the second example method, aggregating the feature based on the second feature includes: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through a transformer process to generate the aggregated feature.
[0188] For some embodiments of the second example method, the transformer process includes one or more multi-layer perceptron (MLP) blocks.
[0189] For some embodiments of the second example method, aggregating the feature based on the second feature includes: performing an iterative process one or more times, wherein the iterative process includes: passing a fused feature through a multi-layer perceptron (MLP) block; passing an output of the MLP though one or more feature aggregation layers to generate an output feature; and fusing the output feature with the octree feature to generate the fused feature for a next pass through the iterative process, wherein the second feature is used as the fused feature for a first pass through the iterative process, and wherein the output feature becomes the aggregated feature for a final pass through the iterative process.
[0190] For some embodiments of the second example method, the MLP block includes an Inception-ResNet block.
[0191] Some embodiments of the second example method may further include passing the octree feature and the aggregated feature through a point synthesis process to generate an output point cloud.
[0192] A second example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any one of the methods listed above.
[0193] A third example method in accordance with some embodiments may include: obtaining information including a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and passing the second feature through a feature aggregation process to generate a third feature.
[0194] A third example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any one of the methods listed above. [0195] A fourth example method in accordance with some embodiments may include: obtaining an octree feature from an octree coding process; obtaining a first feature as an input; generating a second feature by fusing the octree feature with the first feature; and passing the second feature through a feature aggregation process to generate a third feature.
[0196] A fourth example apparatus in accordance with some embodiments may include: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform any one of the methods listed above.
[0197] A fifth example apparatus in accordance with some embodiments may include at least one processor configured to perform any one of the methods listed above.
[0198] A sixth example apparatus in accordance with some embodiments may include a computer-readable medium storing instructions for causing one or more processors to perform any one of the methods listed above.
[0199] A seventh example apparatus in accordance with some embodiments may include at least one processor and at least one non-transitory computer-readable medium storing instructions for causing the at least one processor to perform any one of the methods listed above.
[0200] An example signal in accordance with some embodiments may include a bitstream generated according to any one of the methods listed above.
[0201] This application describes a variety of aspects, including tools, features, embodiments, models, approaches, etc. Many of these aspects are described with specificity and, at least to show the individual characteristics, are often described in a manner that may sound limiting. However, this is for purposes of clarity in description, and does not limit the application or scope of those aspects. Indeed, all of the different aspects can be combined and interchanged to provide further aspects. Moreover, the aspects can be combined and interchanged with aspects described in earlier filings as well.
[0202] The aspects described and contemplated in this application can be implemented in many different forms. While some embodiments are illustrated specifically, other embodiments are contemplated, and the discussion of particular embodiments does not limit the breadth of the implementations. At least one of the aspects generally relates to point cloud encoding and decoding, and at least one other aspect generally relates to transmitting a bitstream generated or encoded. These and other aspects can be implemented as a method, an apparatus, a computer readable storage medium having stored thereon instructions for encoding or decoding video data according to any of the methods described, and/or a computer readable storage medium having stored thereon a bitstream generated according to any of the methods described.
[0203] In the present application, the terms “reconstructed” and “decoded” may be used interchangeably, the terms “point”, “voxel” and “sample” may be used interchangeably, the terms “image,” “picture” and “frame” may be used interchangeably. Usually, but not necessarily, the term “reconstructed” is used at the encoder side while “decoded” is used at the decoder side.
[0204] Various methods are described herein, and each of the methods comprises one or more steps or actions for achieving the described method. Unless a specific order of steps or actions is required for proper operation of the method, the order and/or use of specific steps and/or actions may be modified or combined. Additionally, terms such as “first”, “second”, etc. may be used in various embodiments to modify an element, component, step, operation, etc., such as, for example, a “first decoding” and a “second decoding”. Use of such terms does not imply an ordering to the modified operations unless specifically required. So, in this example, the first decoding need not be performed before the second decoding, and may occur, for example, before, during, or in an overlapping time period with the second decoding.
[0205] Various numeric values may be used in the present application, for example. The specific values are for example purposes and the aspects described are not limited to these specific values.
[0206] Embodiments described herein may be carried out by computer software implemented by a processor or other hardware, or by a combination of hardware and software. As a non-limiting example, the embodiments can be implemented by one or more integrated circuits. The processor can be of any type appropriate to the technical environment and can encompass one or more of microprocessors, general purpose computers, special purpose computers, and processors based on a multi-core architecture, as non-limiting examples.
[0207] Various implementations involve decoding. “Decoding”, as used in this application, can encompass all or part of the processes performed, for example, on a received encoded sequence in order to produce a final output suitable for display. In various embodiments, such processes include one or more of the processes typically performed by a decoder, for example, entropy decoding, inverse quantization, inverse transformation, and differential decoding. In various embodiments, such processes also, or alternatively, include processes performed by a decoder of various implementations described in this application, for example, extracting a picture from a tiled (packed) picture, determining an upsampling filter to use and then upsampling a picture, and flipping a picture back to its intended orientation. [0208] As further examples, in one embodiment “decoding” refers only to entropy decoding, in another embodiment “decoding” refers only to differential decoding, and in another embodiment “decoding” refers to a combination of entropy decoding and differential decoding. Whether the phrase “decoding process” is intended to refer specifically to a subset of operations or generally to the broader decoding process will be clear based on the context of the specific descriptions.
[0209] Various implementations involve encoding. In an analogous way to the above discussion about “decoding”, “encoding” as used in this application can encompass all or part of the processes performed, for example, on an input video sequence in order to produce an encoded bitstream. In various embodiments, such processes include one or more of the processes typically performed by an encoder, for example, partitioning, differential encoding, transformation, quantization, and entropy encoding. In various embodiments, such processes also, or alternatively, include processes performed by an encoder of various implementations described in this application.
[0210] As further examples, in one embodiment “encoding” refers only to entropy encoding, in another embodiment “encoding” refers only to differential encoding, and in another embodiment “encoding” refers to a combination of differential encoding and entropy encoding. Whether the phrase “encoding process” is intended to refer specifically to a subset of operations or generally to the broader encoding process will be clear based on the context of the specific descriptions.
[0211] When a figure is presented as a flow diagram, it should be understood that it also provides a block diagram of a corresponding apparatus. Similarly, when a figure is presented as a block diagram, it should be understood that it also provides a flow diagram of a corresponding method/process.
[0212] Various embodiments refer to rate distortion optimization. In particular, during the encoding process, the balance or trade-off between the rate and distortion is usually considered, often given the constraints of computational complexity. The rate distortion optimization is usually formulated as minimizing a rate distortion function, which is a weighted sum of the rate and of the distortion. There are different approaches to solve the rate distortion optimization problem. For example, the approaches may be based on an extensive testing of all encoding options, including all considered modes or coding parameters values, with a complete evaluation of their coding cost and related distortion of the reconstructed signal after coding and decoding. Faster approaches may also be used, to save encoding complexity, in particular with computation of an approximated distortion based on the prediction or the prediction residual signal, not the reconstructed one. A mix of these two approaches can also be used, such as by using an approximated distortion for only some of the possible encoding options, and a complete distortion for other encoding options. Other approaches only evaluate a subset of the possible encoding options. More generally, many approaches employ any of a variety of techniques to perform the optimization, but the optimization is not necessarily a complete evaluation of both the coding cost and related distortion.
[0213] The implementations and aspects described herein can be implemented in, for example, a method or a process, an apparatus, a software program, a data stream, or a signal. Even if only discussed in the context of a single form of implementation (for example, discussed only as a method), the implementation of features discussed can also be implemented in other forms (for example, an apparatus or program). An apparatus can be implemented in, for example, appropriate hardware, software, and firmware. The methods can be implemented in, for example, a processor, which refers to processing devices in general, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. Processors also include communication devices, such as, for example, computers, cell phones, portable/personal digital assistants (“PDAs”), and other devices that facilitate communication of information between end-users.
[0214] Reference to “one embodiment” or “an embodiment” or “one implementation” or “an implementation”, as well as other variations thereof, means that a particular feature, structure, characteristic, and so forth described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrase “in one embodiment” or “in an embodiment” or “in one implementation” or “in an implementation”, as well any other variations, appearing in various places throughout this application are not necessarily all referring to the same embodiment.
[0215] Additionally, this application may refer to “determining” various pieces of information. Determining the information can include one or more of, for example, estimating the information, calculating the information, predicting the information, or retrieving the information from memory.
[0216] Further, this application may refer to “accessing” various pieces of information. Accessing the information can include one or more of, for example, receiving the information, retrieving the information (for example, from memory), storing the information, moving the information, copying the information, calculating the information, determining the information, predicting the information, or estimating the information.
[0217] Additionally, this application may refer to “receiving” various pieces of information. Receiving is, as with “accessing”, intended to be a broad term. Receiving the information can include one or more of, for example, accessing the information, or retrieving the information (for example, from memory). Further, “receiving” is typically involved, in one way or another, during operations such as, for example, storing the information, processing the information, transmitting the information, moving the information, copying the information, erasing the information, calculating the information, determining the information, predicting the information, or estimating the information.
[0218] It is to be appreciated that the use of any of the following ”, “and/or”, and “at least one of”, for example, in the cases of “A/B”, “A and/or B” and “at least one of A and B”, is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of both options (A and B). As a further example, in the cases of “A, B, and/or C” and “at least one of A, B, and C”, such phrasing is intended to encompass the selection of the first listed option (A) only, or the selection of the second listed option (B) only, or the selection of the third listed option (C) only, or the selection of the first and the second listed options (A and B) only, or the selection of the first and third listed options (A and C) only, or the selection of the second and third listed options (B and C) only, or the selection of all three options (A and B and C). This may be extended for as many items as are listed.
[0219] Also, as used herein, the word “signal” refers to, among other things, indicating something to a corresponding decoder. For example, in certain embodiments the encoder signals a particular one of a plurality of parameters for region-based filter parameter selection for de-artifact filtering. In this way, in an embodiment the same parameter is used at both the encoder side and the decoder side. Thus, for example, an encoder can transmit (explicit signaling) a particular parameter to the decoder so that the decoder can use the same particular parameter. Conversely, if the decoder already has the particular parameter as well as others, then signaling can be used without transmitting (implicit signaling) to simply allow the decoder to know and select the particular parameter. By avoiding transmission of any actual functions, a bit savings is realized in various embodiments. It is to be appreciated that signaling can be accomplished in a variety of ways. For example, one or more syntax elements, flags, and so forth are used to signal information to a corresponding decoder in various embodiments. While the preceding relates to the verb form of the word “signal”, the word “signal” can also be used herein as a noun.
[0220] Implementations can produce a variety of signals formatted to carry information that can be, for example, stored or transmitted. The information can include, for example, instructions for performing a method, or data produced by one of the described implementations. For example, a signal can be formatted to carry the bitstream of a described embodiment. Such a signal can be formatted, for example, as an electromagnetic wave (for example, using a radio frequency portion of spectrum) or as a baseband signal. The formatting can include, for example, encoding a data stream and modulating a carrier with the encoded data stream. The information that the signal carries can be, for example, analog or digital information. The signal can be transmitted over a variety of different wired or wireless links, as is known. The signal can be stored on a processor-readable medium.
[0221] We describe a number of embodiments. Features of these embodiments can be provided alone or in any combination, across various claim categories and types. Further, embodiments can include one or more of the following features, devices, or aspects, alone or in any combination, across various claim categories and types:
• Adapting residues at an encoder according to any of the embodiments discussed.
• A bitstream or signal that includes one or more of the described syntax elements, or variations thereof.
• A bitstream or signal that includes syntax conveying information generated according to any of the embodiments described.
• Inserting in the signaling syntax elements that enable the decoder to adapt residues in a manner corresponding to that used by an encoder.
• Creating and/or transmitting and/or receiving and/or decoding a bitstream or signal that includes one or more of the described syntax elements, or variations thereof.
• Creating and/or transmitting and/or receiving and/or decoding according to any of the embodiments described.
• A method, process, apparatus, medium storing instructions, medium storing data, or signal according to any of the embodiments described.
• A TV, set-top box, cell phone, tablet, or other electronic device that performs adaptation of filter parameters according to any of the embodiments described.
• A TV, set-top box, cell phone, tablet, or other electronic device that performs adaptation of filter parameters according to any of the embodiments described, and that displays (e.g., using a monitor, screen, or other type of display) a resulting image. • A TV, set-top box, cell phone, tablet, or other electronic device that selects (e.g., using a tuner) a channel to receive a signal including an encoded image, and performs adaptation of filter parameters according to any of the embodiments described.
• A TV, set-top box, cell phone, tablet, or other electronic device that receives (e.g., using an antenna) a signal over the air that includes an encoded image, and performs adaptation of filter parameters according to any of the embodiments described.
[0222] Note that various hardware elements of one or more of the described embodiments are referred to as “modules” that carry out (i.e., perform, execute, and the like) various functions that are described herein in connection with the respective modules. As used herein, a module includes hardware (e.g., one or more processors, one or more microprocessors, one or more microcontrollers, one or more microchips, one or more application-specific integrated circuits (ASICs), one or more field programmable gate arrays (FPGAs), one or more memory devices) deemed suitable by those of skill in the relevant art for a given implementation. Each described module may also include instructions executable for carrying out the one or more functions described as being carried out by the respective module, and it is noted that those instructions could take the form of or include hardware (i.e., hardwired) instructions, firmware instructions, software instructions, and/or the like, and may be stored in any suitable non-transitory computer-readable medium or media, such as commonly referred to as RAM, ROM, etc.
[0223] Although features and elements are described above in particular combinations, one of ordinary skill in the art will appreciate that each feature or element can be used alone or in any combination with the other features and elements. In addition, the methods described herein may be implemented in a computer program, software, or firmware incorporated in a computer-readable medium for execution by a computer or processor. Examples of computer-readable storage media include, but are not limited to, a read only memory (ROM), a random access memory (RAM), a register, cache memory, semiconductor memory devices, magnetic media such as internal hard disks and removable disks, magneto-optical media, and optical media such as CD-ROM disks, and digital versatile disks (DVDs). A processor in association with software may be used to implement a radio frequency transceiver for use in a WTRU, DE, terminal, base station, RNC, or any host computer.

Claims

1. A method comprising: obtaining information comprising a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and aggregating a feature based on the second feature.
2. The method of claim 1 , wherein the octree feature is used on at least one of an encoder process and a decoder process.
3. The method of claim 1, further comprising: transmitting a first bitstream encapsulating the aggregated feature; and transmitting a second bitstream encapsulating a block map from the octree coding process.
4. The method of any one of claims 1-3, wherein obtaining the octree feature from the octree coding process is based on a block map corresponding to the first feature.
5. The method of any one of claims 1-4, wherein obtaining the octree feature from the octree coding process comprises: using a block map corresponding to the first feature as an input; and passing the block map through the octree coding process to generate the octree feature.
6. The method of any one of claims 1-5, wherein aggregating the feature based on the second feature comprises: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through a transformer process to generate the aggregated feature.
7. The method of claim 6, wherein the transformer process comprises one or more multi-layer perceptron (MLP) blocks.
8. The method of any one of claims 1-5, wherein aggregating the feature based on the second feature comprises: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through an Inception-ResNet (IRN) process to generate the aggregated feature.
9. The method of claim 8, wherein the IRN process comprises one or more multi-layer perceptron (MLP) blocks.
10. The method of any one of claims 1-5, wherein aggregating the feature based on the second feature comprises: performing an iterative process one or more times, wherein the iterative process comprises: passing a fused feature through a multi-layer perceptron (MLP) block; passing an output of the MLP though one or more feature aggregation layers to generate an output feature; and fusing the output feature with the octree feature to generate the fused feature for a next pass through the iterative process, wherein the second feature is used as the fused feature for a first pass through the iterative process, and wherein the output feature becomes the aggregated feature for a final pass through the iterative process.
11 . An apparatus comprising: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform the method of any one of claims 1 through 10.
12. A method comprising: obtaining an octree feature from an octree coding process; obtaining an input feature; determining a new input feature by fusing the octree feature with the input feature; and aggregating a feature based on the new input feature.
13. The method of claim 12, wherein the octree feature is used on at least one of an encoder process and a decoder process.
14. The method of any one of claims 12-13, wherein obtaining the octree feature from the octree coding process is based on a block map corresponding to the first feature.
15. The method of any one of claims 12-13, wherein obtaining the octree feature from the octree coding process comprises: obtaining a bitstream comprising a block map previously-passed through an encoder octree coding process; using the bitstream as an input; and passing the bitstream through the octree coding process to generate the octree feature.
16. The method of any one of claims 12-15, wherein aggregating the feature based on the second feature comprises: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through a transformer process to generate the aggregated feature.
17. The method of claim 16, wherein the transformer process comprises one or more multi-layer perceptron
(MLP) blocks.
18. The method of any one of claims 12-15, wherein aggregating the feature based on the second feature comprises: passing the second feature through one or more convolutional neural network (CNN) blocks; and passing an output of the one or more CNN blocks through an Inception-ResNet (IRN) process to generate the aggregated feature.
19. The method of claim 18, wherein the IRN process comprises one or more multi-layer perceptron (MLP) blocks.
20. The method of any one of claims 12-15, wherein aggregating the feature based on the second feature comprises: performing an iterative process one or more times, wherein the iterative process comprises: passing a fused feature through a multi-layer perceptron (MLP) block; passing an output of the MLP though one or more feature aggregation layers to generate an output feature; and fusing the output feature with the octree feature to generate the fused feature for a next pass through the iterative process, wherein the second feature is used as the fused feature for a first pass through the iterative process, and wherein the output feature becomes the aggregated feature for a final pass through the iterative process.
21 . The method of any one of claims 12-20, further comprising passing the octree feature and the aggregated feature through a point synthesis process to generate an output point cloud.
22. An apparatus comprising: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform the method of any one of claims 12 through 21.
23. A method comprising: obtaining a first bitstream comprising an encoded block map; using the bitstream as an input to an octree decoding process; obtaining an octree feature and decoded block map from the octree decoding process; obtaining an input feature from a second bitstream; determining a new input feature by fusing the decoded block map with the input feature; and aggregating a feature based on the new input feature; and passing the octree feature and the aggregated feature through a point synthesis process to generate an output point cloud.
24. The method of claim 23, wherein determining the new input feature further comprises: determining the new input feature by fusing the octree feature with the decoded block map and the input feature.
25. The method of claim 23, wherein a bitstream comprises the first bitstream and the second bitstream.
26. An apparatus comprising: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform the method of any one of claims 23 through 25.
27. A method comprising: obtaining information comprising a point cloud; passing the point cloud through a feature extraction process to generate a first feature; obtaining an octree feature from an octree coding process; generating a second feature by fusing the octree feature with the first feature; and passing the second feature through a feature aggregation process to generate a third feature.
28. An apparatus comprising: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform the method of claim 27.
29. A method comprising: obtaining an octree feature from an octree coding process; obtaining a first feature as an input; generating a second feature by fusing the octree feature with the first feature; and passing the second feature through a feature aggregation process to generate a third feature.
30. An apparatus comprising: a processor; and a non-transitory computer-readable medium storing instructions operative, when executed by the processor, to cause the apparatus to perform the method of claim 29.
31. An apparatus comprising at least one processor configured to perform the method of any one of claims 1-
10, 12-21, 23-25, 27, and 29.
32. An apparatus comprising a computer-readable medium storing instructions for causing one or more processors to perform the method of any one of claims 1-10, 12-21 , 23-25, 27, and 29.
33. An apparatus comprising at least one processor and at least one non-transitory computer-readable medium storing instructions for causing the at least one processor to perform the method of any one of claims 1-10, 12-21 , 23-25, 27, and 29.
34. A signal including a bitstream generated according to any one of claims 1-10, 12-21, 23-25, 27, and 29.
EP24800968.0A 2023-10-10 2024-10-08 Octree feature for deep-feature based point cloud compression Pending EP4792296A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202363543466P 2023-10-10 2023-10-10
PCT/US2024/050392 WO2025080594A1 (en) 2023-10-10 2024-10-08 Octree feature for deep-feature based point cloud compression

Publications (1)

Publication Number Publication Date
EP4792296A1 true EP4792296A1 (en) 2026-08-19

Family

ID=93376698

Family Applications (1)

Application Number Title Priority Date Filing Date
EP24800968.0A Pending EP4792296A1 (en) 2023-10-10 2024-10-08 Octree feature for deep-feature based point cloud compression

Country Status (5)

Country Link
EP (1) EP4792296A1 (en)
KR (1) KR20260088576A (en)
CN (1) CN122374789A (en)
AU (1) AU2024358863A1 (en)
WO (1) WO2025080594A1 (en)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20240132303A (en) * 2022-01-10 2024-09-03 인터디지털 브이씨 홀딩스 인코포레이티드 Coordinate Refinement and Upsampling from Quantized Point Cloud Reconstruction
WO2023132919A1 (en) * 2022-01-10 2023-07-13 Interdigital Vc Holdings, Inc. Scalable framework for point cloud compression

Also Published As

Publication number Publication date
KR20260088576A (en) 2026-06-12
AU2024358863A1 (en) 2026-04-30
WO2025080594A1 (en) 2025-04-17
CN122374789A (en) 2026-07-10

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

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

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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: REQUEST FOR EXAMINATION WAS MADE