US 12,348,732 B2
Encoder, a decoder and corresponding methods using compact MV storage
Maxim Borisovitch Sychev, Moscow (RU); Timofey Mikhailovich Solovyev, Munich (DE); Alexander Alexandrovich Karabutov, Munich (DE); Sergey Yurievich Ikonin, Moscow (RU); and Jianle Chen, San Diego, CA (US)
Assigned to HUAWEI TECHNOLOGIES CO., LTD., Shenzhen (CN)
Filed by HUAWEI TECHNOLOGIES CO., LTD., Guangdong (CN)
Filed on Oct. 9, 2023, as Appl. No. 18/483,175.
Application 18/483,175 is a continuation of application No. 17/358,572, filed on Jun. 25, 2021, granted, now 11,818,357.
Application 17/358,572 is a continuation of application No. PCT/RU2019/050260, filed on Dec. 27, 2019.
Claims priority of provisional application 62/786,344, filed on Dec. 29, 2018.
Claims priority of provisional application 62/786,343, filed on Dec. 29, 2018.
Prior Publication US 2024/0040126 A1, Feb. 1, 2024
Int. Cl. H04N 19/137 (2014.01); H04N 19/159 (2014.01); H04N 19/176 (2014.01); H04N 19/46 (2014.01); H04N 19/503 (2014.01)
CPC H04N 19/137 (2014.11) [H04N 19/159 (2014.11); H04N 19/176 (2014.11); H04N 19/46 (2014.11); H04N 19/503 (2014.11)] 19 Claims
OG exemplary drawing
 
1. A motion vector compression method, comprising:
obtaining an 18 bit temporal motion vector;
determining a compressed motion vector of the 18 bit temporal motion vector when an indicator indicates the 18 bit temporal motion vector need to be compressed, wherein a binary representation of the compressed motion vector comprising an exponent part or a mantissa part, wherein the exponent part comprises N bits, the mantissa part comprises M bits, wherein N is a non-negative integer and M is a positive integer, and wherein the representation of the compressed motion vector is 10 bits; and
performing a temporal motion vector prediction (TMVP) using the compressed motion vector;
wherein the determining a compressed motion vector, comprises:
removing least significant bits (LSB) by clipping the obtained temporal motion vector.