Invention Grant
- Patent Title: Low complexity coding based on dynamic mode decision branching for largest coding units
-
Application No.: US14536216Application Date: 2014-11-07
-
Publication No.: US09706210B2Publication Date: 2017-07-11
- Inventor: In Suk Chong , Sungwon Lee , Cheng-Teh Hsieh , Marta Karczewicz
- Applicant: QUALCOMM Incorporated
- Applicant Address: US CA San Diego
- Assignee: QUALCOMM Incorporated
- Current Assignee: QUALCOMM Incorporated
- Current Assignee Address: US CA San Diego
- Main IPC: H04N19/176
- IPC: H04N19/176 ; H04N19/122 ; H04N19/139 ; H04N19/105 ; H04N19/50 ; H04N19/103 ; H04N19/137

Abstract:
Provided are techniques for low complexity video coding. For example, a video coder may be configured to calculate a first sum of absolute difference (SAD) value between a CU block and a corresponding block in a reference frame for the largest coding unit (LCU). The video coder may define conditions (e.g., background and/or homogeneous conditions) for the branching based at least in part on the first SAD value. The video coder may also determine the branching based on detecting the background or homogeneous condition, the branching including a first branch corresponding to both a first CU size of the CU block and a second CU size of a sub-block of the CU block. The video coder may then set the first branch to correspond to the first CU size, if the first CU size or the second CU size satisfies the background condition.
Public/Granted literature
- US20160134876A1 LOW COMPLEXITY CODING BASED ON DYNAMIC MODE DECISION BRANCHING FOR LARGEST CODING UNITS Public/Granted day:2016-05-12
Information query