Bitmask compression method

Abstract

The invention relates to a method for performing compression and decompression of bitmasks comprising the steps of: (a) Representing a bitmask as a 2D matrix where each cell contains a single Boolean value (bit), representing either a False value or a True value; (c) Packing the bitmask as an array of numbers, each number representing the length of a continuous run of False or True values obtained while scanning the mask matrix in row-major order; (d) Storing in computerized memory means only the values of the run lengths, but not the value related to each run (False or True); and (e) If the first scanned bit of the bitmask is True, then storing the first run of False values as having 0 instances.

Dependencies are inferred from the claim text.