Forward sequential algorithms for best basis selection

The problem of signal representation in terms of basis vectors from a large, overcomplete, spanning dictionary has been the focus of much research. Achieving a succinct, or `sparse', representation is known as the problem of best basis representation. Methods are considered which seek to solve this problem by sequentially building up a basis set for the signal. Three distinct algorithm types have appeared in the literature which are here termed basic matching pursuit (BMP), order recursive matching pursuit (ORMP) and modified matching pursuit (MMP). The algorithms are first described and then their computation is closely examined. Modifications are made to each of the procedures which improve their computational efficiency. The complexity of each algorithm is considered in two contexts; one where the dictionary is variable (time-dependent) and the other where the dictionary is fixed (time-independent). Experimental results are presented which demonstrate that the ORMP method is the best procedure in terms of its ability to give the most compact signal representation, followed by MMP and then BMP which gives the poorest results. Finally, weighing the performance of each algorithm, its computational complexity and the type of dictionary available, recommendations are made as to which algorithm should be used for a given problem.