Back to results
US 8,897,558 B2Granted
Method of compressing a block-based binary image
AssigneeSamsung Electronics Co., Ltd.
InventorsSang-hoon Ha, Sang-jo Lee
Life of this patent
Estimating the term…
Abstract
A method of compressing a 2×2 block based binary image is provided. The method includes: determining whether pixels included in a block are included in existing patterns; generating the number N of the pixels included in the existing patterns (N is a natural number); when N is more than a predetermined value, compressing the block with a binary bit stream comprising information about patterns of the pixels included in the existing patterns and color information about the pixels having a new pattern. The method of compressing a 2×2 block based binary image reduces information damage which may occur during compression and restoration of the binary pattern so that the difference in picture quality between an original image and the restored image can be visibly improved.
Claims16
A method of compressing a block based binary image comprising:
- determining whether each of a plurality of pixels included in each of a plurality of blocks has one of existing patterns included in an existing block, by an application processor;
- in each of the plurality of blocks, counting a number of pixels that have one of the existing patterns, by an application processor;
- selecting a compressing process based on a result of the counting the number of pixels that have one of the existing patterns, by an application processor;
- and
- compressing said each of the plurality of blocks by the selected compressing process, by an application processor;
- and
- determining whether the counted number of pixels that have one of the existing patterns in each of the plurality of blocks is equal to or more than a predetermined value,
- wherein, if the counted number of pixels that have one of the existing patterns is equal to or more than the predetermined value, said each of the plurality of blocks is compressed into a binary bit stream,
- wherein the binary bit stream includes information on the number of pixels that have one of the existing patterns, and
- wherein the binary bit stream further includes mode information indicating whether the binary bit stream includes compressed binary image information, sub-mode information indicating whether the binary bit stream uses the existing patterns, pattern information indicating whether each of the pixels has the existing patterns, pixel pattern-type information indicating which pattern each of the pixels has, and a plurality of color information for the pixels that do not have the existing patterns, each of the plurality of color information containing an R (Red) value, a G (Green) value or a B (Blue) value, respectively.
7 more elements
A method of compressing a 2×2 block based binary image comprising:
- determining whether each of a plurality of pixels included in each of a plurality of blocks has one of existing patterns included in an existing block, by an application processor;
- in each of the plurality of blocks, counting a number of pixels that have one of the existing patterns, by an application processor;
- selecting a compressing process based on a result of the counting the number of pixels that have one of the existing patterns, by an application processor;
- compressing said each of the plurality of blocks by the selected compressing process, by an application processor, and
- determining whether the counted number of pixels that have one of the existing patterns in each of the plurality of blocks is equal to or more than a predetermined value,
- wherein, if the counted number of pixels that have one of the existing patterns is equal to or more than the predetermined value, said each of the plurality of blocks is compressed into a binary bit stream,
- wherein the binary bit stream includes information on the number of pixels that have one of the existing patterns, and
- wherein the binary bit stream further includes mode information indicating whether the binary bit stream includes compressed binary image information, sub-mode information indicating whether the binary bit stream uses the existing patterns, pattern information indicating whether each of the pixels has the existing patterns, pixel pattern-type information indicating which pattern each of the pixels has, and a plurality of color information for the pixels that do not have the existing patterns, each of the plurality of color information containing an R (Red) value, a G (Green) value or a B (Blue) value, respectively.
5 more elements
A method of compressing a block based binary image comprising:
- determining whether each of a plurality of pixels included in each of a plurality of blocks has one of existing patterns included in an existing block;
- in each of the plurality of blocks, counting a number of pixels that have one of the existing patterns;
- determining whether the counted number of pixels that have one of the existing patterns is equal to or more than a predetermined value;
- and
- compressing said each of the plurality of blocks by a differential pulse code modulation if the counted number of pixels that have one of the existing patterns is less than the predetermined value, or compressing said each of the plurality of blocks into a binary bit stream if the counted number of pixels that have one of the existing patterns is equal to or greater than the predetermined value,
- wherein the binary bit stream includes information on the number of pixels that have one of the existing patterns, and
- wherein the binary bit stream further includes mode information indicating whether the binary bit stream includes compressed binary image information, sub-mode information indicating whether the binary bit stream uses the existing patterns, pattern information indicating whether each of the pixels has the existing patterns, pixel pattern-type information indicating which pattern each of the pixels has, and a plurality of color information for the pixels that do not have the existing patterns, each of the plurality of color information containing an R (Red) value, a G (Green) value or a B (Blue) value, respectively.
4 more elements
Dependencies are inferred from the claim text.