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...
Saved in:
| Published in: | 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 pp. 541 - 544 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
Piscataway NJ
IEEE
2001
IEEE Service Center |
| Subjects: | |
| ISBN: | 9539676940, 9789539676948 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

