Back to Search
Document details
AHG11: Complexity Reduction on Neural-Network Loop Filter
Abstract
JVET-AA0080 proposes to use CP decomposition plus fusing adjacent 1x1 convolution to reduce the complexity of NNLF. In addition, it also proposes to split architecture for luma and chroma components between input network and output network. Simulation shows that using JVET-X0140 low complexity model (EE1-1.4.1) as baseline, whose worse case block level complexity is 33.6 KMAC/Pixel, the proposal can achieve the AI luma gain about 5% with worst case complexity of 17.7 KMAC/pixel for (24L,8C) split. This contribution applies the same techniques proposed in JVET-AA0080 and investigates the RA case. The same baseline model shows the BD-rate saving of (Y, Cb, Cr, respectively) for RA compared to EE1. For the proposed complexity reduction techniques, when compared against EE1 , the BD-Rate saving for RA (Y, Cb Cr, respectively) is:
ARCHIVE
:
JVET-AB0136-NNLF-complexity_v1.pdf
JVET-AB0136_JVET-X0140_vs_CPFused-X0140.xlsm
JVET-AB0136_NNLF_complexity_v2.docx
JVET-AB0136_VTM-NNVC_vs_CPFused-splitmodel20L8C.xlsm
JVET-AB0136_VTM-NNVC_vs_CPFused-splitmodel24L8C.xlsm
JVET-AB0136_VTM-NNVC_vs_CPFused-X0140.xlsm
~$ET-AB0136_NNLF_complexity_v2.docx
~WRL0259.tmp
Citation