ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349)
DOI: 10.1109/iscas.1999.780061
|View full text |Cite
|
Sign up to set email alerts
|

Dictionaries for matching pursuits video coding

Abstract: Matching pursuits is a dictionary-based coding method, which has recently been demonstrated to outperform standard techniques, such as H.263, at low bit rate video compression. Unfortunately, the method involves an extremely high computational cost, compared to the DCT-based H.263. The contribution of this paper relies on reporting three new dictionaries for matching pursuits video coding, whose advantages include both a reduced computational cost and improved PSNR performance, compared to dictionaries reporte… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…However, this approach can be applied in a more flexible manner, to construct arbitrarily shaped functions. For example, it seems logical to enrich the dictionary with diagonal functions of various orientations [8], [12]. Further research is required to establish whether such extensions justify the associated increase of computational and memory requirements.…”
Section: Extension To Nonseparable Basesmentioning
confidence: 99%
See 1 more Smart Citation
“…However, this approach can be applied in a more flexible manner, to construct arbitrarily shaped functions. For example, it seems logical to enrich the dictionary with diagonal functions of various orientations [8], [12]. Further research is required to establish whether such extensions justify the associated increase of computational and memory requirements.…”
Section: Extension To Nonseparable Basesmentioning
confidence: 99%
“…This paper describes original contribution to the issues of dictionary selection and fast implementation of matching pursuits DFD coding, and draws on work partially presented in the companion papers [12], [13]. Firstly, it is postulated that a basis for coding DFD signals should include functions well localized in space.…”
mentioning
confidence: 99%
“…1(a). All previously published matching pursuit dictionaries have been designed in this way [5], [10]- [12], [1], [13].…”
Section: Introductionmentioning
confidence: 99%