H - Electricity – 04 – N
Patent
H - Electricity
04
N
H04N 1/415 (2006.01) G06T 9/40 (2006.01) H04N 1/41 (2006.01) H04N 1/413 (2006.01) H04N 7/26 (2006.01)
Patent
CA 2289858
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 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.
Dans le cadre de cette invention portant sur un procédé ainsi que sur le dispositif correspondant permettant de coder des matrices binaires, des matrices binaires creuses notamment, on procède à un partitionnement graduel de la matrice en sous-matrices. Durant ce partitionnement graduel, les uns binaires sont décomptés pour chaque sous-matrice obtenue. Si celle-ci ne consiste pas en des symboles mêlés, un partitionnement supplémentaire de la sous-matrice n'est pas exigé. Le nombre décompté de uns binaires pour chaque sous-matrice est alors codé et envoyé. Ce procédé assure un codage efficace, notamment pour des matrices binaires creuses, notamment des images en deux niveaux ou des images en mode points.
Einarsson Torbjorn
Passaggio Filippo
Thorell Per
Ericsson Canada Patent Group
Telefonaktiebolaget Lm Ericsson
LandOfFree
Lossless image compression with tree coding does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Lossless image compression with tree coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless image compression with tree coding will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1734439