Fast method for HEVC (High Efficiency Video Coding) block size partition based on Bayes decision

A block division and decision-making technology, applied in image communication, digital video signal modification, electrical components, etc., can solve the problem of CU not continuing to divide

Active Publication Date: 2017-05-24
芜湖启博知识产权运营有限公司
View PDF6 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the present invention, the CU division operation is regarded as a binary classification problem, that is, W={ω N , ω P }, where ω N Indicates that the current CU does not continue to be divided, ω p Indicates that the current CU continues to be divided, and uses the minimum risk Bayesian decision to solve the binary classification problem

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
  • Fast method for HEVC (High Efficiency Video Coding) block size partition based on Bayes decision
  • Fast method for HEVC (High Efficiency Video Coding) block size partition based on Bayes decision
  • Fast method for HEVC (High Efficiency Video Coding) block size partition based on Bayes decision

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0090] Taking the block division process of 16 sequences such as People on street as an example, the proposed inventive method is described in detail.

[0091] The steps of the HEVC block partition fast algorithm based on Bayesian decision are as follows:

[0092] Step 1. Offline learning to obtain the loss function C NP and C PN and the prior probability P(ω N ) and P(ω P ).

[0093] According to the following formula, the loss matrix C and prior probability are obtained through offline learning and training for 64×64, 32×32, and 16×16 CUs:

[0094] J FRD =(SSE luma +ω chroma ×SSE chroma )+λ mode ×B mode

[0095]

[0096]

[0097] Among them, SSE luma , SSE chroma The sum of squared pixel difference errors between the original image block and the reconstructed image block representing the luminance and chrominance signals, ω chroma is the weight coefficient of the chroma component, λ mode is the Lagrangian multiplier, B mode is the number of bits require...

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 a fast method for HEVC (High Efficiency Video Coding) block size partition based on a Bayes decision. The fast method comprises the following steps: first of all, dividing a video sequence into an online learning stage and a fast partitioning stage by employing scene change detection based on an average gray scale difference; then, for the online learning stage and a video frame which occurs a scene change, in each partitioning depth, respectively extracting Jinter and Jintra of a CU (Coding Unit) as characteristic values, thereby establishing a mixed Gaussian model, wherein specific parameters of the model are determined according to an EM algorithm initialized by a K-Means algorithm; and for a to-be-partitioned CU in the fast partitioning stage, extracting the characteristic values and finding a conditional probability on whether to partition according to the mixed Gaussian model, and at last, finding the decision with a relatively small risk by employing a Bayes formula of a minimum risk to take as a judgment basis on whether the current CU is partitioned. According to the fast method disclosed by the invention, the algorithm complexity is reduced, and the coding time can be greatly reduced.

Description

technical field [0001] The invention belongs to the technical field of high-definition digital video compression encoding and decoding, and in particular relates to a fast method for dividing HEVC (High Efficiency Video Coding, high-efficiency video coding) blocks based on Bayesian decision. Background technique [0002] In the rapid development of the digital video application industry chain, in the face of the trend that video applications continue to develop towards high definition, high frame rate, and high compression rate, the limitations of the previous generation of video compression standard protocol H.264 / AVC are constantly highlighted. Therefore, JCT-VC, an organization jointly established by the International Telecommunication Organization (ITU-T) and the Moving Picture Experts Group (MPEG), proposed the next-generation video codec standard - H.265 / HEVC. Its goal is to double the compression ratio of H.264 / AVC under the premise of the same image quality. [0003...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04N19/61H04N19/176H04N19/119H04N19/147H04N19/149
CPCH04N19/119H04N19/147H04N19/149H04N19/176H04N19/61
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap