{"title":"A cumulant based variable step size adaptive algorithm","authors":"D. I. Pazaitis, A. Constantinides","doi":"10.1109/ICDSP.1997.628004","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628004","url":null,"abstract":"An adaptive step size selection rule for least mean squares (LMS) adaptive algorithms is introduced. The step size sequence is adjusted using the kurtosis of the estimation error, thus the performance degradation due to the existence of noise with a strong variance. The proposed algorithm traces changes in the noise statistics and optimally adapts itself, exhibiting a reduced steady state error. Simulation results illustrate the algorithm's superior performance and confirm its ability to optimally adapt to time varying noise environments. The convergence behavior of the algorithm is also addressed.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127795006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A pattern detection and compression algorithm based on the joint wavelet and Radon transform","authors":"E. Magli, L. Lo Presti, G. Olmo","doi":"10.1109/ICDSP.1997.628410","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628410","url":null,"abstract":"The linear feature detection task can be efficiently accomplished by means of the joint Radon transform (RT) and continuous wavelet transform (CWT) analysis. With regard to the former, a fast algorithm for its computation is described in detail, and the compression and robustness capabilities of the transform are discussed. It is found that the RT is suitable for transmission and fast detection purposes. A completely new, highly efficient CWT based algorithm, to be applied in addition to the classical thresholding methods in the Radon domain, is then discussed. The algorithm is capable to detect linear features even in the presence of large amounts of noise.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121480542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance and design of Farrow filter used for arbitrary resampling","authors":"F. Harris","doi":"10.1109/ICDSP.1997.628420","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628420","url":null,"abstract":"The Farrow filter (1988) is a multirate filter structure which offers the option of continuously adjustable resample ratio. This paper presents a derivation of the method proposed by Farrow, and demonstrates the performance and complexity of resampling filters using his technique. The paper also develops some important system options made available to the designer as spin-offs of the derivation.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128407853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Selection of parameters from power spectral density, wavelet transforms and other methods for the automated interpretation of the ECG","authors":"B. Celler, P. de Chazal","doi":"10.1109/ICDSP.1997.627970","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.627970","url":null,"abstract":"We investigate a range of alternative classifiers for automated interpretation of Frank lead ECG's derived from (i) power spectral density (PSD) estimates of a continuous (8-10 s) recording, (ii) PSD estimates derived from single QRS complexes centred in a data window of 250 ms, (iii) RMS value of signals reconstructed from a 6 level discrete wavelet transform (DWT) decomposition of the ECG using the Haar wavelet, and (iv) scalar parameters calculated from the QRS complex in a selected beat. A database of 500 fully diagnosed ECG records was used to develop the ROC curves for all possible combinations of disease conditions. Results demonstrated that PSD parameters derived from the X lead were generally the most sensitive discriminators between infarcts and ventricular hypertrophies, and were generally more sensitive than parameters derived from DWT decomposition. Surprisingly, neither PSD or DWT parameters provided as good discrimination between normal and abnormal records as did simple scalar lead parameters. A feedforward neural net trained with backpropagation to discriminate between normal and abnormal records was provided with the ten most discriminating parameters in each of the four parameter sets as input. Best results (84.4% correct classification) were obtained for the scalar lead parameters. The worst result (76.6%) was obtained for the continuous PSD. The parameters selected were in general highly discriminating between individual disease conditions and were not optimal for the classification of normal/abnormal records.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128453640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Algorithms and the multiplicative complexity of the reduction a modulo arbitrary polynomial, generalized K/sub N/-convolution and fast Vandermonde transform","authors":"A. M. Krot","doi":"10.1109/ICDSP.1997.628507","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628507","url":null,"abstract":"This paper proves that the number of multiplications required for calculating the product of two polynomial modulo and arbitrary polynomial q(z) (or generalized K/sub N/-convolution), whose coefficients do not belong to the field of constants, is three times higher than the estimate for the case when the coefficients do belong to the field of constants. The existence of a fast Vandermonde transform (FVT) algorithm with the multiplicative complexity (O4NlogN) is shown. The new fast algorithms have applications in filtering and interpolation of digital signal and images.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115892768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decision fusion for writer discrimination","authors":"E. Zois, V. Anastassopoulos","doi":"10.1109/ICDSP.1997.628444","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628444","url":null,"abstract":"In this work the performance improvement of a one-word-based writer discrimination system is described. This is achieved when decision fusion is employed to combine the classification results (decisions) from N words. Only the binary classification problem (discriminate between two persons) is examined. In the proposed approach the randomized Neyman-Pearson (N-P) test is applied. A special case of feature statistics is considered in order to fit the randomized N-P test and simultaneously achieve minimum classification error for each separate decision. Using only a few words the performance of the discrimination system is radically improved as far as the maximum classification error is concerned.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"331 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Blind adaptive equalization and simultaneous separation of convolutive mixtures","authors":"A. Touzni, I. Fijalkow","doi":"10.1109/ICDSP.1997.628120","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628120","url":null,"abstract":"Blind equalization and simultaneous separation of convolutive mixtures is a challenging problem that has received increased attention. Developments in multichannel equalization/identification show that this problem is perfectly solvable assuming some conditions called multichannel identifiability. We choose to use the constant modulus (CM) criterion since it can, under the previous conditions, retrieve and equalize one source perfectly. Moreover, the CM is quite robust to these conditions and to channel additive noise. However, applying the CM criterion may sometimes result in selecting the same source several times, but with different delays. A decorrelation criterion is then required to select the different sources. We propose two approaches to combine the CM with a decorrelation procedure in order to obtain an adaptive algorithm. In a noise free context, we prove that its minima achieve restoration of the separated sources.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116862028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Noise reduction by employment of generalized algorithm","authors":"V. Tuzlukov","doi":"10.1109/ICDSP.1997.628425","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628425","url":null,"abstract":"Questions of detector synthesis on basis of the generalized signal processing algorithm are considered. Detection characteristics for optimal and generalized detectors are investigated. Investigation avenues to the stabilization of the detection characteristics under employment of the generalized algorithm independent of the signal stochastic parameters based on amplitude and phase tracking systems have been proposed.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Estimating and transmitting regularization parameters for reducing blocking artifacts","authors":"J. Mateos, R. Molina, A. Katsaggelos","doi":"10.1109/ICDSP.1997.628018","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.628018","url":null,"abstract":"High compression ratios for both still images and sequences of images are usually achieved by quantizing the block discrete cosine transform (BDCT) coefficients of the intensity or displaced frame different values. This block based processing and quantization yields images that exhibit annoying blocking artifacts. In this paper, we propose a method based on the hierarchical Bayesian approach for the reconstruction of BDCT compressed images and the estimation of the related parameters both at the coder and decoder. We examine how to combine the parameters estimated at the coder and decoder and test the method on real images.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114149621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Blind multivariable equalization","authors":"P. Duhamel","doi":"10.1109/ICDSP.1997.627950","DOIUrl":"https://doi.org/10.1109/ICDSP.1997.627950","url":null,"abstract":"This paper gives an overview of several algorithms which have been proposed in the context of blind (i.e. without training sequence) multivariable (i.e. oversampled or multichannel) equalization. We focus first on the compatibility of previously known blind equalization (BE) algorithms with this relatively new framework. Then, two basic approaches are presented, explicitly dealing with the multivariable context. These two approaches are the subspace and the linear prediction methods. Finally, we emphasize on the validity of the underlying hypotheses (absence of common zeroes, given degree of the channel) in practical situations. These considerations serve as guidelines for discussing further research on blind multivariable equalization.","PeriodicalId":220163,"journal":{"name":"Proceedings of 13th International Conference on Digital Signal Processing","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116229445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}