Showing papers in "Signal Processing in 1982"

TL;DR: It is shown that this modified algorithm works better without any slope constraint and not only consumes less computation time but also improves the word recognition accuracy.

TL;DR: Results indicate that the AAMI-function is useful for the estimation of time delay in non-linear systems.

TL;DR: Following a description of preprocessing techniques, the various features found in the vast accumulation of literature on handprint recognition are divided into two main categories: (1) global analysis, and (2) structural analysis.

TL;DR: The application of this digital band-pass filter to noisy ECG signals shows that baseline variations are removed, the powerline component and its higher harmonics are suppressed quite successfully and artefacts are considerably attenuated.

TL;DR: A way to generate a sequence of closed curves leading from an initial curve to a final one, making use of Fourier descriptors, providing a great flexibility in the use of this method.

TL;DR: The eigensystem for the Fast Fourier transform, FFT, known for several years, can be used to design FFT algorithms and it is found that for every prime number transform there are only 4 distinct eigenvalues.

TL;DR: The explicit factorization developed is found to provide an excellent method for assessing the computational complexity of determinant calculation for Toeplitz matrices and an orthogonality transformation associated with it seem to return computational attractiveness to the use of a direct approach in the many application areas in which ToePlitz matrix arise.

TL;DR: The cepstral coefficients representation is found to be the best linear prediction parametric representation for vowel recognition in a/b/ -vowel- /b/ context.

TL;DR: In this article, an unequally spaced sampling method is proposed to obtain the signal representation by the equally weighted sampling at the non-uniformly distributed instants, where the information about the modulated signal is contained in the carrier samples taken at the instants which are defined by modulating function.

TL;DR: It is shown that a centered finite differences approximation of the image differentials is mandatory to obtain good performances in the estimation of movements in television images.

TL;DR: Typical sets of models are displayed and basic principles for fitting them to data are discussed and asymptotic properties of the resulting model are also quoted.

TL;DR: In this article, a fast operator that extracts edge points of objects in digitized images is presented, which can be classified as a local template matching method, however it allows considerable improvement over several known template matching techniques in terms of boundary thickness, sensitivity both to strong and to faint edges, insensitivity to intensity and to smooth variations of scene illumination and, finally, of computational cost.

TL;DR: In this article, a comparative study of two adaptive algorithms which are available for suppression of a narrow-band interference is discussed, and the major part of the paper is devoted to quantitative analysis of the considered algorithms.

TL;DR: In this article, the authors compared the autocorrelation and covariance methods of linear prediction with the normalized total-squared linear prediction error, error in estimating the power spectrum and errors in estimating first three formant frequencies and bandwidths.

TL;DR: In this article, the form-invariance problem in one and two dimensions is mathematically stated and solved in its most general form: i.e., the class of shift-variant filters is derived such that, when the input is linearly scaled, the output too undergoes a linear scaling (and possibly an amplitude weighting).

TL;DR: In this article, two methods of signal deconvolution for systems whose impulse response (wavelet function) can be explicitly determined, and where the goal is to locate short impulses in the presence of strong, reverberation-like interferences are presented.

TL;DR: A beat-synchronous method for the automatic interpretation of carotid pulse waves is presented based on a mixed interpretation strategy that is bottom-up when syntactic rules are used for recognizing the bounds of a signal period and top-down when significant features are looked for and waveform approximations by polynomial curves are performed.

TL;DR: Both filters in the analysis of a system for analysis of human chromosomes result in a lower error rate than no filtering, but this is due to improved segmentation rather than improved classification.

TL;DR: The sequential approach is shown to provide a greatly reduced error rate as compared with one nonsequential approach under the same signal/noise conditions.

TL;DR: In this paper, the problem of impulsive noise suppression by using adaptive prediction technique is considered and a linear time domain notch filter structure and a procedure to estimate the filter coefficients are proposed.

TL;DR: In this article, it was shown that the estimation bias increases artificially the rank of the spectral matrix and thus changes the dimension of the source subspace, and that uncertainty on eigenvectors direction has a simple expression in terms of the eigenvalues.

TL;DR: A convenient selection of parameters and an optimum strategy for quantizing prediction coefficients are put forth, which reduce transmission rate to less than 3 bits/pel while ensuring exact reproduction of the source.

TL;DR: In this article, a new asymptotical method for the inversion of discrete systems with non-singular symmetrical polynomial transfer functions is given for both the one-and two-dimensional cases.

TL;DR: The asymptotic relative processing time (ARPT) of the modified Cox-Stuart detector has been calculated with respect to the unmodified Cox- Stuart detector, the best parametric detector (for Gaussian noise based on the sample regression coefficient) and the Kendall-τ detector.

TL;DR: In this article, an optimal edge detection procedure for cellular textures was described and analyzed based on a class of one-dimensional contrast operators and one dimensional texture models, and the analysis reported the effect of various parameters on the performance of this procedure.

TL;DR: It is shown that the MAP sequential algorithm demands a substantially smaller average signal energy than the fixed-sample-size algorithm to achieve the same error probability.

TL;DR: The computational efficiency of CZT algorithm over the Fast Fourier Transform (FFT) algorithm in evaluating some Discrete Fourier Transforms (DFT) with a specified resolution is established.

TL;DR: Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc has been programmed and tested and a simple description of computer implementation is given.

TL;DR: The error description is given in terms of the digital Poisson summation formula in order to analyze the error made in the synthesis of a digital signal from its short-time Fourier transform.