- 专利标题: Complexity reduction for 32-p and 64-p LGT
-
申请号: US17691512申请日: 2022-03-10
-
公开(公告)号: US11849115B2公开(公告)日: 2023-12-19
- 发明人: Madhu Peringassery Krishnan , Xin Zhao , Shan Liu
- 申请人: TENCENT AMERICA LLC
- 申请人地址: US CA Palo Alto
- 专利权人: TENCENT AMERICA LLC
- 当前专利权人: TENCENT AMERICA LLC
- 当前专利权人地址: US CA Palo Alto
- 代理机构: Sughrue Mion, PLLC
- 主分类号: H04N19/129
- IPC分类号: H04N19/129 ; H04N19/60 ; H04N19/184 ; G06F17/16 ; H04N19/176 ; H04L65/70 ; H04L65/75
摘要:
A method includes determining whether at least one of a height or width of a residual coding block, that corresponds to a data block of an image, is greater than or equal to a threshold; and based on determining that the at least one of the height or width of the residual coding block is greater than or equal to the threshold: obtaining a reduced-complexity residual coding block based on the residual coding block and performing transform coding of the reduced-complexity residual coding block using a line graph transform (LGT) core to perform direct matrix multiplications for each of the horizontal and vertical dimensions of the reduced-complexity residual coding block, wherein the performing includes determining an order of performing horizontal and vertical transforms to the reduced-complexity residual coding block when zero-out is enabled on LGT, depending on a ratio of width to height of the residual coding block.
公开/授权文献
- US20220201304A1 COMPLEXITY REDUCTION FOR 32-P AND 64-P LGT 公开/授权日:2022-06-23
信息查询