This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the efficient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match to diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and used. Even without any sophisticated entropy coding, the proposed system gives performance exceeding that of H.263
|Translated title of the contribution||Video coding using a fast non-separable matching pursuits algorithm|
|Title of host publication||Unknown|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||769 - 773|
|Publication status||Published - Oct 1998|
|Event||International Conference on Image Processing, 1998 (ICIP '98) - Chicago, IL, United States|
Duration: 1 Oct 1998 → …
|Conference||International Conference on Image Processing, 1998 (ICIP '98)|
|Period||1/10/98 → …|
Bibliographical noteConference Proceedings/Title of Journal: Proc. 1998 IEEE Intl. Conference on Image Processing, Chicago
Rose publication type: Conference contribution
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 email@example.com.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.