Proceedings Paper
Empirical investigation of iterative maximum-entropy spectral estimation of one-dimensional random processes| Format | Member Price | Non-Member Price |
|---|---|---|
| $14.40 | $18.00 |
Paper Abstract
In this paper we provide the results of an empirical investigation of iterative maximum entropy spectrum estimation. The Lim-Malik algorithm is compared to the Burg algorithm on a number of analytic as well as practical one-dimensional signals. We study the convergence of the Lim-Malik algorithm and suggest some criteria to assure convergence in the one- dimensional case.
Paper Details
Date Published: 16 September 1992
PDF: 11 pages
Proc. SPIE 1700, Automatic Object Recognition II, (16 September 1992); doi: 10.1117/12.138282
Published in SPIE Proceedings Vol. 1700:
Automatic Object Recognition II
Firooz A. Sadjadi, Editor(s)
PDF: 11 pages
Proc. SPIE 1700, Automatic Object Recognition II, (16 September 1992); doi: 10.1117/12.138282
Show Author Affiliations
Yuen-Pin Yeap, Univ. of Louisville (United States)
E. David Jansing, Univ. of Louisville (United States)
E. David Jansing, Univ. of Louisville (United States)
Aly A. Farag, Univ. of Louisville (United States)
Published in SPIE Proceedings Vol. 1700:
Automatic Object Recognition II
Firooz A. Sadjadi, Editor(s)
© SPIE. Terms of Use
