![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Signal Processing, Volume 26
Volume 26, Number 1, January 1992
- E. R. Davies:
A skimming technique for fast accurate edge detection. 1-16 - Yuanmei Wang, Weixue Lu:
Multiobjective optimization approach to image reconstruction from projections. 17-26 - Ja-Ling Wu
, Yuh-Ming Huang:
A novel modularized fast polynomial transform algorithm for two-dimensional convolutions. 27-36 - Jean-Marc Vesin:
A nonlinear autoregressive signal model with state-dependent gain. 37-48 - Climent Nadeu
:
Finite length cepstrum modelling - A simple spectrum estimation technique. 49-59 - Anton Kummert, Stephan Hartwig, Alfred Hypki
:
A new adaptive lattice filter for the ARMA modeling of vector signals. 61-93 - Petre Stoica, Randolph L. Moses:
On the unit circle problem: The Schur-Cohn procedure revisited. 95-118 - Soo-Chang Pei, Jong-Jy Shyu:
Design of real FIR filters with arbitrary complex frequency responses by two real Chebyshev approximations. 119-129 - Zhongde Wang, Lifeng Wang:
Interpolation using the fast discrete sine transform. 131-137 - Gilles Jacquemod, Christophe Odet, Robert Goutte:
Image resolution enhancement using subpixel camera displacement. 139-146
Volume 26, Number 2, February 1992
- Jérôme I. Mars, Nadine Martin, Jean-Louis Lacoume, M. Dubesset:
Analysis of signals over short time-windows. 147-159 - Edgar F. Velez, Richard G. Absher:
Parametric modeling of the Wigner half-kernel and its application to spectral estimation. 161-175 - Douglas R. Campbell, Tom J. Moir, H. S. Dabis:
Multivariable polynomial matrix formulation of adaptive noise cancelling. 177-183 - O. W. Kwon, C. K. Un, J. C. Lee:
Performance of constant modulus adaptive digital filters for interference cancellation. 185-196 - Chin-Liang Wang, Rong-Yih Chen:
Optimum design of the LMS algorithm using two step sizes for adaptive FIR filtering. 197-204 - Petre Stoica, Torsten Söderström, Virginija Simonyte:
On estimating the noise power in array processing. 205-220 - Yuang-Cheh Hsueh:
Mathematical morphology on l-images. 221-241 - Jean-Louis de Bougrenet de la Tocnaye, Alain Hillion:
Optical modeling of mathematical morphology: A link between convultion of images, dilation and erosion. 243-246 - Petri Jarske:
Pictorial communication in virtual and real environments: edited by Stephen R. Ellis. Publishers: Taylor & Francis Ltd., Rankine Road, Basingstoke, Hants. RG24 0PR, UK, 1991, ix + 603 pages, ISBN 0-74840-008-7. 249 - Luc Vandendorpe:
Hierarchical coding of digital moving pictures. 251 - Jelena Kovacevic:
Filter banks and wavelets: Extensions and applications. 252 - Serafim N. Efstratiadis:
Adaptive constrained recursive motion field and image sequence estimation. 253
Volume 26, Number 3, March 1992
- Hsing-Hsiung Chen, Yung-Sheng Chen, Wen-Hsing Hsu:
Low-rate sequence image coding via vector quantization. 265-283 - Runmei Hu, Moustafa M. Fahmy:
Texture segmentation based on a hierarchical Markov random field model. 285-305 - Vijaykumar A. Topkar, Arun K. Sood:
Statistical analysis of scale-space. 307-334 - Constantine Kotropoulos, Ioannis Pitas:
Constrained adaptive LMS L-filters. 335-358 - Mohamed L. Hambaba:
The robust generalized least-squares estimator. 359-368 - H. J. Butterweck, A. C. P. van Meer, Jean H. F. Ritzerfeld:
A remote identification system based on passive identifiers. 369-379 - Pierre Comon:
MA identification using fourth order cumulants. 381-388
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.