Abstract: A method for localizing, in a space containing at least one determined object, an object element associated to a particular 2D representation element in a determined 2D image of the space, may have: deriving a range or interval of candidate spatial positions for the imaged object element on the basis of predefined positional relationships); restricting the range or interval of candidate spatial positions to at least one restricted range or interval of admissible candidate spatial positions, wherein restricting includes at least one of: limiting the range or interval of candidate spatial positions using at least one inclusive volume surrounding at least one determined object; and limiting the range or interval of candidate spatial positions using at least one exclusive volume surrounding non-admissible candidate spatial positions; and retrieving, among the admissible candidate spatial positions of the restricted range or interval, a most appropriate candidate spatial position on the basis of similarity metrics

Abstract: An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by: deriving a residual transform signal of the picture from the data stream; combining the residual transform signal with a buffered transform signal of a previous picture of the sequence so as to obtain a transform signal of the picture, the transform signal representing the picture in spectral components; and subjecting the transform signal to a spectral-to-spatial transformation, wherein the buffered transform signal comprises a selection out of spectral components representing the previous picture.

Abstract: An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by deriving a residual transform signal of the picture from the data stream; combining a residual transform signal with a buffered transform signal approximation of a previous picture of the sequence so as to obtain a transform signal representing the picture, the transform signal having a plurality of transform coefficients; and subjecting the transform signal to a spectral-to-spatial transformation. The apparatus is configured for deriving the buffered transform signal approximation from a further transform signal representing the previous picture so that the buffered transform signal approximation has approximations of further transform coefficients of the further transform signal.

Abstract: An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by deriving a residual transform signal of the picture from the data stream; combining a residual transform signal with a buffered transform signal approximation of a previous picture of the sequence so as to obtain a transform signal representing the picture, the transform signal having a plurality of transform coefficients; and subjecting the transform signal to a spectral-to-spatial transformation. The apparatus is configured for deriving the buffered transform signal approximation from a further transform signal representing the previous picture so that the buffered transform signal approximation has approximations of further transform coefficients of the further transform signal.

Abstract: An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by deriving a residual transform signal of the picture from the data stream; combining a residual transform signal with a buffered transform signal approximation of a previous picture of the sequence so as to obtain a transform signal representing the picture, the transform signal comprising a plurality of transform coefficients; and subjecting the transform signal to a spectral-to-spatial transformation. The apparatus is configured for deriving the buffered transform signal approximation from a further transform signal representing the previous picture so that the buffered transform signal approximation comprises approximations of further transform coefficients of the further transform signal.

Abstract: An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by deriving a residual transform signal of the picture from the data stream; combining a residual transform signal with a buffered transform signal approximation of a previous picture of the sequence so as to obtain a transform signal representing the picture, the transform signal comprising a plurality of transform coefficients; and subjecting the transform signal to a spectral-to-spatial transformation. The apparatus is configured for deriving the buffered transform signal approximation from a further transform signal representing the previous picture so that the buffered transform signal approximation comprises approximations of further transform coefficients of the further transform signal.

Abstract: An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by: deriving a residual transform signal of the picture from the data stream; combining the residual transform signal with a buffered transform signal of a previous picture of the sequence so as to obtain a transform signal of the picture, the transform signal representing the picture in spectral components; and subjecting the transform signal to a spectral-to-spatial transformation, wherein the buffered transform signal comprises a selection out of spectral components representing the previous picture.

Abstract: There is disclosed an encoder, a decoder, related methods, and non-transitory storage units storing instructions which, when executed by a computer, cause the computer to perform the methods. At an encoder (300), after a spatial transformation stage (304), there is obtained a spatially transformed version (306) of input image information (302) having multiple bands and, for each band, multiple transform band coefficients. After the generation of precincts (311), each comprising transform coefficients covering a predetermined spatial area of the input image information (302), there is provided a component transformation stage (320, 325), to apply one component transformation (CTr) selected (327) out of a plurality of predetermined component transformations, to each band (102?) of each precinct (311). Hence, there is obtained a spatially transformed and color transformed version (323) of the input image information (302), which is subsequently quantized and entropy encoded.

Abstract: An apparatus for rendering a visual scene includes: a content visualization stage configured: to obtain as a first input a set of images of one or more objects, and to obtain as a second input a geometry representation of the one or more objects in a 3D-space; to obtain a final image representing the visual scene from a perspective of a target position, the visual scene including the one or more objects; to consider at least one of a lighting effect and/or an object interaction effect between the one or more objects and one or more further objects contained in the visual scene; the content visualization stage is configured to obtain a target view image from the set of images irrespective of the geometry representation. The apparatus is configured to map the target view image on the geometry representation under consideration of the target position.

Abstract: There are disclosed techniques for encoding and/or decoding multiple image information, e.g. through recurrent neural network based stereo compression. In an image encoder (1), a primary block (100) encodes a primary image information, and a secondary block (300) encodes a secondary image information. States for the primary block are transformed onto states for the secondary block at a transformation block (200), which keeps into account correspondence information (e.g. disparity information) between the first image information and the second image information. In an image decoder (1b), a primary block (100) decodes an encoded version of a primary image information, and a secondary block (300) encodes an encoded version of a secondary image information. States for the primary block are transformed onto states for the secondary block at a transformation block (200), which keeps into account correspondence information (e.g.

Abstract: A coding efficiency improvement is achieved by performing bit-plane coding in a manner so that coefficient groups for which the set of coded bit-planes is predictively signaled in the datastream, are grouped in two group sets and if a signal is spent in the datastream which signals, for a group set, whether the set of coded bit-planes of all coefficient groups of the respective group set are empty, i.e. all coefficients within the respective group sets are insignificant. In accordance with another aspect, a coding efficiency improvement is achieved by providing bit-plane coding with group-set-wise insignificant signalization according to the first aspect as a coding option alternative relative to the signalization for group sets for which it is signaled that there is no coded prediction residual for the coded bit-planes for the claim groups within the respective group set.

Abstract: A coding efficiency improvement is achieved by performing bit-plane coding in a manner so that coefficient groups for which the set of coded bit-planes is predictively signaled in the datastream, are grouped in two group sets and if a signal is spent in the datastream which signals, for a group set, whether the set of coded bit-planes of all coefficient groups of the respective group set are empty, i.e. all coefficients within the respective group sets are insignificant. In accordance with another aspect, a coding efficiency improvement is achieved by providing bit-plane coding with group-set-wise insignificant signalization according to the first aspect as a coding option alternative relative to the signalization for group sets for which it is signaled that there is no coded prediction residual for the coded bit-planes for the claim groups within the respective group set.

Abstract: A method for localizing, in a space containing at least one determined object, an object element associated to a particular 2D representation element in a determined 2D image of the space, may have: deriving a range or interval of candidate spatial positions for the imaged object element on the basis of predefined positional relationships); restricting the range or interval of candidate spatial positions to at least one restricted range or interval of admissible candidate spatial positions, wherein restricting includes at least one of: limiting the range or interval of candidate spatial positions using at least one inclusive volume surrounding at least one determined object; and limiting the range or interval of candidate spatial positions using at least one exclusive volume surrounding non-admissible candidate spatial positions; and retrieving, among the admissible candidate spatial positions of the restricted range or interval, a most appropriate candidate spatial position on the basis of similarity metrics

Abstract: A method for localizing, in a space containing at least one determined object, an object element associated to a particular 2D representation element in a determined 2D image of the space, may have: deriving a range or interval of candidate spatial positions for the imaged object element on the basis of predefined positional relationships); restricting the range or interval of candidate spatial positions to at least one restricted range or interval of admissible candidate spatial positions, wherein restricting includes at least one of: limiting the range or interval of candidate spatial positions using at least one inclusive volume surrounding at least one determined object; and limiting the range or interval of candidate spatial positions using at least one exclusive volume surrounding non-admissible candidate spatial positions; and retrieving, among the admissible candidate spatial positions of the restricted range or interval, a most appropriate candidate spatial position on the basis of similarity metrics

Abstract: Concepts are presented herein how to efficiently create a suitable palette for low complexity image and video coding. A combination of the palette coding with transform coding is feasible.

Abstract: A method for adding an electrical interconnection within a three-dimensional integrated circuit (3-D IC) is disclosed. The method may include creating, within a design file of a 3-D IC that specifies a layout for a first chip of the 3-D IC, design data corresponding to a set of through-silicon via (TSV) reservation areas. The method may also include receiving an engineering change order (ECO) and releasing, in response to the ECO, at least one TSV reservation area for reuse. The method may also include adding, by re-using at least one TSV reservation area, an electrical interconnection within the design file of the first chip of the 3-D IC.

Abstract: An apparatus for rendering a visual scene includes: a content visualization stage configured: to obtain as a first input a set of images of one or more objects, and to obtain as a second input a geometry representation of the one or more objects in a 3D-space; to obtain a final image representing the visual scene from a perspective of a target position, the visual scene including the one or more objects; to consider at least one of a lighting effect and/or an object interaction effect between the one or more objects and one or more further objects contained in the visual scene; the content visualization stage is configured to obtain a target view image from the set of images irrespective of the geometry representation. The apparatus is configured to map the target view image on the geometry representation under consideration of the target position.

Abstract: A more effective confidence/uncertainty measure determination for disparity measurements is achieved by performing the determination on an evaluation of a set of disparity candidates for a predetermined position of a first picture at which the measurement of the disparity relative to the second picture is to be performed, and if this evaluation involves an accumulation of a contribution value for each of this set of disparity candidates, which contribution values depends on the respective disparity candidate and a dissimilarity to the second picture which is associated with the respective disparity candidate according to a function which has a first monotonicity with a dissimilarity associated with the respective disparity candidate, and a second monotonicity, opposite to the first monotonicity, with an absolute difference between the respective disparity candidate and a predetermined disparity having a minimum dissimilarity associated therewith among dissimilarities associated with the set of disparity candi

Abstract: An apparatus for encoding image data, the image data being decomposed into a plurality of different subbands, each subband having a plurality of coefficients, wherein a precinct has different sets of coefficients from different subbands, wherein two sets of coefficients of a first precinct belong to a first spatial region of an image represented by the image data, the apparatus having: a processor for determining, for each group of coefficients within a set, a greatest coded line index (GCLI); an encoder for encoding the greatest coded line indices associated with a first set of the first precinct in accordance with a first encoding mode, and for encoding the greatest coded line indices associated with a second set of the first precinct in accordance with a second encoding mode, the second encoding mode being different from the first encoding mode; and an output interface for outputting an encoded image signal having data on the encoded greatest coded line indices and data on the coefficients.

Abstract: Transform block coding is performed very efficiently in terms of computational complexity and compression ratio, by coding the magnitude bits of the transform coefficients distributed in a matrix, in which the magnitude bits of the spectral coefficients are arranged column-wise with the spectral coefficients of the transform block ordered along a row direction of the matrix. That is, magnitude bits within a certain column of the matrix belong to a certain spectral coefficient, while magnitude bits within a certain row of the matrix belong to a certain bit plane. In this configuration, the distribution of non-zero magnitude bits may be condensed towards one corner of the matrix, corresponding to, for instance, the least significant bit plane and corresponding to, by using a scan order among the transform coefficients which sorts the transform coefficients generally in a manner from lowest to highest frequency, the lowest frequency. Various low complexity variants are presented.