Memory reduction for non-separable transforms

Techniques are described in which a decoder is configured to receive an input data block and apply an inverse non-separable transform to at least part of the input data block to generate an inverse non-separable transform output coefficient block. The applying the inverse non-separable transform comprises assigning a window, assigning a weight for each position inside the assigned window, and determining the inverse non-separable transform output coefficient block based on the assigned weights. The decoder is further configured to forming a decoded video block based on the determined inverse non-separable transform output coefficient block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

DETERMINING PREDICTION PARAMETERS FOR NON-SQUARE BLOCKS IN VIDEO CODING

A method of decoding video data comprising receiving a block of video data encoded using a position dependent intra prediction combination (PDPC) mode, the block of video data having a non-square shape defined by a width and a height, determining one or more PDPC parameters based on one or more of the width or the height of the block of video data, and decoding the block of video data using the PDPC mode and the determined PDPC parameters.

EFFICIENT TRANSFORM CODING USING OPTIMIZED COMPACT MULTI-PASS TRANSFORMS

As part of a video encoding or decoding process, a device applies a transformation to input data elements to derive output data elements for a current block. The transformation comprises a sequence of vector transformations. For each respective vector transformation of the sequence of vector transformations other than a first vector transformation of the sequence of vector transformations, input values for the respective vector transformation comprise output values of the respective previous vector transformation of the sequence of vector transformations. Each respective vector transformation of the sequence of vector transformations further takes, as input, a respective parameter vector for the respective vector transformation, the respective parameter vector for the respective vector transformation comprising one or more parameters.

Non-separable secondary transform for video coding

Techniques are described in which a decoder is configured to inverse quantize a first coefficient block and apply a first inverse transform to at least part of the inverse quantized first coefficient block to generate a second coefficient block. The first inverse transform is a non-separable transform. The decoder is further configured to apply a second inverse transform to the second coefficient block to generate a residual video block. The second inverse transform converts the second coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

Implicit transform selection in video coding

An example method includes inferring, for a current transform block of a current video block, a transform type from a plurality of transform types that includes one or more discrete cosine transforms (DCTs) and one or more discrete sine transforms (DSTs), wherein inferring the transform type comprises: determining a size of the current transform block; determining whether the current video block is partitioned using intra-subblock partitioning (ISP); and responsive to determining that the size of the current transform block is less than a threshold and that the current video block is partitioned using ISP, selecting a particular DST of the one or more DSTs as the selected transform type; transforming, using the selected transform type, the current transform block to obtain a block of reconstructed residual data for the video block; and reconstructing, based on the reconstructed residual data for the video block, the video block.

Tree-based transform unit (TU) partition for video coding

A video decoder may receive, in a bitstream that comprises an encoded representation of video data, information indicating whether a residual block is partitioned and information indicating a partition tree type for the residual block based on the residual block being partitioned, wherein the residual block is indicative of a difference between a current block and a prediction block. The video decoder may determine, based on the received information that the residual block is partitioned and the partition tree type for the residual block, a plurality of residual sub-blocks into which the residual block is partitioned according to the partition tree type. The video decoder may produce the residual data for the current block based at least in part on the residual block being partitioned according to the partition tree type into the plurality of residual sub-blocks and may decode the current block using the residual data.

TREE-BASED TRANSFORM UNIT (TU) PARTITION FOR VIDEO CODING

A video decoder may receive, in a bitstream that comprises an encoded representation of video data, information indicating whether a residual block is partitioned and information indicating a partition tree type for the residual block based on the residual block being partitioned, wherein the residual block is indicative of a difference between a current block and a prediction block. The video decoder may determine, based on the received information that the residual block is partitioned and the partition tree type for the residual block, a plurality of residual sub-blocks into which the residual block is partitioned according to the partition tree type. The video decoder may produce the residual data for the current block based at least in part on the residual block being partitioned according to the partition tree type into the plurality of residual sub-blocks and may decode the current block using the residual data.

Non-separable secondary transform for video coding with reorganizing

Techniques are described in which a decoder is configured to reorganize a first 2-dimensional coefficient block as a first 1-dimensional coefficient vector according to a coefficient scanning order and apply a first inverse transform to the first 1-dimensional coefficient vector to generate a second 1-dimensional coefficient vector. The first inverse transform is a non-separable transform. The decoder is further configured to reorganize the first 1-dimensional coefficient vector as a second 2-dimensional coefficient block and apply a second inverse transform to the second 2-dimensional coefficient block to generate a residual video block. The second inverse transform converts the second 2-dimensional coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

USING LUMA INFORMATION FOR CHROMA PREDICTION WITH SEPARATE LUMA-CHROMA FRAMEWORK IN VIDEO CODING

A method of decoding video data comprises receiving a bitstream of encoded video data, the encoded video data representing partitioned luma blocks and partitioned chroma blocks, wherein the chroma blocks are partitioned independently of the luma blocks, determining a respective coding mode corresponding to the respective partitioned luma blocks, decoding the respective partitioned luma blocks according to the determined respective coding modes, decoding a first syntax element indicating that the respective coding modes associated with the respective partitioned luma blocks are to be used for decoding a first partitioned chroma block, wherein the first partitioned chroma block is aligned with two or more partitioned luma blocks, determining a chroma coding mode for the first partitioned chroma block according to a function of the respective coding modes of the two or more partitioned luma blocks, and decoding the first partitioned chroma block in accordance with the determined chroma coding mode.

Reducing artifacts in compressed images

EFFICIENT WEIGHTED PROBABILITY ESTIMATION FOR BINARY ARITHMETIC CODING

An example coding device, such as a video coding (encoding or decoding) device is configured to determine a plurality of estimator functions to be used to calculate a probability of a symbol having a particular value, wherein the symbol is to be binary arithmetic coded according to the probability, and wherein the estimator functions do not include division operations; determine a plurality of weights for the plurality of estimator functions such that when the respective weights are applied to the estimator functions, a resulting sum of outputs of the plurality of estimator functions yields the probability; calculate the probability of the symbol having the particular value, including: execute the estimator functions without using the division operations to determine the outputs; and calculate a sum of the outputs as the probability; and binary arithmetic code the symbol according to the probability of the symbol having the particular value.

CONSTRAINED BLOCK-LEVEL OPTIMIZATION AND SIGNALING FOR VIDEO CODING TOOLS

An example device for decoding encoded video data includes storage media and processing circuitry. The storage media are configured a portion of the encoded video data. The processing circuitry is configured to determine a block-level threshold for the portion of the encoded video data stored to the storage media, to determine that an encoded block of the portion of the encoded video data has a size that is equal to or greater than the threshold, to receive a syntax element indicating that a portion of the encoded block is to be reconstructed using a coding tool, to determine, based on the encoded block having the size that is equal to or greater than the threshold, that the syntax element applies to all samples of a plurality of samples included in the encoded block, and to reconstruct the encoded block based on the coding tool.

USING LUMA INFORMATION FOR CHROMA PREDICTION WITH SEPARATE LUMA-CHROMA FRAMEWORK IN VIDEO CODING

A method of decoding video data comprises receiving a bitstream of encoded video data, the encoded video data representing partitioned luma blocks and partitioned chroma blocks, wherein the chroma blocks are partitioned independently of the luma blocks, determining a respective coding mode corresponding to the respective partitioned luma blocks, decoding the respective partitioned luma blocks according to the determined respective coding modes, decoding a first syntax element indicating that the respective coding modes associated with the respective partitioned luma blocks are to be used for decoding a first partitioned chroma block, wherein the first partitioned chroma block is aligned with two or more partitioned luma blocks, determining a chroma coding mode for the first partitioned chroma block according to a function of the respective coding modes of the two or more partitioned luma blocks, and decoding the first partitioned chroma block in accordance with the determined chroma coding ...

EXTENDED MULTIPLE TRANSFORM SELECTION FOR VIDEO CODING

An example device for coding video data includes a memory configured to store video data; and one or more processors implemented in circuitry and configured to: code a first codeword representing a selected transform scheme of a set of transform candidates of a multiple transform selection (MTS) scheme for a current block of video data, the selected transform scheme being a secondary transform of a set of available secondary transforms to be applied in addition to a primary transform; code a second codeword representing the secondary transform from the set of available secondary transforms; and apply the primary transform and the secondary transform during coding of residual data for the current block. The second codeword may be a value for a low-frequency non-separable transform (LFNST) syntax element. 1. A method of coding video data , the method comprising:coding a first codeword representing a selected transform scheme of a set of transform candidates of a multiple transform selection (MTS) scheme for a current block of video data, the selected transform scheme being a secondary transform of a set of available secondary transforms to be applied in addition to a primary transform;coding a second codeword representing the secondary transform from the set of available secondary transforms; andapplying the primary transform and the secondary transform during coding of residual data for the current block.2. The method of claim 1 , wherein the set of transform candidates includes:1) a horizontal identity transform and a vertical identity transform;2) a discrete cosine transform (DCT)-2 horizontal transform and a DCT-2 vertical transform;3) a discrete sine transform (DST)-7 horizontal transform and a DST-7 vertical transform;4) a DCT-8 horizontal transform and the DST-7 vertical transform;5) the DST-7 horizontal transform and a DST-8 vertical transform;6) a first non-separable transform; and7) a second non-separable transform.3. The method of claim 1 , wherein the set ...

Binary arithmetic coding with parameterized probability estimation finite state machines

For at least one respective bin of the bin stream, a decoder may determine, based on a state for the respective bin, an interval for the respective bin, and the offset value, a value of the respective bin. Additionally, the decoder determines one or more Finite State Machine (FSM) parameters for a next bin of the bin stream. The one or more FSM parameters for the next bin controls how probability estimates for the next bin are computed from a state for the respective bin. The decoder determines using a parameterized state updating function that takes as input the state for the respective bin, the one or more FSM parameters for the next bin of the bin stream, and the value of the respective bin, a state for the next bin of the bin stream. The decoder may debinarize the bin stream to form a decoded syntax element.

Probability initialization for video coding

An example method for entropy decoding of video data includes retrieving a pre-defined initialization value for a context of a plurality of contexts used in a context-adaptive entropy coding process to entropy code a value for a syntax element for an independently codable unit of video data; determining, based on the pre-defined initialization value and in a linear domain, an initial probability state of the context; and entropy decoding, from a bitstream and based on the initial probability state of the context, a bin of the value for the syntax element.

IMPLICIT TRANSFORM SELECTION IN VIDEO CODING

An example method includes inferring, for a current transform block of a current video block, a transform type from a plurality of transform types that includes one or more discrete cosine transforms (DCTs) and one or more discrete sine transforms (DSTs), wherein inferring the transform type comprises: determining a size of the current transform block; determining whether the current video block is partitioned using intra-subblock partitioning (ISP); and responsive to determining that the size of the current transform block is less than a threshold and that the current video block is partitioned using ISP, selecting a particular DST of the one or more DSTs as the selected transform type; transforming, using the selected transform type, the current transform block to obtain a block of reconstructed residual data for the video block; and reconstructing, based on the reconstructed residual data for the video block, the video block.

NEIGHBOR BASED SIGNALING OF INTRA PREDICTION MODES

A device for coding video data is configured to determine that a current block of video data is coded using an intra prediction mode; add an intra prediction mode of a first neighboring block of the current block to a most probable mode candidate list for the current block; add an intra prediction mode for a second neighboring block of the current block to the most probable mode candidate list for the current block; add an intra prediction mode for a third neighboring block of the current block to the most probable mode candidate list for the current block; and code the current block of video data using an intra prediction mode.

Probability initialization and signaling for adaptive arithmetic coding in video coding

A method of decoding video data includes receiving, by processing circuitry, a video bitstream including encoded representations of one or more syntax elements of a coded unit and initializing, by the processing circuitry, a respective probability state for each bin of a plurality of bins for the one or more syntax elements based on a comparison of a parameter associated with the coded unit and a respective threshold of a plurality of thresholds. The method further includes performing, by the processing circuitry, inverse binary arithmetic coding on the encoded representations of the one or more syntax elements to obtain each bin of the plurality of bins using a respective probability state for the bin, inverse binarizing, by the processing circuitry, the plurality of bins to obtain the one or more syntax elements, and decoding, by the processing circuitry, the video data based on the one or more syntax elements.

MINIMIZATION OF TRANSFORM MEMORY AND LATENCY VIA PARALLEL FACTORIZATIONS

A device for decoding video data can be configured to perform a multi-pass inverse transformation on a plurality of values to derive residual data that represents pixel differences between a current block of video data and a predictive block of the video data, wherein to perform a pass of the multi-pass inverse transformation, the device is configured to determine at least two matrices, wherein the at least two matrices comprise a first matrix and a second matrix; determine at least two vectors, wherein the at least two vectors comprise a first vector and a second vector; and perform at least two matrix-vector computations, wherein the at least two matrix-vector computations comprise a first matrix-vector computation based on the first matrix and the first vector and a second matrix-vector computation based on the second matrix and the second vector. 1. A method of decoding video data , the method comprising:determining, by a video decoder and based on syntax elements in an encoded video bitstream, a plurality of values for a current block of the video data; determining at least two matrices, wherein the at least two matrices comprise a first matrix and a second matrix;', 'determining at least two vectors, wherein the at least two vectors comprise a first vector and a second vector; and', 'performing at least two matrix-vector computations, wherein the at least two matrix-vector computations comprise a first matrix-vector computation based on the first matrix and the first vector and a second matrix-vector computation based on the second matrix and the second vector; and, 'performing, by the video decoder, a multi-pass inverse transformation on the plurality of values to derive residual data that represents pixel differences between the current block of the video data and a predictive block of the video data, wherein performing a pass of the multi-pass inverse transformation comprisesreconstructing, by the video decoder, the current block of the video data based on ...

Method and device for processing a video signal by using an adaptive separable graph-based transform

A method and a device for decoding a video signal using an adaptive separable graph-based transform. The method includes: receiving a transform index for a target block from the video signal in which the transform index indicates a graph-based transform to be applied to the target block; deriving a graph-based transform kernel corresponding to the transform index; and decoding the target block based on the graph-based transform kernel. The device includes: a parsing unit configured to receive a transform index for a target block from the video signal; and an inverse-transform unit configured to derive a graph-based transform kernel corresponding to the transform index and decode the target block based on the graph-based transform kernel.

Using luma information for chroma prediction with separate luma-chroma framework in video coding

A method of decoding video data comprises receiving a bitstream of encoded video data, the encoded video data representing partitioned luma blocks and partitioned chroma blocks, wherein the chroma blocks are partitioned independently of the luma blocks, determining a respective coding mode corresponding to the respective partitioned luma blocks, decoding the respective partitioned luma blocks according to the determined respective coding modes, decoding a first syntax element indicating that the respective coding modes associated with the respective partitioned luma blocks are to be used for decoding a first partitioned chroma block, wherein the first partitioned chroma block is aligned with two or more partitioned luma blocks, determining a chroma coding mode for the first partitioned chroma block according to a function of the respective coding modes of the two or more partitioned luma blocks, and decoding the first partitioned chroma block in accordance with the determined chroma coding ...

NEIGHBOR BASED SIGNALING OF INTRA PREDICTION MODES

A device for coding video data is configured to determine that a current block of video data is coded using an intra prediction mode; add an intra prediction mode of a first neighboring block of the current block to a most probable mode candidate list for the current block; add an intra prediction mode for a second neighboring block of the current block to the most probable mode candidate list for the current block; add an intra prediction mode for a third neighboring block of the current block to the most probable mode candidate list for the current block; and code the current block of video data using an intra prediction mode. 1determining that a current block of video data is coded using an intra prediction mode;adding an intra prediction mode of a first neighboring block of the current block to a most probable mode candidate list for the current block;adding an intra prediction mode for a second neighboring block of the current block to the most probable mode candidate list for the current block;adding an intra prediction mode for a third neighboring block of the current block to the most probable mode candidate list for the current block;determining an intra prediction mode using the most probable mode candidate list; anddecoding the current block of video data using the intra prediction mode.. A method for decoding video data, the method comprising: This application is a continuation of U.S. application Ser. No. 15/590,261, filed 9 May 2017, which claims the benefit of U.S. Provisional Application 62/336,414 filed 13 May 2016 and U.S. Provisional Application 62/404,128 filed 4 Oct. 2016, the entire content each of which is incorporated herein by reference.This disclosure relates to video encoding and video decoding.Digital video capabilities can be incorporated into a wide range of devices, including digital televisions, digital direct broadcast systems, wireless broadcast systems, personal digital assistants (PDAs), laptop or desktop computers, tablet ...

Reducing artifacts in compressed images

Systems and methods of reducing artifices in compressed images (12) are described. In one aspect, spatially-shifted forward transforms or the input image (12) are computed to generate respective sets of forward transform coefficients (C1, C2, ..., CK). Nonlinear transforms (T1, T2, ...,TK) are applied to the forward transform coefficients of each set (C1, C2, ..., CK). Inverse transforms (C'1, C'2 ..., C'K)of the sets of nonlinearly transformed forward transform coefficients are computed to generate respective intermediate images (I1, I2, ..., IK). Respective measures of local spatial intensity variability are computed for pixels of each of the intermediate images (I1, I2, ..., IK). An output image (40) is computed with pixel values computed based at least in part of the competed measures of the local spatial intensity variability.

SYSTEM AND METHOD FOR MUSIC IDENTIFICATION

Position dependent intra prediction combination extended with angular modes

Techniques are described of using Position Dependent Intra Prediction Combination (PDPC). A video coder such as a video encoder or a video decoder utilizes PDPC in cases where a current block intra mode predicted using an angular intra prediction mode.

POSITION DEPENDENT INTRA PREDICTION COMBINATION EXTENDED WITH ANGULAR MODES

Techniques are described of using Position Dependent Intra Prediction Combination (PDPC). A video coder such as a video encoder or a video decoder utilizes PDPC in cases where a current block intra mode predicted using an angular intra prediction mode.

IMPROVED VIDEO INTRA-PREDICTION USING POSITION-DEPENDENT PREDICTION COMBINATION FOR VIDEO CODING

Techniques are described to improved video intra prediction using position-dependent prediction combination in video coding. In High Efficiency Video Encoding a set of 35 linear predictors are used for doing intra coding and prediction can be computed from either a nonfiltered or a filtered set of neighboring "reference" pixels, depending on the selected predictor mode and block size. Techniques of this disclosure may use a weighted combination of both the nonfiltered and filtered set of reference pixels to achieve better compression via improved prediction and therefore small residual, enable effective parallel computation of all sets of prediction values, and maintain low complexity via applying filtering only to a set of reference pixels and not to predicted values themselves.

Binary arithmetic coding with progressive modification of adaptation parameters

A video decoder can be configured to generate a first bin stream by, for at least one bin of the first bin stream, determining a first probability estimation for the at least one bin of the first bin stream based on a first set of parameters and generate a second bin stream by, for at least one bin of the second bin stream, determining a second probability estimation for the at least one bin of the second bin stream based on a second set of parameters that are different parameters than the first set of parameters.

EFFICIENT WEIGHTED PROBABILITY ESTIMATION FOR BINARY ARITHMETIC CODING

POSITION DEPENDENT INTRA PREDICTION COMBINATION EXTENDED WITH ANGULAR MODES

Techniques are described of using Position Dependent Intra Prediction Combination (PDPC). A video coder such as a video encoder or a video decoder utilizes PDPC in cases where a current block intra mode predicted using an angular intra prediction mode. 1. A method of decoding video data , the method comprising:determining a prediction block, which includes a plurality of prediction samples, for a current block based on an angular intra prediction mode that is not a DC, planar, horizontal, or vertical intra prediction mode; determining one or more reference samples that are external to the current block based on the angular intra prediction mode; and', 'modifying the prediction sample to generate the modified prediction sample based on the determined one or more reference samples; and, 'modifying a prediction sample of the plurality of prediction samples of the prediction block to generate a modified prediction sample using Position Dependent Intra Prediction Combination (PDPC), wherein modifying the prediction sample comprisesreconstructing a sample of the current block based on the modified prediction sample and a residual value.2. The method of claim 1 , wherein determining one or more reference samples that are external to the current block comprises determining the one or more reference samples having both an x-coordinate and a y-coordinate that are different than both a respective x-coordinate and y-coordinate of the prediction sample in the prediction block.3. The method of claim 1 , wherein determining one or more reference samples that are external to the current block comprises:determining a row that is above the current block;determining an x-coordinate in the determined row, wherein the x-coordinate in the determined row is equal to an x-coordinate of the prediction sample plus a y-coordinate of the prediction sample plus 1; anddetermining a reference sample of the one or more reference samples based on the determined row and the determined x-coordinate.4 ...

KLASSIFIKATION VON BILDBLÖCKEN BASIEREND AUF DER ENTROPIE VON PIXELDIFFERENZEN

Determining prediction parameters for non-square blocks in video coding

A method of decoding video data comprising receiving a block of video data encoded using a position dependent intra prediction combination (PDPC) mode, the block of video data having a non-square shape defined by a width and a height, determining one or more PDPC parameters based on one or more of the width or the height of the block of video data, and decoding the block of video data using the PDPC mode and the determined PDPC parameters.

BINARY ARITHMETIC CODING WITH PROGRESSIVE MODIFICATION OF ADAPTATION PARAMETERS

A video decoder can be configured to generate a first bin stream by, for at least one bin of the first bin stream, determining a first probability estimation for the at least one bin of the first bin stream based on a first set of parameters and generate a second bin stream by, for at least one bin of the second bin stream, determining a second probability estimation for the at least one bin of the second bin stream based on a second set of parameters that are different parameters than the first set of parameters.

Method and device for entropy encoding or entropy decoding video signal for high-capacity parallel processing

Disclosed is a method for encoding a video signal using parallel implementations, including generating data symbols to be encoded, encoding 1st data symbols being in a base segment, copying 2nd data symbols being in another segment to a buffer, and encoding in parallel the 2nd data symbols being in the another segment.

Automatically generating three-dimensional graphical environments for information discovery and visualization

PROBABILITY INITIALIZATION FOR VIDEO CODING

An example method for entropy decoding of video data includes retrieving a pre-defined initialization value for a context of a plurality of contexts used in a context-adaptive entropy coding process to entropy code a value for a syntax element for an independently codable unit of video data; determining, based on the pre-defined initialization value and in a linear domain, an initial probability state of the context; and entropy decoding, from a bitstream and based on the initial probability state of the context, a bin of the value for the syntax element.

Communications methods, collaboration session communications organizers, collaboration sessions, and articles of manufacture

Communications methods, collaboration session communications organizers, collaboration sessions, and articles of manufacture are described. According to one aspect, a communications method includes accessing scalable media data for communication to a plurality of participants, wherein the scalable media data is configured to convey information regarding a subject, accessing a plurality of respective configuration parameters corresponding to respective ones of the participants, first modifying the scalable media data using a configuration parameter for a first recipient of the participants, the first modifying providing a first data stream having a first quantity of data to convey information for the subject, second modifying the scalable media data using a configuration parameter for a second recipient of the participants, the second modifying providing a second data stream having a second quantity of data to convey information for the subject and different than the first quantity of data ...

Binary arithmetic coding with progressive modification of adaptation parameters

A video decoder can be configured to generate a first bin stream by, for at least one bin of the first bin stream, determining a first probability estimation for the at least one bin of the first bin stream based on a first set of parameters and generate a second bin stream by, for at least one bin of the second bin stream, determining a second probability estimation for the at least one bin of the second bin stream based on a second set of parameters that are different parameters than the first set of parameters.

METHOD AND APPARATUS FOR ENCODING, DECODING A VIDEO SIGNAL USING ADDITIONAL CONTROL OF QUANTIZATON ERROR

Disclosed herein is a method of encoding a video signal, comprising receiving an original video signal; comparing the original video signal with a previously reconstructed signal; generating a correction signal to minimize a sum of a distortion component and a rate component; and entropy-encoding the correction signal that is transmitted to the decoder for video signal reconstruction, wherein the previously reconstructed signal has been inverse-transformed by additionally using a scaling diagonal matrix. 1. A method of encoding a video signal , comprising:receiving an original video signal;comparing the original video signal with a previously reconstructed signal;generating a correction signal to minimize a sum of a distortion component and a rate component; andentropy-encoding the correction signal that is transmitted to the decoder for video signal reconstruction,wherein the previously reconstructed signal has been inverse-transformed by additionally using a scaling diagonal matrix.2. The method of claim 1 , wherein the correction signal is generated based on another diagonal matrix being used to differentiate a weighting of errors in a spatial domain.3. The method of claim 1 , further comprising:calculating an optimal set of multiple diagonal matrices including the scaling diagonal matrix,wherein the correction signal is generated based on the optimal set of multiple diagonal matrices.4. The method of claim 3 , wherein the optimal set of multiple diagonal matrices is encoded as side information claim 3 , and is transmitted to a decoder.5. The method of claim 3 , wherein the optimal set of multiple diagonal matrices is encoded before encoding frames of the original video signal.6. The method of claim 1 , wherein:the distortion component is indicative of total distortion between the original video signal and a reconstructed signal, andthe rate component is indicative of a number of bits required to send a quantized coefficient.7. A method of decoding a video signal ...

Using luma information for chroma prediction with separate luma-chroma framework in video coding

A method of decoding video data comprises receiving a bitstream of encoded video data, the encoded video data representing partitioned luma blocks and partitioned chroma blocks, wherein the chroma blocks are partitioned independently of the luma blocks, determining a respective coding mode corresponding to the respective partitioned luma blocks, decoding the respective partitioned luma blocks according to the determined respective coding modes, decoding a first syntax element indicating that the respective coding modes associated with the respective partitioned luma blocks are to be used for decoding a first partitioned chroma block, wherein the first partitioned chroma block is aligned with two or more partitioned luma blocks, determining a chroma coding mode for the first partitioned chroma block according to a function of the respective coding modes of the two or more partitioned luma blocks, and decoding the first partitioned chroma block in accordance with the determined chroma coding mode.

Coding adaptive multiple transform information for video coding

An example device for decoding video data includes a memory configured to store video data; and a processor implemented in circuitry and configured to decode a truncated unary codeword representing a multiple transform (MT) scheme for a current block of the video data to determine the MT scheme; apply the MT scheme to transform coefficients of the current block to produce residual data for the current block of video data; and decode the current block using the residual data. The MT scheme may include a plurality of transforms, such as a horizontal transform and a vertical transform, a primary transform and a second transform, or any combination of separable and/or non-separable transforms. Thus, a single truncated unary codeword may represent the entire MT scheme, that is, each of a plurality of transforms of the MT scheme.

System and method for music identification

A system and method that allows users to find a song name, artist and performance without having to proceed through many false results. In one aspect, the system and method use signal matching to produce reliable matches. In another aspect, the system and method use a combination of signal and feature representation and an automatic decision rule together with a human-in-the-loop approach. A feature vector and a processed time signal are computed for each song in a database and extracted from a microphone-recorded sample of music. The database songs are first sorted by feature space distance with respect to the feature vector of the recorded sample. The processed time signals of the database songs and the processed time signal from the recorded sample are processed using signal matching. A decision rule presents likely matches to the user for confirmation. Using signal matching, feature-ordered search and a decision rule results in an effective framework for finding a song from a brief ...

Probability initialization for video coding

An example method for entropy decoding of video data includes retrieving a pre-defined initialization value for a context of a plurality of contexts used in a context-adaptive entropy coding process to entropy code a value for a syntax element for an independently codable unit of video data; determining, based on the pre-defined initialization value and in a linear domain, an initial probability state of the context; and entropy decoding, from a bitstream and based on the initial probability state of the context, a bin of the value for the syntax element.

System and method for music inditification

BINARIZING SECONDARY TRANSFORM INDEX

An example device for decoding video data includes a memory configured to store video data and one or more processors implemented in circuitry and configured to determine a maximum possible value for a secondary transform syntax element for a block of video data, entropy decode a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block, reverse binarize the value for the secondary transform syntax element using a common binarization scheme regardless of the maximum possible value to determine the secondary transform for the block, and inverse-transform transform coefficients of the block using the determined secondary transform.

CODIFICACIÓN DE TRANSFORMADA MÚLTIPLE ADAPTATIVA

Se describen técnicas para mejorar la codificación de transformadas. Se puede obtener un bloque codificado de datos de video, y se puede determinar un ancho y/o una altura del bloque. El ancho se puede comparar con un primer umbral, y/o la altura se puede comparar con un segundo umbral. Se puede determinar una transformada horizontal y una transformada vertical para el bloque en función de la comparación del ancho del bloque con el primer umbral y/o la altura del bloque con el segundo umbral. La transformada horizontal y la transformada vertical se determinan sin decodificar un elemento sintáctico que indique la transformada horizontal y la transformada vertical (por ejemplo, el elemento sintáctico no está en una corriente de bits de video codificado procesada mediante un dispositivo de decodificación). En algunos casos, los datos residuales se determinan usando las transformadas horizontal y vertical, y un bloque de video se determina usando los datos residuales y un bloque predictivo.

PROBABILITY INITIALIZATION FOR VIDEO CODING

Method and device for processing graph-based signal using geometric primitives

Disclosed herein is a method of processing a graph-based signal using a geometric primitive, comprising: specifying the geometric primitive to be used for calculating an edge weight; obtaining a parameter for each of the geometric primitive; calculating an edge weight for each of edges within the image based on the parameter; and encoding the image based on the edge weight.

METHOD AND APPARATUS FOR PERFORMING ARITHMETIC CODING ON BASIS OF CONCATENATED ROM-RAM TABLE

Disclosed herein is a method of performing an arithmetic decoding for data symbols, comprising: creating a decoding table index; obtaining an upper bound value and a lower bound value of a ratio between an interval length and a point within an interval assigned to a symbol from a ROM table; obtaining initial values for a bisection search from a RAM table based on the upper bound value and the lower bound value; and searching a value of sequence in the interval, wherein the interval is determined based on the initial values. 1. A method of performing an arithmetic decoding for data symbols , comprising:creating a decoding table index;{'sub': max', 'min', 'k', 'k, 'obtaining an upper bound value (E) and a lower bound value (E) of a ratio (D/L) between an interval length and a point within an interval assigned to a symbol from a ROM table;'}obtaining initial values for a bisection search from a RAM table based on the upper bound value and the lower bound value; andsearching a value of sequence in the interval,wherein the interval is determined based on the initial values.2. The method of claim 1 , further comprising:determining a position of most significant 1 bit of the interval length;extracting the most significant bit of the interval length after the most significant 1 bit by starting from the position plus 1 bit; andextracting the most significant bit of an interval base by starting from the position.3. The method of claim 1 , further comprising:creating the decoding table index by combining most significant bit of an interval length and most significant bit of the point within the interval assigned to the symbol.4. The method of claim 1 ,wherein the upper bound value is determined based on a ratio between a minimum of the point within the interval assigned to the symbol and a maximum of the interval length.5. The method of claim 1 ,wherein the lower bound value is determined based on a ratio between a minimum of the point within the interval assigned to the ...

Method for encoding and decoding a media signal and apparatus using the same

Disclosed herein is a method of encoding a video signal, comprising receiving an original video signal; comparing the original video signal with available reconstructed signals; determining a correction signal based on a result of the comparison; and generating a transform-coded correction signal to be transmitted for a signal reconstruction.

SYSTEM, METHOD AND FORMAT FOR SCALABLE ENCODED MEDIA DELIVERY

PROBLEM TO BE SOLVED: To deliver scalable encoded media data to a receiving base of a different type. SOLUTION: Original scalable encoded media data is formatted into a format including a first portion and a second portion. The first portion corresponds to non-media type specific scalability attributes of the original encoded media data, and data structure information of the second portion. The second portion corresponds to the original scalable encoded media data arranged in a non-media type specific indexable data structure of one dimension. The original scalable encoded media data formatted by using the data structure information is transcoded prior to delivery to a media destination, and a scaled version of the formatted original scalable encoded media data is generated on the basis of matching between a scalability attribute and a receiving attribute. Transcoded media data conforms to the receiving attribute of the media destination. COPYRIGHT: (C)2004,JPO ...

Using luma information for chroma prediction with separate luma-chroma framework in video coding

A method of decoding video data comprises receiving a bitstream of encoded video data, the encoded video data representing partitioned luma blocks and partitioned chroma blocks, wherein the chroma blocks are partitioned independently of the luma blocks, determining a respective coding mode corresponding to the respective partitioned luma blocks, decoding the respective partitioned luma blocks according to the determined respective coding modes, decoding a first syntax element indicating that the respective coding modes associated with the respective partitioned luma blocks are to be used for decoding a first partitioned chroma block, wherein the first partitioned chroma block is aligned with two or more partitioned luma blocks, determining a chroma coding mode for the first partitioned chroma block according to a function of the respective coding modes of the two or more partitioned luma blocks, and decoding the first partitioned chroma block in accordance with the determined chroma coding ...

Determining prediction parameters for non-square blocks in video coding

A method of decoding video data comprising receiving a block of video data encoded using a position dependent intra prediction combination (PDPC) mode, the block of video data having a non-square shape defined by a width and a height, determining one or more PDPC parameters based on one or more of the width or the height of the block of video data, and decoding the block of video data using the PDPC mode and the determined PDPC parameters.

Non-separable secondary transform for video coding with reorganizing

Techniques are described in which a decoder is configured to reorganize a first 2-dimensional coefficient block as a first 1-dimensional coefficient vector according to a coefficient scanning order and apply a first inverse transform to the first 1-dimensional coefficient vector to generate a second 1-dimensional coefficient vector. The first inverse transform is a non-separable transform. The decoder is further configured to reorganize the first 1-dimensional coefficient vector as a second 2-dimensional coefficient block and apply a second inverse transform to the second 2-dimensional coefficient block to generate a residual video block. The second inverse transform converts the second 2-dimensional coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

Estimación de probabilidad eficientemente ponderada para codificación aritmética binaria

Un ejemplo de dispositivo de codificación, como un dispositivo de codificación (codificación o decodificación) de vídeo, está configurado para determinar una pluralidad de funciones de estimador que se utilizarán para calcular una probabilidad de que un símbolo tenga un valor particular, en el que el símbolo se codificará por aritmética binaria de acuerdo a la probabilidad, y donde las funciones de estimador no incluyen operaciones de división; determinar una pluralidad de ponderaciones para la pluralidad de funciones de estimador de modo que cuando se apliquen las ponderaciones respectivas a las funciones de estimador, una suma resultante de salidas de la pluralidad de funciones de estimador produzca la probabilidad; calcular la probabilidad de que el símbolo tenga el valor particular, incluyendo: ejecutar las funciones del estimador sin usar las operaciones de división para determinar las salidas; y calcular una suma de las salidas como probabilidad; y codificar por aritmética binaria ...

SECONDARY TRANSFORM DESIGNS FOR PARTITIONED TRANSFORM UNITS IN VIDEO CODING

An example device applies a primary transform to a current block of video data to create primary transform coefficients. The device determines whether intra sub-partitioning is applied to the current block of video data. The device applies a primary transform to the current block. The device also determines whether a primary transform size for the current block of video data is at least a predetermined size. Based on intra sub-partitioning being applied and the primary transform size being at least the predetermined size, the device applies a secondary transform to primary transform coefficients and codes the current block of video data based on the secondary transform. 1. A method of coding video data , the method comprising:determining whether intra sub-partitioning is applied to a current block of video data;applying a primary transform to the current block of video data to generate primary transform coefficients;based on intra sub-partitioning being applied, determining whether a size of the primary transform is at least a predetermined size;based on intra sub-partitioning being applied and the size of the primary transform being at least the predetermined size, applying a secondary transform to the primary transform coefficients; andcoding the current block of the video data based on the secondary transform.2. The method of claim 1 , wherein the predetermined size is 4×4.3. The method of claim 1 , wherein the secondary transform is applied to all the primary transform coefficients for the current block of video data.4. The method of claim 1 , wherein the secondary transform is applied to less than all the primary transform coefficients for the current block of video data.5. The method of claim 1 , wherein the secondary transform is a non-separable transform.6. The method of claim 1 , wherein the secondary transform is a separable transform.7. The method of claim 1 , wherein determining whether intra sub-partitioning is applied further comprises determining a ...

Image block classification based on entropy of pixel differences

TRANSFORM COEFFICIENT COMPRESSION USING MULTIPLE SCANS

BINARY ARITHMETIC CODING WITH PROGRESSIVE MODIFICATION OF ADAPTATION PARAMETERS

A video decoder can be configured to generate a first bin stream by, for at least one bin of the first bin stream, determining a first probability estimation for the at least one bin of the first bin stream based on a first set of parameters and generate a second bin stream by, for at least one bin of the second bin stream, determining a second probability estimation for the at least one bin of the second bin stream based on a second set of parameters that are different parameters than the first set of parameters. 1. A method of decoding video data , the method comprising: generating a first bin stream, wherein generating the first bin stream comprises determining a first probability estimation for at least one bin of the first bin stream based on a first set of parameters;', 'debinarizing the first bin stream to form the first decoded syntax element;, 'determining a first decoded syntax element by applying binary arithmetic decoding to an encoded version of the first syntax element included in a bitstream of the video data, wherein applying the binary arithmetic decoding to the encoded version of the first syntax element comprises generating a second bin stream, wherein generating the second bin stream comprises determining a second probability estimation for at least one bin of the second bin stream based on a second set of parameters, wherein the second set of parameters comprises different parameters than the first set of parameters;', 'debinarizing the second bin stream to form the second decoded syntax element; and, 'determining a second decoded syntax element by applying the binary arithmetic decoding to an encoded version of the second syntax element included in the bitstream of the video data, wherein applying the binary arithmetic decoding to the encoded version of the second syntax element comprisesreconstructing a picture of the video data based in part on the first decoded syntax element and the second decoded syntax element.2. The method of claim 1 , ...

NON-SEPARABLE SECONDARY TRANSFORM FOR VIDEO CODING

Techniques are described in which a decoder is configured to inverse quantize a first coefficient block and apply a first inverse transform to at least part of the inverse quantized first coefficient block to generate a second coefficient block. The first inverse transform is a non-separable transform. The decoder is further configured to apply a second inverse transform to the second coefficient block to generate a residual video block. The second inverse transform converts the second coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks. 1. A method for decoding video data , the method comprising:inverse quantizing a first coefficient block;applying a first inverse transform to at least part of the inverse quantized first coefficient block to generate a second coefficient block, the first inverse transform being a non-separable transform;applying a second inverse transform to the second coefficient block to generate a residual video block, the second inverse transform converting the second coefficient block from a frequency domain to a pixel domain; andforming a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.2. The method of claim 1 , further comprising:formulating a subset of a set of non-separable transforms that includes three or more non-separable transform candidates; andselecting one candidate from the subset of the set of non-separable transforms as the first inverse transform.3. The method of claim 2 , wherein formulating the subset comprises determining the subset based on decoded information claim 2 , the decoded information comprising one or more of an intra prediction mode claim 2 , a Coding Unit (CU) level Enhanced Multiple Transforms (EMT) index claim 2 , a Transform Unit ( ...

Using luma information for chroma prediction with separate luma-chroma framework in video coding

A method of decoding video data comprises receiving a bitstream of encoded video data, the encoded video data representing partitioned luma blocks and partitioned chroma blocks, wherein the chroma blocks are partitioned independently of the luma blocks, determining a respective coding mode corresponding to the respective partitioned luma blocks, decoding the respective partitioned luma blocks according to the determined respective coding modes, decoding a first syntax element indicating that the respective coding modes associated with the respective partitioned luma blocks are to be used for decoding a first partitioned chroma block, wherein the first partitioned chroma block is aligned with two or more partitioned luma blocks, determining a chroma coding mode for the first partitioned chroma block according to a function of the respective coding modes of the two or more partitioned luma blocks, and decoding the first partitioned chroma block in accordance with the determined chroma coding ...

Coder matched layer separation for compression of compound documents

SELECCIÓN DE TRANSFORMACIÓN MÚLTIPLE EXTENDIDA PARA CODIFICACIÓN DE VIDEO

Un dispositivo para codificar datos de video incluye una memoria configurada para almacenar datos de video; y uno o más procesadores implementados en circuitos y configurados para: codificar una primera palabra de código que representa un esquema de transformación seleccionado de un conjunto de candidatos de transformación de un esquema de selección de transformación múltiple (MTS) para un bloque actual de datos de video, en donde el esquema de transformación seleccionado es una transformación secundaria de un conjunto de transformaciones secundarias disponibles para ser aplicadas además de una transformación primaria; codificar una segunda palabra de código que represente la transformación secundaria del conjunto de transformaciones secundarias disponibles; y aplicar la transformación primaria y la transformación secundaria durante la codificación de datos residuales para el bloque actual. La segunda palabra de código puede ser un valor para un elemento de sintaxis de transformación no ...

Method and apparatus for performing arithmetic coding on basis of concatenated ROM-RAM table

Disclosed herein is a method of performing an arithmetic decoding for data symbols, comprising: creating a decoding table index; obtaining an upper bound value and a lower bound value of a ratio between an interval length and a point within an interval assigned to a symbol from a ROM table; obtaining initial values for a bisection search from a RAM table based on the upper bound value and the lower bound value; and searching a value of sequence in the interval, wherein the interval is determined based on the initial values.

Non-separable secondary transform for video coding

Techniques are described in which a decoder is configured to inverse quantize a first coefficient block and apply a first inverse transform to at least part of the inverse quantized first coefficient block to generate a second coefficient block. The first inverse transform is a non-separable transform. The decoder is further configured to apply a second inverse transform to the second coefficient block to generate a residual video block. The second inverse transform converts the second coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

Determining a geometric position of a display screen within an array of coupled display screens

In a method for determining a position of at least one display screen within an array of coupled display screens an emitted signal from an adjacent display screen is detected. The detecting is performed by a sensor coupled with a side of a plurality of sides of a display screen. A positional code number is determined based on the detecting. The positional code number includes a bit number corresponding to a detection of the signal emitted from the adjacent display screen.

Intra reference filter for video coding

A method of decoding video data that includes receiving a current block of video data encoded using an intra prediction mode, determining residual video data for the current block of video data, determining reference samples of the current block of video data, determining filter coefficients for a bilateral filter based on a distance between the reference samples and neighboring reference samples and based on a sample value difference between the reference samples and the neighboring reference samples, applying the bilateral filter with the determined filter coefficients to the determined reference samples to produce filtered reference samples, generating a prediction block using the filtered reference samples, and adding samples of the prediction block to the determined residual video data to produce a decoded block of video data.

PARTICIÓN DE UNIDAD DE TRANSFORMADA (TU) BASADA EN ÁRBOL PARA CODIFICAR VIDEO

Un decodificador de video puede recibir, en un flujo de bits que comprende una representación codificada de datos de video, información indicativa si un bloque residual está particionado e información que indica una partición tipo árbol para el bloque residual en base al bloque residual estando particionado, en donde el bloque residual es indicativo de una diferencia entre el bloque actual y un bloque de predicción. El decodificador de video puede determinar, en base a la información recibida que el bloque residual está particionado y la partición tipo árbol para el bloque residual, una pluralidad de subbloques residuales en el cual el bloque residual está particionado de acuerdo con la partición tipo árbol. El decodificador de video puede producir los datos residuales para el bloque actual en base al menos en parte en el bloque residual estando particionado de acuerdo con la partición tipo árbol en una pluralidad de subbloques residuales y puede decodificar el bloque actual usando los ...

Code matched layer separation for compression of compound documents

ADAPTIVE MONOSCOPIC AND STEREOSCOPIC DISPLAY USING AN INTEGRATED 3D SHEET

An adaptive monoscopic and stereoscopic display system is disclosed. The display system includes a display, a D sheet mounted to the display, and a processor to adapt the display according to whether the D sheet is mounted to the display. The display includes at least one lock to hold the D sheet in place and at least one sensor to facilitate alignment of the D sheet and calibration of the display. 1. An adaptive monoscopic and stereoscopic display system , comprising:a display integrated with at least one lock and at least one sensor;a 3D sheet integrated to the display using the at least one lock; anda processor to adapt the display according to whether the 3D sheet is integrated to the display.2. The adaptive monoscopic and stereoscopic display system of claim 1 , wherein the at least one lock is attached to the display to hold the 3D sheet in place and prevent it from moving.3. The adaptive monoscopic and stereoscopic display system of claim 1 , wherein the at least one lock comprises a slider lock.4. The adaptive monoscopic and stereoscopic display system of claim 1 , wherein the at least one sensor detects when the 3D sheet is mounted to the display.5. The adaptive monoscopic and stereoscopic display system of claim 4 , wherein the at least one sensor estimates a position of the 3D sheet relative to pixels in the display.6. The adaptive monoscopic and stereoscopic display system of claim 1 , further comprising at least one directional sensor in a keyboard connected to the display.7. The adaptive monoscopic and stereoscopic display system of claim 1 , wherein the display comprises a camera.8. The adaptive monoscopic and stereoscopic display system of claim 1 , wherein the processor comprises an alignment module to align the 3D sheet with pixels in the display.9. The adaptive monoscopic and stereoscopic display system of claim 1 , wherein the processor comprises an eye-tracking module to detect and track a position of a viewer's eyes.10. The adaptive monoscopic ...

APPARATUS FOR IDENTIFYING PREDOMINANT COLOR IN DIGITAL IMAGE

PROBLEM TO BE SOLVED: To improve compression efficiency of a digital image by identifying a predominant color in the digital image. SOLUTION: An apparatus for identifying at least a predominant color in a digital image is provided. In each pixel of a first sampling in the image, if the color vector of the pixel is in a color occurrence list, the corresponding counter is incremented. If the color vector of the pixel is not in the list, the color vector is added to the list, and the corresponding counter is initiated. In each pixel of at least an added sampling in the image, if the color vector of the pixel is in the list, the corresponding counter is incremented. At each end of the added sampling, all entries with counter qthreshold value Un, the list is completed, and all of the color vectors in the list are identified as the predominant colors. COPYRIGHT: (C)2008,JPO&INPIT ...

Coder matched layer separation for compression of compound documents

Methods for decomposing compound documents for mixed raster content representation are provided. A method for decomposing an image includes the step of decomposing the image into a plurality of stripes (220). Each stripe (310) is decomposed (450) into foreground (120), background (130), and mask (140) layers. The layers are interpolated (460) to modify values of irrelevant pixels in order to achieve more efficient compression. The layers may subsequently be compressed with a coder.

IMPLICIT TRANSFORM SELECTION IN VIDEO CODING

Arithmetic coding with selective adaptation for video coding

Techniques are described of hybrid coders that are configured to selectively use adaptive or non-adaptive coding techniques. A video coder (e.g., video encoder or video decoder) may code (e.g., encode or decode) first video data (e.g., a syntax element or value), for coding a first block, based on an adaptive context model (e.g., one or more adaptive context models) and code second video data, for coding a second block, based on a non-adaptive context model (e.g., one or more non-adaptive context models).

Plenoptic display with automated alignment

One embodiment pertains to an apparatus for displaying three-dimensional views of an image where the image seen depends on a viewing angle. The apparatus includes at least a plurality of tiles, a plenoptic function projection, and alignment mechanisms. Each tile includes an array of lenses on a front side of a transparent base, and the plenoptic function projection is configured on a back side of the transparent base. The alignment mechanisms are configured to independently align each tile to the plenoptic function projection so that the three-dimensional views of the image are properly displayed. Other embodiments, aspects and features are also disclosed.

Memory reduction for non-separable transforms

Techniques are described in which a decoder is configured to receive an input data block and apply an inverse non-separable transform to at least part of the input data block to generate an inverse non-separable transform output coefficient block. The applying the inverse non-separable transform comprises assigning a window, assigning a weight for each position inside the assigned window, and determining the inverse non-separable transform output coefficient block based on the assigned weights. The decoder is further configured to forming a decoded video block based on the determined inverse non-separable transform output coefficient block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

Method and apparatus for performing graph-based prediction using optimization function

Performing a graph-based prediction using a graph signal can be performed using a method that includes obtaining a context signal; generating a graph signal based on a graph parameter set; obtaining a graph-based transform matrix based on the graph signal, wherein the graph-based transform matrix includes an eigenvector; obtaining a prediction vector using an optimal transform vector calculated through an optimization function; and generating a prediction signal using the prediction vector, where the optimization function has the context signal, an eigenvalue of a graph Laplacian matrix and the eigenvector as a variable. Accordingly, a prediction value may be obtained with reduced complexity and the prediction performance may be improved.

COMMUNICATIONS METHODS, COMMUNICATIONS SESSION ORGANIZER, COMMUNICATION SESSION PARTICIPATING DEVICE, PRODUCT, AND COMMUNICATION SYSTEM

PROBLEM TO BE SOLVED: To provide an improved system and methods in which interactive contents or multimedia collaboration can be experienced. SOLUTION: Communication methods, communications session organizers, communication session participating devices, products and communication systems are described. According to one aspect, a communication method includes providing scalable media data, organizing the scalable media data into a plurality of subparts (47), requesting a plurality of data requests from a plurality of participating devices (14), requesting different ones of the subparts (47) during user interaction with the media data, and after the providing the data requests, scaling respective ones of the requested subparts (47) of the scalable media data according to receiving attributes of the respective participating devices (14), and communicating the scaled subparts to respective ones of the participating devices (14). COPYRIGHT: (C)2005,JPO&NCIPI ...

Learned low-complexity adaptive quantization for video compression

A video encoder may determine a set of quantization offset parameters for a group of scaled transform coefficients for a block of video data based on side information associated with the block of video data. The video encoder may further quantize the group of scaled transform coefficients for the block of video data to generate quantized transform coefficients for the block of video data based at least in part on the set of quantization offset parameters. The video encoder may further generate an encoded video bitstream based at least in part on the quantized transform coefficients for the block of video data.

Coder matched layer separation for compression of compound documents

Methods for decomposing compound documents for mixed raster content representation are provided. A method for decomposing an image includes the step of decomposing the image into a plurality of stripes. Each stripe is decomposed into foreground, background, and mask layers. The layers are interpolated to modify values of irrelevant pixels in order to achieve more efficient compression. The layers may subsequently be compressed with a coder.

SYSTEMS AND METHODS FOR PERFORMING SOUND SOURCE LOCALIZATION

Systems and methods for performing sound source localization are provided. In one aspect, a method for locating a sound source using a computing device subdivides a space into subregions. The method then computes a sound source power for each of subregions and determines which of the sound source energies is the largest. When the volume of the subregion is less than a threshold volume, the method outputs the subregion having the largest sound source power. Otherwise, the stages of partitioning, computing, and determining the subregion having the largest sound source power is repeated. 1. A method for locating a sound source using a computing device , the method comprising:subdividing a space into subregions;computing a sound source power for each subregion;determining a largest of the sound source power of the sound source energies; andoutputting the subregion having the largest sound source power when the volume of the subregion is less than a threshold volume, otherwise repeat subdividing, computing, and determining for the subregion having the largest sound source power.2. The method of claim 1 , wherein determining a largest of the sound source power of the sound source energies further comprises:populating a list of subregions and associated sound source powers; andselecting a subregion and associated sound source power from the list with the largest sound source power.3. The method of claim 1 , wherein determining a largest of the sound source power of the sound source energies further comprises:populating a list of subregions and associated sound source powers; andselecting a subregion and associated sound source power from the list with the largest power divided by the subregion volume.5. The method of claim 1 , further comprising pre-computing a time delay for each subregions of the space prior to locating a sound source.6. The method of claim 1 , outputting the subregion having the largest sound source power when the volume of the subregion is less than a ...

SURFACE MICROSTRUCTURES FOR LIGHT SHAPING REFLECTORS

A method for designing microstructures for a light shaping reflector for use in a light field display is provided. A mathematical function is derived to reflect light uniformly from an incident light beam. Curved elements shaped by the mathematical function are combined to design the microstructures. The microstructures are formed in a reflective surface to provide the light shaping reflector for use in the light field display. 1. A method for designing microstructures for a light shaping reflector for use in a light field display , the method comprising:deriving a mathematical function to reflect light uniformly from an incident light beam;combining curved elements shaped by the mathematical function to design the microstructures; andforming the microstructures in a reflective surface to provide the light shaping reflector for use in the light field display.2. The method of claim 1 , wherein the incident light beam is locally uniform close to the microstructures.3. The method of claim 1 , wherein the mathematical function is derived from a scaled function.5. The method of claim 1 , wherein the curved elements comprise convex curved elements shaped by the mathematical function.6. The method of claim 1 , wherein the curved elements comprise concave curved elements shaped by the mathematical function.7. The method of claim 1 , wherein the curved elements comprise a combination of convex and concave curved elements shaped by the mathematical function.8. The method of claim 1 , wherein the curved elements have different sizes.9. The method of claim 1 , wherein the microstructures are etched in the reflective surface.10. The method of claim 1 , wherein the microstructures are stamped in the reflective surface.11. A light shaping reflector for use in a light field display claim 1 , the light shaping reflector comprising:a reflective surface; anda plurality of microstructures formed in the reflective surface, the microstructures defined by a mathematical function to ...

Imaging three-dimensional objects

Imaging systems and methods are described. In one aspect, an imaging system includes a light source that is operable to generate a beam of light directed along a beam path and an optical element that is operable to rotate about a rotational axis. The optical element has two or more optical faces that are positionable to intersect the beam path over respective non-overlapping ranges of rotational positions of the optical element. At least two different optical faces are operable to scan the beam of light in different respective scan planes during rotation of the optical element. In an imaging method, a beam of light directed along a beam path is generated. The beam path is consecutively intersected with at least two different optical faces to scan the light beam in different respective scan planes.

Low-complexity sign prediction for video coding

A device includes processing circuitry configured to identify a set of pre-stored residual samples in video data that is stored to a memory, to combine the set of stored residual samples to form a combination, to apply a first sign combination to transform coefficients of the combination to obtain a first hypothesis reconstruction for a current block of the video data, and to apply a second sign combination to the transform coefficients of the combination to obtain a second hypothesis reconstruction for the current block. The processing circuitry is further configured to derive respective cost functions with respect to the first and second hypothesis reconstructions, to compare the respective derived cost functions, to select, based on the comparison, either the first or second hypothesis reconstruction, and to code the current block using a sign prediction associated with the selected one of the first or second hypothesis reconstruction.

Binarizing secondary transform index

An example device for decoding video data includes a memory configured to store video data and one or more processors implemented in circuitry and configured to determine a maximum possible value for a secondary transform syntax element for a block of video data, entropy decode a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block, reverse binarize the value for the secondary transform syntax element using a common binarization scheme regardless of the maximum possible value to determine the secondary transform for the block, and inverse-transform transform coefficients of the block using the determined secondary transform.

PROBABILITY INITIALIZATION FOR VIDEO CODING

An example method for entropy decoding of video data includes retrieving a pre-defined initialization value for a context of a plurality of contexts used in a context-adaptive entropy coding process to entropy code a value for a syntax element for an independently codable unit of video data; determining, based on the pre-defined initialization value and in a linear domain, an initial probability state of the context; and entropy decoding, from a bitstream and based on the initial probability state of the context, a bin of the value for the syntax element.

Photovoltaic access capacity measuring and calculating model containing energy storage power distribution network and maximum photovoltaic access capacity measuring and calculating method

The invention relates to a photovoltaic access capacity measuring and calculating model containing an energy storage power distribution network and a maximum photovoltaic access capacity measuring and calculating method, which take a public power distribution network as an object, take photovoltaic maximum access capacity after energy storage configuration as a target, take node voltage and branch power not out of limit as a constraint, and consider reasonable light abandoning in an annual time scale. And a photovoltaic maximum access capacity model containing the energy storage power distribution network is constructed. And according to model characteristics, linearization is carried out on the model, a calculation scale reduction strategy is designed, and rapid solving of the model is finally realized. By using the method, the maximum photovoltaic access capacity of the energy-storage-containing power distribution network can be measured and calculated under the condition of considering ...

POSITION DEPENDENT INTRA PREDICTION COMBINATION EXTENDED WITH ANGULAR MODES

TREE-BASED TRANSFORM UNIT (TU) PARTITION FOR VIDEO CODING

SINGLE-PASS GUARANTEED-FIT DATA COMPRESSION METHOD USING RATE FEEDBACK

PROBLEM TO BE SOLVED: To provide high-speed and high-quality single-pass guaranteed-fit compression of continuous-tone compound documents. SOLUTION: This invention provides a compression method M1 and a compression system AP1 including the steps of regulating compression of serialized input data as a function of an in-progress measure of the compression. COPYRIGHT: (C)2003,JPO ...

System and method of presenting 3D images for a display

Disclosed is a three dimensional (3D) continuous display system based on a plurality of projexels. Each projexel may include of a plurality of light emitting devices. Each light emitting device may project a directional beam of light that spans an angular range. The sum of the angular ranges of each beam of light total an angular range for the projexel. Each projexel is also associated with a set of transition angles. The transition angles may be defined by the angle where two beams coincide. The projexels are configured such that sets of transition angles between adjacent projexels are offset.

Coding adaptive multiple transform information for video coding

An example device for decoding video data includes a memory configured to store video data; and a processor implemented in circuitry and configured to decode a truncated unary codeword representing a multiple transform (MT) scheme for a current block of the video data to determine the MT scheme; apply the MT scheme to transform coefficients of the current block to produce residual data for the current block of video data; and decode the current block using the residual data. The MT scheme may include a plurality of transforms, such as a horizontal transform and a vertical transform, a primary transform and a second transform, or any combination of separable and/or non-separable transforms. Thus, a single truncated unary codeword may represent the entire MT scheme, that is, each of a plurality of transforms of the MT scheme.

Position-dependent prediction combinations in video coding

A video coder may generate a predictor block using an intra prediction mode. As part of generating the predictor block, the video coder may, for each respective sample in a set of samples in the predictor block, determine, based on an initial value of the first weight and a distance between the respective sample and a first boundary of the predictor block, a value of the first weight for the respective sample. Additionally, the video coder may determine, based on the initial value of the second weight and a distance between the respective sample and a second boundary of the predictor block, a value of the second weight for the respective sample. The video coder may also determine a primary value for the respective sample. The video coder may then determine a secondary value for the respective sample based on the first weight, second weight, and the primary value.

Predominant color identification in digital images

At least one predominant color in a digital image is identified by applying a detection rule to randomly-selected pixels in the image. The detection rule includes testing specific colors to reduce the probability of at least one of a false-positive outcome and a false-negative outcome.

Communications methods, collaboration session communications organizers, collaboration sessions, and articles of manufacture

Communications methods, collaboration session communications organizers, collaboration sessions, and articles of manufacture are described. According to one aspect, a communications method includes accessing scalable media data for communication to a plurality of participants, wherein the scalable media data is configured to convey information regarding a subject, accessing a plurality of respective configuration parameters corresponding to respective ones of the participants, first modifying the scalable media data using a configuration parameter for a first recipient of the participants, the first modifying providing a first data stream having a first quantity of data to convey information for the subject, second modifying the scalable media data using a configuration parameter for a second recipient of the participants, the second modifying providing a second data stream having a second quantity of data to convey information for the subject and different than the first quantity of data ...

Data compression

In a process for data compression, data to be encoded is received. The received data is based on an alphabet including one or more symbols and coded bits are assigned to each symbol of the received data. In addition, the coded bits are based on a probability estimation using a variable probability estimation factor.

Low-complexity sign prediction for video coding

Techniques for cost function measurement with respect to sign prediction-based video coding are generally described. An example device includes processing circuitry is configured to apply first and second sign combinations to transform coefficients of a stored block of video data to obtain first and second hypothesis reconstructions of the block, to measure first and second cost functions with respect to the first and second hypothesis reconstructions by determining respective sets of pixel value gradients representing differences between samples of each hypothesis reconstruction of the block and samples of a neighboring block positioned adjacent to the block. The processing circuitry is further configured to compare the respective cost functions, to select, based on the comparison, one of the hypothesis reconstructions of the block, and to code the block using the respective sign combination associated with the selected hypothesis reconstruction.

MULTIPLE TRANSFORMS ADJUSTMENT STAGES FOR VIDEO CODING

A device may perform a first prediction process for a first block of video data to produce a first residual. The device may apply a first transform process to the first residual to generate first transform coefficients for the first block of video data and encode the first transform coefficients. The device may perform a second prediction process for a second block of video data to produce a second residual. The device may determine that a second transform process, which includes the first transform process and at least one of a pre-adjustment operation or a post-adjustment operation, is to be applied to the second residual. The device may apply the first transform process and the pre- or post-adjustment operation to the second residual to generate second transform coefficients for the second block. The coding device may code the first and second transform coefficients. 1. A method of encoding video data comprising:performing a first prediction process for a first block of video data to produce a first residual;determining that a first transform process of a plurality of transform processes is to be applied to the first residual;applying the first transform process to the first residual to generate first transform coefficients for the first block of video data;encoding the first transform coefficients;performing a second prediction process for a second block of video data to produce a second residual;determining that a second transform process is to be applied to the second residual, wherein the second transform process comprises the first transform process and at least one of a first pre-adjustment operation or a first post-adjustment operation to apply to the second residual in addition to the first transform process;applying the first transform process and at least one of the first pre-adjustment operation or the first post-adjustment operation to the second residual to generate second transform coefficients for the second block of video data, wherein the first ...

N-dimensional data compression using set partitioning in hierarchical trees

A data structure in a computer memory for use in encoding and decoding an N-dimensional subband decomposition of data points includes, after initialization, three lists: a list of insignificant sets of points (LIS); a list of significant points (LSP); and a list of insignificant points (LIP). The LIS is populated with sets, each of the sets being designated by a root node within the N-dimensional subband decomposition and having a corresponding tree structure of points within the N-dimensional subband decomposition, which tree structure of points is organized as descendants and offspring of the root node but not including the root node, the LIP is populated with points from within the highest designated subband of the N-dimensional subband decomposition, while the LSP is initially empty. The data structure permits encoding and decoding of any N-dimensional data set, i.e., any data set where N is a positive integer. Method and software for employing this data structure are also described ...

EMBEDDED LIGHT FIELD DISPLAY ARCHITECTURE TO PROCESS AND DISPLAY THREE-DIMENSIONAL LIGHT FIELD DATA

An embedded light field display architecture to process and display three-dimensional light field data in a light field display is provided. The light field display architecture includes a plurality of hierarchical modules to decode compressed light field data associated with a light field and a plurality of tile modules embedded directly in the light field display to process light field data for display. A plurality of networking modules is also provided to transmit light field data among the hierarchical modules and the tile modules. 1. A light field display architecture for displaying a light field in a light field display , the light field display architecture comprising:a plurality of hierarchical modules to decode compressed light d data associated with a light field;a plurality of tile modules embedded in the light field display to process light field data for display at the light field display; anda plurality of networking modules to communicate light field data within the light field display architecture.2. The light field display architecture of claim 1 , wherein a hierarchical module from the plurality of hierarchical modules comprises a hierarchical decoder to decode the compressed light field data.3. The light field display architecture of claim 1 , wherein a tile module from the plurality of tile modules comprises a the decoder to decode light field data transmitted from at least one hierarchical module from the plurality of hierarchical modules.4. The light field display architecture of claim 1 , wherein a tile module from the plurality of tile modules comprises a tile decoder to decode light field data transmitted from at least one other tile module from the plurality of tile modules.5. The light field display architecture of claim 1 , wherein the plurality of networking modules communicate light field data between at least one hierarchical module from the plurality of hierarchical modules and at least one tile module from the plurality of tile ...

CONDITIONAL REPLENISHMENT FOR THREE-DIMENSIONAL IMAGES WITH BLOCK-BASED SPATIAL THRESHOLDING

A decoding architecture for decoding a multi-dimensional image for display in a light field display is provided. The multi-dimensional image is compressed in a plurality of blocks, with each block storing compressed light field data and a displacement range. A spatial thresholding module compares the displacement range in each block of the image to a difference between a current decoding position and a previous decoding position. A decoder module decodes a block according to a result oldie comparison. 1. A decoding architecture for decoding a multi-dimensional image for display in a light field display , the multi-dimensional image compressed in a plurality of blocks , each block storing compressed light field data and a displacement range , the decoding architecture comprising:a spatial thresholding module to compare the displacement range in each block of the image to a difference between a current decoding position and a previous decoding position; anda decoder module to decode a block if the difference is larger than the displacement range.2. The decoding architecture of claim 1 , wherein the displacement range comprises a spatial threshold (Δx claim 1 , Δy claim 1 , Δz) for each block.3. The decoding architecture of claim 1 , wherein the displacement range is encoded together with each block.4. The decoding architecture of claim 1 , wherein the difference comprises a difference in projexel values for spatial (x claim 1 , y claim 1 , z) coordinates in each block.5. The decoding architecture of claim 1 , wherein the decoder module replenishes a block in the image with decoded data if the difference is larger than the displacement range.6. The decoding architecture of claim 1 , wherein the decoder module maintains a block in the image with compressed data if the difference is smaller than the displacement range.7. The decoding architecture of claim 1 , wherein the displacement range is based on a content of a scene being imaged.8. The decoding architecture of ...

ALIGNING STEREOSCOPIC IMAGES

Systems, methods, and computer-readable and executable instructions are provided for aligning stereoscopic images. Aligning stereoscopic images can include applying, by a computer, a feature detection technique to a pair of stereoscopic images to detect a number of features in each stereoscopic image. Aligning stereoscopic images can also include creating, by the computer, a feature coordinate list for each stereoscopic image based on the feature detection and comparing, by the computer, the feature coordinate lists. Furthermore, aligning stereoscopic images can include aligning the stereoscopic images, by the computer, based on the comparison. 1. A computer-implemented method for aligning stereoscopic images comprising:applying, by the computer, a feature detection technique to a pair of stereoscopic images to detect a number of features in each stereoscopic image;creating, by the computer, a feature coordinate list for each stereoscopic image based on the feature detection;comparing, by the computer, the feature coordinate lists; andaligning the stereoscopic images, by the computer, based on the comparison.2. The method of claim 1 , wherein the method comprises fixing a first stereoscopic image of the pair and aligning a second stereoscopic image of the pair to the first stereoscopic image.3. The method of claim 1 , wherein the feature coordinate lists comprise feature orientations for each feature in each stereoscopic image and vertical and horizontal coordinates for each feature in each stereoscopic image.4. The method of claim 1 , further comprising generating a histogram of vertical coordinates for each of the number of stereoscopic images.5. The method of claim 1 , further comprising aligning the stereoscopic images through horizontal movement only.6. The method of claim 1 , wherein the method is performed on a mobile device.7. A computer-readable non-transitory medium storing a set of instructions for aligning stereoscopic images executable by the computer ...

SYSTEMS AND METHODS FOR EYE TRACKING USING RETROREFLECTOR-ENCODED INFORMATION

Embodiments of the present invention are directed to eye tracking systems and methods that can be used in uncontrolled environments and under a variety of lighting conditions. In one aspect, an eye tracking system () includes a light source () configured to emit infrared (“IR”) light, and an optical sensor () disposed adjacent to the light source and configured to detect IR light. The system also includes one or more retroreflectors () disposed on headgear. The one or more retroreflectors are configured to reflect the IR light back toward the light source. The reflected IR light is captured as IR images by the optical sensor. The IR images provide information regarding the location and head orientation of a person wearing the headgear. 1200. An eye tracking system () comprising:{'b': '204', 'a light source () configured to emit infrared (“IR”) light;'}{'b': '206', 'an optical sensor () disposed adjacent to the light source and configured to detect IR light; and'}{'b': '210', 'one or more retroreflectors () disposed on headgear, wherein the one or more retroreflectors are configured to reflect the IR light back toward the light source, and wherein the reflected IR light is captured as IR images by the optical sensor, the IR images provide information regarding the location and head orientation of a person wearing the headgear.'}2402502610. The system of claim 1 , wherein the one or more retroreflectors disposed on the headgear further comprises the retroreflectors arranged to produce an identifiable reflection pattern in the IR images ( claim 1 , claim 1 ,).3706905908. The system of claim 1 , wherein each of the one or more retroreflectors disposed on the headgear further comprises the retroreflectors configured to produce identifiable shapes in the IR images ( claim 1 , claim 1 ,).4. The system of claim 1 , wherein each of the one or more retroreflectors disposed on the headgear further comprises the retroreflectors configured to produce identifiable shapes in the ...

Systems and methods for acquiring and processing image data produced by camera arrays

This disclosure is directed to camera systems including a camera array, data buses shared by the cameras, and one or more processors that process images captured by the camera array. In one aspect, a camera system () includes a camera array (), a controller (), a number of camera buses (-), and a computing device () connected to the controller. Each camera is connected to one or more adjacent cameras and includes one or more processors. Each camera bus connects a subset of cameras of the camera array to the controller. And each camera can be operated to send to the controller only the image data used by the computing device to generate virtual images and receive instructions from the controller over a camera bus. 1400. A camera system () comprising:{'b': '402', 'a camera array ();'}{'b': '404', 'a camera processor/controller ();'}{'b': 409', '415, 'a number of camera buses (-), each camera bus connects a subset of cameras of the camera array to the camera processor/controller; and'}{'b': '406', 'a computing device () connected to the camera processor/controller, wherein each camera can be operated to send to the camera processor/controller only image data used by the computing device to generate virtual images and each camera receives instructions from the camera processor/controller over a camera bus.'}2. The system of claim 1 , wherein the camera processor/controller sends the image data received from the cameras to the computing device.3. The system of claim 1 , wherein the camera processor/controller sends instructions to each camera of the camera array over a camera bus connected to the camera.4. The system of claim 1 , wherein the camera processor/controller receives image data from each camera of the can array over a camera bus connected to the camera.5. The system of claim 1 , wherein the camera processor/controller controls the operation of each camera of the camera array by sending instructions to each camera of the camera array over a camera bus.6450. A ...

MEMORY REDUCTION FOR NON-SEPARABLE TRANSFORMS

Techniques are described in which a decoder is configured to receive an input data block and apply an inverse non-separable transform to at least part of the input data block to generate an inverse non-separable transform output coefficient block. The applying the inverse non-separable transform comprises assigning a window, assigning a weight for each position inside the assigned window, and determining the inverse non-separable transform output coefficient block based on the assigned weights. The decoder is further configured to forming a decoded video block based on the determined inverse non-separable transform output coefficient block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks. 1. A method of encoding video data , the method comprising:forming a residual video block, wherein forming the residual video block comprises subtracting at least one predictive block from a video block being coded; assigning a window,', 'assigning a weight for each position inside the assigned window, and', 'determining the non-separable transform output coefficient block based on the assigned weights; and, 'applying a non-separable transform to at least part of an input data block to generate a non-separable transform output coefficient block, wherein applying the non-separable transform comprisesgenerating the encoded video data based on the determined non-separable transform output coefficient block.2. The method of claim 1 , wherein the input data block comprises the residual video block.3. The method of claim 1 , wherein the non-separable transform comprises a first transform or second transform.4. The method of claim 1 , wherein the generating the encoded video data comprises quantizing the non-separable transform output coefficient block.5. The method of claim 1 , wherein determining the non-separable transform output coefficient block based on the assigned weights comprises calculating a weighted sum of ...

Transform variations of multiple separable transform selection

This disclosure describes examples of extending the number of available discrete cosine transform (DCT) and discrete sine transform (DST) for encoding and decoding. A video coder may determine one or more transforms or inverse transforms to apply from a set of transforms or inverse transforms that includes DCT-2 or inverse DCT-2, DST-7 or inverse DST-7, DST-8 or inverse DST-8, DCT-3 or inverse DCT-3, DST-2 or inverse DST-2, DST-3 or inverse DST-3, DCT-4 or inverse DCT-4, DST-4 or inverse DST-4, DST-5 or inverse DST-5, DST-6 or inverse DST-6, and identity transform an inverse identity transform (IDT).

SYSTEM AND METHOD OF PRESENTING 3D IMAGES FOR A DISPLAY

Disclosed is a three dimensional (3D) continuous display system based on a plurality of projexels. Each projexel may include of a plurality of light emitting devices. Each light emitting device may project a directional beam of light that spans an angular range. The sum of the angular ranges of each beam of light total an angular range for the projexel. Each projexel is also associated with a set of transition angles. The transition angles may be defined by the angle where two beams coincide. The projexels are configured such that sets of transition angles between adjacent projexels are offset. 1. A method of projecting a three dimensional (3D) image comprising:creating a plurality of projexels comprising multiple beams of light, each projexel spanning an angular range, the angular range equivalent for each projexel;directionally projecting the multiple beams of light from each projexel, each beam spanning an angular range, the sum of the beam angular ranges totaling the angular range for the projexel, each projexel having a set of transition angles, the transition angles defined by the angle where two beams coincide; andoffsetting the sets of transition angles between adjacent projexels.2. The method of claim 1 , the creating a plurality of projexels comprising covering a conventional display comprised of a matrix of pixels with a matrix of lenses to create the projexels and the projexel beams claim 1 , each lens of the matrix of lenses associated with a plurality pixels of the matrix of pixels.3. The method of claim 2 , comprising offsetting the matrix of lenses in the x and y direction with respect to the matrix of pixels.4. The method of claim 3 , wherein the lenses within the matrix of lenses are rectangular.5. The method of claim 3 , wherein the lenses within the matrix of lenses are hexagonal.6. The method of claim 1 , the plurality of projexels comprising multiple light emitting devices that each emit a beam of light.7. The method of claim 6 , the light ...

TRANSFORM UNIT DESIGN FOR VIDEO CODING

An example device for decoding video data includes a memory configured to store the video data and one or more processors coupled to the memory. The one or more processors are configured to reorganize 2-D dequantized coefficients according to a first ordering. The one or more processors are configured to apply an inverse low-frequency non-separable transform (LFNST) to the reorganized 2-D dequantized coefficients to create inverse transformed coefficients. The one or more processors are configured to reorganize the inverse transformed coefficients according to a second ordering, the second ordering being based on an array including values, wherein each value in the array corresponds to a position in a 2-D block and the values in the array denote indices of the 2-D block in a defined order. The one or more processors are configured to decode the video data based on the second ordered inverse transformed coefficients. 1. A method of decoding video data , the method comprising:reorganizing, by one or more processors, 2-D dequantized coefficients according to a first ordering;applying, by the one or more processors, an inverse low-frequency non-separable transform (LFNST) to the reorganized 2-D dequantized coefficients to create inverse transformed coefficients, the inverse LFNST comprising an M×N matrix, wherein M denotes a number of basis vectors and denotes a number of rows and N denotes a number of reconstructed LFNST coefficients after applying the inverse LFNST;reorganizing, by the one or more processors, the inverse transformed coefficients according to a second ordering, the second ordering being based on an array comprising values, wherein each value in the array corresponds to a position in a 2-D block and the values in the array denote indices of the 2-D block in a defined order; anddecoding, by the one or more processors, the video data based on the second ordered inverse transformed coefficients.2. The method of claim 1 , wherein the first ordering is a ...

Video intra-prediction using position-dependent prediction combination for video coding

Techniques are described to improved video intra prediction using position-dependent prediction combination in video coding. In High Efficiency Video Encoding a set of 35 linear predictors are used for doing intra coding and prediction can be computed from either a nonfiltered or a filtered set of neighboring “reference” pixels, depending on the selected predictor mode and block size. Techniques of this disclosure may use a weighted combination of both the nonfiltered and filtered set of reference pixels to achieve better compression via improved prediction and therefore small residual, enable effective parallel computation of all sets of prediction values, and maintain low complexity via applying filtering only to a set of reference pixels and not to predicted values themselves.

NON-SEPARABLE SECONDARY TRANSFORM FOR VIDEO CODING WITH REORGANIZING

Techniques are described in which a decoder is configured to reorganize a first 2-dimensional coefficient block as a first 1-dimensional coefficient vector according to a coefficient scanning order and apply a first inverse transform to the first 1-dimensional coefficient vector to generate a second 1-dimensional coefficient vector. The first inverse transform is a non-separable transform. The decoder is further configured to reorganize the first 1-dimensional coefficient vector as a second 2-dimensional coefficient block and apply a second inverse transform to the second 2-dimensional coefficient block to generate a residual video block. The second inverse transform converts the second 2-dimensional coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks. 1. A method for decoding video data , the method comprising:reorganizing a first 2-dimensional coefficient block as a first 1-dimensional coefficient vector according to a coefficient scanning order;applying a first inverse transform to the first 1-dimensional coefficient vector to generate a second 1-dimensional coefficient vector, the first inverse transform being a non-separable transform;reorganizing the first 1-dimensional coefficient vector as a second 2-dimensional coefficient block;applying a second inverse transform to the second 2-dimensional coefficient block to generate a residual video block, the second inverse transform converting the second 2-dimensional coefficient block from a frequency domain to a pixel domain; andforming a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.2. The method of claim 1 , wherein:the first 2-dimensional coefficient block is a 4×4 coefficient group,the method further comprises determining the ...

NON-SEPARABLE SECONDARY TRANSFORM FOR VIDEO CODING

Techniques are described in which a decoder is configured to inverse quantize a first coefficient block and apply a first inverse transform to at least part of the inverse quantized first coefficient block to generate a second coefficient block. The first inverse transform is a non-separable transform. The decoder is further configured to apply a second inverse transform to the second coefficient block to generate a residual video block. The second inverse transform converts the second coefficient block from a frequency domain to a pixel domain. The decoder is further configured to form a decoded video block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks. 120-. (canceled)21: A method for decoding video data , the method comprising:inverse quantizing a first coefficient block for a transform unit of a first video block of the video data to generate an inverse quantized first coefficient block for the transform unit of the first video block;applying a first inverse transform to at least part of the inverse quantized first coefficient block for the transform unit of the first video block to generate a second coefficient block for the transform unit of the first video block, the first inverse transform being a non-separable transform signaled by a Non-Separable Secondary Transform (NSST) index for the transform unit of the first video block;generating a residual video block for the first video block, wherein generating the residual video block for the first video block comprises applying a second inverse transform to the second coefficient block for the transform unit of the first video block, the second inverse transform converting the second coefficient block for the first video block from a frequency domain to a pixel domain;forming a decoded video block for the first video block, wherein forming the decoded video block for the first video block comprises summing the residual video block for the ...

PRIMARY TRANSFORM AND SECONDARY TRANSFORM IN VIDEO CODING

In general, the disclosure describes a video coding device (e.g., a video encoder or a video decoder) configured to perform various transformations on video data. The video coding device applies a primary transform to a block of the video data, the primary transform having a first size, and the sub-block being at least a portion of the block. The video coding device determines whether application of a secondary transform, having a second size, to a sub-block of the block is allowed. Application of the secondary transform is disallowed when the first size is equal to the second size. Based on the application of the secondary transform being allowed, the video coding device applies the secondary transform to the sub-block. Application of the primary transform and the secondary transform construct a residual block in a pixel domain. 1. A method for coding video data , the method comprising:applying a primary transform to a block of the video data, the primary transform having a first size;determining whether application of a secondary transform to a sub-block of the block is allowed, wherein the sub-block comprises at least a portion of the block, wherein the secondary transform has a second size, and application of the secondary transform to the sub-block is disallowed when the first size is equal to the second size;based on the application of the secondary transform to the sub-block being allowed, applying the secondary transform to the sub-block, wherein application of the primary transform to the block and the secondary transform to the sub-block construct a residual block in a pixel domain; andreconstructing the block based on the residual block and one or more corresponding predictive blocks.2. The method of claim 1 , wherein the sub-block comprises a top-left portion of the block.3. The method of claim 1 , wherein the block is a first block claim 1 , and wherein the method further comprises:applying a second primary transform to a second block of the video data, ...

ADAPTIVE MULTIPLE TRANSFORM CODING

Techniques are described for improving transform coding. For example, an encoded block of video data can be obtained, and a width and/or a height of the block can be determined. The width can be compared to a first threshold and/or the height can be compared to a second threshold. A horizontal transform and a vertical transform can be determined for the block based on comparing the width of the block to the first threshold and/or the height of the block to the second threshold. The horizontal transform and the vertical transform are determined without decoding a syntax element that indicates the horizontal transform and the vertical transform (e.g., the syntax element is not in an encoded video bitstream processed by a decoding device). In some cases, residual data is determined using the horizontal and vertical transforms, and a video block is determined using the residual data and a predictive block. 1. A method of decoding video data , the method comprising:obtaining an encoded block of the video data;determining at least one of a width of the block and a height of the block;comparing at least one of the width of the block to a first threshold and the height of the block to a second threshold;determining a horizontal transform and a vertical transform to use for the block based on comparing at least one of the width of the block to the first threshold and the height of the block to the second threshold, the horizontal transform and the vertical transform being determined without decoding a syntax element that indicates the horizontal transform and the vertical transform;determining a block of residual data based on the horizontal transform and the vertical transform determined for the block; anddecoding, using intra-prediction or inter-prediction, a video block based on the block of residual data and a predictive block.2. The method of claim 1 , wherein the horizontal transform is determined for the block based on comparing the width of the block to the first ...

PARAMETRIC GRAPH-BASED SEPARABLE TRANSFORMS FOR VIDEO CODING

A video decoder can be configured to receive, in a syntax structure that applies to a current block, graph-related information; determine a transform matrix based on the received graph-related syntax information; perform an inverse transform based on the determined transform matrix of one or more coefficient values to generate a residual block; and reconstruct the current block of the video data based on the residual block. 1. A method of decoding video data , the method comprising:receiving, in a syntax structure that applies to a current block of the video data, graph-related information;determining a transform matrix based on the received graph-related syntax information;performing an inverse transform, based on the determined transform matrix, on one or more coefficient values to generate a residual block; andreconstructing the current block of the video data based on the residual block.2. The method of claim 1 , wherein determining the transform matrix based on the received graph-related syntax information comprises:determining a graph Laplacian matrix based on the graph-related information;performing an Eigen-decomposition operation on the graph Laplacian matrix to determine one or more basis vectors;scaling values of the one or more basis vectors;rounding the scaled values to integer values to determine the transform matrix.3. The method of claim 2 , wherein:the graph-related information comprises one or more constant edge weights and one or more vertex weights, anddetermining the graph Laplacian matrix based on the graph-related information comprises applying the one or more constant edge weights and one or more vertex weights to a generalized graph Laplacian matrix to determine the graph Laplacian matrix.4. The method of claim 3 , wherein the graph-related information further comprises a syntax element identifying the generalized graph Laplacian matrix in a set of generalized graph Laplacian matrices.5. The method of claim 1 , wherein the graph-related ...

POSITION-DEPENDENT PREDICTION COMBINATIONS IN VIDEO CODING

A video coder may generate a predictor block using an intra prediction mode. As part of generating the predictor block, the video coder may, for each respective sample in a set of samples in the predictor block, determine, based on an initial value of the first weight and a distance between the respective sample and a first boundary of the predictor block, a value of the first weight for the respective sample. Additionally, the video coder may determine, based on the initial value of the second weight and a distance between the respective sample and a second boundary of the predictor block, a value of the second weight for the respective sample. The video coder may also determine a primary value for the respective sample. The video coder may then determine a secondary value for the respective sample based on the first weight, second weight, and the primary value. 1. A method of decoding video data , the method comprising: determining an initial value of a first weight;', 'determining an initial value of a second weight;', determining, based on the initial value of the first weight and a distance between the respective sample and a first boundary of the predictor block, a value of the first weight for the respective sample;', 'determining, based on the initial value of the second weight and a distance between the respective sample and a second boundary of the predictor block, a value of the second weight for the respective sample;', 'determining a value of a third weight for the respective sample;', 'determining a value of a fourth weight for the respective sample based on the value of the first weight for the respective sample, the value of the second weight for the respective sample, and the value of the third weight for the respective sample;', 'determining a primary value for the respective sample according to the intra prediction mode; and', 'determining a secondary value for the respective sample as a first value for the respective sample right-shifted by a ...

METHOD AND DEVICE FOR PROCESSING A VIDEO SIGNAL BY USING AN ADAPTIVE SEPARABLE GRAPH-BASED TRANSFORM

The present invention provides a method for decoding a video signal using an adaptive separable graph-based transform, comprising the steps of: receiving a transform index for a target block from the video signal, wherein the transform index indicates a graph-based transform to be applied to the target block; deriving a graph-based transform kernel corresponding to the transform index; and decoding the target block based on the graph-based transform kernel. 1. A method for decoding a video signal using an adaptive separable graph-based transform , the method comprising:receiving, from the video signal, a transform index for a target block, the transform index indicating graph-based transform to be applied to the target block;deriving a graph-based transform kernel corresponding to the transform index; anddecoding the target block based on the graph-based transform kernel.2. The method of claim 1 , whereinwhen the target block is comprised of M or N subblocks partitioned in a horizontal or vertical direction, the transform index corresponds to each subblock.3. The method of claim 2 , whereinthe graph-based transform kernel is derived to each subblock according to the transform index, and different transform types are applied to at least two subblocks.4. The method of claim 3 , whereinthe different transform types include at least two of DCT, asymmetric discrete sine transform (ADST), and reverse asymmetric discrete sine transform (RADST).5. The method of claim 1 , whereinthe graph-based transform kernel is a 2-dimensional separable graph-based transform kernel generated based on a combination of a plurality of 1-dimensional graph-based transforms.6. The method of claim 1 , whereinthe graph-based transform kernel is predefined in every row or column of the target block.7. The method of claim 1 , whereinthe transform index is received in every unit of at least one of a coding unit, a prediction unit, and a transform unit.8. A method for encoding a video signal using an ...

DATA COMPRESSION WITH A MULTI-SCALE AUTOENCODER

A method of image compression includes receiving an image. Multiple quantized latent representations are generated to represent features of the image. Each of the quantized latent representations has a different resolution and is generated at staggered timings. Each of the later generated quantized latent representations is conditioned on each of the prior generated quantized latent representations. The multiple quantized latent representations are decoded to reconstruct the image. 1. A method of image compression comprising:receiving an image; andgenerating multiple quantized latent representations to represent features of the image, each of the quantized latent representations having a different resolution and being generated at staggered timings and in which later generated quantized latent representations are conditioned on prior generated quantized latent representations.2. The method of claim 1 , further comprising decoding the multiple quantized latent representations to reconstruct the image.3. The method of claim 1 , further comprising supplying as feedback a quantization error for a first quantized latent representation claim 1 , the quantization error being applied for generating a next succeeding quantized latent representation.4. The method of claim 1 , further comprising learning a hierarchical representation of latent representations across different resolutions.5. The method of claim 1 , in which processing for generating the multiple quantized latent representations is performed in parallel.6. The method of claim 1 , in which processing of computations for generating the multiple quantized latent representations is distributed evenly across the multiple quantized latent representations.7. The method of claim 1 , in which the multiple quantized latent representations are respectively generated based on separate input images claim 1 , the separate input images being formed by repeatedly down-sampling the received image.8. An apparatus for image ...

MULTI-SCALE OPTICAL FLOW FOR LEARNED VIDEO COMPRESSION

Systems and techniques are described for encoding and/or decoding data based on motion estimation that applies variable-scale warping. An encoding device can receive an input frame and a reference frame that depict a scene at different times. The encoding device can generate an optical flow identifying movements in the scene between the two frames. The encoding device can generate a weight map identifying how finely or coarsely the reference frame can be warped for input frame prediction. The encoding device can generate encoded video data based on the optical flow and the weight map. A decoding device can generate a reconstructed optical flow and a reconstructed weight map from the encoded data. A decoding device can generate a prediction frame by warping the reference frame based on the reconstructed optical flow and the reconstructed weight map. The decoding device can generate a reconstructed input frame based on the prediction frame. 1. An apparatus for data encoding , the apparatus comprising:a memory; and receive video data including an input frame that depicts a scene at a first time and a reference frame that depicts the scene at a second time;', 'generate an optical flow based on the input frame and the reference frame, the optical flow identifying one or more movements in one or more areas of the scene between the reference frame and the input frame;', 'generate a weight map based on the reference frame and the input frame, the weight map including a first set of values and a second set of values, the second set of values being different than the first set of values; and', 'generate encoded video data at least in part by encoding the video data based on the optical flow and the weight map, the encoded video data including a first set of data encoded at a first level of detail based on the first set of values from the weight map and a second set of data encoded at a second level of detail based on the second set of values from the weight map, the second ...

LOW-COMPLEXITY SIGN PREDICTION FOR VIDEO CODING

A device includes processing circuitry configured to identify a set of pre-stored residual samples in video data that is stored to a memory, to combine the set of stored residual samples to form a combination, to apply a first sign combination to transform coefficients of the combination to obtain a first hypothesis reconstruction for a current block of the video data, and to apply a second sign combination to the transform coefficients of the combination to obtain a second hypothesis reconstruction for the current block. The processing circuitry is further configured to derive respective cost functions with respect to the first and second hypothesis reconstructions, to compare the respective derived cost functions, to select, based on the comparison, either the first or second hypothesis reconstruction, and to code the current block using a sign prediction associated with the selected one of the first or second hypothesis reconstruction. 1. A method of coding video data , the method comprising:identifying a set of pre-stored residual samples in a pre-stored portion of the video data;combining the set of pre-stored residual samples to form a combination of pre-stored residual samples;applying a first sign combination to transform coefficients of the combination of pre-stored residual samples to obtain a first hypothesis reconstruction with respect to a current block of the video data;applying a second sign combination to the transform coefficients of the combination of pre-stored residual samples to obtain a second hypothesis reconstruction with respect to the current block of the video data;deriving respective cost functions with respect to the first hypothesis reconstruction and the second hypothesis reconstruction;comparing the respective derived cost functions;selecting, based on the comparison, either the first hypothesis reconstruction or the second hypothesis reconstruction; andcoding the current block using a sign prediction associated with the selected one ...

LOW-COMPLEXITY SIGN PREDICTION FOR VIDEO CODING

Sign prediction technology for video coding are generally described. An example device includes a memory configured to store video data, and processing circuitry in communication with the memory. The processing circuitry is configured to determine that a block of the video data stored to the memory is eligible to be coded using sign prediction, to perform the sign prediction with respect to one or more transform coefficients of the block only if the block meets a predetermined criterion, wherein the predetermined criterion is based on at least one of: a width of the block, a height of the block, a coding mode used to code the block, or a position of one or more sign-predicted transform coefficients within the block, and to code the block based on the sign prediction performed with respect to the block. 1. A method of coding video data , the method comprising:determining that a block of the video data is eligible to be coded using sign prediction;performing the sign prediction with respect to one or more transform coefficients of the block only if the block meets a predetermined criterion, wherein the predetermined criterion is based on at least one of: a width of the block, a height of the block, a coding mode used to code the block, or a position of one or more sign-predicted transform coefficients within the block; andcoding the block based on the sign prediction performed with respect to the block.2. The method of claim 1 , further comprising determining that the block meets the predetermined criterion only if the width of the block is equal to or greater than a predetermined threshold width.3. The method of claim 1 , further comprising determining that the block meets the predetermined criterion only if the height of the block is equal to or greater than a predetermined threshold height.4. The method of claim 1 , further comprising determining that the block meets the predetermined criterion only if the sign-predicted transform coefficients are positioned in a ...

LOW-COMPLEXITY SIGN PREDICTION FOR VIDEO CODING

Techniques for cost function measurement with respect to sign prediction-based video coding are generally described. An example device includes processing circuitry is configured to apply first and second sign combinations to transform coefficients of a stored block of video data to obtain first and second hypothesis reconstructions of the block, to measure first and second cost functions with respect to the first and second hypothesis reconstructions by determining respective sets of pixel value gradients representing differences between samples of each hypothesis reconstruction of the block and samples of a neighboring block positioned adjacent to the block. The processing circuitry is further configured to compare the respective cost functions, to select, based on the comparison, one of the hypothesis reconstructions of the block, and to code the block using the respective sign combination associated with the selected hypothesis reconstruction. 1. A method of coding video data , the method comprising:applying a first sign combination to transform coefficients of a block of the video data to obtain a first hypothesis reconstruction with respect to the block of the video data;applying a second sign combination to the transform coefficients of the block of the video data to obtain a second hypothesis reconstruction with respect to the block of the video data;measuring a first cost function with respect to the first hypothesis reconstruction by determining a first set of pixel value gradients that represent respective differences between samples of the first hypothesis reconstruction of the block and samples of a neighboring block that is positioned adjacent to the block;measuring a second cost function with respect to the second hypothesis reconstruction by determining a second set of pixel value gradients that represent respective differences between samples of the second hypothesis reconstruction of the block and samples of the neighboring block that is positioned ...

COMPUTATION OF ASYMMETRIC TRANSFORM PAIRS FOR VIDEO CODING USING ADJUSTMENT STAGES AND DCT-2

A method of encoding video data includes transforming residual values using a pair of transforms, wherein the pair of transforms are a mirror pair of asymmetric transforms. The transform comprises determining matrices for a low-complexity transform adjustment stage for each of the pair of transforms, calculating matrices for each of the pair of transforms from a low-complexity transform and the matrices for the low-complexity transform adjustment stage, and transforming the residual values using the calculated matrices for each of the pair of transforms to produce transform coefficients. 1. A method of encoding video data , the method comprising:performing a prediction process on a block of video data to produce residual values; determining matrices for a low-complexity transform adjustment stage for each of the pair of transforms,', 'calculating matrices for each of the pair of transforms from a low-complexity transform and the matrices for the low-complexity transform adjustment stage, and', 'transforming the residual values using the calculated matrices for each of the pair of transforms to produce transform coefficients;, 'transforming the residual values using a pair of transforms to produce transform coefficients, wherein the pair of transforms are a mirror pair of asymmetric transforms, and wherein transforming the residual values using the pair of transforms comprisesentropy encoding the transform coefficients to produce an encoded block of video data; andoutputting the encoded block of video data.2. The method of claim 1 , wherein a first transform of the pair of transforms is defined by a matrix A and a second transform of the pair of transforms is defined by a matrix B claim 1 , and wherein the first transform and the second transform are the mirror pair of asymmetric transforms in the case that:{'br': None, 'i': 'A=SBR⇔B=SAR'}where R and S are orthogonal involutory matrices.3. The method of claim 2 , wherein the first transform and the second transform ...

BINARY ARITHMETIC CODING WITH SMALL TABLES OR SHORT-OPERAND MULTIPLICATIONS FOR VIDEO CODING

A method of decoding video data including receiving video data including coded representations of syntax elements performing inverse binary arithmetic coding on the coded representations of the syntax elements to obtain bins of the syntax elements, inverse binarizing the bins of the syntax elements to obtain the syntax elements, and decoding the video data based on the syntax elements. Performing the inverse binary arithmetic coding includes determining a probability for a particular coded representation of the coded representations, normalizing the probability for the particular coded representation using right bit shifts to create a normalized probability, determining a product of the normalized probability and a range for the particular coded representation, and updating a range of a least probable symbol for the particular coded representation using the determined product. 1. A method of decoding video data , the method comprising:receiving video data including coded representations of syntax elements; determining a probability for a particular coded representation of the coded representations;', 'normalizing the probability for the particular coded representation using right bit shifts to create a normalized probability;', 'determining a product of the normalized probability and a range for the particular coded representation; and', 'updating a range of a least probable symbol for the particular coded representation using the determined product;, 'performing inverse binary arithmetic coding on the coded representations of the syntax elements to obtain bins of the syntax elements, performing the inverse binary arithmetic coding includinginverse binarizing the bins of the syntax elements to obtain the syntax elements; anddecoding the video data based on the syntax elements.2. The method of claim 1 , wherein the particular coded representation is a value indicating an interval value a probability within a final coded probability interval.3. The method of claim 1 , ...

PROBABILITY INITIALIZATION AND SIGNALING FOR ADAPTIVE ARITHMETIC CODING IN VIDEO CODING

A method of decoding video data includes receiving, by processing circuitry, a video bitstream including encoded representations of one or more syntax elements of a coded unit and initializing, by the processing circuitry, a respective probability state for each bin of a plurality of bins for the one or more syntax elements based on a comparison of a parameter associated with the coded unit and a respective threshold of a plurality of thresholds. The method further includes performing, by the processing circuitry, inverse binary arithmetic coding on the encoded representations of the one or more syntax elements to obtain each bin of the plurality of bins using a respective probability state for the bin, inverse binarizing, by the processing circuitry, the plurality of bins to obtain the one or more syntax elements, and decoding, by the processing circuitry, the video data based on the one or more syntax elements. 1. A method of decoding video data , the method comprising:receiving, by processing circuitry, a video bitstream including encoded representations of one or more syntax elements of a coded unit;initializing, by the processing circuitry, a respective probability state for each bin of a plurality of bins for the one or more syntax elements based on a comparison of a parameter associated with the coded unit and a respective threshold of a plurality of thresholds;performing, by the processing circuitry, inverse binary arithmetic coding on the encoded representations of the one or more syntax elements to obtain each bin of the plurality of bins using a respective probability state for the bin;inverse binarizing, by the processing circuitry, the plurality of bins to obtain the one or more syntax elements; anddecoding, by the processing circuitry, the video data based on the one or more syntax elements.2. The method of claim 1 , wherein the video data is for current picture information and wherein the initializing comprises:performing selective probability ...

METHOD AND APPARATUS FOR PERFORMING ARITHMETIC CODING BY LIMITED CARRY OPERATION

Disclosed herein is a method of performing an arithmetic coding for data symbols, comprising: creating an interval for each of the data symbols, the interval being represented based on a starting point and a length of the interval; updating the interval for each of the data symbols; checking whether the updated interval is included in a specific range; and renormalizing the updated interval based on a result of the checking. 1. A method of performing an arithmetic coding for data symbols , comprising:creating an interval for each of the data symbols, the interval being represented based on a starting point and a length of the interval;updating the interval for each of the data symbols;checking whether the updated interval is included in a specific range; andadjusting the updated interval to reduce outstanding bits.2. The method of claim 1 , further comprisingrenormalizing the adjusted interval.3. The method of claim 1 , further comprising:if the updated interval is not included in a specific range, selecting one of a top part and a bottom part of the updated interval,wherein the updated interval is adjusted based on a selected part.4. The method of claim 3 , further comprising:calculating a threshold point within the updated interval; andcomparing a first distance with a second distance,wherein the first distance indicates a length from the threshold point to the top part and the second distance indicates a length from the threshold point to the bottom part, andwherein the updated interval is adjusted based on a result of the comparing step.5. The method of claim 4 ,wherein if the first distance is smaller than the second distance, a length of the updated interval is set as the second distance.6. The method of claim 4 ,wherein if the first distance is not smaller than the second distance, a length of the updated interval is set as the first distance, and a starting point of the updated interval is set by the threshold point.7. An apparatus of performing an ...

TREE-BASED TRANSFORM UNIT (TU) PARTITION FOR VIDEO CODING

A video decoder may receive, in a bitstream that comprises an encoded representation of video data, information indicating whether a residual block is partitioned and information indicating a partition tree type for the residual block based on the residual block being partitioned, wherein the residual block is indicative of a difference between a current block and a prediction block. The video decoder may determine, based on the received information that the residual block is partitioned and the partition tree type for the residual block, a plurality of residual sub-blocks into which the residual block is partitioned according to the partition tree type. The video decoder may produce the residual data for the current block based at least in part on the residual block being partitioned according to the partition tree type into the plurality of residual sub-blocks and may decode the current block using the residual data. 1. A method of decoding video data , the method comprising:receiving, in a bitstream that comprises an encoded representation of the video data, information indicative of whether a residual block is partitioned and information indicative of a partition tree type for the residual block based on the residual block being partitioned, wherein the residual block is indicative of a difference between a current block and a prediction block;determining, based on the received information that the residual block is partitioned and the partition tree type for the residual block, a plurality of residual sub-blocks into which the residual block is partitioned according to the partition tree type;producing residual data for the current block based at least in part on the residual block being partitioned according to the partition tree type into the plurality of residual sub-blocks; anddecoding the current block using the residual data.2. The method of claim 1 , wherein receiving the information indicative of the partition tree type comprises receiving index ...

LEARNED LOW-COMPLEXITY ADAPTIVE QUANTIZATION FOR VIDEO COMPRESSION

A video encoder may determine a set of quantization offset parameters for a group of scaled transform coefficients for a block of video data based on side information associated with the block of video data. The video encoder may further quantize the group of scaled transform coefficients for the block of video data to generate quantized transform coefficients for the block of video data based at least in part on the set of quantization offset parameters. The video encoder may further generate an encoded video bitstream based at least in part on the quantized transform coefficients for the block of video data. 1. A method of encoding video data , the method comprising:determining a set of quantization offset parameters for a group of scaled transform coefficients for a block of video data based on side information associated with the block of video data;quantizing the group of scaled transform coefficients for the block of video data to generate quantized transform coefficients for the block of video data based at least in part on the set of quantization offset parameters; andgenerating an encoded video bitstream based at least in part on the quantized transform coefficients for the block of video data.2. The method of claim 1 , wherein determining the set of quantization offset parameters for the group of scaled transform coefficients for the block of video data comprises:selecting the set of quantization offset parameters for the group of scaled transform coefficients from a plurality of sets of quantization offset parameters based on the side information associated with the block of video data.3. The method of claim 2 , wherein selecting the set of quantization offset parameters for the group of scaled transform coefficients from the plurality of sets of quantization offset parameters comprises:determining an index associated with the group of scaled transform coefficients based at least in part on the side information associated with the block of video data; ...

MULTI-PASS NON-SEPARABLE TRANSFORMS FOR VIDEO CODING

An example method of decoding video data includes determining, by a video decoder and based on syntax elements in an encoded video bitstream, a plurality of values for a current block of the video data; performing, by the video decoder, a multi-pass non-separable inverse transformation on the plurality of values to derive residual data that represents pixel differences between the current block of the video data and a predictive block of the video data; and reconstructing, by the video decoder, the current block of the video data based on the residual data and the predictive block of the video data. In some examples, performing a pass of the multi-pass non-separable inverse transformation includes performing a plurality of Givens orthogonal transformations. 1. A method of decoding video data , the method comprising:determining, by a video decoder and based on syntax elements in an encoded video bitstream, a plurality of values for a current block of the video data;performing, by the video decoder, a multi-pass non-separable inverse transformation on the plurality of values to derive residual data that represents pixel differences between the current block of the video data and a predictive block of the video data, wherein performing a pass of the multi-pass non-separable inverse transformation comprises performing a plurality of Givens orthogonal transformations; andreconstructing, by the video decoder, the current block of the video data based on the residual data and the predictive block of the video data.2. The method of claim 1 , further comprising: performing, based on a respective parameter of the plurality of pre-defined parameters for the respective pass, respective Givens orthogonal transformations on respective pairs of input values of a plurality of input values to generate respective pairs of output values of a plurality of output values,', 'wherein the plurality of input values for a first pass of the multi-pass non-separable inverse transformation ...

EFFICIENT PARAMETER STORAGE FOR COMPACT MULTI-PASS TRANFORMS

A device determines a Compact Multi-Pass Transform (CMPT) from a plurality of CMPTs. Additionally, the device decompresses CMPT parameters for the CMPT. In instances where the device decodes video data, the device applies the CMPT to a coefficient block to reconstruct a residual block and decodes, based on a predictive block and the residual block, a current block of a picture of the video data. In instances where the device encodes video data, the device applies the CMPT to a residual block to construct a coefficient block and generates for output information indicating coefficient values for the coefficient block. 1. A method of decoding video data , the method comprising:determining a Compact Multi-Pass Transform (CMPT) from a plurality of CMPTs;decompressing CMPT parameters for the CMPT; input of each transform pass of the plurality of transform passes other than an initial transform pass of the plurality of transform passes comprises output of a previous transform pass of the plurality of transform passes,', 'the CMPT parameters for the CMPT comprise respective parameter vectors for each respective transform pass of the plurality of transform passes,', 'for each respective transform pass of the plurality of transform passes, the respective transform pass includes parallel performance of a respective set of Givens rotations, each respective Givens rotation of the respective set of Givens rotations taking two input values of the input of the respective pass and outputting two output values of output of the respective transform pass, wherein factors used for transformation in the respective Givens rotation are defined by a sine and cosine of a respective angle θ for the respective Givens rotation, the sine and cosine of the respective angle θ for the respective Givens rotation correspond to respective CMPT parameters in the parameter vector for the respective transform pass; and, 'applying the CMPT to a coefficient block to reconstruct a residual block, wherein ...

Efficient transform coding using optimized compact multi-pass transforms

As part of a video encoding or decoding process, a device applies a transformation to input data elements to derive output data elements for a current block. The transformation comprises a sequence of vector transformations. For each respective vector transformation of the sequence of vector transformations other than a first vector transformation of the sequence of vector transformations, input values for the respective vector transformation comprise output values of the respective previous vector transformation of the sequence of vector transformations. Each respective vector transformation of the sequence of vector transformations further takes, as input, a respective parameter vector for the respective vector transformation, the respective parameter vector for the respective vector transformation comprising one or more parameters.

METHOD FOR ENCODING AND DECODING A MEDIA SIGNAL AND APPARATUS USING THE SAME

Disclosed herein is a method of encoding a video signal, comprising receiving an original video signal; comparing the original video signal with available reconstructed signals; determining a correction signal based on a result of the comparison; and generating a transform-coded correction signal to be transmitted for a signal reconstruction. 1. A method of encoding a video signal , comprising:receiving an original video signal;comparing the original video signal with available reconstructed signals;determining a correction signal based on a result of the comparison; andgenerating a transform-coded correction signal to be transmitted for a signal reconstruction.2. The method of claim 1 , further comprising:determining a reconstruction function to be used for the signal reconstruction,wherein the reconstruction function includes at least one of a linear component and a non-linear component.3. The method of claim 2 , wherein the reconstruction function is determined based on all the previously reconstructed samples and the correction signal.4. The method of claim 2 , wherein:the correction signal is determined to minimize a sum of a distortion component and a rate component,the distortion component is indicative of total distortion between the original video signal and the correction signal, andthe rate component is indicative of a number of bits required to send the transform-coded correction signal.5. The method of claim 2 ,wherein the transform-coded correction signal is multiplied by a dequantization matrix and an inverse-transform matrix, andwherein the dequantization matrix is selected for controlling a bit-rate and quantization errors.6. The method of claim 1 ,wherein the transform-coded correction signal corresponds to the correction signal for a group of pictures and a spatiotemporal transform coding has been applied to the correction signal.7. A method of decoding a video signal claim 1 , comprising:receiving a transform-coded correction signal;obtaining a ...

BINARIZING SECONDARY TRANSFORM INDEX

An example device for decoding video data includes a memory configured to store video data and one or more processors implemented in circuitry and configured to determine a maximum possible value for a secondary transform syntax element for a block of video data, entropy decode a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block, reverse binarize the value for the secondary transform syntax element using a common binarization scheme regardless of the maximum possible value to determine the secondary transform for the block, and inverse-transform transform coefficients of the block using the determined secondary transform. 1. A method of decoding video data , the method comprising:decoding transform coefficients for a transform block of a current block of video data;determining positions of non-zero-valued transform coefficients of the decoded transform coefficients in the transform block;determining a type of transform to perform according to the positions of the non-zero-valued transform coefficients in the transform block;transforming the transform coefficients in the transform block using the type of transform to produce a residual block; anddecoding the current block using the residual block.2. The method of claim 1 , wherein determining the type of transform comprises determining the type of transform without decoding a value for a syntax element of the video data indicating the type of transform.3. The method of claim 1 , wherein determining the type of transform comprises:determining a number of the non-zero-valued transform coefficients following an Nth transform coefficient in the transform block in scan order, wherein N is an integer value; anddetermining the type of transform according to the number of non-zero-valued transform coefficients following the Nth transform coefficient in scan order.4. The method of claim 3 , further comprising determining a value of N ...

METHOD AND DEVICE FOR PROCESSING GRAPH-BASED SIGNAL USING GEOMETRIC PRIMITIVES

Disclosed herein is a method of processing a graph-based signal using a geometric primitive, comprising: specifying the geometric primitive to be used for calculating an edge weight; obtaining a parameter for each of the geometric primitive; calculating an edge weight for each of edges within the image based on the parameter; and encoding the image based on the edge weight. 1. A method of processing a graph-based signal using a geometric primitive , comprising:specifying the geometric primitive to be used for calculating an edge weight;obtaining a parameter for each of the geometric primitive;calculating an edge weight for each of edges within the image based on the parameter; andencoding the image based on the edge weight.2. The method of claim 1 , further comprising:calculating a minimum distance for an edge in a graph corresponding to the target block; andapplying a distance-to-weight function to the minimum distance,wherein the edge weight is calculated based on the distance-to-weight function.3. The method of claim 2 ,wherein the minimum distance indicates a distance from a center of an edge to the geometric primitive.4. The method of claim 1 ,wherein the parameter includes at least one of type information, location information or length information.5. The method of claim 4 , further comprising:checking whether the type information is different from a default type: andencoding parameters of a distance-to-weight function when the type information is different from the default type.6. The method of claim 4 ,wherein the type information of the geometric primitive indicates one of a predetermined set of the geometric primitive.7. The method of claim 4 ,wherein each of the geometric primitive uses different distance-to-weight function.8. The method of claim 7 ,wherein the edge weight is calculated by using another function.9. The method of claim 1 ,wherein the image corresponds to a residual signal.10. The method of claim 1 ,wherein the geometric primitive is ...

PARALLELIZED RATE-DISTORTION OPTIMIZED QUANTIZATION USING DEEP LEARNING

A video encoder determines scaled transform coefficients, wherein determining the scaled transform coefficients comprises scaling transform coefficients of a block of the video data according to a given quantization step. The video encoder determines scalar quantized coefficients, wherein determining the scalar quantized coefficients comprises applying scalar quantization to the scaled transform coefficients of the block. Additionally, the video encoder applies a neural network that determines a respective set of probabilities for each respective transform coefficient of the block. The respective set of probabilities for the respective transform coefficient includes a respective probability value for each possible adjustment value in a plurality of possible adjustment values. Inputs to the neural network include the scaled transform coefficients and the scalar quantized coefficients. The video encoder determines, based on the set of probabilities for a particular transform coefficient of the block, a quantization level for the particular transform coefficient. 1. A method of encoding video data , the method comprising:determining scaled transform coefficients, wherein determining the scaled transform coefficients comprises scaling transform coefficients of a block of the video data according to a given quantization step;determining scalar quantized coefficients, wherein determining the scalar quantized coefficients comprises applying scalar quantization to the scaled transform coefficients of the block; the respective set of probabilities for the respective transform coefficient includes a respective probability value for each possible adjustment value in a plurality of possible adjustment values, and', 'inputs to the neural network include the scaled transform coefficients and the scalar quantized coefficients;, 'applying a neural network that determines a respective set of probabilities for each respective transform coefficient of the block, whereindetermining, ...

DETERMINING PREDICTION PARAMETERS FOR NON-SQUARE BLOCKS IN VIDEO CODING

A method of decoding video data comprising receiving a block of video data encoded using a position dependent intra prediction combination (PDPC) mode, the block of video data having a non-square shape defined by a width and a height, determining one or more PDPC parameters based on one or more of the width or the height of the block of video data, and decoding the block of video data using the PDPC mode and the determined PDPC parameters.

METHOD AND APPARATUS FOR ADAPTIVELY ENCODING, DECODING A VIDEO SIGNAL BASED ON SEPARABLE TRANSFORM

Disclosed herein is a method of performing an adaptive video coding, comprising: determining transform subsets including a group index and linear transforms with dimensions M×M and N×N, wherein the linear transforms correspond to at least one of a null transform and predefined transforms; selecting an optimal transform subset for a transform unit from the determined transform subsets, wherein each of rows and columns of the transform unit corresponds to different linear transform; and encoding the optimal transform subset. 1. A method of performing an adaptive video coding , comprising:determining transform subsets including a group index and linear transforms with dimensions M×M and N×N, wherein the linear transforms correspond to at least one of a null transform and predefined transforms;selecting an optimal transform subset for a transform unit from the determined transform subsets, wherein each of rows and columns of the transform unit corresponds to different linear transform; andencoding the optimal transform subset.2. The method of claim 1 , further comprising:calculating a transform coefficient of a residual block based on the optimal transform subset;quantizing the transform coefficient: andencoding a group index of the quantized transform coefficient.3. The method of claim 1 ,wherein the optimal transform subset is selected for each of transform blocks.4. The method of claim 3 ,wherein the transform blocks include variable-size blocks or non-square blocks.5. The method of claim 1 ,wherein the method is repeatedly performed for a video segment.6. A method of adaptively decoding a video signal claim 1 , comprising:receiving a video signal including a group index;extracting the group index from the video signal; andperforming an inverse-transform of a residual block based on an optimal inverse-transform subset corresponding to the group index.7. The method of claim 6 ,wherein the optimal inverse-transform subset corresponds to each of transform blocks.8. The ...

Constrained block-level optimization and signaling for video coding tools

An example device for decoding encoded video data includes storage media and processing circuitry. The storage media are configured a portion of the encoded video data. The processing circuitry is configured to determine a block-level threshold for the portion of the encoded video data stored to the storage media, to determine that an encoded block of the portion of the encoded video data has a size that is equal to or greater than the threshold, to receive a syntax element indicating that a portion of the encoded block is to be reconstructed using a coding tool, to determine, based on the encoded block having the size that is equal to or greater than the threshold, that the syntax element applies to all samples of a plurality of samples included in the encoded block, and to reconstruct the encoded block based on the coding tool.

BINARY ARITHMETIC CODING WITH PARAMETERIZED PROBABILITY ESTIMATION FINITE STATE MACHINES

For at least one respective bin of the bin stream, a decoder may determine, based on a state for the respective bin, an interval for the respective bin, and the offset value, a value of the respective bin. Additionally, the decoder determines one or more Finite State Machine (FSM) parameters for a next bin of the bin stream. The one or more FSM parameters for the next bin controls how probability estimates for the next bin are computed from a state for the respective bin. The decoder determines using a parameterized state updating function that takes as input the state for the respective bin, the one or more FSM parameters for the next bin of the bin stream, and the value of the respective bin, a state for the next bin of the bin stream. The decoder may debinarize the bin stream to form a decoded syntax element. 1. A method of decoding video data , the method comprising: [ determining a value of the respective bin based on a state for the respective bin, an interval for the respective bin, and the offset value;', 'determining one or more Finite State Machine (FSM) parameters for a next bin of the bin stream, the one or more FSM parameters for the next bin controlling how probability estimates for the next bin are computed from a state for the respective bin, the next bin of the bin stream following the respective bin in the bin stream; and', 'determining a state for the next bin of the bin stream using a parameterized state updating function that takes as input the state for the respective bin, the one or more FSM parameters for the next bin of the bin stream, and the value of the respective bin; and, 'for at least one respective bin of the bin stream, 'generating a bin stream, wherein generating the bin stream comprises, 'debinarizing the bin stream to form the decoded syntax element; and, 'determining a decoded syntax element by applying binary arithmetic decoding to an offset value included in a bitstream, wherein applying the binary arithmetic decoding ...

IMPLICIT TRANSFORM SELECTION IN VIDEO CODING

An example method includes inferring, for a current transform block of a current video block, a transform type from a plurality of transform types that includes one or more discrete cosine transforms (DCTs) and one or more discrete sine transforms (DSTs), wherein inferring the transform type comprises: determining a size of the current transform block; determining whether the current video block is partitioned using intra-subblock partitioning (ISP); and responsive to determining that the size of the current transform block is less than a threshold and that the current video block is partitioned using ISP, selecting a particular DST of the one or more DSTs as the selected transform type; transforming, using the selected transform type, the current transform block to obtain a block of reconstructed residual data for the video block; and reconstructing, based on the reconstructed residual data for the video block, the video block.

METHOD AND APPARATUS FOR PERFORMING AN ARITHMETIC CODING FOR DATA SYMBOLS

Disclosed herein is a method of performing an arithmetic coding for data symbols, comprising: creating an interval for each of the data symbols, the interval being represented based on a starting point and a length of the interval; updating the interval for each of the data symbols using a multiplication approximation; and calculating the multiplication approximation of products using bit-shifts and additions within the updated interval. 1. A method of performing an arithmetic coding for data symbols , comprising:creating an interval for each of the data symbols, the interval being represented based on a starting point and a length of the interval;updating the interval for each of the data symbols using a multiplication approximation; andcalculating the multiplication approximation of products using bit-shifts and additions within the updated interval.2. The method of claim 1 ,wherein the multiplication approximation of the products is performed by using optimization of factors including negative numbers.3. The method of claim 1 ,wherein the multiplication approximation of the products is scaled with the number of register bits.4. The method of claim 1 , wherein the calculating step further comprises:determining a position of most significant 1 bit of the length; andextracting some of most significant bits of the length after the most significant 1 bit, to obtain the approximated length,wherein the interval is updated based on the approximated length and resulting bits of the products.5. A method of decoding data symbols claim 1 , comprising:receiving location information of code value;checking a symbol corresponding to the location information of code value; anddecoding the checked symbol,wherein the code value has been calculated by a multiplication approximation using bit-shifts and additions.6. The method of claim 5 , further comprising:determining a position of most significant 1 bit of an interval length;extracting most significant bit of the interval length ...

METHOD AND APPARATUS FOR DECODING/ENCODING VIDEO SIGNAL USING TRANSFORM DERIVED FROM GRAPH TEMPLATE

There is provided a method for decoding a video signal using a graph-based transform, the method comprising: receiving a template index for a target unit from the video signal, wherein the template index indicates a graph-based transform template to be applied to the target unit; deriving a graph-based transform matrix for the target unit corresponding to the template index; and decoding the target unit based on the graph-based transform matrix. 1. A method for decoding a video signal using a graph-based transform , the method comprising:receiving a template index for a target unit from the video signal, wherein the template index indicates a graph-based transform template to be applied to the target unit;deriving a graph-based transform matrix for the target unit corresponding to the template index; anddecoding the target unit based on the graph-based transform matrix.2. The method of claim 1 ,wherein the template index corresponds to one template graph in a predetermined template graph set.3. The method of claim 2 ,wherein the predetermined template graph set includes a plurality of template graphs, andwherein the plurality of template graphs have a pattern in which a corner region in the target unit has a smaller edge weight than other regions in the target unit.4. The method of claim 2 ,wherein the predetermined template graph set is determined based on a sample pattern of the target unit.5. The method of claim 1 , wherein the template index is set to each of a plurality of template graphs.6. A method for encoding a video signal using a graph-based transform claim 1 , the method comprising:extracting a graph parameter, wherein the graph parameter includes at least one of a vertex parameter set and an edge parameter set;generating a base template graph based on the graph parameter;generating a template graph set based on adjustment of an edge weight of the base template graph;determining a template graph corresponding to a target unit from the template graph set; ...

METHOD AND APPARATUS FOR PROCESSING VIDEO SIGNAL FOR REDUCING VISIBILITY OF BLOCKING ARTIFACTS

Disclosed herein is a method of processing a video signal, comprising: receiving a video signal comprising an original frame; generating random shift information being used to derive a relative position of the original frame; copying the original frame within an extended frame using the generated random shift information; and encoding the extended frame and the random shift information, wherein a boundary of frames included in the video signal varies for each frame based on the random shift information. 1. A method of processing a video signal , comprising:receiving a video signal comprising an original frame;generating random shift information being used to derive a relative position of the original frame;copying the original frame within an extended frame using the generated random shift information; andencoding the extended frame and the random shift information,wherein a boundary of frames included in the video signal varies for each frame based on the random shift information.2. The method of claim 1 , wherein the random shift information is generated horizontally and/or vertically for each frame.3. The method of claim 1 , wherein the extended frame is extended by one block size or more in each dimension of the original frame.4. The method of claim 1 , wherein the random shift information is inserted in a slice header.5. A method of processing a video signal claim 1 , comprising:receiving the video signal comprising an extended frame and random shift information;decoding the extended frame comprising a target frame and the random shift information; andoutputting the extended frame and the random shift information,wherein the target frame indicates a frame with an original frame size which is cropped from the extended frame based on the random shift information.6. The method of claim 5 , wherein the random shift information is used to derive a position of the target frame horizontally and/or vertically.7. The method of claim 5 , wherein the extended frame has ...

BINARIZING SECONDARY TRANSFORM INDEX

An example device for decoding video data includes a memory configured to store video data and one or more processors implemented in circuitry and configured to determine a maximum possible value for a secondary transform syntax element for a block of video data, entropy decode a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block, reverse binarize the value for the secondary transform syntax element using a common binarization scheme regardless of the maximum possible value to determine the secondary transform for the block, and inverse-transform transform coefficients of the block using the determined secondary transform. 1. A method of decoding video data , the method comprising:determining a maximum possible value for a secondary transform syntax element for a block of video data;entropy decoding a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block;reverse binarizing the value for the secondary transform syntax element using a common reverse binarization scheme regardless of the maximum possible value to determine the secondary transform for the block; andinverse transforming transform coefficients of the block using the determined secondary transform.2. The method of claim 1 , further comprising determining a context model to be used to entropy decode the value for the secondary transform syntax element based on the determined maximum possible value claim 1 , wherein entropy decoding the value comprises entropy decoding the value using the determined context model.3. The method of claim 2 , wherein entropy decoding comprises context-based entropy decoding a predetermined number of bits of the value for the secondary transform syntax element using the determined context model claim 2 , and entropy decoding remaining bits of the value for the secondary transform syntax element ...

METHOD AND APPARATUS FOR PREDICTING VIDEO SIGNAL USING PREDICTED SIGNAL AND TRANSFORM-CODED SIGNAL

Disclosed herein is a method of encoding a video signal, comprising receiving an original video signal; comparing the original video signal with available reconstructed signals; generating a transform-coded correction signal based on a result of the comparison; generating a prediction signal based on the transform-coded correction signal and the available reconstructed signals; and reconstructing a signal by adding the transform-coded correction signal to the prediction signal. 1. A method of encoding a video signal , comprising:receiving an original video signal;comparing the original video signal with available reconstructed signals;generating a transform-coded correction signal based on a result of the comparison;generating a prediction signal based on the transform-coded correction signal and the available reconstructed signals; andreconstructing a signal by adding the transform-coded correction signal to the prediction signal.2. The method of claim 1 , further comprising:determining a scaling parameter to minimize a sum of a distortion component and a rate component; andperforming quantization to the transform-coded correction signal based on the scaling parameter.3. The method of claim 2 , wherein:the distortion component is indicative of total distortion between the original video signal and the reconstructed signal, andthe rate component is indicative of a number of bits required to send a quantized coefficient.4. The method of claim 2 ,wherein the scaling parameter is determined from a quantization parameter value.5. The method of claim 1 , further comprising:decomposing the original video signal to be coded into a plurality of layers.6. The method of claim 1 ,wherein a nonorthogonal transform matrix is used to reconstruct the signal.7. A method of decoding a video signal claim 1 , comprising:receiving the video signal including an optimal quantized coefficient;obtaining a residual error vector based on the optimal quantized coefficient; andreconstructing ...

INTRA REFERENCE FILTER FOR VIDEO CODING

A method of decoding video data that includes receiving a current block of video data encoded using an intra prediction mode, determining residual video data for the current block of video data, determining reference samples of the current block of video data, determining filter coefficients for a bilateral filter based on a distance between the reference samples and neighboring reference samples and based on a sample value difference between the reference samples and the neighboring reference samples, applying the bilateral filter with the determined filter coefficients to the determined reference samples to produce filtered reference samples, generating a prediction block using the filtered reference samples, and adding samples of the prediction block to the determined residual video data to produce a decoded block of video data. 1. A method of decoding video data , the method comprising:receiving a current block of video data encoded using an intra prediction mode;determining residual video data for the current block of video data;determining reference samples of the current block of video data;determining filter coefficients for a bilateral filter based on a distance between the reference samples and neighboring reference samples and based on a sample value difference between the reference samples and the neighboring reference samples;applying the bilateral filter with the determined filter coefficients to the determined reference samples to produce filtered reference samples;generating a prediction block using the filtered reference samples; andadding samples of the prediction block to the determined residual video data to produce a decoded block of video data.2. The method of claim 1 , wherein the bilateral filter is a 5-tap bilateral filter.4. The method of claim 3 , wherein a is equal to Napier's constant (2.71828).5. The method of claim 3 , wherein a is a power of 2.6. The method of claim 3 , wherein σis equal to 2.4 and σis equal to 260.7. The method of ...

NEIGHBOR BASED SIGNALING OF INTRA PREDICTION MODES

A device for coding video data is configured to determine that a current block of video data is coded using an intra prediction mode; add an intra prediction mode of a first neighboring block of the current block to a most probable mode candidate list for the current block; add an intra prediction mode for a second neighboring block of the current block to the most probable mode candidate list for the current block; add an intra prediction mode for a third neighboring block of the current block to the most probable mode candidate list for the current block; and code the current block of video data using an intra prediction mode. 1. A method for decoding video data , the method comprising:determining that a current block of video data is coded using an intra prediction mode;adding an intra prediction mode of a first neighboring block of the current block to a most probable mode candidate list for the current block;adding an intra prediction mode for a second neighboring block of the current block to the most probable mode candidate list for the current block;adding an intra prediction mode for a third neighboring block of the current block to the most probable mode candidate list for the current block;determining an intra prediction mode using the most probable mode candidate list; anddecoding the current block of video data using the intra prediction mode.2. The method of claim 1 , wherein the first neighboring block claim 1 , the second neighboring block claim 1 , and the third neighboring block each correspond to one of a left neighbor block claim 1 , an above neighbor block claim 1 , a below left neighbor block claim 1 , an above right neighbor block claim 1 , or an above left neighbor block relative to the current block.3. The method of claim 1 , further comprising:after adding the intra prediction modes of the first neighboring block and the second neighboring block to the most probable mode candidate list and before adding the intra prediction mode of the ...

METHOD AND DEVICE FOR PERFORMING GRAPH-BASED TRANSFORM USING GENERALIZED GRAPH PARAMETER

The present invention provides a method for decoding a video signal using a graph-based transform including receiving a generalized graph signal including a graph parameter set; obtaining a graph-based transform kernel of a transform unit based on the graph parameter set and a predetermined penalty function; and decoding the transform unit using the graph-based transform kernel. 1. A method for decoding a video signal using a graph-based transform , comprising:receiving a generalized graph signal including a graph parameter set;obtaining a graph-based transform kernel of a transform unit based on the graph parameter set and a predetermined penalty function; anddecoding the transform unit using the graph-based transform kernel.2. The method of claim 1 ,wherein the graph parameter set includes at least one of a vertex parameter set represented as V-dimensional vector and an edge parameter set represented as V×V matrix.3. The method of claim 1 ,wherein the predetermined penalty function is generated based on the generalized graph signal.4. The method of claim 1 ,wherein the graph-based transform kernel is obtained by an optimization function based on the graph parameter set and the predetermined penalty function.5. The method of claim 4 ,wherein the optimization function is comprised of a summation of a first penalty function component for a vertex parameter set and a second penalty function component for an edge parameter set, andwherein the graph-based transform kernel indicates a value in which the optimization function is a minimum.6. A method for performing a graph-based transform based on a generalized graph signal claim 4 , comprising:determining a graph parameter including at least one of a vertex parameter set and an edge parameter set;generating a generalized graph signal based on the graph parameter;generating at least one of a penalty function and a constraint function based on the graph parameter;generating an optimization function based on at least one of ...

A METHOD AND APPARATUS FOR PERFORMING GRAPH-BASED PREDICTION USING OPTIMAZATION FUNCTION

The present invention provides a method for performing a graph-based prediction using a graph signal including obtaining a context signal; generating a graph signal based on a graph parameter set; obtaining a graph-based transform matrix based on the graph signal, wherein the graph-based transform matrix includes an eigenvector; obtaining a prediction vector using an optimal transform vector calculated through an optimization function; and generating a prediction signal using the prediction vector, where the optimization function has the context signal, an eigenvalue of a graph Laplacian matrix and the eigenvector as a variable. 1. A method for performing a graph-based prediction using a graph signal , comprising:obtaining a context signal;generating a graph signal based on a graph parameter set;obtaining a graph-based transform matrix based on the graph signal, wherein the graph-based transform matrix includes an eigenvector;obtaining a prediction vector using an optimal transform vector calculated through an optimization function; andgenerating a prediction signal using the prediction vector,wherein the optimization function has the context signal, an eigenvalue of a graph Laplacian matrix and the eigenvector as a variable.2. The method of claim 1 ,wherein the prediction vector is obtained based on a linear combination of the transform vector and the eigenvector, andwherein the transform vector is determined using a cost function based on a distribution of the eigenvalue of the graph Laplacian matrix.3. The method of claim 1 ,further comprising calculating the graph Laplacian matrix based on the graph signal,wherein the graph-based transform matrix is obtained through a spectral decomposition of the graph Laplacian matrix.4. The method of claim 1 ,wherein the optimization function is represented as an unconstrained optimization function based on a Lagrange multiplier, and the unconstrained optimization function is represented by a new M-dimensional vector.5. The ...

METHOD AND DEVICE FOR ENTROPY ENCODING OR ENTROPY DECODING VIDEO SIGNAL FOR HIGH-CAPACITY PARALLEL PROCESSING

Disclosed is a method for encoding a video signal using parallel implementations, including generating data symbols to be encoded, encoding 1data symbols being in a base segment, copying 2data symbols being in another segment to a buffer, and encoding in parallel the 2data symbols being in the another segment. 1. A method for encoding a video signal using parallel implementations , the method comprisinggenerating data symbols to be encoded{'sup': 'st', 'encoding 1data symbols being in a base segment,'}{'sup': 'nd', 'copying 2data symbols being in another segment to a buffer; and'}{'sup': 'nd', 'encoding in parallel the 2data symbols being in the another segment.'}2. The method of claim 1 ,wherein a load-balancing algorithm is used for assigning segments to different threads.3. The method of claim 1 , further comprising:creating a compressed data header when all data has been compressed,wherein the compressed data header includes an index of each segment.4. The method of claim 3 , further comprising:concatenating all segments to create a single data array.5. The method of claim 1 ,wherein a non-blocking process starts when assigned to a data segment.6. A method for decoding a video signal based on parallel implementations claim 1 , the method comprisingreading each segment in a compressed data headerdecoding all segments except a base segment using multiple threadsstoring data symbols in a buffer; andecoding the video signal based on the data symbols7. The method of claim 6 ,wherein if the data symbols exist in the base segment, the data symbols in the base segment are decoded.8. The method of claim 6 ,wherein wherein if the data symbols do not exist in the base segment, the data symbols are read from a corresponding buffer.9. An apparatus for encoding a video signal using parallel implementations claim 6 , the apparatus comprising:a data symbol generation unit configured to generate data symbols to be encoded;{'sup': 'st', 'a series processing unit configured to ...

VIDEO INTRA PREDICTION USING HYBRID RECURSIVE FILTERS

An example method of decoding video data includes obtaining, from a coded video bitstream and for a current block of the video data, an indication of an intra-prediction mode that identifies an initial predictive block; filtering, in parallel, samples in a current line of a plurality of lines of the initial predictive block based on filtered values of samples in a preceding line of the plurality of lines and unfiltered values of samples in the current line to generate filtered values for samples for the current line; and reconstructing, using intra prediction, values of samples of the current block based on the filtered values of the samples of the current initial predictive block and residual data for the current block that represents a difference between the filtered values of the samples of the current initial predictive block and the values of samples of the current block. 1. A method of decoding video data , the method comprising:obtaining, from a coded video bitstream and for a current block of the video data, an indication of an intra-prediction mode that identifies an initial predictive block;filtering, in parallel, samples in a current line of a plurality of lines of the initial predictive block based on filtered values of samples in a preceding line of the plurality of lines of the initial predictive block and unfiltered values of samples in the current line to generate filtered values for samples for the current line of the initial predictive block, wherein the plurality of lines comprises either a plurality of rows or a plurality of columns of the video data; andreconstructing, using intra prediction, values of samples of the current block based on the filtered values of the samples of the current initial predictive block and residual data for the current block that represents a difference between the filtered values of the samples of the current initial predictive block and the values of samples of the current block.2. The method of claim 1 , wherein ...

CODING ADAPTIVE MULTIPLE TRANSFORM INFORMATION FOR VIDEO CODING

An example device for decoding video data includes a memory configured to store video data; and a processor implemented in circuitry and configured to decode a truncated unary codeword representing a multiple transform (MT) scheme for a current block of the video data to determine the MT scheme; apply the MT scheme to transform coefficients of the current block to produce residual data for the current block of video data; and decode the current block using the residual data. The MT scheme may include a plurality of transforms, such as a horizontal transform and a vertical transform, a primary transform and a second transform, or any combination of separable and/or non-separable transforms. Thus, a single truncated unary codeword may represent the entire MT scheme, that is, each of a plurality of transforms of the MT scheme. 1. A method of decoding video data , the method comprising:decoding a truncated unary codeword representing a multiple transform (MT) scheme for a current block of video data to determine the MT scheme;applying the MT scheme to transform coefficients of the current block to produce residual data for the current block of video data; anddecoding the current block using the residual data.2. The method of claim 1 , wherein decoding the truncated unary codeword comprises decoding the truncated unary codeword according to a signaling method claim 1 , wherein the signaling method comprises one of using a one-bit flag to represent one of two transforms of a predefined set of two transforms or using a set of one- or two-bit flags to represent one of three transforms of a predefined set of three transforms claim 1 , the MT scheme comprising the one of the two transforms of the predefined set of two transforms or the one of the three transforms of the predefined set of three transforms.3. The method of claim 2 ,wherein when the signaling method comprises using the one-bit flag, the truncated unary codeword representing the MT scheme comprises one of a value ...

VIDEO INTRA-PREDICTION USING POSITION-DEPENDENT PREDICTION COMBINATION FOR VIDEO CODING

Techniques are described to improved video intra prediction using position-dependent prediction combination in video coding. In High Efficiency Video Encoding a set of 35 linear predictors are used for doing intra coding and prediction can be computed from either a nonfiltered or a filtered set of neighboring “reference” pixels, depending on the selected predictor mode and block size. Techniques of this disclosure may use a weighted combination of both the nonfiltered and filtered set of reference pixels to achieve better compression via improved prediction and therefore small residual, enable effective parallel computation of all sets of prediction values, and maintain low complexity via applying filtering only to a set of reference pixels and not to predicted values themselves. 1. A method of decoding video data , the method comprising:determining non-filtered values of neighboring pixels to a current block of video data;determining filtered values of the neighboring pixels;generating a predicted block for the current block, the predicted block having predicted values representing linear combinations of the non-filtered values and the filtered values, the linear combinations including first weights having values greater than zero multiplied by the filtered values and second weights having values greater than zero multiplied by the non-filtered values, the predicted values including a first predicted value and a second predicted value, the second predicted value being different than the first predicted value; andreconstructing the current block using the predicted block.2. The method of claim 1 , wherein the first weights and the second weights vary based on a position of a predicted pixel of the predicted block.3. The method of claim 1 , wherein the first weights and the second weights vary according to distances between the positions of the predicted values in the predicted block and the positions of the neighboring pixels.4. The method of claim 1 , further ...

EFFICIENT WEIGHTED PROBABILITY ESTIMATION FOR BINARY ARITHMETIC CODING

An example coding device, such as a video coding (encoding or decoding) device is configured to determine a plurality of estimator functions to be used to calculate a probability of a symbol having a particular value, wherein the symbol is to be binary arithmetic coded according to the probability, and wherein the estimator functions do not include division operations; determine a plurality of weights for the plurality of estimator functions such that when the respective weights are applied to the estimator functions, a resulting sum of outputs of the plurality of estimator functions yields the probability; calculate the probability of the symbol having the particular value, including: execute the estimator functions without using the division operations to determine the outputs; and calculate a sum of the outputs as the probability; and binary arithmetic code the symbol according to the probability of the symbol having the particular value. 1. A method of coding data , the method comprising:determining a plurality of estimator functions to be used to calculate a probability of a symbol having a particular value, wherein the symbol is to be binary arithmetic coded according to the probability, and wherein the estimator functions do not include division operations;determining a plurality of weights for the plurality of estimator functions such that when the respective weights are applied to the estimator functions, a resulting sum of outputs of the plurality of estimator functions yields the probability; executing the estimator functions without using the division operations to determine the outputs of the estimator functions; and', 'calculating a sum of the outputs as the probability; and, 'calculating the probability of the symbol having the particular value, comprisingbinary arithmetic coding the symbol according to the probability of the symbol having the particular value.5. The method of claim 1 , further comprising maintaining a plurality of state elements Qto ...

ARITHMETIC CODING WITH SELECTIVE ADAPTATION FOR VIDEO CODING

Techniques are described of hybrid coders that are configured to selectively use adaptive or non-adaptive coding techniques. A video coder (e.g., video encoder or video decoder) may code (e.g., encode or decode) first video data (e.g., a syntax element or value), for coding a first block, based on an adaptive context model (e.g., one or more adaptive context models) and code second video data, for coding a second block, based on a non-adaptive context model (e.g., one or more non-adaptive context models). 1. A method of coding video data , the method comprising:coding first video data, for coding a first block, based on an adaptive context model; andcoding second video data, for coding a second block, based on a non-adaptive context model.2. The method of claim 1 , wherein coding the first video data comprises coding the first video data using entropy coding with the adaptive context model claim 1 , and wherein coding the second video data comprises coding the second video data using entropy coding with the non-adaptive context model.3. The method of claim 2 , wherein coding the first video data using entropy coding comprises coding the first video data using context-based arithmetic coding with the adaptive context model claim 2 , and wherein coding the second video data using entropy coding comprises coding the second video data using context-based arithmetic coding with the non-adaptive context model.4. The method of claim 1 , wherein the first block and the second block are in the same picture or slice.5. The method of claim 1 , wherein the first block and the second block are in different pictures or slices.6. The method of claim 1 , wherein coding the first video data based on the adaptive context model comprises:adapting one or more context models based on at least one of previous input bins or previous output bins to generate one or more adapted context models;storing the one or more adapted context models in a memory;reading the one or more adapted context ...

System, method, and format thereof for scalable encoded media delivery

A system, method, and bit-stream format thereof for delivery, scalable encoded media data is described. The scalable encoded bit-stream is formatted to have first and second portions. The first portion corresponds at least to non-media type specific scalability attributes of the original encoded media data and data structure information of a second portion and the second portion corresponds to the original scalable encoded media data arranged in a non-media type specific indexable data structure having at least one dimension. The formatted media data allows the system and method to provide seamless, flexible delivery to media destinations having a variety of receiving attributes. The media data is transcoded prior to delivery based on the receiving attributes of the media destination and non-media specific scalability attributes of the formatted scalable encoded media bit-stream.

Abducing orthesis

This invention concerns a orthotic device for abduction for persons affected by spasticity for placing between the knees and/or feet of patients. Viewed from above, this orthotic device consists of an approximately H-shaped structure with a central element (4), the length of which can be adjusted, with cross-pieces (6 and 8) which can be movably attached by means of articulations (3, 5) at both ends of the central element (4). The length of the cross-pieces (6 and 8) can also be adjusted and serve to support the knees and/or feet. The cross-pieces (6 and 8) have support elements (7, 9) movably mounted by means of articulations (11, 13 and 15, 17), which are provided with cushions in the form of foam, gel, or air pillows. The support elements can be constructed as unitary rectilinear pieces or as unitary angular pieces. Preferably these support elements (9) consist of parts (88, 90) which are connected to one another and to the cross-piece (8) in a pivoting or articulated fashion. It is possible to regulate the two support elements with respect to one another in a position which is rectilinear or angular to any degree to improve the wearing comfort for a wide array of different lying and sitting positions of the person affected by spasticity. The orthotic device for abduction is simple and economical to construct and simple and secure to install, and can be utilized in a wide variety of situations.

Coding data using different coding alphabets

A plurality of segments of the sequence are identified, wherein a segment of the plurality of segments includes at least one unsigned integer of the unsigned integer data, and wherein the plurality of segments are based in part on context within the sequence. The plurality of segments are coded, wherein each segment of the plurality of segments is coded using a different coding alphabet, wherein a coding alphabet is constrained at least by unsigned integers of a corresponding segment.

Spreader orthosis

Systems and methods for acquiring and processing image data produced by camera arrays

This disclosure is directed to camera systems including a camera array, data buses shared by the cameras, and one or more processors that process images captured by the camera array. In one aspect, a camera system ( 450 ) includes a camera array ( 452 ), a controller ( 454 ), a number of camera buses ( 458 - 465 ), and a computing device ( 456 ) connected to the controller. Each camera is connected to one or more adjacent cameras and includes one or more processors. Each camera bus connects a subset of cameras of the camera array to the controller. And each camera can be operated to send to the controller only the image data used by the computing device to generate virtual images and receive instructions from the controller over a camera bus.

System and method for music inditification

A system and method that allows users to find a song name, artist and performance without having to proceed through many false results. In one aspect, the system and method use signal matching to produce reliable matches. In another aspect, the system and method use a combination of signal and feature representation and an automatic decision rule together with a human-in-the-loop approach. A feature vector (145) and a processed time signal (140) are computed for each song in a database (130) and extracted from a microphone-recorded sample of music (102). The database songs are first sorted by feature space distance with respect to the feature vector of the recorded sample (102). The processed time signals (140) of the database songs and the processed time signal (121) from the recorded sample (102) are processed using signal matching. A decision rule presents likely matches to the user for confirmation. Using signal matching, feature-ordered search and a decision rule results in an effective framework for finding a song from a brief microphone recorded sample of music (102).

Low-complexity sign prediction for video coding

A device includes processing circuitry configured to identify a set of pre-stored residual samples in video data that is stored to a memory, to combine the set of stored residual samples to form a combination, to apply a first sign combination to transform coefficients of the combination to obtain a first hypothesis reconstruction for a current block of the video data, and to apply a second sign combination to the transform coefficients of the combination to obtain a second hypothesis reconstruction for the current block. The processing circuitry is further configured to derive respective cost functions with respect to the first and second hypothesis reconstructions, to compare the respective derived cost functions, to select, based on the comparison, either the first or second hypothesis reconstruction, and to code the current block using a sign prediction associated with the selected one of the first or second hypothesis reconstruction.

Primary transform and secondary transform in video coding

A video coding device (e.g., a video encoder or a video decoder) is configured to perform various transformations on video data. The video coding device applies a primary transform to a block of the video data, the primary transform having a first size, and the sub-block being at least a portion of the block. The video coding device determines whether application of a secondary transform, having a second size, to a sub-block of the block is allowed. Application of the secondary transform is disallowed when the first size is equal to the second size. Based on the application of the secondary transform being allowed, the video coding device applies the secondary transform to the sub-block. Application of the primary transform and the secondary transform construct a residual block in a pixel domain.

Locating system utilising adjustable transmission power in a micro-cellular network

A communications system and a method of wireless communication for mobile units (MU) within a facility having a central controller (FP server), a plurality of wireless base stations (BS1-BS11) having an adjustable transmission power. The base stations are distributed throughout the facility for wireless communication with the controller and the mobile units (MU). The controller (FP server) configures the base stations (BS1-BS11) into a plurality of micro-cells (MC1-MC6) each including at least two base stations (BS1-BS11) by adjusting the wireless transmission power of the base stations (BS1-BS11) such that at least one base station (BS1-BS11) in each micro-cell (MC1-MC6) is a member of another micro-cell (MC1-MC6). At least one base station is able to communicate with the central controller (FP server) and all mobile units (MU) within a selected area of the facility are able to communicate with at least one base station (BS1-BS11).

Low-complexity sign prediction for video coding

Sign prediction technology for video coding are generally described. An example device includes a memory configured to store video data, and processing circuitry in communication with the memory. The processing circuitry is configured to determine that a block of the video data stored to the memory is eligible to be coded using sign prediction, to perform the sign prediction with respect to one or more transform coefficients of the block only if the block meets a predetermined criterion, wherein the predetermined criterion is based on at least one of: a width of the block, a height of the block, a coding mode used to code the block, or a position of one or more sign-predicted transform coefficients within the block, and to code the block based on the sign prediction performed with respect to the block.

JADE-JPEG BASED COMPRESSION SYSTEM FOR DOCUMENTS

Autostereoscopic display of an image

In a method of creating an autostereoscopic display of an image, a plurality of images are received at a spatial-resolution-to-angular-resolution-converter. The plurality of images each have differing incident angles with respect to the spatial-resolution-to-angular-resolution-converter. An autostereoscopically displayed image is created from the plurality of images using the spatial-resolution-to-angular-resolution-converter.

Learned low-complexity adaptive quantization for video compression

A video encoder may determine a set of quantization offset parameters for a group of scaled transform coefficients for a block of video data based on side information associated with the block of video data. The video encoder may further quantize the group of scaled transform coefficients for the block of video data to generate quantized transform coefficients for the block of video data based at least in part on the set of quantization offset parameters. The video encoder may further generate an encoded video bitstream based at least in part on the quantized transform coefficients for the block of video data.

Secondary transform designs for partitioned transform units in video coding

An example device applies a primary transform to a current block of video data to create primary transform coefficients. The device determines whether intra sub-partitioning is applied to the current block of video data. The device applies a primary transform to the current block. The device also determines whether a primary transform size for the current block of video data is at least a predetermined size. Based on intra sub-partitioning being applied and the primary transform size being at least the predetermined size, the device applies a secondary transform to primary transform coefficients and codes the current block of video data based on the secondary transform.

transform encryption using compact multipath transform

como parte de um processo de codificação ou decodificação de vídeo, um dispositivo aplica uma transformação aos elementos de dados de entrada para derivar elementos de dados de saída para um bloco atual. a transformação compreende uma sequência de transformações de vetor. para cada respectiva transformação de vetor da sequência de transformações de vetor além de uma primeira transformação de vetor da sequência de transformações de vetor, valores de entrada para a respectiva transformação de vetor compreendem valores de saída da respectiva transformação de vetor anterior da sequência de transformações de vetor. cada respectiva transformação de vetor da sequência de transformações de vetor toma, adicionalmente, como entrada, um respectivo vetor de parâmetro para a respectiva transformação de vetor, o respectivo vetor de parâmetro para a respectiva transformação de vetor que compreende um ou mais parâmetros. As part of a video encoding or decoding process, a device applies a transformation to the input data elements to derive output data elements to a current block. The transformation comprises a sequence of vector transformations. For each respective vector transformation of the sequence of vector transformations In addition to a first vector transformation of the sequence of vector transformations, input values for the respective vector transformation comprise output values of the respective previous vector transformation of the sequence of vector transformations. vector. each respective vector transformation of the sequence of vector transformations additionally takes as input a respective parameter vector for the respective vector transformation, the respective parameter vector for the respective vector transformation comprising one or more parameters.

Low-complexity sign prediction for video coding

Techniques for cost function measurement with respect to sign prediction-based video coding are generally described. An example device includes processing circuitry is configured to apply first and second sign combinations to transform coefficients of a stored block of video data to obtain first and second hypothesis reconstructions of the block, to measure first and second cost functions with respect to the first and second hypothesis reconstructions by determining respective sets of pixel value gradients representing differences between samples of each hypothesis reconstruction of the block and samples of a neighboring block positioned adjacent to the block. The processing circuitry is further configured to compare the respective cost functions, to select, based on the comparison, one of the hypothesis reconstructions of the block, and to code the block using the respective sign combination associated with the selected hypothesis reconstruction.

Determination of prediction parameters for non-square blocks in video coding

RESUMEN Un método para decodificar datos de video comprende recibir un bloque de datos de video codificados mediante un modo de combinación de intrapredicción dependiente de la posición (PDPC), donde el bloque de datos de video tiene una forma no cuadrada definida por una anchura y una altura, determinar uno o más parámetros de PDPC con base en una o más de la anchura o la altura del bloque de datos de video, y decodificar el bloque de datos de video mediante el modo de PDPC y los parámetros de PDPC determinados.

Determining prediction parameters for non-square blocks in video coding

A method of decoding video data comprising receiving a block of video data encoded using a position dependent intra prediction combination (PDPC) mode, the block of video data having a non-square shape defined by a width and a height, determining one or more PDPC parameters based on one or more of the width or the height of the block of video data, and decoding the block of video data using the PDPC mode and the determined PDPC parameters.

Transform variations of multiple separable transform selection

This disclosure describes examples of extending the number of available discrete cosine transform (DCT) and discrete sine transform (DST) for encoding and decoding. A video coder may determine one or more transforms or inverse transforms to apply from a set of transforms or inverse transforms that includes DCT-2 or inverse DCT-2, DST-7 or inverse DST-7, DST-8 or inverse DST-8, DCT-3 or inverse DCT-3, DST-2 or inverse DST-2, DST-3 or inverse DST-3, DCT-4 or inverse DCT-4, DST-4 or inverse DST-4, DST-5 or inverse DST-5, DST-6 or inverse DST-6, and identity transform an inverse identity transform (IDT).

Localization system that uses adjustable transmit power in a network of microcells

Et kommunikasjonssystem og en fremgangsmåte for ttådløs kommunikasjon for mobilenheter (MU) innenfor et anlegg som har en senttal konttollenhet (FP server), flere ttådløse basestasjoner (BSl-BSll) som har justerbar sendeeffekt. Basestasjonene er fordelt over hele anlegget for ttådløs kommunikasjon med konttollenheten og de mobile enhetene (MU). Konttolleren (FP server) konfigurerer basestasjonene (BSl-BSll) i flere mikroceller (MCI -MC6) som hver inkluderer minst to basestasjoner (BSl-BSll) ved å justere den ttådløse sendeeffekten for basestasjonene (BS 1-BS11) slik at minst én basestasjon (BSl-BSl 1) i hver mikrocelle (MCI -MC6) er et medlem i en annen mikrocelle (MCI -MC6). Minst én basestasjon er i stand til å kommunisere med den senttale konttollenheten (FP server) og alle mobilenhetene (MU) innenfor et valgt område av anlegget er stand til å kommunisere med minst én basestasjon (BSl-BSll).

Extended multiple transform selection for video coding

An example device for coding video data includes a memory configured to store video data; and one or more processors implemented in circuitry and configured to: code a first codeword representing a selected transform scheme of a set of transform candidates of a multiple transform selection (MTS) scheme for a current block of video data, the selected transform scheme being a secondary transform of a set of available secondary transforms to be applied in addition to a primary transform; code a second codeword representing the secondary transform from the set of available secondary transforms; and apply the primary transform and the secondary transform during coding of residual data for the current block. The second codeword may be a value for a low-frequency non-separable transform (LFNST) syntax element.

Methods and apparatus for imaging and displaying a navigable path

Various methods for imaging and navigating a selected path are described. A method of navigating a path includes the step of identifying a selected path. At least one image stream associated with navigating the selected path is identified. The displayed image stream includes visual information corresponding to traveling the selected path. In one embodiment, display of the image stream is varied in accordance with an actual location and a speed of a traveler along the selected path. Various single pass and multi-pass systems are described for capturing the visual information associated with a path. One method of acquiring visual information includes generating first and second image streams comprising visual information representing traversal of the path. Audio cues are recorded at the same plurality of locations on each pass. The audio cues permit synchronization of the image streams to locations along the path.

Memory reduction for non-separable transforms

Techniques are described in which a decoder is configured to receive an input data block and apply an inverse non-separable transform to at least part of the input data block to generate an inverse non-separable transform output coefficient block. The applying the inverse non-separable transform comprises assigning a window, assigning a weight for each position inside the assigned window, and determining the inverse non-separable transform output coefficient block based on the assigned weights. The decoder is further configured to forming a decoded video block based on the determined inverse non-separable transform output coefficient block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

Reducing artifacts in compressed images

Systems and methods of reducing artifices in compressed images (12) are described. In one aspect, spatially-shifted forward transforms of the input image (12) are computed to generate respective sets of forward transform coefficients (C1, C2, …, CK). Nonlinear transforms (T1, T2, …, TK) are applied to the forward transform coefficients of each set (C1, C2, …, CK). Inverse transforms (C’1, C’2, …, C’K)of the sets of nonlinearly transformed forward transform coefficients are computed to generate respective intermediate images (I1, I2, …, IK). Respective measures of local spatial intensity variability are computed for pixels of each of the intermediate images (I1, I2, …, IK). An output image (40) is computed with pixel values computed based at least in part of the competed measures of the local spatial intensity variability.

Using luma information for chroma prediction with separate luma-chroma framework in video coding

Binarizing secondary transform index

An example device for decoding video data includes a memory configured to store video data and one or more processors implemented in circuitry and configured to determine a maximum possible value for a secondary transform syntax element for a block of video data, entropy decode a value for the secondary transform syntax element of the block to form a binarized value representative of the secondary transform for the block, reverse binarize the value for the secondary transform syntax element using a common binarization scheme regardless of the maximum possible value to determine the secondary transform for the block, and inverse-transform transform coefficients of the block using the determined secondary transform.