Set-theoretic estimation based on a priori knowledge of the noise distribution

IEEE Transactions on Signal Processing

Volumn 48, Issue 7, 2000, Pages 2150-2156

  Chung, J Kuo ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBABILITY DENSITY FUNCTION; SET THEORY;

NOISE DISTRIBUTION; PSEUDO MEAN ESTIMATE; SET MEMBERSHIP;

SPURIOUS SIGNAL NOISE;

EID: 0033723070     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.847798     Document Type: Article

References (15)

1. V. Broman and M. J. Shensa, "A compact algorithm for the intersection of approximation of JV-dimensional polytopes," Math. Comput. Simul., vol. 32, pp. 469-80, 1990.
2. P. L. Combettes, "Inconsistent signal feasibility problems: Least-squares solutions in a product space," IEEE Trans. Signal Processing, vol. 42, pp. 2955-2966, Nov. 1994.
3. P. L. Combettes and H. J. Trussell, "The use of noise properties in set-theoretic estimation," IEEE Trans. Signal Processing, vol. 39, pp. 1630-1641, July 1991.
4. J. R. Deller, Jr., M. Nayeri, and M. S. Liu, "Unifying the landmark developments in optimal bounding ellipsoid identification," Int. J. Automat. Contr. Signal Process., vol. 8, pp. 48-63, Jan.-Feb. 1994.
5. J. R. Deller, Jr., M. Nayeri, and S. F. Odeh, "Least-square identification with error bounds for real-time signal processing and control," Proc. IEEE, vol. 81, pp. 815-849, June 1993.
6. S. Haykin, Adaptive Filter Theory, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 1996.
7. Y. F. Huang, "A recursive estimation algorithm using selective updating for spectral analysis and adaptive signal processing," IEEE Trans. Acoustics, Speech, Signal Processing, vol. ASSP-34, pp. 1331-1334, Oct. 1986.
8. C. Y. Lin, "Set-Theoretic Estimation Based on Noise Distribution," M.S. thesis, National Chung Cheng Univ., Chiayi, Taiwan, R.O.C., 1997.
9. M. Milanese, J. P. Norton, H. Piet-Lahanier, and E. Walter, Bounding Approaches to System Identification. London, U.K.: Plenum, 1996.
10. S. H. Mo and J. P. Norton, "Fast and robust algorithm to compute exact polytope parameter bounds," Math. Comput. Simul., vol. 32, pp. 481-93, 1990.
11. _, "Recursive parameter-bounding algorithms which compute polytope bounds," in Proc. 12th IMACS World Congr., Paris, France, July 1988, pp. 477-80.
12. J. P. Norton, "Identification of parameter bounds of ARMAX models from records with bounded noise," Int. J. Contr., vol. 42, pp. 375-390, 1987.
13. _, "Identification and application of bounded parameter models," Automatica, vol. 23, pp. 497-507, 1987.
14. A. Vicino and G. Zappa, "Sequential approximation of feasibility parameter sets for identification with set membership uncertainty," IEEE Trans. Automat. Contr., vol. 41, June 1996.
15. E. Walter and H. Piet-Lahanier, "Exact recursive polyhedral description of the feasible parameter seet for boundedror models," IEEE Trans. Automat. Contr., vol. 34, pp. 911-915, Aug. 1989.