Abstract: Embodiments of this application provide a data processing method, device, filming system, and computer storage medium. The data processing method includes: obtaining a target background resource to be displayed, where the target background resource includes an image resource and/or a video resource; performing image quality optimization on an image in the background resource according to reference information, where the reference information is used for indicating a situation in a background resource display process; displaying the background resource, to use the image in the background resource as a background for filming. During filming, a terminal device performs image quality optimization on an image in a background resource and then displays a background. This process does not require post matting and synthesis and reduces production costs and time costs. Moreover, on-site filming can ensure that the background matches with lighting effects of a real scene, thereby achieving a better film result.

Abstract: A method including selecting a first definition and a second definition from multiple levels of definition, and determining a first resolution and a second resolution that respectively correspond to the first definition and the second definition; transcoding a first part of content of a media file based on the first resolution and the second resolution and according to a preset transcoding rule, and recording a first real-time quantization parameter (QP) value and a second real-time QP value in the transcoding process; determining whether the first real-time QP value and the second real-time QP value meet a preset detection rule; if the determining result is no, adjusting the first resolution and/or adjusting the second resolution; and transcoding the non-transcoded part in the media file according to the adjusted first resolution and/or second resolution. The transcoding method and apparatus increase the transcoding speed of a media file.

Abstract: A method and an apparatus for constructing a spatial tree data structure corresponding to a region. According to the present principles, a cell may include therein a point or a set of points that are determined to be duplicate points. In an embodiment the duplicate points are determined based on the size of the points included within the cell. The inclusion of duplicate points within a particular cell, rather than further subdividing the cell, provides coding efficiency. The present principles are particularly advantageous in the context of quadtree or octree type partitioning, and may be used in 3D mesh coding.

Abstract: A method and an apparatus for transcoding are disclosed. The method includes obtaining an initial resolution of a media file; determining a first definition level and a second definition level corresponding to the media file; determining a first resolution corresponding to the first definition level and a second resolution corresponding to the second definition level; pre-coding the media file using a first preset rule to obtain a first pre-coding rate corresponding to the first definition level and a second pre-coding rate corresponding to the second definition level based on the first resolution and the second resolution; adjusting the first resolution and the second resolution if the first pre-coding rate is greater than the preset coding threshold; and transcoding the media file using the first preset rule based on the adjusted first resolution and the adjusted second resolution.

Abstract: A method, an apparatus and a coder for selecting an optimal reference frame in HEVC coding are disclosed. The method includes obtaining optimal reference frames of prediction units spatially adjacent to a current prediction unit, and determining an optimal reference frame of the current prediction unit based on a correlation between optimal reference frames of the spatially adjacent prediction units in a same layer depth for prediction unit(s) of a minimum layer depth. In this way, an ergodic rate distortion cost calculation is not needed to be performed at least for the prediction unit(s) of the minimum layer depth, and the corresponding optimal reference frame is directly determined using the correlation, thus reducing the amount of calculations and enhancing the coding efficiency.

Abstract: A method including selecting a first definition and a second definition from multiple levels of definition, and determining a first resolution and a second resolution that respectively correspond to the first definition and the second definition; transcoding a first part of content of a media file based on the first resolution and the second resolution and according to a preset transcoding rule, and recording a first real-time quantization parameter (QP) value and a second real-time QP value in the transcoding process; determining whether the first real-time QP value and the second real-time QP value meet a preset detection rule; if the determining result is no, adjusting the first resolution and/or adjusting the second resolution; and transcoding the non-transcoded part in the media file according to the adjusted first resolution and/or second resolution. The transcoding method and apparatus increase the transcoding speed of a media file.

Abstract: A method and an apparatus for transcoding are disclosed. The method includes obtaining an initial resolution of a media file; determining a first definition level and a second definition level corresponding to the media file; determining a first resolution corresponding to the first definition level and a second resolution corresponding to the second definition level; pre-coding the media file using a first preset rule to obtain a first pre-coding rate corresponding to the first definition level and a second pre-coding rate corresponding to the second definition level based on the first resolution and the second resolution; adjusting the first resolution and the second resolution if the first pre-coding rate is greater than the preset coding threshold; and transcoding the media file using the first preset rule based on the adjusted first resolution and the adjusted second resolution.

Abstract: A method and apparatus for position decoding of three dimensional mesh models are described including predicting a symbol probability of a non-empty-child-cell Cl,k, where Cl,k denotes the kth cell at layer l, wherein the symbol probability is estimated based on an accuracy of a fitted plane P, decoding the non-empty-child-cell responsive to the received predicted probability of the non-empty-child-cell, subdividing the non-empty-child-cell, if the non-empty-child-cell has more than one vertex, determining if there are more unprocessed non-empty-child-cells at layer l, determining if a lowest layer of non-empty-child-cells has been reached, if there are no more unprocessed non-empty-child-cells at layer l and regenerating the three dimensional mesh model, if the lowest layer of non-empty-child-cells has been reached.

Abstract: The invention provides a method of terminable spatial tree-based position coding and decoding, and corresponding coding and decoding apparatus. The encoding method comprises: constructing a cell around the input spatial points; recursively dividing the cell into sub-cells at different layers; and assigning a symbol for each sub-cell indicating whether or not there is a spatial point within each sub-cell. The method further comprising: terminating further division of a sub-cell, if the sub-cell contains only one point and the distance between the center point of the sub-cell and the point contained in the sub-cell is smaller than the allowed maximal error.

Abstract: A 3D model can be modeled using “pattern-instance?representation. To describe the vertices and triangles, properties of the instance, for example, texture, color, and normal, are adjusted to correspond to the order in the pattern. The texture of an instance is encoded depending on its similarity with the texture of a corresponding pattern. When instance texture is identical or almost identical to the pattern texture, the instance texture is not encoded and the pattern texture will be used to reconstruct the instance texture. When the instance texture is similar to the pattern texture, the instance texture is predictively encoded from the pattern texture, that is, the difference between the instance texture and pattern texture is encoded, and the instance texture is determined as a combination of the pattern texture and the difference.

Abstract: A particular implementation forms an initial reconstructed image block from inverse quantization and inverse transform, and further refines the reconstructed image block using pixels from neighboring reconstructed blocks. The image block may be refined using a bilateral filter, whose space parameter and range parameter are adaptive to the quantization parameter. The particular implementation can be used in both encoding and decoding when reconstructing an image block. When used in encoding, the particular implementation can be used jointly with coefficient truncation, where some non-zero transform coefficients are set to zero. The number of remaining non-zero transform coefficients after coefficient truncation may be adaptive to the quantization parameter, the variance of the image block, the number of non-zero transform coefficients of the image block, and the index of the last non-zero transform coefficient in a zigzag scanning order.

Abstract: A 3D model can be modeled using “pattern-instance” representation, wherein an instance component may be represented as transformation (for example, rotation, translation, and scaling) of a pattern. To improve compression efficiency, the quantization parameters for the rotation part and translation part for transformation of an instance can be determined based on the quantization parameter used for encoding a corresponding pattern. Specifically, the quantization parameter for the rotation part may depend on the size of the instance, and the quantization parameter for the translation part may depend on the scale of translation. That is, a larger instance may use a finer quantization parameter for the rotation part. The quantization parameters are so determined that quantization errors caused by compressing the patterns, the translation part of transformation, and the rotation part of transformation are at similar levels.

Abstract: A method and apparatus for generating a bitstream representative of a 3D model, and a method and an apparatus for processing the same. A 3D model is modeled by using a using a ‘pattern-instance’ representation, wherein a pattern is a representative geometry of a repetitive structure, and the connected components belonging to the repetitive structure is call an instance of the corresponding pattern. After discovery of the repetitive structures and their transformations and properties, the present embodiments provide for generating a bitstream in either a first format or a second format. In the first format, the pattern ID and its associated transformation and property information are grouped together in the bitstream, and in the second format the pattern ID, transformation property and property information are grouped together according to information type.

Abstract: Embodiments of the disclosure provide a video processing method and a video processing apparatus. The video processing method may include estimating noise of an input video to obtain noise level information of the input video; and selecting, according to the noise level information, a denoising scheme to process the input video. The denoising scheme may merge a plurality of denoising algorithms.

Abstract: A 3D model can be modeled using “pattern-instance” representation, wherein an instance component may be represented as transformation (for example, rotation, translation, and scaling) of a pattern. Quantization errors may be introduced when encoding rotation information, causing different vertex coordinate errors at different 5 vertices of an instance. To efficiently compensate the vertex coordinate errors, the encoder decides a quantization parameter for compensating a vertex coordinate error. The quantization parameter is signaled in the bitstream as a quantization index. The quantization index, a quantization table the indicates a mapping between quantization indices and quantization parameters, and vertex coordinate errors are 10 encoded into a bitstream. The quantization table may be built based on statistical data. At the decoder, the vertex coordinate error is decoded based on a quantization parameter, which is determined from a received quantization index.

Abstract: An image recognition method is disclosed. The method includes acquiring an image detecting image information and a position of a polygon object included in the image; projecting the image information of the polygon object onto the recognition area based on the position of the polygon object and a position of a recognition area to obtain a projection image; and recognizing the projection image using an image recognition technology to obtain information in the polygon object. Projecting image information of a polygon object onto a recognition area and performing recognition thereon are equivalent to correcting a shape and a position of the polygon object in the recognition area, such that an image after the correction can be recognized. As such, a failure in recognition due to a failure of a position, a shape and the like of a polygon object in a recognition area in fulfilling the recognition requirements is solved.

Abstract: Disclosed are a method and apparatus for processing a 3D model. To preserve fine structures while de-noising a 3D mesh model, the local structural information around a vertex is captured when designing a de-noising filter. In particular, for a current vertex to be processed, a path, for example, a geodesic path, is determined between the current vertex and each neighboring vertex. For each mesh edge along the path, local variations are calculated for the two end vertices of the mesh edge using a covariance matrix, and a geometric variation for the mesh edge is calculated as the difference between the two local variations. Then structural information for the region between the current vertex and a neighboring vertex is calculated as a function of the geometric variations for mesh edges along the path, for example, as the maximum geometric variation along the path. The present principles can also be adjusted to be used in de-noising 3D point-based models.

Abstract: A particular implementation decomposes an image into a structure component and a texture component. An edge strength map is calculated for the structure component, and a texture strength map is calculated for the texture component. Using the edge strength and the texture strength, texture masking weights are calculated. The stronger the texture strength is, or the weaker the edge strength is, the more distortion can be tolerated by human eyes, and thus, the smaller the texture masking weight is. The local distortions are then weighted by the texture masking weights to generate an overall distortion level or an overall quality metric.

Abstract: To reduce the entropy of occupancy codes of an octree and improve compression efficiency, the present principles provide a method and an apparatus for traversing sub-cells in a cell according to the geometrical property of 3D models. That is, a surface smoothness measure is calculated for each sub-cell and the sub-cells are traversed in a pre-determined order of surface smoothness measures. To compute the surface smoothness measure, a sub-cell is connected to neighboring cells of its parent cell to form triangles and angles. Subsequently, the triangle areas or angular measures are used to compute the surface smoothness measure. When the connectivity information is not available in the 3D model data, the present principles also provide a method and an apparatus for estimating the connectivity.

Abstract: A 3D model can be modeled using pattern-instance representation, wherein an instance component may be represented as transformation (for example, rotation, translation, and scaling) of a pattern. Quantization errors may be introduced when encoding rotation information, causing different vertex coordinate errors at different vertices of an instance. To efficiently compensate the vertex coordinate errors, an upper bound can be estimated for the vertex coordinate error of a vertex. Based on the upper bound, the codec decides whether the vertex coordinate error of the vertex needs to be compensated, and decides a quantization parameter for compensating the vertex coordinate error if compensation is needed. The upper bound can be estimated at both the encoder and decoder, and thus, no explicit signaling is needed to indicate whether vertex coordinate error compensation is used or to indicate the quantization parameter for the vertex coordinate error.