Techniques for reducing the computation effort of matching pursuits

Pao Yue-kong Library Electronic Theses Database

Techniques for reducing the computation effort of matching pursuits

 

Author: Cheung, Kin-pong
Title: Techniques for reducing the computation effort of matching pursuits
Degree: M.Phil.
Year: 2002
Subject: Hong Kong Polytechnic University -- Dissertations
Image processing -- Digital techniques
Signal processing -- Digital techniques
Department: Dept. of Electronic and Information Engineering
Pages: xi, 104 leaves : ill. (some col.) ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1657666
URI: http://theses.lib.polyu.edu.hk/handle/200/4521
Abstract: Matching pursuits is a method which utilises an iterative procedure to project a given waveform onto a particular dictionary. It has been successfully applied in different areas such as data compression since its introduction in 1993. Recent research has demonstrated that it helps to provide a very good coding performance at very low bit-rate video compression. However, its realization effort is so high that it is nearly impossible for real-time applications. This thesis is primarily concerned with how to realize matching pursuits efficiently and effectively. Since matching pursuits is basically a core module widely used in various applications, a fast matching pursuits algorithm would directly speed up the realization of a number of applications. In this thesis, a technique for convening a matching pursuits problem into a vector quantization problem is presented. This technique allows one to realize matching pursuits with a lot of well-developed fast vector quantization algorithms. As a result, a number of fast matching pursuits algorithms can be obtained. In this thesis, the partial searching algorithm, a classical technique for realizing vector quantization is used as an example to show how to realize matching pursuits and orthogonal matching pursuits, a variant of matching pursuits, with the proposed technique in an efficient way. A fast two-stage algorithm based on a recently proposed two-stage filtering structure for realizing matching pursuits is also presented in this thesis. A complete analysis of the structure is provided and the optimization of the two stages is investigated. Simulation results show that a significant improvement of the performance of the structure can be achieved.

Files in this item

Files Size Format
b16576664.pdf 8.963Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information