Vittorio Murino, C. Ottonello, S. Pagnan, A. Trucco
In this paper the use of 3rd-order cumulants, i.e. triple correlations, is proposed for texture analysis. Properties of such features are derived, with particular attention to insensitivity to symmetrically distributed noises and statistical estimate stabilility. Experimental evaluation of 3rd-order cumulants as descriptive features for textures is carried out in comparison with autocorrelation-based approaches.
{"title":"Texture analysis: Comparison of autocorrelation-based with cumulant-based approaches","authors":"Vittorio Murino, C. Ottonello, S. Pagnan, A. Trucco","doi":"10.5281/ZENODO.36047","DOIUrl":"https://doi.org/10.5281/ZENODO.36047","url":null,"abstract":"In this paper the use of 3rd-order cumulants, i.e. triple correlations, is proposed for texture analysis. Properties of such features are derived, with particular attention to insensitivity to symmetrically distributed noises and statistical estimate stabilility. Experimental evaluation of 3rd-order cumulants as descriptive features for textures is carried out in comparison with autocorrelation-based approaches.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"7 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":"122177426","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 work, a new design method of M-channel linear-phase paraunitary filter banks (LPPUFB) is proposed for odd M with a cascade structure. The conventional cascade structure has a problem that one of the filters is restricted to be of length M. In the proposed method, all filters are permitted to be of the same length as each other and longer than M. The significance of our proposed method is verified by showing some design examples.
{"title":"A new design method of linear-phase paraunitary filter banks with an odd number of channels","authors":"S. Muramatsu, H. Kiya","doi":"10.5281/ZENODO.36095","DOIUrl":"https://doi.org/10.5281/ZENODO.36095","url":null,"abstract":"In this work, a new design method of M-channel linear-phase paraunitary filter banks (LPPUFB) is proposed for odd M with a cascade structure. The conventional cascade structure has a problem that one of the filters is restricted to be of length M. In the proposed method, all filters are permitted to be of the same length as each other and longer than M. The significance of our proposed method is verified by showing some design examples.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"2 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":"122187847","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}
Extended optimum interpolatory approximation is presented for a certain set of signals having n variables. As the generalized spectrum of a signal, we consider a v-dimensional vector. These variables can be contained in one of the time domain, the frequency domain or the time-frequency domain. Sometimes, these can be contained in the space-variable domain or in the space-frequency variable domain. To construct the theory across these domains, we assume that the number of variables for a signal and its generalized spectrum are different, in general. Under natural assumption that those generalized spectrums have weighted norms smaller than a given positive number, we prove that the presented approximation has the minimum measure of approximation error among all the linear and the nonlinear approximations using the same generalized sample values. Application to numerical simulation of partial differential equations is considered. In this application, a property for discrete orthogonality associated with the presented approximation plays an essential part.
{"title":"The optimum approximation in generalized time-frequency domains and application to numerical simulation of partial differential equations","authors":"T. Kida","doi":"10.5281/ZENODO.36082","DOIUrl":"https://doi.org/10.5281/ZENODO.36082","url":null,"abstract":"Extended optimum interpolatory approximation is presented for a certain set of signals having n variables. As the generalized spectrum of a signal, we consider a v-dimensional vector. These variables can be contained in one of the time domain, the frequency domain or the time-frequency domain. Sometimes, these can be contained in the space-variable domain or in the space-frequency variable domain. To construct the theory across these domains, we assume that the number of variables for a signal and its generalized spectrum are different, in general. Under natural assumption that those generalized spectrums have weighted norms smaller than a given positive number, we prove that the presented approximation has the minimum measure of approximation error among all the linear and the nonlinear approximations using the same generalized sample values. Application to numerical simulation of partial differential equations is considered. In this application, a property for discrete orthogonality associated with the presented approximation plays an essential part.","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":"128746508","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, firstly, the Schur-Cohn test known as an algebraic stability test of discrete-time linear systems is presented as a "lossless bounded realness test by lossless bounded real lattice realization" of a given real rational transfer function on the unit disk. Then, by characterizing a discrete model of piecewise constant passive transmission line in terms of a set of physical system parmeters, it is extended to an algebraic algorithm for "bounded realness test by bounded real realization" of a certain class of rational transfer functions, which are general enough to cover almost actual passive transmission lines.
{"title":"Algebraic lattice realization of passive transmission line systems","authors":"Y. Monden, M. Nagamatsu, S. Okamoto","doi":"10.5281/ZENODO.36111","DOIUrl":"https://doi.org/10.5281/ZENODO.36111","url":null,"abstract":"In this paper, firstly, the Schur-Cohn test known as an algebraic stability test of discrete-time linear systems is presented as a \"lossless bounded realness test by lossless bounded real lattice realization\" of a given real rational transfer function on the unit disk. Then, by characterizing a discrete model of piecewise constant passive transmission line in terms of a set of physical system parmeters, it is extended to an algebraic algorithm for \"bounded realness test by bounded real realization\" of a certain class of rational transfer functions, which are general enough to cover almost actual passive transmission lines.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"3 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":"129484174","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 intends to present an integrated approach of constructing new spatio-temporal wavelets for discrete signal analysis. The main illustrative field of applications considered here stands as the analysis of digital image sequences. Nevertheless, this can be readily extended to any kind of spatio-temporal signals. Continuous wavelet transforms, continuous series, discretized series and discrete transforms are considered here in an unified way. The analysis to be developed relies only on dynamic parameters like uniform translation and rotation, on kinematic parameters like velocity and speed and on structural parameters as scale and orientation. This digital processing intends to cover the detection and the focalization on motion-based regions of interest in order to perform tracking, classification, segmentation, multiscale trajectory construction and eventually a selective reconstruction of the useful content.
{"title":"Spatio-temporal wavelet transforms for image sequence analysis","authors":"J. Leduc, C. Labit","doi":"10.5281/ZENODO.36066","DOIUrl":"https://doi.org/10.5281/ZENODO.36066","url":null,"abstract":"This paper intends to present an integrated approach of constructing new spatio-temporal wavelets for discrete signal analysis. The main illustrative field of applications considered here stands as the analysis of digital image sequences. Nevertheless, this can be readily extended to any kind of spatio-temporal signals. Continuous wavelet transforms, continuous series, discretized series and discrete transforms are considered here in an unified way. The analysis to be developed relies only on dynamic parameters like uniform translation and rotation, on kinematic parameters like velocity and speed and on structural parameters as scale and orientation. This digital processing intends to cover the detection and the focalization on motion-based regions of interest in order to perform tracking, classification, segmentation, multiscale trajectory construction and eventually a selective reconstruction of the useful content.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"59 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":"130548534","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 present a new error concealment technique for audio transmission over packet networks with high packet loss rate. Unlike other techniques it modifies the time-scale of correctly received packets instead of repeating them. This is done by a time-domain algorithm, WSOLA, whose parameters are redefined so that short audio segments like lost packets can be extended. Particular attention is paid to the additional delay introduced by the new technique. For subjective hearing tests, single and double packet loss is simulated at high packet loss rates, and the new technique is compared to previous proposals by category judgment and component judgment of sound quality. Mean Opinion Score (MOS) curves show that sound distortions due to packet repetition can be reduced.
{"title":"A new error concealment technique for audio transmission with packet loss","authors":"A. Stenger, K. B. Younes, R. Reng, B. Girod","doi":"10.5281/ZENODO.35961","DOIUrl":"https://doi.org/10.5281/ZENODO.35961","url":null,"abstract":"We present a new error concealment technique for audio transmission over packet networks with high packet loss rate. Unlike other techniques it modifies the time-scale of correctly received packets instead of repeating them. This is done by a time-domain algorithm, WSOLA, whose parameters are redefined so that short audio segments like lost packets can be extended. Particular attention is paid to the additional delay introduced by the new technique. For subjective hearing tests, single and double packet loss is simulated at high packet loss rates, and the new technique is compared to previous proposals by category judgment and component judgment of sound quality. Mean Opinion Score (MOS) curves show that sound distortions due to packet repetition can be reduced.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"81 2 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":"121208803","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 high quality wideband audio coder based on a low delay code excited linear predictive (LD-CELP) model where the excitation gain is adapted in a sample-by-sample manner. The proposed coder employs a backward adaptive predictor which introduces no extra delay to the system. A simple gain adaptive control is utilized to perform a sample-by-sample gain adaptive excitation model. In other words, the proposed coder exploits the advantages of the LD-CELP and ADPCM coding. This coder can provide transparent quality audio signals at a bitrate of 1.5 bits/sample.
{"title":"Sample-by-sample gain adaptive celp coding of wideband audio","authors":"M. Chu, C. Chan","doi":"10.5281/ZENODO.36284","DOIUrl":"https://doi.org/10.5281/ZENODO.36284","url":null,"abstract":"This paper presents a high quality wideband audio coder based on a low delay code excited linear predictive (LD-CELP) model where the excitation gain is adapted in a sample-by-sample manner. The proposed coder employs a backward adaptive predictor which introduces no extra delay to the system. A simple gain adaptive control is utilized to perform a sample-by-sample gain adaptive excitation model. In other words, the proposed coder exploits the advantages of the LD-CELP and ADPCM coding. This coder can provide transparent quality audio signals at a bitrate of 1.5 bits/sample.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"5 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":"121225621","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 addresses the problem of blind beamforming in a cyclostationary context. We show the equivalence between the SCORE algorithm derived by Gardner et al., and the minimization of an optimally weighted quadratic cost function. This approach allows us to justify, from a statistical point of view, the relevance of the SCORE algorithm.
{"title":"Blind beamforming in a cyclostationary context using an optimally weighted quadratic cost function","authors":"C. Vignat, P. Loubaton","doi":"10.5281/ZENODO.35958","DOIUrl":"https://doi.org/10.5281/ZENODO.35958","url":null,"abstract":"This paper addresses the problem of blind beamforming in a cyclostationary context. We show the equivalence between the SCORE algorithm derived by Gardner et al., and the minimization of an optimally weighted quadratic cost function. This approach allows us to justify, from a statistical point of view, the relevance of the SCORE algorithm.","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":"121309548","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}
Additive and multiplicative abrupt changes in random signals have been studied in many applications. In segmentation theory, the detection of these additive abrupt changes allows the determination of stationary parts of signals. In radar images, multiplicative abrupt jumps have been used to model "speckled" signal: these multiplicative jumps correspond to object edges on piecewise constant backgrounds. The Continuous Wavelet Transform (CWT) has shown nice properties for the detection of abrupt additive jumps. The paper studies the problem of abrupt multiplicative jump detection using the CWT. The time-scale plane Neyman-Pearson test is studied and its performance is evaluated.
{"title":"Performance of an optimal multiplicative jump detector based on the continuous wavelet transform","authors":"M. Chabert, J. Tourneret, F. Castanie","doi":"10.5281/ZENODO.36191","DOIUrl":"https://doi.org/10.5281/ZENODO.36191","url":null,"abstract":"Additive and multiplicative abrupt changes in random signals have been studied in many applications. In segmentation theory, the detection of these additive abrupt changes allows the determination of stationary parts of signals. In radar images, multiplicative abrupt jumps have been used to model \"speckled\" signal: these multiplicative jumps correspond to object edges on piecewise constant backgrounds. The Continuous Wavelet Transform (CWT) has shown nice properties for the detection of abrupt additive jumps. The paper studies the problem of abrupt multiplicative jump detection using the CWT. The time-scale plane Neyman-Pearson test is studied and its performance is evaluated.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"93 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":"116374812","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}
Y. Abramovich, O. A. Gray, A. Gorokhov, N. Spencer
Three subclasses of geometries for nonuniform linear antenna arrays with a fixed number of sensors are compared in the sense of maximum possible direction-of-arrival (DOA) estimation accuracy. Cramer-Rao bound analysis is applied to compare the optimal accuracy for each geometry under some fixed source environment. Actual DOA estimation simulations, obtained by recently-introduced algorithms, are used to demonstrate the applicability of Cramer-Rao bound analysis for DOA estimation in these cases. We show that previous attempts to maximise the number of contiguous correlation lags and to avoid missing lags in certain array geometries does not necessarily lead to an improvement in DOA estimation performance.
{"title":"Comparison of DOA estimation performance for various types of sparse antenna array geometries","authors":"Y. Abramovich, O. A. Gray, A. Gorokhov, N. Spencer","doi":"10.5281/ZENODO.36140","DOIUrl":"https://doi.org/10.5281/ZENODO.36140","url":null,"abstract":"Three subclasses of geometries for nonuniform linear antenna arrays with a fixed number of sensors are compared in the sense of maximum possible direction-of-arrival (DOA) estimation accuracy. Cramer-Rao bound analysis is applied to compare the optimal accuracy for each geometry under some fixed source environment. Actual DOA estimation simulations, obtained by recently-introduced algorithms, are used to demonstrate the applicability of Cramer-Rao bound analysis for DOA estimation in these cases. We show that previous attempts to maximise the number of contiguous correlation lags and to avoid missing lags in certain array geometries does not necessarily lead to an improvement in DOA estimation performance.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"7 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":"124310202","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
扫码关注我们
求助内容：
应助结果提醒方式：