Name
Abstract | ||
|---|---|---|
Previous work on sparse approximations has shown that in the pursuit of a signal model using greedy iterative algorithms, the efficiency of the representation can be increased by considering the interference between selected atoms. However, in such interference-adaptive algorithms, atoms are still often selected that necessitate correction by subsequently chosen atoms. It is thus logical to remove these atoms from the representation so that they do not diminish the efficiency of the pursued signal model. In this paper, we propose to prune atoms from the model based on the degree and type of interference, and test its effectiveness in an interference-adaptive orthogonal matching pursuit algorithm. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/CISS.2009.5054763 | 2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2 |
Keywords | Field | DocType |
covariance matrix,iterative algorithm,statistical distributions,dictionaries,computational modeling,maximum likelihood estimation,mathematics,parameter estimation,atomic clocks,sparse approximation,interference,physics,orthogonal matching pursuit,iterative methods,reactive power,statistics | Computer science,AC power,Probability distribution,Interference (wave propagation),Artificial intelligence,Estimation theory,Pruning,Atomic clock,Mathematical optimization,Pattern recognition,Iterative method,Algorithm,Covariance matrix | Conference |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bob L. Sturm | 1 | 241 | 29.88 |
| John J. Shynk | 2 | 14 | 10.72 |
| Dae Hong Kim | 3 | 0 | 0.68 |