Abstract
In this paper three methods of basis selection are considered: Basic Matching Pursuit (BMP), Order Recursive Matching Pursuit (ORMP) and Modified Matching Pursuit (MMP). These algorithms are briefly described and particular attention is paid, in the formulation of these algorithms, to the computation required. Fast versions of the algorithms are developed. The algorithms are evaluated in terms of their ability to produce a sparse solution and also in terms of their computational complexity and the storage necessary to implement them. Complexity-wise, BMP and MMP are shown to be comparable while ORMP is the most complex. In terms of their ability to select basis vectors, ORMP was the best followed by MMP and then BMP.
| Original language | English (US) |
|---|---|
| Title of host publication | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
| Editors | M.P. Farques, R.D. Hippenstiel |
| Publisher | IEEE Comp Soc |
| Pages | 1474-1478 |
| Number of pages | 5 |
| Volume | 2 |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) - Pacific Grove, CA, USA Duration: Nov 2 1997 → Nov 5 1997 |
Other
| Other | Proceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) |
|---|---|
| City | Pacific Grove, CA, USA |
| Period | 11/2/97 → 11/5/97 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Signal Processing
- Electrical and Electronic Engineering
Cite this
Fast basis selection methods. / Cotter, Shane F.; Murthi, Manohar; Rao, B. D.
Conference Record of the Asilomar Conference on Signals, Systems and Computers. ed. / M.P. Farques; R.D. Hippenstiel. Vol. 2 IEEE Comp Soc, 1998. p. 1474-1478.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Fast basis selection methods
AU - Cotter, Shane F.
AU - Murthi, Manohar
AU - Rao, B. D.
PY - 1998
Y1 - 1998
N2 - In this paper three methods of basis selection are considered: Basic Matching Pursuit (BMP), Order Recursive Matching Pursuit (ORMP) and Modified Matching Pursuit (MMP). These algorithms are briefly described and particular attention is paid, in the formulation of these algorithms, to the computation required. Fast versions of the algorithms are developed. The algorithms are evaluated in terms of their ability to produce a sparse solution and also in terms of their computational complexity and the storage necessary to implement them. Complexity-wise, BMP and MMP are shown to be comparable while ORMP is the most complex. In terms of their ability to select basis vectors, ORMP was the best followed by MMP and then BMP.
AB - In this paper three methods of basis selection are considered: Basic Matching Pursuit (BMP), Order Recursive Matching Pursuit (ORMP) and Modified Matching Pursuit (MMP). These algorithms are briefly described and particular attention is paid, in the formulation of these algorithms, to the computation required. Fast versions of the algorithms are developed. The algorithms are evaluated in terms of their ability to produce a sparse solution and also in terms of their computational complexity and the storage necessary to implement them. Complexity-wise, BMP and MMP are shown to be comparable while ORMP is the most complex. In terms of their ability to select basis vectors, ORMP was the best followed by MMP and then BMP.
UR - http://www.scopus.com/inward/record.url?scp=0031676933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0031676933&partnerID=8YFLogxK
M3 - Conference contribution
VL - 2
SP - 1474
EP - 1478
BT - Conference Record of the Asilomar Conference on Signals, Systems and Computers
A2 - Farques, M.P.
A2 - Hippenstiel, R.D.
PB - IEEE Comp Soc
ER -