Matching pursuits video coding: dictionaries and fast implementation

PJ Czerepinski; C Davies; CN Canagarajah; DR Bull

doi:10.1109/76.875515

Matching pursuits video coding: dictionaries and fast implementation

PJ Czerepinski, C Davies, CN Canagarajah, DR Bull

Research output: Contribution to journal › Article (Academic Journal) › peer-review

24 Citations (Scopus)

430 Downloads (Pure)

Abstract

Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains an original contribution to the issues of dictionary selection and fast implementation for matching pursuits video coding. First, it is shown that the PSNR performance of existing matching pursuits codecs can be improved and the implementation cost reduced by a better selection of dictionary functions. Secondly, dictionary factorization is put forward to further reduce implementation costs. A reduction of the computational load by a factor of 20 is achieved compared to implementations reported to date. For a majority of test conditions, this reduction is supplemented by an improvement in reconstruction quality. Finally, a pruned full-search algorithm is introduced, which offers significant quality gains compared to the better-known heuristic fast-search algorithm, while keeping the computational cost low.

Translated title of the contribution	Matching pursuits video coding: dictionaries and fast implementation
Original language	English
Article number	7
Pages (from-to)	1103 - 1115
Journal	IEEE Transactions on Circuits and Systems for Video Technology
Volume	10
Issue number	7
DOIs	https://doi.org/10.1109/76.875515
Publication status	Published - Oct 2000

Bibliographical note

Other: Invited Paper
Rose publication type: Journal article

Terms of use: Copyright © 2000 IEEE. Reprinted from IEEE Transactions on Circuits and Systems for Video Technology.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

matching pursuit
displaced frame difference
low-complexity algorithm
pruned full search
video coding

Access to Document

10.1109/76.875515

Czerepinski IEEE TransCSVT 2000Accepted author manuscript, 758 KB

http://hdl.handle.net/1983/1330

Handle.net

Persistent link

Cite this

@article{8d949a005c0b418d9ecfdd368af33195,

title = "Matching pursuits video coding: dictionaries and fast implementation",

abstract = "Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains an original contribution to the issues of dictionary selection and fast implementation for matching pursuits video coding. First, it is shown that the PSNR performance of existing matching pursuits codecs can be improved and the implementation cost reduced by a better selection of dictionary functions. Secondly, dictionary factorization is put forward to further reduce implementation costs. A reduction of the computational load by a factor of 20 is achieved compared to implementations reported to date. For a majority of test conditions, this reduction is supplemented by an improvement in reconstruction quality. Finally, a pruned full-search algorithm is introduced, which offers significant quality gains compared to the better-known heuristic fast-search algorithm, while keeping the computational cost low.",

keywords = "matching pursuit, displaced frame difference, low-complexity algorithm, pruned full search, video coding",

author = "PJ Czerepinski and C Davies and CN Canagarajah and DR Bull",

note = "Other: Invited Paper Rose publication type: Journal article Terms of use: Copyright {\textcopyright} 2000 IEEE. Reprinted from IEEE Transactions on Circuits and Systems for Video Technology. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ",

year = "2000",

month = oct,

doi = "10.1109/76.875515",

language = "English",

volume = "10",

pages = "1103 -- 1115",

journal = "IEEE Transactions on Circuits and Systems for Video Technology",

issn = "1051-8215",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "7",

}

TY - JOUR

T1 - Matching pursuits video coding: dictionaries and fast implementation

AU - Czerepinski, PJ

AU - Davies, C

AU - Canagarajah, CN

AU - Bull, DR

N1 - Other: Invited Paper Rose publication type: Journal article Terms of use: Copyright © 2000 IEEE. Reprinted from IEEE Transactions on Circuits and Systems for Video Technology. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2000/10

Y1 - 2000/10

N2 - Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains an original contribution to the issues of dictionary selection and fast implementation for matching pursuits video coding. First, it is shown that the PSNR performance of existing matching pursuits codecs can be improved and the implementation cost reduced by a better selection of dictionary functions. Secondly, dictionary factorization is put forward to further reduce implementation costs. A reduction of the computational load by a factor of 20 is achieved compared to implementations reported to date. For a majority of test conditions, this reduction is supplemented by an improvement in reconstruction quality. Finally, a pruned full-search algorithm is introduced, which offers significant quality gains compared to the better-known heuristic fast-search algorithm, while keeping the computational cost low.

AB - Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains an original contribution to the issues of dictionary selection and fast implementation for matching pursuits video coding. First, it is shown that the PSNR performance of existing matching pursuits codecs can be improved and the implementation cost reduced by a better selection of dictionary functions. Secondly, dictionary factorization is put forward to further reduce implementation costs. A reduction of the computational load by a factor of 20 is achieved compared to implementations reported to date. For a majority of test conditions, this reduction is supplemented by an improvement in reconstruction quality. Finally, a pruned full-search algorithm is introduced, which offers significant quality gains compared to the better-known heuristic fast-search algorithm, while keeping the computational cost low.

KW - matching pursuit

KW - displaced frame difference

KW - low-complexity algorithm

KW - pruned full search

KW - video coding

U2 - 10.1109/76.875515

DO - 10.1109/76.875515

M3 - Article (Academic Journal)

VL - 10

SP - 1103

EP - 1115

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

SN - 1051-8215

IS - 7

M1 - 7

ER -

Matching pursuits video coding: dictionaries and fast implementation

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this