跳到主要导航 跳到搜索 跳到主要内容

Bases for low complexity matching pursuits image coding

  • University of Bath, Department of Electronic & Electrical Engineering

科研成果: 书/报告/会议事项章节会议稿件同行评审

4 引用 (Scopus)

摘要

The basis size and number of bases in a basis dictionary (codebook) are the dominant parameters in the complexity of coding data by Matching Pursuits (MP). By Basis Picking for a range of constrained basis widths on a training image coded by 1D MP, dictionaries are obtained for both still and residual images and applied in both 1D and 2D coding. On still (intra) images fidelity measured by PSNR is optimum for widths in the range 9 to 13 and dictionary sizes from 14 to 18. For residual images similar results are obtained but the bias towards narrower, smaller dictionaries is even more marked. The resulting combinations of 1D and 2D dictionaries offer significantly lower computational cost while maintaining high quality.

源语言英语
主期刊名IEEE International Conference on Image Processing 2005, ICIP 2005
249-252
页数4
DOI
出版状态已出版 - 2005
已对外发布
活动IEEE International Conference on Image Processing 2005, ICIP 2005 - Genova, 意大利
期限: 11 9月 200514 9月 2005

出版系列

姓名Proceedings - International Conference on Image Processing, ICIP
2
ISSN(印刷版)1522-4880

会议

会议IEEE International Conference on Image Processing 2005, ICIP 2005
国家/地区意大利
Genova
时期11/09/0514/09/05

指纹

探究 'Bases for low complexity matching pursuits image coding' 的科研主题。它们共同构成独一无二的指纹。

引用此