Dimensional vector and variable resolution quantization
First Claim
1. A computer system for coding and decoding digital signals by vector quantization at variable rate defining a variable resolution, comprising:
- a computer readable medium storing a dictionary comprising;
codevectors of variable dimension; and
inter-embedded sub-dictionaries of increasing resolution of a given dimension, wherein each sub-dictionary comprises a union of a) a first set consisting of codevectors constructed by inserting, into codevectors of dictionaries of lower dimension, elements taken from a finite set of real numbers according to a finite collection of predetermined insertion rules, and of b) a second set consisting of codevectors that may not be obtained by insertion into codevectors of lower dimension of the elements of said finite set according to said collection of insertion rules.
1 Assignment
0 Petitions
Accused Products
Abstract
The invention relates to compression coding and/or decoding of digital signals, in particular by vector variable-rate quantisation defining a variable resolution. For this purpose an impulsion dictionary comprises: for a given dimension, increasing resolution dictionaries imbricated into each other and, for a given dimension, a union of: a totality (D′i<N>) of code-vectors produced, by inserting elements taken in a final set (A) into smaller dimension code-vectors according to a final set of predetermined insertion rules (F1) and a second totality of code-vectors (Y′) which are not obtainable by insertion into the smaller dimension code vectors according to said set of the insertion rules.
-
Citations
32 Claims
-
1. A computer system for coding and decoding digital signals by vector quantization at variable rate defining a variable resolution, comprising:
a computer readable medium storing a dictionary comprising; codevectors of variable dimension; and inter-embedded sub-dictionaries of increasing resolution of a given dimension, wherein each sub-dictionary comprises a union of a) a first set consisting of codevectors constructed by inserting, into codevectors of dictionaries of lower dimension, elements taken from a finite set of real numbers according to a finite collection of predetermined insertion rules, and of b) a second set consisting of codevectors that may not be obtained by insertion into codevectors of lower dimension of the elements of said finite set according to said collection of insertion rules. - View Dependent Claims (2, 3)
-
4. A method for operating a coding-decoding device having a processor by vector quantization at variable rate defining a variable resolution, comprising:
-
forming, using the processor, a dictionary comprising codevectors of variable dimension in which, for a given dimension, the method comprises; a) forming a first set consisting of codevectors by performing an operation selected from the group consisting of inserting into and deleting from codevectors of dictionaries of dimension elements comprising at least one of lower and higher dimension elements taken from a finite set of real numbers according to a finite collection of predetermined operation rules selected from the group consisting of insertion rules and deletion rules, b) constructing a first, intermediate, dictionary comprising at least said first set, for said given dimension, and c) adapting said dictionary for use with at least one given resolution, wherein a second, definitive, dictionary is constructed, on the basis of the intermediate dictionary, by performing at least one of embedding and simplification of dictionaries of at least one of increasing and decreasing resolutions, the dictionaries of increasing resolutions being inter-embedded from the dictionary of smallest resolution up to the dictionary of greatest resolution. - View Dependent Claims (5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 31)
-
-
18. A method for operating a coding-decoding device having a processor, comprising:
-
forming, using the processor, a dictionary comprising codevectors of variable dimension in which, for a given dimension N of codevectors, the method comprises; constructing a first, intermediate, dictionary still of dimension N′
but of at least one of higher and lower resolution rN on the basis of an initial dictionary of resolution rn and of dimension N′
by performing at least one of embedding and simplification of dictionaries of at least one of increasing and decreasing resolutions, so as to substantially attain the resolution rN of said first dictionary,forming, to attain the given dimension N, a first set consisting of codevectors by performing an operation selected from the group consisting of inserting into and deleting from codevectors of the first dictionary of dimension N′
at least one of lower and higher than said given dimension N elements taken from a finite set of real numbers according to a finite collection of predetermined operation rules is constructed,and subsequent to a possible step of definitive adaptation to the resolution rN, constructing a second, definitive, dictionary comprising at least said first set for said given dimension N.
-
-
21. A method for operating a coding-decoding device having a processor by vector quantization at variable rate defining a variable resolution, comprising:
-
forming, using the processor, a dictionary comprising codevectors of variable dimension and, in which, for a given dimension; a) forming a first set consisting of codevectors by performing an operation selected from the group consisting of inserting into and deleting from codevectors of dictionaries of dimension elements comprising at least one of lower and higher dimension elements taken from a finite set of real numbers according to a finite collection of predetermined operation rules, b) constructing a first, intermediate, dictionary comprising at least said first set said given dimension, c) adapting said dictionary for a use with at least one given resolution, wherein a second, definitive, dictionary is constructed, on the basis of the intermediate dictionary, by performing at least one of embedding and simplification of dictionaries of at least one of increasing and decreasing resolutions, the dictionaries of increasing resolutions being inter-embedded from the dictionary of smallest resolution up to the dictionary of greatest resolution; in which, for a given dimension N; a′
0) obtaining an initial dictionary of initial dimension n, higher than said given dimension N,a′
1) constructing a first set, of dimension n−
i, where i is a non negative integer, by selecting and extracting of possible codevectors of dimension n−
i from the dictionary of dimension n, according to a finite collection of predetermined deletion rules,a′
2) providing a second set consisting of codevectors of dimension n−
i, that may not be obtained by deletion, from the codevectors of the initial dictionary, of the elements of said finite set with said collection of deletion rules,a′
3) constructing an intermediate dictionary, of dimension n−
i comprising a union of said first set and of said second set, anda′
4) repeating steps a′
1) to a′
3) at most n−
N−
1 times, with said intermediate dictionary in the guise of initial dictionary, down to said given dimension N.
-
-
22. A method for operating a coding-decoding device having a processor by vector quantization at variable rate defining a variable resolution, comprising:
-
forming, using the processor, a dictionary comprising codevectors of variable dimension in which, for a given dimension, the method comprising; a) forming a first set consisting of codevectors by performing an operation selected from the group consisting of inserting into and deleting from codevectors of dictionaries of dimension elements comprising at least one of lower and higher dimension elements taken from a finite set of real numbers according to a finite collection of predetermined operation rules, b) constructing a first, intermediate, dictionary comprising at least said first set, for said given dimension, and c) adapting said dictionary to a use with at least one given resolution, wherein a second, definitive, dictionary is constructed, on the basis of the intermediate dictionary, by performing at least one of embedding and simplification of dictionaries of at least one of increasing and decreasing resolutions, the dictionaries of increasing resolutions being inter-embedded from the dictionary of smallest resolution up to the dictionary of greatest resolution;
whereinstep c) further comprises; c0) obtaining an initial dictionary of initial resolution rn, lower than said given resolution rN, c1) constructing on the basis of the initial dictionary, an intermediate dictionary of resolution rn+1 higher than the initial resolution rn, and c2) repeating step c1) until the given resolution rN is attained. - View Dependent Claims (23, 24, 25)
-
-
26. A method for operating a compression coding-decoding device having a processor, comprising:
-
searching for a codevector (xj) which is the nearest neighbour of an input vector y=(y0, . . . , yk, . . . , yj−
1) in a dictionary (Dij) of given dimension (j),reconstituting, using the processor, said codevectors by using at least one correspondence table making it possible to reconstitute any codevector of the dictionary of said given dimension, using indices of a collection of operation rules selected from the group consisting of insertion rules and deletion rules and indices identifying elements of a set of codevectors that may not be obtained by application of the operation to codevectors of at least one of lower and higher dimension than the given dimension according to said collection of operation rules, CO1) reconstituting, for a current index (mj) of said codevector (xj) sought, at least partial of a codevector of index (m′
) corresponding to said current index (mj), at least through the prior reading of the indices (j′
, m′
, lr) appearing in the correspondence tables making it possible to formulate said dictionary,CO2) calculating at least on coding, a distance between the input vector and the codevector reconstituted in step CO1), CO3) repeating steps CO1) and CO2), at least on coding, for all the current indices in said dictionary, CO4) identifying, at least on coding, of the index (mmin) of the codevector at least partially reconstituted whose distance (dmin), calculated in the course of one of the iterations of step CO2), with the input vector is the smallest, and CO5) determining at least on decoding, of the nearest neighbour of the input vector (y) in the guise of codevector (xj) whose index (mmin) has been identified in step CO4). - View Dependent Claims (27, 28, 29, 30, 32)
-
Specification