Basis selection for coding and decoding of data
Embodiments related to coding data using an optimal codebook and/or dictionary, and selection of the entries for the optimal dictionary are disclosed.
1 . A method of base selection, comprising:
identifying a candidate dictionary entry;
determining a substantially optimal candidate entry; and
saving the substantially optimal entry in a final dictionary.
2 . The method of claim 1 , further comprising removing the substantially optimal candidate entry from the candidate dictionary.
3 . The method of claim 1 , further comprising providing and initial final dictionary.
4 . The method of claim 1 , wherein the determining comprises finding a relatively maximum inner product of the candidate dictionary entry and a signal to be coded.
5 . The method of claim 4 , further comprising ending the process when a determined threshold has been reached.
6 . The method of claim 4 , wherein the threshold is a predetermined number of entries in the final dictionary.
7 . The method of claims 5 , wherein the threshold is a predetermined value for the relatively maximum inner product.
8 . The method of claim 1 , further comprising coding data based at least in part upon the final dictionary.
9 . The method of claim 8 , wherein coding data comprises performing matching pursuits.
10 . The method of claim 8 , further comprising discrete wavelet transforming the data.
11 . The method of claim 8 , wherein the data comprises a still image.
12 . The method of claim 8 , wherein the data comprises video.
13 . The method of claim 8 , wherein the data comprises an audio signal.
14 . The method of claim 8 , wherein the data comprises multidimensional data.
15 . A method of bases selection, comprising:
identifying a candidate dictionary entry;
determining a substantially best candidate entry;
saving the substantially best candidate entry in a final dictionary;
removing the substantially best candidate entry from the candidate dictionary; and
utilizing the final dictionary for matching pursuits coding.
16 . The method of claim 15 , wherein the determining comprises finding a relatively maximum inner product of the candidate dictionary entry and a signal to be coded.
17 . The method of claim 15 , further comprising providing and initial final dictionary.
18 . The method of claim 15 , further comprising ending the process when a determined threshold has been reached.
19 . The method of claim 18 , wherein the threshold is a predetermined number of entries in the final dictionary.
20 . The method of claims 19 , wherein the threshold is a predetermined value for the relatively maximum inner product.
21 . The method of claim 15 , further comprising coding data based at least in part upon the final dictionary.
22 . The method of claim 21 , wherein coding data comprises performing matching pursuits.
23 . The method of claim 21 , wherein the data comprises data transformed by discrete wavelet transform.
24 . An entry selection system, comprising:
a candidate dictionary;
a signal to be coded; and
a selection module configured to receive an entry from a candidate dictionary, to calculate an inner product between the entry and the signal to be coded, and to select the entry with a relatively maximum inner product for inclusion in a final dictionary.
25 . The system of claim 24 , further comprising an initial final dictionary.
26 . The system of claim 24 , wherein the signal to be coded is a wavelet transformed signal.
27 . The system of claim 24 , wherein the signal to be coded comprises a still image.
28 . The system of claim 24 , wherein the signal to be coded comprises video.
29 . The system of claim 24 , wherein the signal to be coded comprises an audio signal.
30 . The system of claim 24 , wherein the signal to be coded comprises multidimensional data.
31 . The system of claim 24 , wherein the final dictionary is utilized to code data.
32 . An article of manufacture, comprising:
a machine accessible medium, the machine accessible medium providing instructions, that when executed by a machine, cause the machine to code data, with instructions comprising:
identifying a candidate dictionary entry;
determining an substantially optimal candidate entry; and
saving the substantially optimal candidate entry in a final dictionary.
33 . The method of claim 32 , further comprising providing and initial final dictionary.
34 . The method of claim 32 , further comprising removing the substantially optimal candidate entry from the candidate dictionary.
35 . The method of claim 32 , wherein the determining comprises finding a relatively maximum inner product of the candidate dictionary entry and a signal to be coded.
36 . The method of claim 35 , further comprising ending the process when a determined threshold has been reached.
37 . The method of claim 36 , wherein the threshold is a predetermined number of entries in the final dictionary.
38 . The method of claims 37 , wherein the threshold is a predetermined value for the relatively maximum inner product.
39 . The method of claim 32 , further comprising coding data based at least in part upon the final dictionary.
40 . A system, comprising:
a means for identifying a candidate dictionary entry;
a means for determining a substantially best candidate entry;
a means for saving the substantially best candidate entry in a final dictionary;
a means for removing the substantially best candidate entry from the candidate dictionary; and
a means for utilizing the final dictionary for matching pursuits coding.