IP Library Granted Patent US 12,532,009
Granted Patent B2
US 12,532,009 · App. 18/304,214 · Granted Jan 20, 2026

Feature map encoding and decoding based on presence indicator

Inventors: Sergey Yurievich Ikonin (Moscow, RU); Alexander Alexandrovich Karabutov (Munich, DE); Mikhail Vyacheslavovich Sosulnikov (Munich, DE); Victor Alexeevich Stepin (Munich, DE); Elena Alexandrovna Alshina (Munich, DE)
Assignee: Huawei Technologies Co., Ltd.
H04N19/42H04N19/13H04N19/136H04N19/154H04N19/167H04N19/17H04N19/184H04N19/60H04N19/70
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,532,009
App. No.
18/304,214
Granted
Jan 20, 2026
Kind
B2
Abstract

The present disclosure relates to efficient signaling of feature map information for a system employing a neural network. In particular, at the decoder side, a presence indicator is obtained based on information parsed from a bitstream. Based on the value of the obtained presence indicator, further data related to a feature map region are parsed or the parsing is bypassed. The presence indicator may be, for instance, a region presence indicator indicating whether feature map data is included in the bitstream or may be a side information presence indicator indicating whether a side information related to the feature map data is included in the bitstream. Similarly, an encoding method, as well as encoding and decoding devices, are provided. Accordingly, feature map data may be processed more efficiently, by reducing decoding complexity, and the amount of transmitted data can be reduced by applying the bypassing.

Claims (88)

1 . A method for decoding, based on a bitstream, a feature map for processing by a neural network, the method comprising:

obtaining, for a region of the feature map, a region presence indicator based on information from the bitstream; and

decoding the region, wherein decoding the region includes:

parsing data from the bitstream for decoding the region based on the region presence indicator having a first value, or

bypassing parsing data from the bitstream for decoding the region based on the region presence indicator having a second value.

2 . The method according to claim 1 , wherein, based on the region presence indicator having a second value, the decoding the region further includes setting of the region according to a predetermined rule.

3 . The method according to claim 2 , wherein the predetermined rule specifies the setting of the features of the region to a constant.

4 . The method according to claim 3 , wherein the constant is zero.

5 . The method according to claim 3 , further comprising decoding the constant from the bitstream.

6 . The method according to claim 1 , wherein the bitstream includes the region presence indicator.

7 . The method according to claim 1 , further comprising obtaining side information from the bitstream,

wherein the obtaining the region presence indicator based on information from the bitstream comprises obtaining the region presence indicator based on the side information.

8 . The method according to claim 7 , further comprising:

obtaining a side information presence indicator from the bitstream; and

parsing the side information from the bitstream based on the side information presence indicator having a third value or bypassing parsing the side information from the bitstream based on the side information presence indicator having a fourth value,

wherein the side information includes the region presence indicator and/or information for being processed by a neural network to obtain an estimated probability model for use in an entropy decoding of the region.

9 . The method according to claim 8 , further comprising setting, based on the side information presence indicator having the fourth value, the side information to a predetermined side information value.

10 . The method according to claim 1 , wherein the region presence indicator is a flag capable of taking one of only two values formed by the first value and the second value.

11 . The method according to claim 1 , wherein the region is a channel of the feature map.

12 . The method according to claim 11 , further comprising:

obtaining a significance order that indicates significance of a plurality of channels of the feature map,

obtaining a last significant channel indicator, and

obtaining the region presence indicator based on the last significant channel indicator.

13 . The method according to claim 12 , wherein the last significant channel indicator corresponds to a quality indicator decoded from the bitstream and indicating quality of the coded feature map resulting from compression of the region of the feature map.

14 . The method according to claim 12 , wherein the last significant channel indicator corresponds to an index of the last significant channel within the significance order.

15 . The method according to claim 12 , wherein the obtaining the significance order comprises decoding an indication of the significance order from the bitstream.

16 . The method according to claim 12 , wherein the obtaining the significance order comprises deriving the significance order based on previously decoded information regarding source data from which the feature map has been generated.

17 . The method according to claim 12 , wherein the obtaining the significance order comprises deriving the significance order based on previously decoded information regarding a type of source data from which the feature map has been generated.

18 . The method according to claim 12 , further comprising decoding, from the bitstream, channels sorted within the bitstream according to the significance order from a most significant channel to a least significant channel.

19 . The method according to claim 1 , further comprising:

decoding, from the bitstream, region splitting information indicating a splitting of the region of the feature map into units, and

based on the region splitting information, obtaining a unit presence indicator that indicates whether or not feature map data is to be parsed from the bitstream for decoding a unit of the region.

20 . The method according to claim 19 , wherein the region splitting information for the region includes a flag indicating whether or not the bitstream comprises unit information specifying dimensions and/or position of the units of the region, the method further comprising:

obtaining, based on information from the bitstream, a respective unit presence indicator for each respective unit of the region; or

based on a value of the respective unit presence indicator for a respective unit, parsing or not parsing from the bitstream feature map data for the respective unit.

21 . The method according to claim 20 , wherein the unit information specifies hierarchic splitting of the region including at least one of quad-tree, binary-tree, ternary-tree, or triangular splitting.

22 . The method according to claim 19 , wherein the bitstream includes the unit presence indicator.

23 . The method according to claim 1 , wherein the decoding of the region includes:

extracting, from the bitstream, a last significant coefficient indicator that indicates a position of a last coefficient among coefficients of the region,

decoding significant coefficients of the region from the bitstream,

setting the coefficients following the last significant coefficient indicator according to a predefined rule, and

obtaining feature data of the region by inverse transformation of the coefficients of the region.

24 . The method according to claim 23 , wherein the inverse transformation is one of: an inverse discrete cosine transformation, an inverse discrete sine transformation, an inverse transformation obtained by modifying the inverse discrete cosine transformation or inverse discrete sine transformation, or a convolutional neural network transform.

25 . The method according to claim 1 , further comprising decoding from the bitstream a side information presence flag that indicates whether or not the bitstream includes any side information for the feature map, the side information including information to be processed by a neural network to obtain an estimated probability model for use in an entropy decoding of the feature map.

26 . The method according to claim 1 , wherein the obtaining the region presence indicator includes decoding by a context adaptive entropy decoder.

27 . A method for computer vision, the method comprising:

performing the method according to claim 1 for decoding, from the bitstream, the feature map for processing by the neural network; and

performing a computer vision task comprising processing the decoded feature map with the neural network.

28 . A computer program stored on a non-transitory processor readable medium comprising processor executable code that, when executed by one or more processors, causes the one or more processors to perform the method according to claim 1 .

29 . A device for decoding a feature map for processing by a neural network based on a bitstream, the device comprising a processing circuitry configured to perform the method according to claim 1 .

30 . The method according to claim 1 , wherein the region of the feature map corresponds to a spatially contiguous subset of an image.

31 . The method of claim 30 , wherein the value of the region presence indicator is determined based on an importance of the region of the feature map to a reconstruction quality of the image.

32 . The method of claim 31 , wherein the region presence indicator has the first value when the region of the feature map is non-flat, and

wherein the region presence indicator has the second value when the region of the feature map is flat.

33 . The method of claim 30 , wherein the value of the region presence indicator is determined based on a number of bits required to transit the region of the feature map.

34 . The method according to claim 30 , wherein the value of the region presence indicator is determined by rate-distortion optimization (RDO).

35 . The method according to claim 1 , wherein the feature map is an output of one or more convolutional layers of a convolutional neural network.

36 . A method for decoding an image, the method comprising:

performing the method according to claim 1 for decoding, from the bitstream, the feature map for processing by the neural network; and

processing the decoded feature map with the neural network to obtain the decoded image.

37 . The method according to claim 36 , wherein the feature map represents: coded image data and/or coded side information for decoding the image data.

38 . The method according to claim 36 , wherein the computer vision task is object detection, object classification, and/or object recognition.

39 . A method for encoding, into a bitstream, a feature map for processing by a neural network, the method comprising:

obtaining, for a region of the feature map, a region presence indicator; and

implementing, based on the obtained region presence indicator, a decision to perform:

encoding, based on the region presence indicator having a first value, the region of the feature map into the bitstream; or

bypassing encoding, based on the region presence indicator having a second value, of the region of the feature map into the bitstream.

40 . The method according to claim 39 , wherein the region presence indicator is indicated in the bitstream.

41 . The method according to claim 39 , wherein the deciding includes evaluating values of the features of the region.

42 . The method according to claim 39 , wherein implementing the decision is based on an impact of the region on a quality of a result of the neural network processing.

43 . The method according to claim 39 , wherein implementing the decision comprises:

determining, incrementally, a sum of bits required for transmission of the feature map, starting from bits of most significant regions and continuing to bits of regions with decreasing significance until the sum exceeds a pre-configured threshold,

encoding regions for which the sum did not exceed the pre-configured threshold and the region presence indicator having the first value for the encoded regions, and

encoding the region presence indicator having the second value for non encoded regions.

44 . A device for encoding a feature map for processing by a neural network into a bitstream, the device comprising a processing circuitry configured to perform the method according to claim 39 .

45 . A computer program stored on a non-transitory processor readable medium comprising processor executable code that, when executed by one or more processors, causes the one or more processors to perform the method according to claim 39 .

46 . A device for decoding, based on a bitstream, a feature map for processing by a neural network, the device comprising:

processing circuitry, the processing circuitry comprising:

a region presence indicator obtaining module configured to obtain, for a region of the feature map, a region presence indicator based on information from the bitstream,

a decoding module configured to decode the region by:

parsing, based on the region presence indicator having a first value, data from the bitstream for decoding the region, and

bypassing parsing, based on the region presence indicator having a second value, of data from the bitstream for decoding the region.

47 . A device for encoding, into a bitstream, a feature map for processing by a neural network, the device comprising:

processing circuitry, the processing circuitry comprising:

a feature map region presence indicator obtaining module configured to obtain the feature map region presence indicator,

an encoding control module configured to implement a decision, based on the obtained feature map region presence indicator, to:

encode, based on the feature map region presence indicator having a first value, the region of the feature map into the bitstream;

bypass encoding, based on the feature map region presence indicator having a second value, of the region of the feature map into the bitstream.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 29, 2025
From: IKONIN, SERGEY YURIEVICH; KARABUTOV, ALEXANDER ALEXANDROVICH; SOSULNIKOV, MIKHAIL VYACHESLAVOVICH; STEPIN, VICTOR ALEXEEVICH; ALSHINA, ELENA ALEXANDROVNA
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 072721/0094 →
Priority Claims (1)
WO PCT/RU2020/000559 · Oct 20, 2020 · international
Continuity (2)
Continuation PCTRU2021050347 · Oct 20, 2021
Related Publication 20230262243A1 · Aug 17, 2023
References Cited (66)
US 20160358069A1 · Brothers et al. · 2016 [cited by applicant]
US 20180027243A1 · Haghani et al. · 2018 [cited by applicant]
US 20180270502A1 · Mukherjee · 2018 [cited by examiner]
US 20190238893A1 · Covell · 2019 [cited by examiner]
US 20200021813A1 · Tanner et al. · 2020 [cited by applicant]
US 20200092552A1 · Coelho et al. · 2020 [cited by applicant]
US 20200162736A1 · Seok · 2020 [cited by examiner]
US 20200304832A1 · Ramasubramonian et al. · 2020 [cited by applicant]
US 20210004993A1 · Sugio · 2021 [cited by examiner]
US 20210021823A1 · Na · 2021 [cited by examiner]
US 20210027505A1 · Yano · 2021 [cited by examiner]
US 20230085554A1 · Kim et al. · 2023 [cited by applicant]
CN 110971901A · 2020 [cited by applicant]
EP 3621304A1 · 2020 [cited by applicant]
EP 3672241A1 · 2020 [cited by applicant]
JP 2010515300A · 2010 [cited by applicant]
JP 2020191077A · 2020 [cited by applicant]
TW 200910987A · 2009 [cited by applicant]
WO 2021172956A1 · 2021 [cited by applicant]
Hu et al., “Learning End-to-End Lossy Image Compression: A Benchmark,” arXiv:2002.03711v2 [eess.IV]0, Total 18 pages (Feb. 2020). [cited by applicant]
C. E. Shannon, “A Mathematical Theory of Communication,” Reprinted with corrections from The Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, Total 55 pages (Jul. and Oct. 1948). [cited by applicant]
Gersho et al., “Vector Quantization and Signal Compression,” Springer Link, Total 7 pages (Nov. 1992). With an English Abstract. [cited by applicant]
Wintz et al., “Transform Picture Coding,” Proceedings of the IEEE, vol. 60, No. 7, Total 18 pages, Institute of Electrical and Electronics Engineers, New York, New York (Jul. 1972). [cited by applicant]
Netravali et al., “Picture Coding: A Review,” Proceedings of the IEEE, vol. 68, No. 3, Total 48 pages Institute of Electrical and Electronics Engineers, New York, New York (Mar. 1980). [cited by applicant]
Balle et al., “End-To-End Optimized Image Compression,” Published as a conference paper at ICLR 2017, Total 27 pages (Mar. 3, 2017). [cited by applicant]
Balle et al, “Density Modeling of Images Using a Generalized Normalization Transformation,” Published a.s a conference paper at ICLR 2016, Total 15 pages (Feb. 29, 2016). [cited by applicant]
Kingma et al., “Auto-Encoding Variational Bayes,” arXiv:1312.6114v10 [stat.ML], Total 14 pages (May 1, 2014). [cited by applicant]
Rezende et al., “Stochastic Backpropagation and Approximate Inference in Deep Generative Models,” arXiv:1401.4082v3 [stat.ML], Total 14 pages (May 30, 2014). [cited by applicant]
Wiegand et al., “Overview of the H.264/AVC Video Coding Standard,” 560 IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, No. 7, Total 17 pages Institute of Electrical and Electronics Engineers, Ne… [cited by applicant]
Sullivan et al., Overview of the High Efficiency Video Coding (HEVC) Standard, IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, No. 12, Total 20 pages Institute of Electrical and Electronics Engi… [cited by applicant]
Bross et al., “Versatile Video Coding (Draft 7),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, Document: JVET-P2001-vE, Total 492 pages,International Union… [cited by applicant]
Choi et al., “Near-Lossless Deep Feature Compression for Collaborative Intelligence,” arXiv:1804.09963v1 [eess.IV], Total 7 pages (Apr. 26, 2018). [cited by applicant]
Kang et al., “Neurosurgeon: Collaborative Intelligence Between the Cloud and Mobile Edge,” ASPLOS ″17, Xi″an, China, Total 15 pages (Apr. 8-12, 2017). [cited by applicant]
Eshratifar et al., “JointDNN: An Efficient Training and Inference Engine for Intelligent Mobile Cloud Computing Services,” arXiv:1801.08618v1 [cs.DC], Total 13 pages (Jan. 25, 2013). [cited by applicant]
Choi et al., “Deep Feature Compression for Collaborative Object Detection,” ICIP 2018, Total 5 pages (Sep. 2018). [cited by applicant]
Redmon et al., “YOLO9000: Better, Faster, Stronger,” CVPR 2017 paper, Total 9 pages (Submitted Dec. 2016). [cited by applicant]
Bossen et al., “HEVC Complexity and Implementation Analysis,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, No. 12, Total 12 pages Institute of Electrical and Electronics Engineers, New York, … [cited by applicant]
Luo et al., “DeepSIC: Deep Semantic Image Compression,” arXiv:1801.09468v1 [cs.CV], Total 9 pages (Jan. 29, 2018). [cited by applicant]
Marpe et al., “Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, No. 7, Total 17 pages Institute of El… [cited by applicant]
“Cisco Visual Networking Index: Forecast and Methodology, 2016-2021,” White paper, Cisco public, Total 17 pages (Jun. 6, 2017). [cited by applicant]
Wu et al., “Compressed Video Action Recognition,” arXiv:1712.00636v2 [cs.CV], Total 14 pages (Mar. 29, 2018). [cited by applicant]
Han et al., “Deep Compression: Compressing Deep Neural Networks With Pruning, Trained Quantization and Huffman Coding,” Published as a conference paper at ICLR 2016, Total 14 pages (Feb. 15, 2016). [cited by applicant]
Choi et al., “Near-Lossless Deep Feature Compression for Collaborative Intelligence,” arXiv:1804.09963v2 [eess.IV], Total 7 pages (Jun. 15, 2018). [cited by applicant]
Toderici et al., “Variable Rate Image Compression With Recurrent Neural Networks,” Published as a conference paper at ICLR 2016, Total 12 pages (Mar. 1, 2016). [cited by applicant]
Toderici et al., “Full Resolution Image Compression with Recurrent Neural Networks,” CVPR 2017 paper, Total 9 pages (Nov. 2017). [cited by applicant]
Agustsson et al., “Soft-to-Hard Vector Quantization for End-to-End Learning Compressible Representations,” 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, Total 11 pages (Apr. … [cited by applicant]
Balle et al., Variational Image Compression With a Scale Hyperprior, arXiv:1802.01436v2 [eess.IV] Total 23 pages (May 1, 2018). [cited by applicant]
Johnston et al., “Improved Lossy Image Compression with Priming and Spatially Adaptive Bit Rates for Recurrent Networks,” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Total 9 pages (Jun. 2018). [cited by applicant]
Theis et al., “Lossy Image Compression With Compressive Autoencoders,” arXiv:1703.00395v1 [stat.ML], Total 19 pages (Mar. 1, 2017). [cited by applicant]
Li et al., “Learning Convolutional Networks for Content-weighted Image Compression,” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Jun. 18-23, 2018, Total 10 pages (Dec. 2018). [cited by applicant]
Rippel et al., “Real-Time Adaptive Image Compression,” Proceedings of the 3th International Conference on Machine, Learning, Sydney, Australia, PMLR 70, Total 9 pages (May 2017). [cited by applicant]
Agustsson et al., “Generative Adversarial Networks for Extreme Learned Image Compression,” arXiv:1804.02958v3 [cs.CV], Total 26 pages (Aug. 18, 2019). [cited by applicant]
Wallace, “The JPEG Still Picture Compression Standard,” IEEE Transactions on Consumer Electronics, vol. 38, No. 1, Total 17 pages Institute of Electrical and Electronics Engineers, New York, New York (Feb. 1, 1992). [cited by applicant]
Skodras et al., “The JPEG 2000 Still Image Compression Standard,” IEEE, Total 23 pages Institute of Electrical and Electronics Engineers, New York, New York (Sep. 2001). [cited by applicant]
F. Bellard, “BPG image format,” http://bellard.org/bpg/, Release 0.9.8 is available, Total 2 pages (Apr. 21, 2018). [cited by applicant]
Xue et al., “Video Enhancement with Task-Oriented Flow,” arXiv:1711.09078v3 [cs.CV], Total 20 pages (Nov. 10, 2019). [cited by applicant]
Lu et al., “DVC: An End-to-end Deep Video Compression Framework,” CVPR 2019 paper, Total 10 pages (Jan. 2019). [cited by applicant]
Bross et al., “Versatile Video Coding (Draft 10),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 19th Meeting: by teleconference, JVET-S2001-v, Total 551 pages, International Union o… [cited by applicant]
Choi et al., “Text of ISO/IEC CD 23094-1, Essential Video Coding,” Information technology—General Video Coding—Part 1: Essential Video Coding, International Organisation for Standardisation Organisation Internationale d… [cited by applicant]
“Artificial neural network,” Wikipedia, Total 38 pages (Date of page creation 12:50, Oct. 2, 2001). [cited by applicant]
“Autoencoder,” Wikipedia, Total 14 pages (Date of page creation 09:11, Sep. 4, 2006). [cited by applicant]
“Convolutional neural network,” Wikipedia, Total 36 pages (Date of page creation 15:20, Aug. 31, 2013). [cited by applicant]
“Lagrange multiplier,” Wikipedia, Total 15 pages (Date of page creation 19:32, Dec. 20, 2002). [cited by applicant]
“Quadtree,” Wikipedia, Total 12 pages ( Date of page creation 04:22, Apr. 5, 2004). [cited by applicant]
Liu et al., “PiCANet: Learning Pixel-wise Contextual Attention for Saliency Detection,” CVPR 2018 paper, Total 10 pages (Apr. 2018). [cited by applicant]
Ma et al., “Convolutional Neural Network-Based Arithmetic Coding for HEVC Intra-Predicted Residues,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 30, No. 7, total 16 pages, Institute of Electrica… [cited by applicant]
Cited By (1)
US 12,739,398