Inter-frame image parallel coding method based on time-space domain prediction

A coding method and technology in the temporal and spatial domains, which are applied in the field of parallel coding of inter-frame images based on prediction in the temporal and spatial domains, can solve the problem of difficulty in synchronous parallel coding of adjacent coding blocks, and achieve the effect of reducing the loss of bit rate and improving the effectiveness.

Active Publication Date: 2021-10-15
康达洲际医疗器械有限公司
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The current coding block can be encoded only after the adjacent coding blocks are encoded, so it is difficult to encode the current coding block and its adjacent coding blocks synchronously.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Inter-frame image parallel coding method based on time-space domain prediction
  • Inter-frame image parallel coding method based on time-space domain prediction
  • Inter-frame image parallel coding method based on time-space domain prediction

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0039] In the existing H.265 / HEVC technology, some parallel tools can be used to improve the parallelism of motion estimation. Generally speaking, the parallel level within a largest coding unit (LCU) can be divided into: coding block group (CU group) level and coding block (CU) level parallelism. In the parallel region (PMER), there are some coded blocks whose motion vector candidates are known, and some coded blocks whose motion vector candidates are unknown. For CU group-level parallelism, candidate motion vectors for all prediction units (PUs) in the parallel region PMER can be constructed in parallel. However, for CU-level parallelism, the candidate motion vectors of the prediction units inside the CU share the legal candidate motion vectors outside the CU. At the same time, while improving the encoding parallelism, it is also necessary to balance the encoding efficiency to avoid excessive bit rate loss. Based on the above requirements, such as figure 1 As shown, the p...

Embodiment 2

[0081] In order to better prove the effectiveness of the present invention, this embodiment demonstrates the technical effect of the present invention by citing a specific simulation experiment, and compares the algorithm proposed by the present invention with the rate-distortion and Calculate the complexity to verify the performance of the algorithm. The experimental test uses standard H.265 / HEVC video sequences, which have different resolutions and image texture features. The configuration of the simulated experimental environment is shown in Table 1.

[0082] Table 1: Simulation experiment environment

[0083]

[0084] In order to evaluate the performance of the algorithm proposed by the present invention, the evaluation standard of the algorithm performance adopts BDBR and BDPSNR, and the average encoding time TS calculation method is as follows:

[0085]

[0086] in T HM ( QP i )with T pro ( QP i ) are respectively the coding time of the reference software...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an inter-frame image parallel coding method based on time-space domain prediction, which relates to the technical field of image processing, and comprises the following steps: setting a space domain reliability threshold and a time domain reliability threshold according to a data compression requirement, and obtaining a motion vector candidate list of a current frame image coding block group; acquiring a space domain reliability parameter and a time domain reliability parameter according to the motion direction of the current frame image; selecting a more appropriate motion vector in the current coding block as a shared motion vector of all coding blocks in the parallel region according to the proportion of the spatial domain reliability parameter and the time domain reliability parameter and the size relationship between the spatial domain reliability parameter and the time domain reliability parameter and the spatial domain reliability threshold and the time domain reliability threshold; and according to the shared motion vector set of each coding block, parallel coding of the coding blocks in the coding block group is carried out. According to the method, the texture complexity of the image needing to be processed during parallel coding is reduced through submergence of the depth of the coding block, so that the coding block realizes parallel coding while the bit rate loss is low.

Description

technical field [0001] The invention relates to the technical field of image processing, in particular to an inter-frame image parallel encoding method based on time-space domain prediction. Background technique [0002] Motion estimation is a technology commonly used in the process of encoding continuous video frames, such as MPEG-2, MPEG-4, H.264 / AVC, H.265 / HEVC, and it is also a very key technology in video encoding, occupying half the encoding time. In the past, many motion estimation algorithms and architectures were not suitable for high-definition and ultra-high-definition video applications. Therefore, in order to achieve a high-time-effective coding environment, it is necessary to optimize the current motion estimation algorithms and architectures, and parallel processing is a feasible scheme. However, HEVC currently only supports parallelism at the slice level, and does not support parallelism at the coding block (CU) level. [0003] The reason why the current H...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04N19/176H04N19/52
CPCH04N19/176H04N19/52
Inventor 蒋先涛蔡佩华张纪庄郭咏梅郭咏阳
Owner 康达洲际医疗器械有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products