Table of Contents
Advances in Artificial Neural Systems
Volume 2013 (2013), Article ID 292567, 7 pages
http://dx.doi.org/10.1155/2013/292567
Research Article

An Efficient Constrained Learning Algorithm for Stable 2D IIR Filter Factorization

1Department of Financial and Management Engineering, University of the Aegean, 82100 Chios, Greece
2Institute of Informatics and Telecommunications, NCSR “Demokritos”, 15310 Athens, Greece

Received 9 November 2012; Accepted 12 January 2013

Academic Editor: Tingwen Huang

Copyright © 2013 Nicholas Ampazis and Stavros J. Perantonis. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. S. Lim, Two-Dimensional Signal and Image Processing, Prentice-Hall International, 1990.
  2. Z. Mou-Yan and R. Unbehauen, “On the approximate factorization of 2-D polynomials,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 35, no. 4, pp. 577–579, 1987. View at Google Scholar · View at Scopus
  3. N. E. Mastorakis, N. J. Theodorou, and S. G. Tzafestas, “A general factorization method for multivariable polynomials,” Multidimensional Systems and Signal Processing, vol. 5, no. 2, pp. 151–178, 1994. View at Publisher · View at Google Scholar · View at Scopus
  4. P. Misra and R. V. Patel, “Simple factorizability of 2-D polynomials,” in Proceedings of the International Symposium on Circuits and Systems, pp. 1207–1210, New Orleans, La, USA, 1990.
  5. B. C. Langand Frenzel, “Polynomial root finding,” IEEE Signal Processing Letters, vol. 1, no. 10, pp. 141–143, 1994. View at Publisher · View at Google Scholar
  6. L. Hoteit, “FFT-based fast polynomial rooting,” in Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP'00), vol. 6, pp. 3315–3318, Istanbul, Turkey, June 2000.
  7. S. Perantonis, N. Ampazis, S. Varoufakis, and G. Antoniou, “Constrained learning in Nneural networks: application to stable factorization of 2-D polynomials,” Neural Processing Letters, vol. 7, no. 1, pp. 5–14, 1998. View at Google Scholar · View at Scopus
  8. T. S. Huang, “Stability of two-dimensional recursive filters,” IEEE Transactions on Audio and Electroacoustics, vol. 20, no. 2, pp. 158–163, 1972. View at Google Scholar · View at Scopus
  9. D. S. Huang, H. H. S. Ip, and Z. Chi, “A neural root finder of polynomials based on root moments,” Neural Computation, vol. 16, no. 8, pp. 1721–1762, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. D. S. Huang, H. S. I. Horace, C. K. L. Ken, Z. Chi, and H. S. Wong, “A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials,” Applied Mathematics and Computation, vol. 162, no. 3, pp. 1183–1200, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. D. S. Huang, “constructive approach for finding arbitrary roots of polynomials by neural networks,” AIEEE Transactions On Neural Networks, vol. 15, no. 2, pp. 477–491, 2004. View at Publisher · View at Google Scholar
  12. R. Hormis, G. Antoniou, and S. Mentzelopoulou, “Separation of two- dimensional polynomials via a sigma-pi neural net,” in Proceedings of the International Conference on Modelling and Simulation, pp. 304–306, Pittsburg, Pa, USA, 1995.