Finding sparse representation of quantized frame coefficients using 0-1 integer programming
The use of overcomplete dictionaries, or frames, has received increased attention in low-bit-rate compression. Several vector selection algorithms, such as Matching Pursuit, Orthogonal Matching Pursuit and FOCUSS have been developed to get sparse representations of signals. In these algorithms, cont...
Uložené v:
| Vydané v: | ISPA 2001 : proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis : in conjunction with 23nd [sic] Int'l Conference on Information Technology Interfaces : Pula, Croatia, June 19-21, 2001 s. 541 - 544 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
Piscataway NJ
IEEE
2001
IEEE Service Center |
| Predmet: | |
| ISBN: | 9539676940, 9789539676948 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!

