Abstract: A second level intra prediction mode can be combined with one or more of sixty-seven JVET intra prediction modes during encoding of a coding unit in a video bitstream. Embodiments include making a position dependent intra prediction combination (PDPC) mode available as the second level intra prediction mode. In embodiments, when a PDPC (position dependent intra prediction combination) mode is enabled, the second level intra prediction is combined with one of the 67 selected intra predictor modes. In embodiments, the PDPC mode is only enabled or available for a predetermined subset of intra prediction modes (out of 67 possible modes), in order to reduce encoder complexity and potentially improve coding efficiency. The PDPC mode may be identifies as enabled or available by a list of modes or signaling in the video bitstream.

Abstract: Particular embodiments provide a variable, BitDepth, that may be set at a value based on a number of bits used to represent pixels in pictures of a video. The variable may be used in syntax elements in HEVC, such as the HEVC range extension, but other coding standards may be used. By using the variable, different resolutions for the video may be accommodated during the encoding and decoding process. For example, the number of pixels in the pictures may be represented by 8 bits, 10 bits, 12 bits, or another number of bits depending on the resolution. Using the BitDepth variable in the syntax provides flexibility in the motion estimation and motion compensation process. For example, syntax elements used in the weighted prediction process may take into account different numbers of bits used to represent the pictures.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a node represented by a leaf node into two child nodes of unequal size, representing the two child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning is allowed recursively along the same branch in any order with symmetric partitioning.

Abstract: An apparatus including at least one processor; and at least one memory storing instructions that, when executed with the at least one processor, cause the apparatus to: determine a virtual boundary that separates a picture, or a portion of the picture, into a first area and a second area; and determine to perform filtering of at least one pixel of the first area and not perform filtering of pixels of the second area; and filter the at least one pixel of the first area with coding information of the second area.

Abstract: The present invention relates to a method for separating and purifying CVB1, and particularly, relates to a method for purifying CVB1 virus by using a heparin affinity medium.

Abstract: Particular embodiments provide a variable, BitDepth, that may be set at a value based on a number of bits used to represent pixels in pictures of a video. The variable may be used in syntax elements in HEVC, such as the HEVC range extension, but other coding standards may be used. By using the variable, different resolutions for the video may be accommodated during the encoding and decoding process. For example, the number of pixels in the pictures may be represented by 8 bits, 10 bits, 12 bits, or another number of bits depending on the resolution. Using the BitDepth variable in the syntax provides flexibility in the motion estimation and motion compensation process. For example, syntax elements used in the weighted prediction process may take into account different numbers of bits used to represent the pictures.

Abstract: A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.

Abstract: A system for decoding a bitstream by a decoder that includes receiving a bitstream indicating how a coding tree unit was partitioned into coding units and identifying final coding units to be decoded represented. The system decodes the identified final coding units using a first predictor, a second predictor, and an adjustment factor. The system derives a prediction pixel value based upon the first predictor, the second predictor and together with the adjustment factor.

Abstract: A computing device includes at least one network interface controller (NIC), a memory, and at least one processor including one or more cores. The NIC(s) receive inbound Transmission Control Protocol (TCP) packets and transmit outbound TCP packets. The memory stores a program of instructions, which the processor executes to split a datapath including both receive endpoints and transmit endpoints within the computing device into a first path and a second path. The processor assigns first inbound TCP packets to the first path in response to determining that the first inbound TCP packets are associated with an established TCP connection and a data splicing group, and assigns second inbound TCP packets not assigned to the first path to the second path. The processor uses the first path to perform one-to-many data splicing of payload data from the first inbound TCP packets into the outbound TCP packets.

Abstract: A scene encoding subsystem for multi-user mixed-reality telepresence has at least one encoder that processes signals from a plurality of cameras. A scene manager determines relative priorities of the cameras and allocates CPU resources and GPU resources in the at least one encoder based on the relative priorities of the cameras, where (i) greater CPU resources are allocated to higher priority cameras than to lower priority cameras and (ii) greater GPU resources are allocated to lower priority cameras than to higher priority cameras. The scene manager instructs a CPU to process a skipped frame using a bounding-box expansion algorithm based on object motion determined using GPU object detection and segmentation processing of previous non-skipped frames. The scene manager multiplicatively decreases and additively increases CPU and GPU resources for a set of multiple cameras based on performance of any one camera in the set.

Abstract: A nesting and shear cutting preprocessing method for a defective plate, comprising the following steps: acquiring plate information of a plate, wherein the plate information includes defect information and plate dimension information; making an electronic defect map according to the defect information and the plate dimension information, and partitioning out a region available for nesting and shear cutting; and partitioning the plate to obtain small plates according to the region available for nesting and shear cutting. A nesting and shear cutting layout method for a defective plate, a nesting and shear cutting production optimization method for a defective plate, and a system, a computing device, a storage medium therefor. The preprocessing method and the system can reduce the scrap rate of plate processing.

Abstract: A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a child node represented by a leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the parent leaf node and coding the child coding units represented by final leaf nodes of the binary tree with JVET. Disclosed is a generalized method of partitioning a block, either square or rectangular, which leads to more flexible block sizes with possible higher coding efficiency.

Abstract: The present embodiments relate to a method for encoding and a technical equipment for implementing the method. The method includes receiving a sequence of pictures to be encoded; defining a refresh period for coded pictures, wherein the decoded recovery point picture and all subsequent decoded pictures in output order are correct in content when starting decoding from the random access point picture. The encoding further includes determining the size of the refreshed area; selecting a number of sample columns or rows outside a conformance cropping window so that a boundary between the refreshed area and the unrefreshed area of the picture is aligned with a coding tree unit boundary.

Abstract: In accordance with example embodiments of the invention there is at least a method and an apparatus to perform: determining a virtual boundary that separates a picture, or a portion of the picture, into a first area and a second area; and determining to perform filtering of at least one pixel of the first area with coding information of the second area derived from the first area or with the coding information of the second area set to at least one value, when the coding information of the second area is to be used to perform the filtering of the at least one pixel of the first area, or determine to not perform the filtering of the at least one pixel of the first area, when the coding information of the second area is to be used to perform the filtering of the at least one pixel of the first area.

Abstract: A control system of gas flow for in-situ uranium mining includes: a gas mass flow controller, a gas inlet assembly, an automatic liquid discharge assembly, a gas outlet assembly, a control assembly and a pressure collection assembly. The gas inlet assembly is connected to an outlet of the gas mass flow controller; the automatic liquid discharge assembly is configured to discharge backflow liquid; the gas outlet assembly is configured to prevent backflow of an injection pipe; the control assembly is electrically connected to the gas mass flow controller, the gas outlet assembly, and the automatic liquid discharge assembly; and the pressure collection assembly includes a first sensor and a second sensor, the first sensor is disposed between the automatic liquid discharge assembly and the gas inlet assembly, and the second sensor is disposed between the injection pipe and the gas outlet assembly.

Abstract: An apparatus includes at least one processor; and at least one memory storing instructions that, when executed by the at least one processor, cause the apparatus at least to: analyze an analysis area associated with a prediction block of a coding unit; and derive at least one intra prediction mode, based on the analyzing of the analysis area associated with the prediction block of the coding unit that does not have a directionality from its coding mode.

Abstract: In an inter-frame prediction process for frames of video, a luma block is selected to be coded first for a current coding unit to form a reconstructed luma block of the current coding unit. MV(s) are refined that point from the luma block to a prediction luma block in a reference picture of the video. One of the refined MV(s) is selected to code chroma blocks for the current coding unit. In an inter-frame prediction process for frames of video, chroma blocks are selected to be coded first for a current coding unit to form reconstructed chroma blocks of the current coding unit. MV(s) are refined that point from the reconstructed chroma blocks to prediction chroma blocks in a reference picture of the video. One of the refined MV(s) is selected to code a luma block for the current coding unit.

Abstract: An apparatus configured to: determine a plurality of pairwise merge candidates for a current coding unit based on a list of merge candidates sorted according to template cost, wherein multiple pairwise merge candidates are determined for respective merge candidates of the sorted list of merge candidates; and select at least one pairwise merge candidate of the plurality of pairwise merge candidates based, at least partially, on an averaged template cost of the respective pairwise merge candidates of the at least one selected pairwise merge candidate.

Abstract: An apparatus may be configured to: select a coding unit of an image; select a first area within a coded area of the image, wherein the first area comprises, at least, a first part and a second part, wherein the first part is at least partially different from the second part; perform in-loop filtering of, at least, the first part of the first area; perform intra prediction for the selected coding unit based, at least partially, on the first area, comprising the in-loop filtered first part; and output an intra-prediction block for the selected coding unit based on the performed intra prediction.

Abstract: A method of decoding JVET video, comprising defining a coding unit (CU) template within a decoded area of a video frame, the CU template being positioned above and/or to the left of a current decoding position for which data was intra predicted, defining a search window within the decoded area, the search window being adjacent to the CU template, generating a plurality of candidate prediction templates based on pixel values in the search window, each of the plurality of candidate prediction templates being generated using different intra prediction modes, calculating a matching cost between the CU template and each of the plurality of candidate prediction templates, selecting an intra prediction mode that generated the candidate prediction template that had the lowest matching cost relative to the CU template, and generating a prediction CU for the current decoding position based on the intra prediction mode.