Some content of this application is unavailable at the moment.
If this situation persist, please contact us atFeedback&Contact
1. (WO1993010634) DATA COMPRESSION SYSTEM
Latest bibliographic data on file with the International Bureau

Pub. No.: WO/1993/010634 International Application No.: PCT/US1992/008184
Publication Date: 27.05.1993 International Filing Date: 01.10.1992
Chapter 2 Demand Filed: 23.04.1993
IPC:
G06T 9/00 (2006.01) ,G06T 9/40 (2006.01) ,H04N 7/26 (2006.01)
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
T
IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
9
Image coding, e.g. from bit-mapped to non bit-mapped
G PHYSICS
06
COMPUTING; CALCULATING; COUNTING
T
IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
9
Image coding, e.g. from bit-mapped to non bit-mapped
40
Tree coding, e.g. quadtree, octree
H ELECTRICITY
04
ELECTRIC COMMUNICATION TECHNIQUE
N
PICTORIAL COMMUNICATION, e.g. TELEVISION
7
Television systems
24
Systems for the transmission of television signals using pulse code modulation
26
using bandwidth reduction
Applicants:
GENERAL ELECTRIC COMPANY [US/US]; 1 River Road Schenectady, NY 12345, US
Inventors:
SHAPIRO, Jerome, Mark; US
Agent:
TRIPOLI, Joseph, S. ; GE & RCA Licensing Management Operation, Inc. CN 5312 Princeton, NJ 08540, US
Priority Data:
790,86012.11.1991US
Title (EN) DATA COMPRESSION SYSTEM
(FR) SYSTEME DE COMPRESSION DE DONNEES
Abstract:
(EN) A data processing system augments compression of non-zero values of significant coefficients by coding (1410, 1412) entries of a significance map independently of coding the values of significant non-zero coefficients. A dedicated symbol represents a zerotree structure encompassing a related association of insignificant coefficients within the tree structure, thereby compactly representing each tree of insignificant coefficients. The zerotree symbol represents that neither a root coefficient of the zerotree structure nor any descendant of the root coefficient has a magnitude greater than a given reference level. The zerotree structure is disclosed in the context of a pyramid-type image subband processor (1408) together with successive refinement quantization and entropy coding (1418) to facilitate data compression.
(FR) Un système de traitement de données permet d'accroître la compression des valeurs non nulles de coefficients significatifs par un codage (1410, 1412) des entrées concernant une carte de données significatives indépendant du codage des valeurs se rapportant à des coefficients non nuls significatifs. Un symbole spécifique représente une structure en arbre zéro qui englobe une association apparentée de coefficients non significatifs au sein de la structure en arbre, ce qui permet de représenter chaque arbre de coefficients non significatifs de façon compacte. Le symbole arbre zéro indique que ni un coefficient de racine de la structure à arbre zéro ni un quelconque descendant de ce coefficient de racine ne comporte d'ordre de grandeur supérieur à un niveau de référence donné. On décrit la structure en arbre zéro dans le contexte d'un processeur (1408) de sous-bande d'image du type pyramide, ainsi que le codage (1418) portant sur la quantification par approximations et affinements successifs et sur l'entropie afin de faciliter la compression des données.
Designated States: CA, JP, KR, PL, RU
European Patent Office (AT, BE, CH, DE, DK, ES, FR, GB, GR, IE, IT, LU, MC, NL, SE)
Publication Language: English (EN)
Filing Language: English (EN)
Also published as:
JP3108808JPH07501664CA2123090KR1002745280000*