Patent Publication Number: US-11399192-B2

Title: Spatial scalable coding for point cloud coding

Description:
CROSS-REFERENCE TO RELATED APPLICATION 
     This application claims the benefit of priority from U.S. Provisional Application No. 62/972,159 filed Feb. 10, 2020, which is hereby incorporated by reference in its entirety. 
    
    
     FIELD 
     The disclosure relates generally to the field of data processing, and more particularly to Point Cloud Coding (POC), including methods of spatial scalable coding of a point cloud. 
     BACKGROUND 
     A point cloud is a set of data points in space that may represent a three-dimensional (3D) shape. Point cloud technology has been widely used in recent years. For example, point cloud technology may be used in autonomous driving vehicles for object detection and localization; geographic information systems (GIS) for mapping, and cultural heritage to visualize and archive cultural heritage objects and collections, etc. 
     Point clouds contain a set of high dimensional data points, each including 3D position information and additional attributes such as color, reflectance, etc. They can be captured using multiple cameras and depth sensors, or Light Detection and Ranging (Lidar) in various setups, and may be made up of thousands up to billions of points to realistically represent the original scene(s). 
     Compression technologies are needed to reduce the amount of data required to represent a point cloud for faster transmission and/or reduction of storage. 
     SUMMARY 
     Embodiments relate to a method, system, and non-transitory computer readable medium for encoding and/or decoding video data. According to one aspect, a method for decoding video data is provided. The method may include: receiving an entropy coded bitstream comprising compressed video data including point cloud occupancy codes; generating one or more dequantized dimensions of a boundary box of a point cloud by a process comprising: parsing dimensions of the boundary box of the point cloud from the bitstream; entropy-decoding the entropy coded dimensions of the boundary box of the point cloud; and dequantizing the dimensions of the boundary box of the point cloud; determining whether a node or node depth has attribute information; based on determining that the node or node depth has attribute information, using the attribute information for the node or node depth; and based on determining that the node or node depth does not have attribute information, obtaining attribute information for the node or node depth by inheriting attribute information from a node or node depth that is at least one depth level in an octree of the point cloud above a depth level of the node or node depth in the octree. 
     The node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may be an intermediate node. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may comprise averaging attribute values in the node or node depth that is the at least one depth level above. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may include using a min/max function based on attribute values in the node or node depth that is the at least one depth level above. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may include using only a subset that is less than an entire set of attribute values in the node or node depth that is the at least one depth level above. 
     The subset may include only children nodes or a subset of children nodes. 
     The subset may include only the children nodes within a center sphere distance threshold of the middle. 
     The method may further comprise: grouping descendant nodes corresponding to a same ancestor node together. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may comprise computing a weighted average of attribute values in the node or node depth that is the at least one depth level above. 
     The method may further comprise using attributes of a parent level or an ancestor level as a predictor. 
     The method may further comprise: using attribute information of a node at an octree depth as a predictor for attributes of descendant nodes of the node at the octree depth. 
     The method may further comprise: using attribute information of a node at an octree depth as predictor candidates for attributes of descendant nodes of the node at the octree depth. 
     The method may further comprise: using rate distortion optimization to select a best predictor candidate as a final predictor for attribute information of one of the descendant nodes of the node at the octree depth. 
     The attributes of the point cloud may include one or more of color or reflectance. 
     The method may further comprise: generating a displayable image based at least in part on the inherited attribute information; and performing control so that the displayable image is displayed by a display. 
     The method may further comprise: building an octree structure by subdividing the boundary box of the point cloud according to the dequantized dimensions of the boundary box including the point cloud occupancy codes of the point cloud by using the inherited attribute information. 
     According to an embodiment, a computer system for decoding video data may be provided, which may comprise: one or more computer-readable non-transitory storage media configured to store computer program code; and one or more computer processors configured to access said computer program code and operate as instructed by said computer program code, said computer program code including: receiving code configured to cause the one or more computer processors to receive an entropy coded bitstream comprising compressed video data including point cloud occupancy codes; dequantization code configured to cause the one or more computer processors to generate one or more dequantized dimensions of a boundary box of the point cloud by a process comprising: parsing dimensions of the boundary box of the point cloud from the bitstream, entropy-decoding the entropy coded dimensions of the boundary box of the point cloud, and dequantizing the dimensions of the boundary box of the point cloud; determining code configured to cause the one or more computer processors to determine whether a node or node depth has attribute information; and attribute identification code configured to cause the one or more computer processors to: based on determining that the node or node depth has attribute information, use the attribute information for the node or node depth; and based on determining that the node or node depth does not have attribute information, obtain attribute information for the node or node depth by inheriting attribute information from a node or node depth that is at least one depth level in an octree of the point cloud above a depth level of the node or node depth in the octree. 
     The computer system may further comprise a display, wherein the computer program code further comprises: display code configured to cause the at one or more processors to: generate a displayable image based at least in part on the inherited attribute information, and perform control so that the displayable image is displayed by the display. 
     The attributes of the point cloud may include one or more of color or reflectance. 
     According to an embodiment, a non-transitory computer readable medium having stored thereon a computer program for decoding video data\ may include where the computer program is configured to cause one or more computer processors to: receive an entropy coded bitstream comprising compressed video data including point cloud occupancy codes; generate one or more dequantized dimensions of a boundary box of a point cloud by a process comprising: parsing dimensions of the boundary box of the point cloud from the bitstream; entropy-decoding the entropy coded dimensions of the boundary box of the point cloud; and dequantizing the dimensions of the boundary box of the point cloud; determine whether a node or node depth has attribute information; based on determining that the node or node depth has attribute information, use the attribute information for the node or node depth; and based on determining that the node or node depth does not have attribute information, obtain attribute information for the node or node depth by inheriting attribute information from a node or node depth that is at least one depth level in an octree of the point cloud above a depth level of the node or node depth in the octree. 
     The computer program of the non-transitory computer-readable storage medium may be further configured to cause the one or more computer processors to: generate a displayable image based at least in part on the inherited attribute information; and perform control so that the displayable image is displayed by a display. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       These and other objects, features and advantages will become apparent from the following detailed description of illustrative embodiments, which is to be read in connection with the accompanying drawings. The various features of the drawings are not to scale as the illustrations are for clarity in facilitating the understanding of one skilled in the art in conjunction with the detailed description. In the drawings: 
         FIG. 1  shows an illustration of an octree-partition according to an embodiment. 
         FIG. 2  illustrates an example of a two-level octree partition, the tree structure and the corresponding occupancy codes. 
         FIGS. 3 and 4  show groupings of nodes at various octree depths, according to one or more embodiments. 
         FIG. 5  shows an operational flowchart illustrating the steps of a method for decoding video data is depicted. 
         FIG. 6  shows a functional block diagram of a networked computer environment illustrating a video coding system for encoding and/or decoding video data according to an embodiment. 
         FIG. 7  illustrates the placement of a decoder in a streaming environment/streaming system, according to an embodiment. 
         FIG. 8  illustrates a functional block diagram of a decoder (e.g., a video decoder) according to an embodiment. 
         FIG. 9  illustrates a functional block diagram of an encoding system including a source coder, which may be a video encoder according to an embodiment. 
         FIG. 10  shows a computer system  700  suitable for implementing certain embodiments of the disclosed subject matter. 
     
    
    
     DETAILED DESCRIPTION 
     Detailed embodiments of the claimed structures and methods are disclosed herein; however, it can be understood that the disclosed embodiments are merely illustrative of the claimed structures and methods that may be embodied in various forms. Those structures and methods may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments set forth herein. Rather, these exemplary embodiments are provided so that this disclosure will be thorough and complete and will fully convey the scope to those skilled in the art. In the description, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments. 
     Embodiments relate generally to the field of data processing, and more particularly to video encoding and/or decoding. The following described exemplary embodiments provide a system, method and computer program to, among other things, encode and/or decode video data. 
     Aspects are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer readable media according to the various embodiments. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. 
     Referring now to  FIG. 6 , a functional block diagram of a networked computer environment illustrating a video coding system  100  (hereinafter “system”) for encoding and/or decoding video data according to an embodiment. It should be appreciated that  FIG. 6  provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environments may be made based on design and implementation requirements. 
     As shown in  FIG. 6 , the communication system ( 100 ), according to an embodiment of the present disclosure, may include at least two terminals ( 110 ,  120 ) interconnected via a network ( 150 ). For unidirectional transmission of data, a first terminal ( 110 ) may code video data at a local location for transmission to the other terminal ( 120 ) via the network ( 150 ). The second terminal ( 120 ) may receive the coded video data of the other terminal from the network ( 150 ), decode the coded data and display the recovered video data. Unidirectional data transmission may be common in media serving applications and the like. 
       FIG. 6  illustrates a second pair of terminals ( 130 ,  140 ) provided to support bidirectional transmission of coded video that may occur, for example, during videoconferencing. For bidirectional transmission of data, each terminal ( 130 ,  140 ) may code video data captured at a local location for transmission to the other terminal via the network ( 150 ). Each terminal ( 130 ,  140 ) also may receive the coded video data transmitted by the other terminal, may decode the coded data and may display the recovered video data at a local display device. 
     In  FIG. 6 , the terminals ( 110 - 140 ) may be illustrated as a laptop  110 , a server  120 , and smartphones  130  and  140 , but the principles of the present disclosure are not so limited. Embodiments of the present disclosure find application with other equipment including but not limited to laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network ( 150 ) represents any number of networks that convey coded video data among the terminals ( 110 - 140 ), including for example wireline and/or wireless communication networks. The communication network ( 150 ) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network ( 150 ) may be immaterial to the operation of the present disclosure unless explained herein below. 
       FIG. 7  illustrates, as an example for an application for the disclosed subject matter, the placement of a decoder  210  in a streaming environment/streaming system  200 . Decoder  210  is further discussed with reference to  FIG. 8  and the decoder  433  in  FIG. 9 . The decoder  210  may correspond to decoder  210  in  FIG. 3  or the decoder  433  in  FIG. 9 . 
     The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on. 
     As shown in  FIG. 7 , a streaming system ( 200 ) may include a capture subsystem ( 213 ), which can include a video source ( 201 ), for example a digital camera, which may create an uncompressed video sample stream ( 202 ). That sample stream ( 202 ), depicted as a bold line to emphasize a high data volume when compared to encoded video bit streams, can be processed by a source encoder ( 203 ) coupled to the camera ( 201 ). The source encoder ( 203 ) can include hardware (e.g., a processor or circuit and memory), software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video bit stream ( 204 ), depicted as a thin line to emphasize the lower data volume when compared to the sample stream, can be stored on a streaming server ( 205 ) for future use. One or more streaming clients ( 206 ,  208 ) can access the streaming server ( 205 ) to retrieve copies ( 207 ,  209 ) of the encoded video bitstream ( 204 ). A client ( 206 ) can include a video decoder ( 210 ) which may decode the incoming copy of the encoded video bitstream ( 207 ) and may create an outgoing video sample stream ( 211 ) that can be rendered on a display ( 212 ) or other rendering device. 
       FIG. 8  illustrates a functional block diagram of a decoder ( 210 ) (e.g., a video decoder) according to an embodiment of the present disclosure. As shown in  FIG. 8 , a receiver ( 310 ) may receive one or more codec video sequences to be decoded by the decoder ( 210 ). In the same or another embodiment, one coded video sequence may be received at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel ( 312 ), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver ( 310 ) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver ( 310 ) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory ( 315 ) may be coupled in between a receiver ( 310 ) and an entropy decoder/parser ( 320 ) (“parser” henceforth). When receiver ( 310 ) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosychronous network, the buffer ( 315 ) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer ( 315 ) may be required, which can be comparatively large and can advantageously be of adaptive size. 
     The video decoder ( 210 ) may include a parser ( 320 ) to reconstruct symbols ( 321 ) from the entropy coded video sequence. Categories of those symbols include information used to manage operation of the decoder ( 210 ), and potentially information to control a rendering device such as a display ( 212 ) that is not an integral part of the decoder but can be coupled to it, as shown in  FIGS. 7 and 8 . The control information for the rendering device(s) may be in the form of Supplementary Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser ( 320 ) may parse/entropy-decode the coded video sequence received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow principles well known to a person skilled in the art, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser ( 320 ) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The entropy decoder/parser  320  may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth. 
     The parser ( 320 ) may perform entropy decoding/parsing operation on the video sequence received from the buffer ( 315 ), so as to create symbols ( 321 ). Reconstruction of the symbols ( 321 ) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser ( 320 ). The flow of such subgroup control information between the parser ( 320 ) and the multiple units below is not depicted for clarity. 
     Beyond the functional blocks already mentioned, the decoder  210  can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate. 
     A first unit may be the scaler/inverse transform unit ( 351 ). The scaler/inverse transform unit ( 351 ) may receive a quantized transform coefficient as well as control information, including which transform to use, a block size, a quantization factor, quantization scaling matrices, etc. as symbol(s) ( 321 ) from the parser ( 320 ). It can output blocks comprising sample values that can be input into an aggregator ( 355 ). 
     In some cases, the output samples of the scaler/inverse transform ( 351 ) can pertain to an intra-coded block, which is a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit ( 352 ). In some cases, the intra picture prediction unit ( 352 ) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current (partly reconstructed) picture ( 358 ). The aggregator ( 355 ), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit ( 352 ) has generated to the output sample information as provided by the scaler/inverse transform unit ( 351 ). 
     In other cases, the output samples of the scaler/inverse transform unit ( 351 ) can pertain to an inter-coded block, and a potentially motion compensated block. In such a case, a Motion Compensation Prediction unit ( 353 ) can access reference a picture memory ( 357 ) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols ( 321 ) pertaining to the block, these samples can be added by the aggregator ( 355 ) to the output of the scaler/inverse transform unit (in this case called the residual samples or residual signal) so to generate output sample information. The addresses within the reference picture memory form where the motion compensation unit fetches prediction samples can be controlled by motion vectors, available to the motion compensation unit in the form of symbols ( 321 ) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth. 
     The output samples of the aggregator ( 355 ) can be subject to various loop filtering techniques in the loop filter unit ( 356 ). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video bitstream and made available to the loop filter unit ( 356 ) as symbols ( 321 ) from the parser ( 320 ), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values. 
     The output of the loop filter unit ( 356 ) can be a sample stream that can be output to the render device ( 212 ) as well as stored in the reference picture memory ( 357 ) for use in future inter-picture prediction. 
     Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. Once a coded picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, parser ( 320 )), the current reference picture ( 358 ) can become part of the reference picture buffer ( 357 ), and a fresh current picture memory can be reallocated before commencing the reconstruction of the following coded picture. 
     The video decoder  210  may perform decoding operations according to a predetermined video compression technology that may be documented in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that it adheres to the syntax of the video compression technology or standard, as specified in the video compression technology document or standard and specifically in the profiles document therein. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), and/or maximum reference picture size. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence. 
     In an embodiment, the receiver ( 310 ) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder ( 210 ) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or SNR enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on. 
       FIG. 9  may be a functional block diagram of an encoding system ( 400 ) including a source coder ( 203 ), which may be a video encoder ( 203 ) according to an embodiment of the present disclosure. 
     The encoder ( 203 ) may receive video samples from a video source ( 201 ) (that is not a part of the encoder) that may capture video image(s) to be coded by the encoder ( 203 ). 
     The video source ( 201 ) may provide the source video sequence to be coded by the encoder ( 203 ) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ) and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source ( 201 ) may be a storage device, which may include a memory and processor, that stores previously prepared video. In a videoconferencing system, the video source ( 201 ) may include a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more sample depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focusses on samples. 
     According to an embodiment, the encoder ( 203 ) may code and compress the pictures of the source video sequence into a coded video sequence in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of controller ( 450 ). The controller  450  may control other functional units as described below and is functionally coupled to these units. The coupling is not depicted for clarity. Parameters set by the controller  450  can include rate control related parameters (e.g., picture skip, quantizer, lambda value of rate-distortion optimization techniques), a picture size, a group of pictures (GOP) layout, a maximum motion vector search range, and so forth. A person skilled in the art can readily identify other functions of controller ( 450 ) as they may pertain to video encoder ( 203 ) optimized for a certain system design. 
     Some video encoders operate in what a person skilled in the art readily recognizes as a “coding loop.” As an oversimplified description, a coding loop can consist of the encoding part of a source encoder ( 430 ) (“source coder” or “source encoder” henceforth), which is responsible for creating symbols based on an input picture to be coded, and a reference picture(s), and a local decoder ( 433 ) embedded in the encoder ( 203 ) that reconstructs the symbols to create the sample data a remote decoder  210  also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). That reconstructed sample stream is input to the reference picture memory ( 434 ). 
     As the decoding of a symbol stream leads to bit-exact results independent of a decoder location (local or remote), the reference picture buffer content is also bit exact between local encoder and remote encoder. In other words, the prediction part of an encoder “sees,” as reference picture samples, exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example, because of channel errors) is well known to a person skilled in the art. 
     The operation of the “local” decoder ( 433 ) can be the same as of a “remote” decoder ( 210 ), which has already been described in detail above in conjunction with  FIG. 8 . Briefly referring also to  FIG. 8 , however, as symbols are available and en/decoding of symbols to a coded video sequence by entropy coder ( 445 ) and parser ( 320 ) can be lossless, the entropy decoding parts of decoder ( 210 ) (including channel ( 312 ), receiver ( 310 ), buffer ( 315 ), and parser ( 320 )) may not be fully implemented in local decoder ( 433 ). 
     An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. The description of encoder technologies are the inverse of the described decoder technologies. Only in certain areas a more detail description is required and provided below. 
     As part of its operation, the source coder ( 430 ) may perform motion compensated predictive coding, which codes an input frame predictively with reference to one or more previously-coded frames from the video sequence that were designated as “reference frames.” In this manner, the coding engine ( 432 ) codes differences between pixel blocks of an input frame and pixel blocks of reference frame(s) that may be selected as prediction reference(s) to the input frame. 
     The local video decoder ( 433 ) may decode coded video data of frames that may be designated as reference frames, based on symbols created by the source coder ( 430 ). Operations of the coding engine ( 432 ) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder, the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder ( 433 ) replicates decoding processes that may be performed by the video decoder on reference frames and may cause reconstructed reference frames to be stored in the reference picture cache ( 434 ). In this manner, the source encoder ( 203 ) may store copies of reconstructed reference frames locally that have common content as the reconstructed reference frames that will be obtained by a far-end video decoder (absent transmission errors). 
     The predictor ( 435 ) may perform prediction searches for the coding engine ( 432 ). That is, for a new frame to be coded, the predictor ( 435 ) may search the reference picture memory ( 434 ) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor ( 435 ) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor ( 435 ), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory ( 434 ). 
     The controller ( 450 ), which may include a processor, may manage coding operations of the source coder ( 203 ), including, for example, setting of parameters and subgroup parameters used for encoding the video data. 
     Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder ( 445 ). The entropy coder may translate the symbols as generated by the various functional units into a coded video sequence, by loss-less compressing the symbols according to technologies known to a person skilled in the art as, for example Huffman coding, variable length coding, arithmetic coding, and so forth. 
     The transmitter ( 440 ) may buffer the coded video sequence(s) as created by the entropy coder ( 445 ) to prepare it for transmission via a communication channel ( 460 ), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter ( 440 ) may merge coded video data from the source coder ( 203 ) with other data to be transmitted, for example, coded audio data and/or ancillary data streams. 
     The controller ( 450 ) may manage operation of the encoder ( 203 ). During coding, the controller ( 450 ) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following frame types from among, for example, an Intra Picture (I picture), a Predictive picture (P picture) and a Bi-directionally Predictive Picture (B Picture). 
     An Intra Picture (I picture) may be one that may be coded and decoded without using any other frame in the sequence as a source of prediction. Some video codecs allow for different types of Intra pictures, including, for example Independent Decoder Refresh Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features. 
     A Predictive Picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block. 
     A Bi-directionally Predictive Picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block. 
     Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks&#39; respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference pictures. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures. 
     The source coder ( 203 ) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265, or Versatile Video Coding (VVC). In its operation, the source coder ( 203 ) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used. 
     In an embodiment, the transmitter ( 440 ) may transmit additional data with the encoded video. The source coder ( 430 ) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, Supplementary Enhancement Information (SEI) messages, Visual Usability Information (VUI) parameter set fragments, and so on. 
     As discussed above, the coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow principles well known to a person skilled in the art, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. In some streaming systems, the video bitstreams ( 204 ,  207 ,  209 ) can be encoded according to certain video coding/compression standards. An example of those standards include ITU-T HEVC Recommendation of H.265. 
     Point-Cloud Compression 
     In Test Model 13 (TMC13) in the Motion Picture Experts Group (MPEG), geometry information and the associated attributes, such as color or reflectance, may be separately compressed. The geometry information, which is the 3D coordinates of the point clouds, may be coded by octree-partition(s) with occupancy information of the octree-partition(s). The attributes may then be compressed based on reconstructed geometry using prediction, lifting and region adaptive hierarchical transform techniques. The octree partition and occupancy encoding processes are described more below. 
     Octree Partition(s) 
       FIG. 1  shows an illustration of an octree-partition according to an embodiment. In TMC13, when the octree geometry coder-decoder (codec) is used, the geometry encoding proceeds as follows. First, a cubical axis-aligned bounding box B is defined by two points (0,0,0) and (2 M-1 , 2 M-1 , 2 M-1 ), where 2 M-1  defines the size of B and M is specified in the bitstream. 
     An octree structure is then built by recursively subdividing B. At each stage, a cube is subdivided into 8 sub-cubes. An 8-bit code, namely the occupancy code, may then be generated by associating a 1-bit value with each sub-cube to indicate whether it contains points (i.e., full and has value 1) or not (i.e., empty and has value 0). Only full sub-cubes with a size greater than 1 (i.e., non-voxels) are further subdivided (e.g., by performing another octree partition of the sub-cube that is full). 
       FIG. 2  illustrates an example of a two-level octree partition, the tree structure and the corresponding occupancy codes (e.g., 10000001, 00011000, 10001000), where cubes and nodes in dark indicate that the respective cubes and nodes are occupied by points (i.e., full). 
     Encoding of Occupancy Code(s) 
     The occupancy code of each node may be compressed by an arithmetic encoder. The occupancy code can be denoted as S which is an 8-bit integer, and each bit in S may indicate the occupancy status of the corresponding child node. Two encoding methods for occupancy codes exist in TMC13: bit-wise encoding method and byte-wise encoding method. The bit-wise encoding may be enabled by default. In both bit-wise and byte-wise approaches, arithmetic coding with context modeling may be adopted to encode the occupancy code(s), where the context status is initialized at the beginning of the whole coding process and is updated during the coding process. 
     For bit-wise encoding, eight bins in S are encoded in a certain order where each bin is encoded by referring to the occupancy status of neighboring nodes and child nodes of neighboring nodes, where the neighboring nodes are in the same level of the current node. 
     For byte-wise encoding, S is encoded by referring to: an adaptive look up table (A-LUT), which keeps track of the N (e.g., 32) most frequent occupancy codes, and a cache (e.g., a second table in the cache), which keeps track of the most recent different observed M (e.g., 16) occupancy codes. 
     A binary flag indicating whether S is the A-LUT or not may be encoded. According to an embodiment, when S is in the A-LUT, the index in the A-LUT may be encoded by using a binary arithmetic encoder. According to an embodiment, when S is not in the A-LUT, then a binary flag indicating whether S is in the cache or not may be encoded. When S is in the cache, then the binary representation of the index of S may encoded by using a binary arithmetic encoder. Otherwise, when S is not in the cache, then the binary representation of S may be encoded by using a binary arithmetic encoder. 
     In some sense, the encoding using the octree partition is similar to variable length coding. 
     The decoding process starts by parsing the dimensions of the bounding box B from the bitstream. The same octree structure is then built by subdividing B according to the decoded occupancy codes. 
     According to an embodiment, attributes of a point cloud can be color, reflectance etc. 
     In the TMC13 design of the related art, the geometry coding and attribute coding are separate, and the geometry is coded by performing octree partitioning of the 3D bounding box. 
     According to an embodiment, an octree may be generalized to include not only octree partitions, but also quad-tree and binary tree partitions. 
     For example, let d=0, 1, . . . , M−1 denote the octree partition depth of a point cloud where M is the number of octree partition depths. The root node is the only node at depth 0. By construction, an octree itself introduces special scalability. For example, a subtree containing first k depths, where 0≤k≤M−1 to approximate the original point cloud may be used. Obviously, if k=0, only the root node is included, resulting in a degenerate case. When k=M−1, the subtree is the same as the original tree. When k becomes larger, the subtree resembles the original point cloud more closely. 
     However, a problem in the related art is that the octree-based geometry coding only addresses the 3D geometry positions of points in a point cloud and attribute information is available after the completion of attribute coding, which is a separate step after the completion of the geometry coding of the point cloud. Another problem is that nodes in a subtree containing first k depths for k&lt;M−1 will not have attribute information (e.g., the middle node=M−1). M depths (first is zero). 
     According to an embodiment, because the root node is too close, the middle node may be examined. Even though a decoder can decode the subtree to obtain the node positions but cannot display those nodes properly without corresponding attribute information. 
     According to an embodiment, the elements and methods described in the disclosure may be used separately or combined in any order. Further, each of the methods (or embodiments), encoder, and decoder may be implemented by processing circuitry (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program that is stored in a non-transitory computer-readable medium. 
     According to various embodiments of the disclosure, various methods to resolve the two problems in order to achieve spatial scalability of point cloud coding are provided. First, methods to obtain attributes of nodes other than leaf nodes of an octree are disclosed. Second, methods to code geometry and attribute simultaneously are also presented. 
     Attributes of Intermediate Nodes 
     According to an embodiment, a way to get the attributes of the intermediate nodes is in a reverse look. For example, when attribute information at a specific level has been obtained, attribute information of the parent node may be obtained (based on the specific level attribute information). That is, according to an embodiment, the attribute information of an intermediate node may be computed based on the node below (e.g., by looking at from the leaf level, using a simple average, etc.). 
     According to an embodiment, all nodes in depth 0, 1, . . . , M−2 in an octree may be as intermediate nodes. Note that those intermediate nodes have no attributes. The nodes at the depth M−1 are all leaf nodes with attributes. 
     According to an embodiment, N d  may be denoted as the number of nodes at depth d, where d=0, 1, M−1. 
     According to an embodiment, p d  (n) may be denoted as a node at depth d where n=0, 1, . . . , N d −1 and d=0, 1, M−1. In addition, p d  (n) may also be used to represent the 3D geometry position of the center of the corresponding node. Without loss of generality and for simple description, according to an embodiment, the points may be assumed to be ordered in such a way that all nodes corresponding to the same parent node are grouped together, as shown in  FIG. 3 . 
       FIG. 3  shows a grouping of nodes at octree depth d as children of nodes at octree depth d−1. 
     In  FIG. 3 , child nodes of p d-1 (n) are the nodes in the set {p d (S d (n−1)), p d (S d (n−1)+1), p d (S d (n)−1)}. 
     According to an embodiment, S d (N d-1 −1)=N d  and S d (0)&lt;S d (1)&lt; . . . &lt;S d (N d-1 −1). 
     According to an embodiment, A d (n) may be denoted as the attribute vector of the node p d (n). 
     According to an embodiment, attributes of nodes at depth d−1 are obtained from the attributes of nodes at depth d, starting from the last octree depth, i.e., M−1. Specifically, attribute of a node at depth d−1 is computed as a linear combination of its child nodes at depth d. In one example, attribute information of a node at depth d−1 is computed as the average value of attributes of all its child nodes at depth d, shown in the following Equation 1 (Eq. 1): 
                 A     d   -   1       ⁡     (   n   )       =       1         S   d     ⁡     (   n   )       -       S   d     ⁡     (     n   -   1     )           ⁢       ∑     l   =       S   d     ⁡     (     n   -   1     )               S   d     ⁡     (   n   )       -   1       ⁢       A   d     ⁡     (   l   )                 
where d=M−1, M−2, . . . , 2, 1, and n=0, 1, . . . , N d-1 −1, S d (−1)=0.
 
     Alternatively, according to an embodiment could use max/min instead of average. For example, according to an embodiment, a non-linear function may be applied to obtain the attribute value of a node at depth d−1, such as a maximum or minimum function, as shown below: 
     
       
         
           
             
               
                 
                   
                     
                       
                         A 
                         
                           d 
                           - 
                           1 
                         
                       
                       ⁡ 
                       
                         ( 
                         n 
                         ) 
                       
                     
                     = 
                     
                       
                         max 
                         
                           
                             A 
                             d 
                           
                           ⁡ 
                           
                             ( 
                             l 
                             ) 
                           
                         
                       
                       ⁢ 
                       
                         { 
                         
                           
                             A 
                             d 
                           
                           ⁡ 
                           
                             ( 
                             l 
                             ) 
                           
                         
                         } 
                       
                     
                   
                   , 
                   
                     
                       for 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       l 
                     
                     ∈ 
                     
                       [ 
                       
                         
                           
                             S 
                             d 
                           
                           ⁡ 
                           
                             ( 
                             
                               n 
                               - 
                               1 
                             
                             ) 
                           
                         
                         , 
                         
                             
                         
                         ⁢ 
                         
                           
                             
                               S 
                               d 
                             
                             ⁡ 
                             
                               ( 
                               n 
                               ) 
                             
                           
                           - 
                           1 
                         
                       
                       ] 
                     
                   
                 
               
               
                 
                   ( 
                   
                     Eq 
                     . 
                     
                         
                     
                     ⁢ 
                     2 
                   
                   ) 
                 
               
             
           
         
       
     
     In another embodiment, only attributes of nodes from a subset of octree depths are computed and coded in the bitstream to reduce the bitrate of a point cloud. For example, only nodes that are children nodes or a subset of the children nodes (e.g., from the center). The subset of octree depth may be denoted as {d 0 , d 1 , . . . , d D-1 } where D is number of depths in the set and the set satisfies 0≤d 0 &lt;d 1 &lt; . . . &lt;d D-1 ≥M−2. 
     According to an embodiment, nodes at the octree depth M−1 are all leaf nodes and have attributes already from the original point cloud. Thus, according to an embodiment, d D =M−1 is not included in the subset. 
     Without loss of generality and for simple description, according to an embodiment, the points may be assumed to be ordered in such a way that all descendant nodes corresponding to the same ancestor node are grouped together, shown as in  FIG. 4 . 
       FIG. 4  shows a grouping of nodes, according to an embodiment, at octree depth d t  as descendants of nodes at octree depth d t-1 . 
     In  FIG. 4 , according to an embodiment, descendent nodes of p d     t-1   (n) are the nodes in the set {p d     t   (S d     t   (n−1)), p d     t   (S d     t   (n−1)+1), . . . , p d     t   (S d     t   (n)−1)}. Note that S d     t   (N d     t-1   −1)=N d     t    and S d     t   (0)&lt;S d     t   (1)&lt; . . . &lt;S d     t   (N d     t-1   −1). 
     For example, according to an embodiment, a descendent node could be a grandparent. According to an embodiment, descendent nodes are used to compute the average. According to an embodiment, a weighted average of attributes is computed. For example, the attributes may be computed on specific level or levels (e.g., on 3 and 5). According to an embodiment, there may be variation in the weights (e.g., more weight closer to the center compared to the case where farther away from the center; farther away from the center may have less weight). 
     In one embodiment of this disclosure, attribute of a node at depth d t-1  is computed as weighted average of attributes of all its descendant nodes at depth d t , shown in the following Equation 3 (Eq. 3): 
                 A     d     t   -   1         ⁡     (   n   )       =       1       ∑     l   =       S     d   t       ⁡     (     n   -   1     )               S     d   t       ⁡     (   n   )       -   1       ⁢       w     d   t       ⁡     (   l   )           ⁢       ∑     l   =       S     d   t       ⁡     (     n   -   1     )               S     d   t       ⁡     (   n   )       -   1       ⁢         w     d   t       ⁡     (   l   )       ⁢       A     d   t       ⁡     (   l   )                   
where w d     t   (l) is the weight factor. In one embodiment, w d     t   (l) can be inverse of the norm of the vector between the center of the descendant node p d     t   (l) and the center of the node p d     t-1   (n), denoted as the following Equation 4 (Eq. 4):
 
                 w     d   t       ⁡     (   l   )       =     1              p     d     t   -   1         ⁡     (   n   )       -       p     d   t       ⁡     (   l   )                      
Where ∥V∥ denotes the norm of the vector V and the norm could be l 1  norm or l 2  norm.
 
     In another embodiment, w d     t   (l)=1. Thus, a simple average is used. 
     For example, according to an embodiment, a distance threshold may be used to, for example, choose points closer to the center, such as within a sphere. According to an embodiment, only the threshold in the sphere/center is utilized. 
     In one embodiment, a threshold, denoted as Threshold may be used to limit the descendant nodes used to compute the attribute of p d     t-1   (n), i.e., only a subset of descendant nodes shown in the following set are used:
 
Φ d     t-1   ( n )={ p   d     t   ( l )| S   d     t   ( n− 1)≤ l&lt;S   d     t   ( n ) and ∥ p   d     t-1   ( n )− p   d     t   ( l )∥&lt;Threshold}
 
Where Threshold can be predefined and used in both encoder side and decoder side, or it can be coded and sent in the bitstream
 
     According to an embodiment, the indicate function may be denoted as 
     
       
         
           
             
               I 
               x 
             
             = 
             
               { 
               
                 
                   
                     
                       1 
                     
                     
                       
                         if 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         x 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         is 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         true 
                       
                     
                   
                   
                     
                       0 
                     
                     
                       
                         if 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         x 
                         ⁢ 
                         
                           
                               
                           
                           ⁢ 
                           
                               
                           
                         
                         ⁢ 
                         is 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         false 
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
     According to an embodiment, when a simple average is used, an attribute of a node at depth d t-1  may be computed as in the following Equation 5 (Eq. 5): 
     
       
         
           
             
               
                 A 
                 
                   d 
                   
                     t 
                     - 
                     1 
                   
                 
               
               ⁡ 
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 1 
                 
                   
                     ∑ 
                     
                       l 
                       = 
                       0 
                     
                     
                       
                         N 
                         
                           d 
                           t 
                         
                       
                       - 
                       1 
                     
                   
                   ⁢ 
                   
                     I 
                     
                       
                         
                           p 
                           
                             d 
                             t 
                           
                         
                         ⁡ 
                         
                           ( 
                           l 
                           ) 
                         
                       
                       ∈ 
                       
                         
                           Φ 
                           
                             d 
                             
                               t 
                               - 
                               1 
                             
                           
                         
                         ⁡ 
                         
                           ( 
                           n 
                           ) 
                         
                       
                     
                   
                 
               
               ⁢ 
               
                 
                   ∑ 
                   
                     l 
                     = 
                     0 
                   
                   
                     
                       N 
                       
                         d 
                         t 
                       
                     
                     - 
                     1 
                   
                 
                 ⁢ 
                 
                   
                     I 
                     
                       
                         
                           p 
                           
                             d 
                             t 
                           
                         
                         ⁡ 
                         
                           ( 
                           l 
                           ) 
                         
                       
                       ∈ 
                       
                         
                           Φ 
                           
                             d 
                             
                               t 
                               - 
                               1 
                             
                           
                         
                         ⁡ 
                         
                           ( 
                           n 
                           ) 
                         
                       
                     
                   
                   ⁢ 
                   
                     
                       A 
                       
                         d 
                         t 
                       
                     
                     ⁡ 
                     
                       ( 
                       l 
                       ) 
                     
                   
                 
               
             
           
         
       
     
     According to an embodiment, when a weighted average is used, an attribute of a node at depth d t-1  may be computed as in the following Equation 6 (Eq. 6): 
     
       
         
           
             
               
                 A 
                 
                   d 
                   
                     t 
                     - 
                     1 
                   
                 
               
               ⁡ 
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 1 
                 
                   
                     ∑ 
                     
                       l 
                       = 
                       0 
                     
                     
                       
                         N 
                         
                           d 
                           t 
                         
                       
                       - 
                       1 
                     
                   
                   ⁢ 
                   
                     
                       I 
                       
                         
                           
                             p 
                             
                               d 
                               t 
                             
                           
                           ⁡ 
                           
                             ( 
                             l 
                             ) 
                           
                         
                         ∈ 
                         
                           
                             Φ 
                             
                               d 
                               
                                 t 
                                 - 
                                 1 
                               
                             
                           
                           ⁡ 
                           
                             ( 
                             n 
                             ) 
                           
                         
                       
                     
                     ⁢ 
                     
                       
                         w 
                         
                           d 
                           t 
                         
                       
                       ⁡ 
                       
                         ( 
                         l 
                         ) 
                       
                     
                   
                 
               
               ⁢ 
               
                 
                   ∑ 
                   
                     l 
                     = 
                     0 
                   
                   
                     
                       N 
                       
                         d 
                         t 
                       
                     
                     - 
                     1 
                   
                 
                 ⁢ 
                 
                   
                     I 
                     
                       
                         
                           p 
                           
                             d 
                             t 
                           
                         
                         ⁡ 
                         
                           ( 
                           l 
                           ) 
                         
                       
                       ∈ 
                       
                         
                           Φ 
                           
                             d 
                             
                               t 
                               - 
                               1 
                             
                           
                         
                         ⁡ 
                         
                           ( 
                           n 
                           ) 
                         
                       
                     
                   
                   ⁢ 
                   
                     
                       w 
                       
                         d 
                         t 
                       
                     
                     ⁡ 
                     
                       ( 
                       l 
                       ) 
                     
                   
                   ⁢ 
                   
                     
                       A 
                       
                         d 
                         t 
                       
                     
                     ⁡ 
                     
                       ( 
                       l 
                       ) 
                     
                   
                 
               
             
           
         
       
     
     For an octree corresponding to a point cloud, nodes in the first few depths are rather sparse and may not be fit for display in spatial scalability scenario. In one embodiment, only attributes of nodes at depth d≥d th  are computed (where d th  can be pre-defined or specified in the bitstream) (e.g., 5, 6 or 7). In this case, attributes of nodes at octree depth in the set {d 0 , d 1 , . . . , d D-1 } may be computed, coded and sent in the bitstream, where the set satisfies the condition: d th ≤d 0 &lt;d 1 &lt; . . . &lt;d D-1 ≤M−2. According to an embodiment, a subset of depths may be used. 
     Coding of Attributes 
     As discussed above, according to various embodiments, methods compute the attributes of intermediate nodes. According to an embodiment, methods of coding the attributes of intermediate nodes and leaf nodes of an octree are disclosed. 
     In a general case, nodes at the octree depths in the subset {d 0 , d 1 , . . . , d D-1 =M−1} may have attributes and need to be coded and sent in the bitstream. According to an embodiment, attributes of parent level or ancestor level may be used as a predictor (to predict current one). 
     In one embodiment, attribute of a node at octree depth d t-1 , i.e., A d     t-1   (n), may be used as the predictor for attributes of its descendant nodes at octree depth d t , i.e., the set of attribute vectors {A d     t   (S d     t   (n−1)), A d     t   (S d     t   (n−1)+1), . . . , A d     t   (S d     t   (n)−1)}. 
     The difference between an attribute and its predictor is computed as the following Equation 7 (Eq. 7):
 
 A   d     t   ( l )− A   d     t-1   ( n ) for  S   d     t   ( n− 1)≤ l≤S   d     t   ( n )−1
 
Where the difference can be directly entropy coded and sent in the bitstream.
 
     In one embodiment, the difference is first binarized, entropy coded and sent in the bitstream. In one embodiment, the difference is first quantized (resulting in less bits), binarized, entropy coded and sent in the bitstream. In one embodiment, the difference is first transformed, coded and sent in the bitstream. In this case, quantization of the transformed difference, binarization and entropy coding can be utilized as well. 
     According to an embodiment, Adt−1 is an ancestor. As discussed above, Adt−1 was a predictor, and now Adt−1 is one of predictor candidates, according to an embodiment. In one embodiment, attribute of a node at octree depth d t-1 , i.e., A d     t-1   (n), is used as one of the predictor candidates for attributes of its descendant nodes at octree depth d t . At the end, a set of predictor candidates is constructed and rate distortion optimization is used to select the best predictor candidate as the final predictor for the attribute of one of its descendant node A d     t   (l) where S d     t   (n−1)≤l≤S d     t   (n)−1. The index to the best predictor candidate in the candidate set is entropy coded and sent in the bitstream. According to an embodiment, the best may correspond to the best from a rate distortion point of view. According to an embodiment, different predictors may have different distortion and number of bits. Thus, according to an embodiment, analysis of a total cost formula and/or a distortion formulae may be used. 
     In one embodiment, region adaptive hierarchical transform (RAHT) transform in MPEG may be used to encode the attributes at each octree depth in which attribute information is available. 
     According to an embodiment, an attribute of a node may be a vector which may contain multiple elements such as three-color components (R, G, B or Y, Cb, Cr, etc.) and reflectance. The coding method for different attribute elements such as color elements and reflectance, can be different. 
     Coding of Geometry and Attribute Information for Spatial Scalability 
     As mentioned before, in TMC13 design (MPEG) of the related art, geometry coding and attribute coding are done separately. Attribute coding can only start after geometry coding of the whole point cloud is completed. Furthermore, two separate bitstream, i.e., geometry bitstream and attribute bitstream, are transmitted. Thus, a complete spatial scalable coding cannot be achieved in the design of the related art even though geometry coding itself or attribute coding itself allows spatial scalable coding. Methods to address this issue are presented in this section. 
     To achieve complete spatial scalability, bitstreams for geometry coding and attribute coding are interleaved. In one embodiment, occupancy information for one node and its attribute information when available are coded and put together in the bitstream. Geometry and attribute put together. In another embodiment, occupancy information for nodes in an octree depth and first coded followed by attribute coding if attribute information is available; The bitstreams of the occupancy information for nodes in an octree depth is also followed by the corresponding bitstream of attribute information. According to an embodiment, interleaving may be used (a first embodiment) and transmitting after may be used (a second embodiment). 
     In addition, the number of depths, i.e., D, in the set {d 0 , d 1 , . . . , d D-1 } may be signaled in either sequence header, frame header or slice header. Using TMC13 terminology, D is signaled in either sequence parameter set, geometry or attribute parameter set, or slice header. D can be coded using fixed-length coding with a predefined length or using unsigned exponential Golomb code, i.e., ue(n). 
     When D equals M−1, no need to send information about the set {d 0 , d 1 , . . . , d D-1 }. Otherwise, the numbers in the set are coded send sent either sequence header, frame header or slice header. First, number of bits for each number, i.e., bit length, is signaled followed by fixed-length coding of all the numbers in the set using fixed-length coding with the given bit length. 
     In one embodiment, a flag, has_attribute_flag is sent before coding nodes of an octree depth where has_attribute_flag=1 indicates attributes are computed and coding and has_attribute_flag=0 indicates no attribute information for nodes at the given octree depth. Note that for last octree depth, i.e., depth M−1, has_attribute_flag is not signaled since it&#39;s always 1. 
     According to an embodiment, a flag may be used instead of signaling. For example, a flag at each depth level may be used. According to an embodiment, a signal of which depths have attribute information (or a flag) may be used. 
     According to an embodiment, one bit may correspond to one depth. According to an embodiment, a signal can be used. 
     Referring now to  FIG. 5 , an operational flowchart illustrating the steps of a method  600  for decoding video data is depicted. However, one of ordinary skill can appreciate how the encoding process would work based on  FIG. 5 . In some implementations, one or more process blocks may be performed by the computer and the server. In some implementations, one or more process blocks may be performed by another device or a group of devices separate from or including the computer and the server. 
     Embodiments relate to a method, system, and non-transitory computer readable medium for encoding and/or decoding video data. According to one aspect, a method for decoding video data is provided. 
     As shown in  FIG. 5 , the method may include: receiving an entropy coded bitstream comprising compressed video data including point cloud occupancy codes (Step  601 ). 
     At Step  602 , the method may include generating one or more dequantized dimensions of a boundary box of a point cloud by a process. The process for dequantized dimensions may include: parsing dimensions of the boundary box of the point cloud from the bitstream; entropy decoding the entropy coded dimensions of the boundary box of the point cloud; and dequantizing the dimensions of the boundary box of the point cloud. 
     At step  603 , the method may include determining whether attribute information of a node or node depth is available. 
     At Step  604 , the method may include: based on determining that the node or node depth has attribute information, using the attribute information for the node or node depth. 
     At Step  605 , the method may include: based on determining that the node or node depth does not have attribute information, obtaining attribute information for the node or node depth by inheriting attribute information from a node or node depth that is at least one depth level in an octree of the point cloud above a depth level of the node or node depth in the octree. 
     The node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may be an intermediate node. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may comprise averaging attribute values in the node or node depth that is the at least one depth level above. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may include using a min/max function based on attribute values in the node or node depth that is the at least one depth level above. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may include using only a subset that is less than an entire set of attribute values in the node or node depth that is the at least one depth level above. 
     The subset may include only children nodes or a subset of children nodes. 
     The subset may include only the children nodes within a center sphere distance threshold of the middle. 
     The method may further comprise: grouping descendant nodes corresponding to a same ancestor node together. 
     The inheriting of the attribute information from the node or node depth that is the at least one depth level in the octree above the depth level of the node or node depth may comprise computing a weighted average of attribute values in the node or node depth that is the at least one depth level above. 
     The method may further comprise using attributes of a parent level or an ancestor level as a predictor. 
     The method may further comprise: using attribute information of a node at an octree depth as a predictor for attributes of descendant nodes of the node at the octree depth. 
     The method may further comprise: using attribute information of a node at an octree depth as predictor candidates for attributes of descendant nodes of the node at the octree depth. 
     The method may further comprise: using rate distortion optimization to select a best predictor candidate as a final predictor for attribute information of one of the descendant nodes of the node at the octree depth. 
     The attributes of the point cloud may include one or more of color or reflectance. 
     The method may further comprise: generating a displayable image based at least in part on the inherited attribute information; and performing control so that the displayable image is displayed by a display. 
     The method may further comprise: building an octree structure by subdividing the boundary box of the point cloud according to the dequantized dimensions of the boundary box including the point cloud occupancy codes of the point cloud by using the inherited attribute information. 
     According to an embodiment, a computer system for decoding video data may be provided, which may comprise: one or more computer-readable non-transitory storage media configured to store computer program code; and one or more computer processors configured to access said computer program code and operate as instructed by said computer program code, said computer program code including: receiving code configured to cause the one or more computer processors to receive an entropy coded bitstream comprising compressed video data including point cloud occupancy codes; dequantization code configured to cause the one or more computer processors to generate one or more dequantized dimensions of a boundary box of the point cloud by a process comprising: parsing dimensions of the boundary box of the point cloud from the bitstream, entropy-decoding the entropy coded dimensions of the boundary box of the point cloud, and dequantizing the dimensions of the boundary box of the point cloud; determining code configured to cause the one or more computer processors to determine whether a node or node depth has attribute information; and attribute identification code configured to cause the one or more computer processors to: based on determining that the node or node depth has attribute information, use the attribute information for the node or node depth; and based on determining that the node or node depth does not have attribute information, obtain attribute information for the node or node depth by inheriting attribute information from a node or node depth that is at least one depth level in an octree of the point cloud above a depth level of the node or node depth in the octree. 
     The computer system may further comprise a display, wherein the computer program code further comprises: display code configured to cause the at one or more processors to: generate a displayable image based at least in part on the inherited attribute information, and perform control so that the displayable image is displayed by the display. 
     The attributes of the point cloud may include one or more of color or reflectance. 
     According to an embodiment, a non-transitory computer readable medium having stored thereon a computer program for decoding video data\ may include where the computer program is configured to cause one or more computer processors to: receive an entropy coded bitstream comprising compressed video data including point cloud occupancy codes; generate one or more dequantized dimensions of a boundary box of a point cloud by a process comprising: parsing dimensions of the boundary box of the point cloud from the bitstream; entropy-decoding the entropy coded dimensions of the boundary box of the point cloud; and dequantizing the dimensions of the boundary box of the point cloud; determine whether a node or node depth has attribute information; based on determining that the node or node depth has attribute information, use the attribute information for the node or node depth; and based on determining that the node or node depth does not have attribute information, obtain attribute information for the node or node depth by inheriting attribute information from a node or node depth that is at least one depth level in an octree of the point cloud above a depth level of the node or node depth in the octree. 
     The computer program of the non-transitory computer-readable storage medium may be further configured to cause the one or more computer processors to: generate a displayable image based at least in part on the inherited attribute information; and perform control so that the displayable image is displayed by a display. 
     It may be appreciated that the flow charts (e.g.,  FIG. 5 ) provide only an illustration of one implementation and does not imply any limitations with regard to how different embodiments may be implemented. Many modifications to the depicted environments may be made based on design and implementation requirements. 
     The techniques for encoding/decoding can be implemented by one or more processors that may execute computer software having computer-readable instructions that may be physically stored in one or more computer-readable media (e.g., a hard disk drive). For example,  FIG. 10  shows a computer system  700  suitable for implementing certain embodiments of the disclosed subject matter. 
     The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like. 
     The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like. 
     The components shown in  FIG. 10  for computer system  700  are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system  700 . 
     Computer system  700  may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video). 
     Input human interface devices may include one or more of (only one of each depicted): keyboard  701 , mouse  702 , trackpad  703 , touch screen  710 , data-glove  704 , joystick  705 , microphone  706 , scanner  707 , camera  708 . 
     Computer system  700  may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen  710 , data-glove  704 , or joystick  705 , but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers  709 , headphones (not depicted)), visual output devices (such as screens  710  to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted). 
     Computer system  700  can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW  720  with CD/DVD or the like media  721 , thumb-drive  722 , removable hard drive or solid state drive  723 , legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like. 
     Those skilled in the art should also understand that term “computer readable media” or “computer readable medium” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals. 
     Computer system  700  can also include interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses ( 749 ) (such as, for example USB ports of the computer system  700 ; others are commonly integrated into the core of the computer system  700  by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system  700  can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above. 
     Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core  740  of the computer system  700 . 
     The core  740  can include one or more Central Processing Units (CPU)  741 , Graphics Processing Units (GPU)  742 , specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA)  743 , hardware accelerators for certain tasks  744 , and so forth. These devices, along with Read-only memory (ROM)  745 , Random-access memory  746 , internal mass storage such as internal non-user accessible hard drives, SSDs, and the like  747 , may be connected through a system bus  748 . In some computer systems, the system bus  748  can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core&#39;s system bus  748 , or through a peripheral bus  749 . Architectures for a peripheral bus include PCI, USB, and the like. 
     CPUs  741 , GPUs  742 , FPGAs  743 , and accelerators  744  can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM  745  or RAM  746 . Transitional data can be also be stored in RAM  746 , whereas permanent data can be stored for example, in the internal mass storage  747 . Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU  741 , GPU  742 , mass storage  747 , ROM  745 , RAM  746 , and the like. 
     The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts. 
     As an example and not by way of limitation, the computer system having architecture  700 , and specifically the core  740  can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core  740  that are of non-transitory nature, such as core-internal mass storage  747  or ROM  745 . The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core  740 . A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core  740  and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM  746  and modifying such data structures according to the processes defined by the software. 
     In addition or as an alternative, the computer system  700  may provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator  744 ), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software. 
     While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof. 
     Some embodiments may relate to a system, a method, and/or a computer readable medium at any possible technical detail level of integration. The computer readable medium may include a computer-readable non-transitory storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out operations. 
     The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire. 
     Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device. 
     Computer readable program code/instructions for carrying out operations may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user&#39;s computer, partly on the user&#39;s computer, as a stand-alone software package, partly on the user&#39;s computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user&#39;s computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects or operations. 
     These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks. 
     The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks. 
     The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer readable media according to various embodiments. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). The method, computer system, and computer readable medium may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted in the Figures. In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed concurrently or substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions. 
     It will be apparent that systems and/or methods, described herein, may be implemented in different forms of hardware, firmware, or a combination of hardware and software. The actual specialized control hardware or software code used to implement these systems and/or methods is not limiting of the implementations. Thus, the operation and behavior of the systems and/or methods were described herein without reference to specific software code—it being understood that software and hardware may be designed to implement the systems and/or methods based on the description herein. 
     No element, act, or instruction used herein should be construed as critical or essential unless explicitly described as such. Also, as used herein, the articles “a” and “an” are intended to include one or more items, and may be used interchangeably with “one or more.” Furthermore, as used herein, the term “set” is intended to include one or more items (e.g., related items, unrelated items, a combination of related and unrelated items, etc.), and may be used interchangeably with “one or more.” Where only one item is intended, the term “one” or similar language is used. Also, as used herein, the terms “has,” “have,” “having,” or the like are intended to be open-ended terms. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise. 
     The descriptions of the various aspects and embodiments have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Even though combinations of features are recited in the claims and/or disclosed in the specification, these combinations are not intended to limit the disclosure of possible implementations. In fact, many of these features may be combined in ways not specifically recited in the claims and/or disclosed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of possible implementations includes each dependent claim in combination with every other claim in the claim set. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.