DocumentCode :
442694
Title :
Bases for low complexity matching pursuits image coding
Author :
Monro, D.M. ; Yuan, Yuan
Author_Institution :
Dept. of Electron. & Electr. Eng., Bath Univ., UK
Volume :
2
fYear :
2005
fDate :
11-14 Sept. 2005
Abstract :
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 ID 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.
Keywords :
computational complexity; data compression; image coding; image matching; basis dictionary; low complexity matching pursuits image coding; matching pursuits; residual images; Bit rate; Computational efficiency; Costs; Dictionaries; Frequency; Image coding; Matching pursuit algorithms; PSNR; Size measurement; Wavelet coefficients;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image Processing, 2005. ICIP 2005. IEEE International Conference on
Print_ISBN :
0-7803-9134-9
Type :
conf
DOI :
10.1109/ICIP.2005.1530038
Filename :
1530038
Link To Document :
بازگشت