In this contribution a new robust technique for adjusting the step size of the Least Mean Squares (LMS) adaptive algorithm is introduced. The proposed method exhibits faster convergence, enhanced tracking ability and lower steady state excess error compared to the fixed step size LMS and other previously developed variable step size algorithms, while retaining much of the LMS computational simplicity. A theoretical behaviour analysis is conducted and equations regarding the evolution of the weight error vector correlation matrix together with convergence bounds are established. Extensive simulation results support the theoretical analysis and confirm the desirable characteristics of the proposed algorithm.
{"title":"A new robust adaptive step size LMS algorithm","authors":"D. I. Pazaitis, A. Constantinides","doi":"10.5281/ZENODO.35932","DOIUrl":"https://doi.org/10.5281/ZENODO.35932","url":null,"abstract":"In this contribution a new robust technique for adjusting the step size of the Least Mean Squares (LMS) adaptive algorithm is introduced. The proposed method exhibits faster convergence, enhanced tracking ability and lower steady state excess error compared to the fixed step size LMS and other previously developed variable step size algorithms, while retaining much of the LMS computational simplicity. A theoretical behaviour analysis is conducted and equations regarding the evolution of the weight error vector correlation matrix together with convergence bounds are established. Extensive simulation results support the theoretical analysis and confirm the desirable characteristics of the proposed algorithm.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134620167","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}
In this paper we first describe the objectives of the Delft Mobile Multimedia Communications project. Next, the subject of lossy contour compression is considered in more detail as it is an essential component of most object or region-based compression techniques for low bit rate video coding. We propose an optimized B-splines approximation approach, which results in a 40 percent higher compression than the lossless conditional chain code method. Achieved rates are, depending on the tolerable deviation between original and coded contour, in the order of 0.70 to 0.90 bit per contour pixel.
{"title":"Low bit rate video coding for mobile multimedia communications","authors":"R. Lagendijk, J. Biemond, Cor P. Quist","doi":"10.5281/ZENODO.36393","DOIUrl":"https://doi.org/10.5281/ZENODO.36393","url":null,"abstract":"In this paper we first describe the objectives of the Delft Mobile Multimedia Communications project. Next, the subject of lossy contour compression is considered in more detail as it is an essential component of most object or region-based compression techniques for low bit rate video coding. We propose an optimized B-splines approximation approach, which results in a 40 percent higher compression than the lossless conditional chain code method. Achieved rates are, depending on the tolerable deviation between original and coded contour, in the order of 0.70 to 0.90 bit per contour pixel.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115849047","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}
We describe a speechreading (lipreading) system purely based on visual features extracted from grey level image sequences of the speaker's lips. Active shape models are used to track the lip contours while visual speech information is extracted from the shape of the contours. The distribution and temporal dependencies of the shape features are modelled by continuous density Hidden Markov Models. Experiments are reported for speaker independent recognition tests of isolated digits. The analysis of individual feature components suggests that speech relevant information is embedded in a low dimensional space and fairly robust to inter- and intra-speaker variability.
{"title":"Statistical LIP modelling for visual speech recognition","authors":"J. Luettin, N. Thacker, S. W. Beet","doi":"10.5281/ZENODO.36365","DOIUrl":"https://doi.org/10.5281/ZENODO.36365","url":null,"abstract":"We describe a speechreading (lipreading) system purely based on visual features extracted from grey level image sequences of the speaker's lips. Active shape models are used to track the lip contours while visual speech information is extracted from the shape of the contours. The distribution and temporal dependencies of the shape features are modelled by continuous density Hidden Markov Models. Experiments are reported for speaker independent recognition tests of isolated digits. The analysis of individual feature components suggests that speech relevant information is embedded in a low dimensional space and fairly robust to inter- and intra-speaker variability.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114501760","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}
One of the way to extract edges uses the fast wavelet transform algorithm. This technique allows the detection of multiscale edge and is used to detect all the details which are in a picture by modifying the scale. The real time application for edge detection involves the implementation of the algorithm on an integrated circuit like an FPGA and the development of an appropriated board. This article deals about the implementation of a wavelet transform algorithm onto a FPGA and the development of an electronic board to detect multiscale edges.
{"title":"Multiscale edges detection algorithm implementation using FPGA devices","authors":"M. Paindavoine, Sarifuddin, C. Milan, J. Grapin","doi":"10.5281/ZENODO.36058","DOIUrl":"https://doi.org/10.5281/ZENODO.36058","url":null,"abstract":"One of the way to extract edges uses the fast wavelet transform algorithm. This technique allows the detection of multiscale edge and is used to detect all the details which are in a picture by modifying the scale. The real time application for edge detection involves the implementation of the algorithm on an integrated circuit like an FPGA and the development of an appropriated board. This article deals about the implementation of a wavelet transform algorithm onto a FPGA and the development of an electronic board to detect multiscale edges.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116385080","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}
This paper presents a new speech coding algorithm based on a fast wavelet packet transform algorithm and psychoacoustic modeling. The employed FFT-like overlapped block orthogonal transform allows us to approximate the auditory critical band decomposition in an efficient manner, which is a major advantage over previous approaches. Owing to such a decomposition of the original signal, we make use of the human ear masking properties to decrease the mean bit rate of the encoder.
{"title":"Perceptual coding of speech using a fast wavelet packet transform algorithm","authors":"B. Carnero, A. Drygajlo","doi":"10.5281/ZENODO.36342","DOIUrl":"https://doi.org/10.5281/ZENODO.36342","url":null,"abstract":"This paper presents a new speech coding algorithm based on a fast wavelet packet transform algorithm and psychoacoustic modeling. The employed FFT-like overlapped block orthogonal transform allows us to approximate the auditory critical band decomposition in an efficient manner, which is a major advantage over previous approaches. Owing to such a decomposition of the original signal, we make use of the human ear masking properties to decrease the mean bit rate of the encoder.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116474771","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}
In this paper a simple but effective operator for the reduction of blocking artifacts is presented. The method is based on the Rational Filter approach: the operator is expressed as a ratio between a linear and a polynomial function of the input data. Such filters proved to outperform other conventional methods in other applications, such as noise smoothing [1], thanks to their capability of adapting gradually to the local image characteristics. The filter is capable of biasing its behaviour in order to achieve good performance both in uniform areas, where linear smoothing is needed, and in textured zones, where nonlinear and directional filtering is required. A detector of activity is embedded in the expression of the operator itself so that the biasing of the behaviour of the filter is smooth and not based on fixed thresholds. The proposed method has been originally designed as a post-processing tool for frames of sequences coded at medium-low bitrate with the dynamic coding scheme proposed in [2], but gave good results also when applied to JPEG coded images.
{"title":"A rational filter for the removal of blocking artifacts in image sequences coded at low bitrate","authors":"R. Castagno, G. Ramponi","doi":"10.5281/ZENODO.36037","DOIUrl":"https://doi.org/10.5281/ZENODO.36037","url":null,"abstract":"In this paper a simple but effective operator for the reduction of blocking artifacts is presented. The method is based on the Rational Filter approach: the operator is expressed as a ratio between a linear and a polynomial function of the input data. Such filters proved to outperform other conventional methods in other applications, such as noise smoothing [1], thanks to their capability of adapting gradually to the local image characteristics. The filter is capable of biasing its behaviour in order to achieve good performance both in uniform areas, where linear smoothing is needed, and in textured zones, where nonlinear and directional filtering is required. A detector of activity is embedded in the expression of the operator itself so that the biasing of the behaviour of the filter is smooth and not based on fixed thresholds. The proposed method has been originally designed as a post-processing tool for frames of sequences coded at medium-low bitrate with the dynamic coding scheme proposed in [2], but gave good results also when applied to JPEG coded images.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120847700","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}
In this paper a new parameter estimation based criterion for two-point resolution is proposed. Unlike the classical resolution criteria, the new criterion takes account of noise and systematic errors. A resolution limit in terms of the observations is derived. This limit depends on the point spread function used and the degree of coherence supposed. For statistical observations the probability of resolution as a function of the SNR is derived. This probability can be used as a performance measure in the assessment of optical instruments.
{"title":"Coherent model-based optical resolution and SNR","authors":"A. J. D. Dekker","doi":"10.5281/ZENODO.36325","DOIUrl":"https://doi.org/10.5281/ZENODO.36325","url":null,"abstract":"In this paper a new parameter estimation based criterion for two-point resolution is proposed. Unlike the classical resolution criteria, the new criterion takes account of noise and systematic errors. A resolution limit in terms of the observations is derived. This limit depends on the point spread function used and the degree of coherence supposed. For statistical observations the probability of resolution as a function of the SNR is derived. This probability can be used as a performance measure in the assessment of optical instruments.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126176568","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}
This work is a contribution to Adequation between Algorithm and Architecture. It presents an example of application made with SynDEx, a software environment to implement signal processing or automatic algorithms on multiprocessor network. This communication shows that a Conditioned Data Flow Graph used for modelling an algorithm, is enough to do an implementation on multi-processeur network.
{"title":"Parallel implementation of image coding usingwavelet transform: Syndex software environment application","authors":"C. Cudel, B. Vigouroux","doi":"10.5281/ZENODO.36261","DOIUrl":"https://doi.org/10.5281/ZENODO.36261","url":null,"abstract":"This work is a contribution to Adequation between Algorithm and Architecture. It presents an example of application made with SynDEx, a software environment to implement signal processing or automatic algorithms on multiprocessor network. This communication shows that a Conditioned Data Flow Graph used for modelling an algorithm, is enough to do an implementation on multi-processeur network.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124664639","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}
In this paper, the steady-state performance of the Least Mean Square (LMS) adaptive second order Volterra filter, with constant step-sizeμ, in a time-varying setting, is analysed. The quantitative evaluation of the steady-state Excess Mean Square Error (EMSE), where the contribution of the gradient misadjustment and the tracking error are well characterized, is established. The optimum step-size for time-varying second order Volterra filter is then given. Thus, we can study the correlation between the Excess MSE and the optimum step-size in one hand and the parameters of the time-varying nonlinear system, in the other hand. Furthermore, the steady-state behavior predicted by the analysis is in good agreement with the experimental results. The adaptive filter was used in a second order Volterra system identification in a non stationary environment.
{"title":"Steady-state performance analysis of the LMS adaptive time-varying second order Volterra filter","authors":"M. Sayadi, F. Fnaiech, S. Guillon, M. Najim","doi":"10.5281/ZENODO.36117","DOIUrl":"https://doi.org/10.5281/ZENODO.36117","url":null,"abstract":"In this paper, the steady-state performance of the Least Mean Square (LMS) adaptive second order Volterra filter, with constant step-sizeμ, in a time-varying setting, is analysed. The quantitative evaluation of the steady-state Excess Mean Square Error (EMSE), where the contribution of the gradient misadjustment and the tracking error are well characterized, is established. The optimum step-size for time-varying second order Volterra filter is then given. Thus, we can study the correlation between the Excess MSE and the optimum step-size in one hand and the parameters of the time-varying nonlinear system, in the other hand. Furthermore, the steady-state behavior predicted by the analysis is in good agreement with the experimental results. The adaptive filter was used in a second order Volterra system identification in a non stationary environment.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774791","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}
A non-parametric probability density function (pdf) estimation technique is presented. The estimation consists in approximating the unknown pdf by a network of Gaussian Radial Basis Functions (GRBFs). Complexity analysis is introduced in order to select the optimal number of GRBFs. Results obtained on real data show the potentiality of this technique.
{"title":"RBF networks for density estimation","authors":"L. Sardo, J. Kittler","doi":"10.5281/ZENODO.36129","DOIUrl":"https://doi.org/10.5281/ZENODO.36129","url":null,"abstract":"A non-parametric probability density function (pdf) estimation technique is presented. The estimation consists in approximating the unknown pdf by a network of Gaussian Radial Basis Functions (GRBFs). Complexity analysis is introduced in order to select the optimal number of GRBFs. Results obtained on real data show the potentiality of this technique.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127053234","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：