Methods and devices for coding point clouds using direct coding mode to code coordinates of a point within a sub-volume associated with a current node instead of a pattern of occupancy for child nodes. When direct coding is applied to two or more points in the sub-volume, the points are ordered based on one of their respective coordinate values and pairwise coding of those coordinate values is carried out on a bit-by-bit basis. The pairwise coding includes coding whether the bits are the same and, if so, the bit value.

The purpose of the present invention is to provide a computer program for achieving die-to-database inspection at high speed and with few false reports, and a semiconductor inspection device using the same. To achieve this purpose, the present invention proposes: a computer program comprising an encoder layer that is configured to determine the features of a design data image, and a decoder layer that is configured to generate, on the basis of a variation in an image (inspection target image) obtained by photographing an inspection target pattern, a statistic pertaining to the brightness values of pixels from feature values output by the encoder layer, wherein die-to-database inspection with few false reports can be achieved by comparing the inspection target image and the statistic obtained from the decoder layer and pertaining to the brightness values, and thereby detecting a defect region in the image; and a semiconductor inspection device using the same.

Methods and devices for encoding a point cloud. A bit sequence signaling an occupancy pattern for sub-volumes of a volume is coded using binary entropy coding. Contexts may be based on neighbour configuration and a partial sequence of previously-coded bits of the bit sequence. A determination is made as to whether to apply a context reduction operation and, if so, the operation reduces the number of available contexts. Example context reduction operations include reducing neighbour configurations based on shielding by sub-volumes associated with previously-coded bits, special handling for empty neighbour configurations, and statistics-based context consolidation.

A method and system for converting a filled shape to a run length encoded RLE vector is disclosed. The method includes creating a virtual pixel array of pixel cells corresponding to a graphical array of pixels comprising the filled shape. The method includes determining a border on the virtual pixel array corresponding to the filled shape, storing a pixel-type value within each pixel cell that corresponds to a border line element within the pixel, and creating a shape RLE group corresponding to a line of pixels aligned along a first axis of the virtual pixel array. Once created, the position and length of the shape RLE group is stored as an RLE vector. The method for clipping filled shapes is also disclosed, which includes converting a clipping region to a clip RLE group, then comparing the clip RLE group to the shape RLE group, forming a clipped image RLE vector.

A method, computer program, and computer system is provided for decoding point cloud data. Data corresponding to a point cloud is received. A number of contexts associated with the received data is reduced based on occupancy data corresponding to one or more parent nodes and one or more child nodes within the received data. The data corresponding to the point cloud is decoded based on the reduced number of contexts.

A method, apparatus, and computer-readable medium for point cloud coefficient coding are provided. The method may include receiving compressed point cloud data based on set-index values and symbol-index values; and entropy-decoding the set-index values based on the compressed point cloud data. The symbol-index values may be bypass-decoded based on the compressed point cloud data, and the set-index values and symbol-index values may be combined into transform coefficients associated with cloud point data.

Methods and devices for encoding a point cloud. A bit sequence signaling an occupancy pattern for sub-volumes of a volume is coded using binary entropy coding. Contexts may be based on neighbour configuration and a partial sequence of previously-coded bits of the bit sequence. A determination is made as to whether to apply a context reduction operation and, if so, the operation reduces the number of available contexts. Example context reduction operations include reducing neighbour configurations based on shielding by sub-volumes associated with previously-coded bits, special handling for empty neighbour configurations, and statistics-based context consolidation.

In some examples, a method for compressing a spectral reflectance dataset may be performed through compression circuitry. The method may include computing a principal component analysis basis for the spectral reflectance dataset; projecting the spectral reflectance dataset onto the principal component analysis basis to obtain a weight matrix; quantizing the weight matrix; performing a Huffman encoding process on the quantized weight matrix to generate a Huffman table and Huffman codes for the quantized weight matrix; and providing compressed spectral reflectance data as the principal component analysis basis, the Huffman table, and the Huffman codes.

A three-dimensional data encoding method includes: dividing three-dimensional points included in three-dimensional data into three-dimensional point sub-clouds including a first three-dimensional point sub-cloud and a second three-dimensional point sub-cloud; appending first information indicating a space of the first three-dimensional point sub-cloud to a header of the first three-dimensional point sub-cloud, and appending second information indicating a space of the second three-dimensional point sub-cloud to a header of the second three-dimensional point sub-cloud; and encoding the first three-dimensional point sub-cloud and the second three-dimensional point sub-cloud so that the first three-dimensional point sub-cloud and the second three-dimensional point sub-cloud are decodable independently of each other.

Technologies for composing a managed node with multiple processors on multiple compute sleds to cooperatively execute a workload include a memory, one or more processors connected to the memory, and an accelerator. The accelerator further includes a coherence logic unit that is configured to receive a node configuration request to execute a workload. The node configuration request identifies the compute sled and a second compute sled to be included in a managed node. The coherence logic unit is further configured to modify a portion of local working data associated with the workload on the compute sled in the memory with the one or more processors of the compute sled, determine coherence data indicative of the modification made by the one or more processors of the compute sled to the local working data in the memory, and send the coherence data to the second compute sled of the managed node.