


default search action
Signal Processing, Volume 22
Volume 22, Number 1, January 1991
- Murat Kunt:
Editorial. 1-2 - Luc Vincent:
Morphological transformations of binary images with arbitrary structuring elements. 3-23 - Seop Hyeong Park, Sang Uk Lee:
A pyramid image coder using classified transform vector quantization. 25-42 - J. S. Sunwoo, C. K. Un:
Recursive modified Gram-Schmidt algorithm for linear phase filtering. 43-51 - Josiane Zerubia
, Gérard Alengrin:
Estimation of ARMA(p, q) parameters. 53-60 - Wlodzimierz Greblicki
, Miroslaw Pawlak
:
Nonparametric identification of a cascade nonlinear time series system. 61-75 - Sheng Chen
, Galvin J. Gibson, C. F. N. Cowan, Peter M. Grant:
Reconstruction of binary signals using an adaptive radial-basis-function equalizer. 77-93 - Lixin Dong, Gabriel Pelle, Philippe Brun, Michael Unser
:
Adaptive myocardial border tracking in M-mode echocardiograms. 95-105 - Sergio Amedeo Pignari, Flavio G. Canavero:
Amplitude errors in the Burg spectrum estimation of sinusoidal signals. 107-112
Volume 22, Number 2, February 1991
- Hans Wilhelm Schüßler:
Helmut Brehm. 113-114 - Maurice G. Bellanger, Phillip A. Regalia:
The FLS-QR algorithm for adaptive filtering: The case of multichannel signals. 115-126 - Vijaykumar A. Topkar, S. K. Mullick, Edward L. Titlebaum:
Invariant transformation of the t-ω plane with respect to Wigner distribution. 127-137 - Hans-Joachim Dreßler:
Interpolative bandpass-A/D-conversion. 139-151 - A. Zayezdny, I. Druckmann:
A new method of signal description and its applications to signal processing. 153-178 - Jack-Kang Chan:
Applications of Astrom-Gray-Markel recursions. 179-185 - Joseph Ronsin:
Block coding for television at 34 Mbit/s. 187-198 - Louisa Lam, Ching Y. Suen:
A dynamic shape preserving thinning algorithm. 199-208 - A. J. Anderson, T. J. Moir:
Evaluation of the gain for an adaptive deconvolution smoother. 209-213 - G. R. Reddy, M. N. S. Swamy:
Hilbert transform relations for complex signals. 215-219 - Hans Peter Amann:
3D object recognition based on surface representations. 223-224
Volume 22, Number 3, March 1991
- Thierry Pitarque, Gérard Alengrin, André Ferrari, Jean Menez:
A new state space algorithm for computing the frequencies of sinusoids in white noise. 231-238 - Luis Vergara-Dominguez
, José Manuel Páez-Borrallo, J. Portillo García, B. Ruiz Mezcua:
A general approach to the automatic classification of radiocommunication signals. 239-250 - Anthony J. Weiss, Benjamin Friedlander:
Array shape calibration using eigenstructure methods. 251-258 - Hema A. Murthy, Bayya Yegnanarayana:
Speech processing using group delay functions. 259-267 - J. W. Van der Woude:
System identification of lossless layered media from input-output data. 269-285 - Goran D. Zivanovic, William A. Gardner:
Degrees of cyclostationarity and their application to signal detection and estimation. 287-297 - P. W. Lux, C. H. Schaefer:
Range imaging for autonomous navigation of robotic land vehicles. 299-311 - Wei Qian, D. M. Titterington:
Pixel labelling for three-dimensional scenes based on Markov mesh models. 313-328 - E. R. Davies:
The minimal match graph and its use to speed identification of maximal cliques. 329-343 - Elliot Neil Linzer:
Arithmetic complexity and numerical properties of algorithms involving Toeplitz matrices. 347

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.