Lossless image compression with tree coding
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Apr 16, 2002
Issued Date -
N/A
app pub date -
Nov 5, 1999
filing date -
May 13, 1997
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
In a method and a device for coding binary matrices, in particular sparse binary matrices, a matrix is gradually partitioned into sub-matrices During the gradual partitioning the number of binary ones are counted for each resulting sub-matrix. If a resulting sub-matrix does not consist of mixed symbols no further partitioning of that sub-matrix is required. The counted number of binary ones for each sub-matrix is then coded and transmitted. The method provides an efficient coding particularly for sparse binary matrices such as bi-level images or bit maps.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully