Pub Date : 2006-12-01DOI: 10.1093/ietfec/e90-a.8.1636
S. Iwamura, Taizo Suzuki, Yuichi Tanaka, M. Ikehara
This paper discusses a new structure of M-channel IIR perfect reconstruction filterbanks. A novel design implementation for the new building block defined as a product of an IIR building block and an FIR building block is presented. The IIR building blocks are written by state space representation, in which we can easily obtain a stability of the filterbank by placing its eigen values inside the unit circle. Due to cascading of building blocks, we can get more free parameters. We introduce the condition how we obtain the new building blocks without increasing of the filter order. Additionally, by showing the simulation results, we show that our proposed FBs have better stopband attenuation than a conventional method.
{"title":"Design of M-channel perfect reconstruction filterbanks with IIR-FIR hybrid building blocks","authors":"S. Iwamura, Taizo Suzuki, Yuichi Tanaka, M. Ikehara","doi":"10.1093/ietfec/e90-a.8.1636","DOIUrl":"https://doi.org/10.1093/ietfec/e90-a.8.1636","url":null,"abstract":"This paper discusses a new structure of M-channel IIR perfect reconstruction filterbanks. A novel design implementation for the new building block defined as a product of an IIR building block and an FIR building block is presented. The IIR building blocks are written by state space representation, in which we can easily obtain a stability of the filterbank by placing its eigen values inside the unit circle. Due to cascading of building blocks, we can get more free parameters. We introduce the condition how we obtain the new building blocks without increasing of the filter order. Additionally, by showing the simulation results, we show that our proposed FBs have better stopband attenuation than a conventional method.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060996","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 Sensor node localization algorithm for indoor quasi-static sensor environments using spatial domain quasi-maximum likelihood (QML) estimation is presented. A time of arrival (TOA) based algorithm is used to arrive at the “pseudo” range estimates from the base stations to the sensor nodes. The localization algorithm uses spatial domain quasi-maximum likelihood estimation to determine the actual sensor location. The algorithm is preceded by a calibration phase during which statistical characterization of the line-of-sight (LOS) and non-line-of-sight (NLOS) returns are derived. Using a synthesized bandwidth of 2GHz, a 4-bit analog-to-digital converter (ADC) and 5-10dB signal-to-noise ratio (SNR), localization with high accuracy is achieved.
{"title":"Sensor node localization via spatial domain quasi-maximum likelihood estimation","authors":"Seshan Srirangarajan, A. Tewfik","doi":"10.5281/ZENODO.53551","DOIUrl":"https://doi.org/10.5281/ZENODO.53551","url":null,"abstract":"A Sensor node localization algorithm for indoor quasi-static sensor environments using spatial domain quasi-maximum likelihood (QML) estimation is presented. A time of arrival (TOA) based algorithm is used to arrive at the “pseudo” range estimates from the base stations to the sensor nodes. The localization algorithm uses spatial domain quasi-maximum likelihood estimation to determine the actual sensor location. The algorithm is preceded by a calibration phase during which statistical characterization of the line-of-sight (LOS) and non-line-of-sight (NLOS) returns are derived. Using a synthesized bandwidth of 2GHz, a 4-bit analog-to-digital converter (ADC) and 5-10dB signal-to-noise ratio (SNR), localization with high accuracy is achieved.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134642542","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}
Adaptive Projected Subgradient Method (APSM) serves as a unified guiding principle of various set-theoretic adaptive filtering algorithms including NLMS/APA. APSM asymptotically minimizes a sequence of non-negative convex functions in a real-Hilbert space. On the other hand, the exponentially weighted stepsize projection (ESP) algorithm has been reported to converge faster than APA in the acoustic echo cancellation (AEC) problem. In this paper, we first clarify that ESP is derived by APSM in a real Hilbert space with a special inner product. This gives us an interesting interpretation that ESP is based on iterative projections onto the same convex sets as APA with a special metric. We can thus expect that a proper choice of metric will lead to improvement of convergence speed. We then propose an efficient adaptive algorithm named adaptive quadratic-metric parallel subgradient projection (AQ-PSP). Numerical examples demonstrate that AQ-PSP with a very simple metric achieves even better echo canceling ability than ESP, proportionate NLMS, and Euclidean-metric version of AQ-PSP, while keeping low computational complexity.
{"title":"Adaptive quadratic-metric parallel subgradient projection algorithm and its application to acoustic echo cancellation","authors":"M. Yukawa, I. Yamada","doi":"10.5281/ZENODO.53485","DOIUrl":"https://doi.org/10.5281/ZENODO.53485","url":null,"abstract":"Adaptive Projected Subgradient Method (APSM) serves as a unified guiding principle of various set-theoretic adaptive filtering algorithms including NLMS/APA. APSM asymptotically minimizes a sequence of non-negative convex functions in a real-Hilbert space. On the other hand, the exponentially weighted stepsize projection (ESP) algorithm has been reported to converge faster than APA in the acoustic echo cancellation (AEC) problem. In this paper, we first clarify that ESP is derived by APSM in a real Hilbert space with a special inner product. This gives us an interesting interpretation that ESP is based on iterative projections onto the same convex sets as APA with a special metric. We can thus expect that a proper choice of metric will lead to improvement of convergence speed. We then propose an efficient adaptive algorithm named adaptive quadratic-metric parallel subgradient projection (AQ-PSP). Numerical examples demonstrate that AQ-PSP with a very simple metric achieves even better echo canceling ability than ESP, proportionate NLMS, and Euclidean-metric version of AQ-PSP, while keeping low computational complexity.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133450099","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}
Sharpness enhancement is one of the post-processing stages in the consumer electronics video chain that operates in an open-loop mode. Although adaptive behavior is possible, in general there is no feedback system aimed at maximizing perceived quality. In this paper we introduce a control system and metric for sharpness enhancement algorithms. We also discuss the options of implementing an internal or local control loop, i.e., to control the basic sharpness enhancement engine at the pixel or region level, and an external or global control loop for sharpness enhancement module.
{"title":"Intelligent sharpness enhancement for video post-processing","authors":"J. Caviedes","doi":"10.5281/ZENODO.40190","DOIUrl":"https://doi.org/10.5281/ZENODO.40190","url":null,"abstract":"Sharpness enhancement is one of the post-processing stages in the consumer electronics video chain that operates in an open-loop mode. Although adaptive behavior is possible, in general there is no feedback system aimed at maximizing perceived quality. In this paper we introduce a control system and metric for sharpness enhancement algorithms. We also discuss the options of implementing an internal or local control loop, i.e., to control the basic sharpness enhancement engine at the pixel or region level, and an external or global control loop for sharpness enhancement module.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130095607","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 method to extract the haemodynamic response function (HRF) from functional magnetic resonance imaging (fMRI) time series based on Fourier-wavelet regularised deconvolution (ForWaRD), and introduce a simple model for the HRF. The HRF extraction algorithm extends the ForWaRD algorithm by introducing a more efficient computation in the case of very long wavelet filters. We compute shift-invariant discrete wavelet transforms (SIDWT) in the frequency domain, and apply ForWaRD using orthogonal spline wavelets. Extraction and modelling of subject-specific HRFs is demonstrated, as well as the use of these HRFs in a subsequent brain activation analysis. Temporal responses are predicted by using the extracted HRF coefficients. The resulting activation maps show the effectiveness of the proposed method.
{"title":"Extracting the haemodynamic response function from fMRI time series using Fourier-wavelet regularised deconvolution with orthogonal spline wavelets","authors":"A. Wink, J. Roerdink","doi":"10.5281/ZENODO.39945","DOIUrl":"https://doi.org/10.5281/ZENODO.39945","url":null,"abstract":"We describe a method to extract the haemodynamic response function (HRF) from functional magnetic resonance imaging (fMRI) time series based on Fourier-wavelet regularised deconvolution (ForWaRD), and introduce a simple model for the HRF. The HRF extraction algorithm extends the ForWaRD algorithm by introducing a more efficient computation in the case of very long wavelet filters. We compute shift-invariant discrete wavelet transforms (SIDWT) in the frequency domain, and apply ForWaRD using orthogonal spline wavelets. Extraction and modelling of subject-specific HRFs is demonstrated, as well as the use of these HRFs in a subsequent brain activation analysis. Temporal responses are predicted by using the extracted HRF coefficients. The resulting activation maps show the effectiveness of the proposed method.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126715478","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}
Non-linear time-frequency structures, naturally present in large number of applications, are difficult to apprehend by means of Cohen's class methods. In order to improve readability, it is possible to generate other class of time-frequency representations using time and/or frequency warping operators. Nevertheless, this requires the knowledge of a non-linear warping function which characterizes the time-frequency content. For this purpose, an unsupervised approach to estimate the warping function is proposed here in the case where time-frequency structures can be represented by chirps with a fractional order. To this end, a Hilbert transform-based technique is applied in order to robustify phases jumps detection. Since those phases jumps define the fractional order in a unique way, the chirp order can be estimated by a bisection method. Results obtained from synthetic data illustrate the attractive outlines of the proposed method.
{"title":"Identifying non-linear fractional chirps using unsupervised Hilbert approach","authors":"A. Jarrot, P. Oonincx, C. Ioana, A. Quinquis","doi":"10.5281/ZENODO.39648","DOIUrl":"https://doi.org/10.5281/ZENODO.39648","url":null,"abstract":"Non-linear time-frequency structures, naturally present in large number of applications, are difficult to apprehend by means of Cohen's class methods. In order to improve readability, it is possible to generate other class of time-frequency representations using time and/or frequency warping operators. Nevertheless, this requires the knowledge of a non-linear warping function which characterizes the time-frequency content. For this purpose, an unsupervised approach to estimate the warping function is proposed here in the case where time-frequency structures can be represented by chirps with a fractional order. To this end, a Hilbert transform-based technique is applied in order to robustify phases jumps detection. Since those phases jumps define the fractional order in a unique way, the chirp order can be estimated by a bisection method. Results obtained from synthetic data illustrate the attractive outlines of the proposed method.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114177655","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 computationally efficient and high-quality preserving DCT architecture is presented. It is obtained by optimizing the Loeffler DCT based on the Cordic algorithm. The computational complexity is reduced from 11 multiply and 29 add operations (Loeffler DCT) to 38 add and 16 shift operations (which is similar to the complexity of the binDCT). The experimental results show that the proposed DCT algorithm not only reduces the computational complexity significantly, but also retains the good transformation quality of the Loeffler DCT. Therefore, the proposed Cordic based Loeffler DCT can be used in low-power and high-quality CODECs, especially in battery-based systems.
{"title":"A computationally efficient high-quality cordic based DCT","authors":"B. Heyne, C. C. Sun, J. Götze, S. Ruan","doi":"10.5281/ZENODO.39453","DOIUrl":"https://doi.org/10.5281/ZENODO.39453","url":null,"abstract":"In this paper a computationally efficient and high-quality preserving DCT architecture is presented. It is obtained by optimizing the Loeffler DCT based on the Cordic algorithm. The computational complexity is reduced from 11 multiply and 29 add operations (Loeffler DCT) to 38 add and 16 shift operations (which is similar to the complexity of the binDCT). The experimental results show that the proposed DCT algorithm not only reduces the computational complexity significantly, but also retains the good transformation quality of the Loeffler DCT. Therefore, the proposed Cordic based Loeffler DCT can be used in low-power and high-quality CODECs, especially in battery-based systems.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972059","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}
Echo detection on time-varying signals is a typical problem of signal processing. A not so typical application of this problem is the detection of foreign bodies in the alimentary industry. In this work we are going to present some results of a project whose objective was to develop an ultrasonic automatic system for detection of foreign bodies. The algorithm presented merge some ideas of time frequency representation (TFR) and morphological image processing to get an easy to implement and highly customizable algorithm that could be applied to many different products and situations.
{"title":"Morphological image processing for echo detection on ultrasonic signals: An application to foreign bodies detection in the alimentary industry","authors":"R. Miralles, M. Jover-Andreu, I. Bosch","doi":"10.5281/ZENODO.39522","DOIUrl":"https://doi.org/10.5281/ZENODO.39522","url":null,"abstract":"Echo detection on time-varying signals is a typical problem of signal processing. A not so typical application of this problem is the detection of foreign bodies in the alimentary industry. In this work we are going to present some results of a project whose objective was to develop an ultrasonic automatic system for detection of foreign bodies. The algorithm presented merge some ideas of time frequency representation (TFR) and morphological image processing to get an easy to implement and highly customizable algorithm that could be applied to many different products and situations.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"920 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120957243","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}
The recently proposed discrete Pascal transform possesses a computational complexity for an N-point vector of the order of N2 for both multiplications and additions. In the present work an efficient structure is proposed, which eliminates the multiplications and halves the number of additions.
{"title":"Efficient computation of the discrete Pascal transform","authors":"A. Skodras","doi":"10.5281/ZENODO.39493","DOIUrl":"https://doi.org/10.5281/ZENODO.39493","url":null,"abstract":"The recently proposed discrete Pascal transform possesses a computational complexity for an N-point vector of the order of N2 for both multiplications and additions. In the present work an efficient structure is proposed, which eliminates the multiplications and halves the number of additions.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121330068","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 describes an investigation into the repair of continuous tracheoesophageal (TE) speech. Our repair system resynthesises TE speech using a synthetic glottal waveform, reduces its jitter and shimmer and applies a novel spectral smoothing and tilt correction algorithm, derived from a comparative study of normal and TE spectral envelopes. The perceptual enhancement achieved by each correction and the performance of the whole system are evaluated on a corpus of thirteen TE speakers using listening tests. Results show that our repair algorithms reduce the perceived breathiness and harshness and out-perform previous enhancement attempts overall.
{"title":"Continuous tracheoesophageal speech repair","authors":"A. D. Pozo, S. Young","doi":"10.5281/ZENODO.39562","DOIUrl":"https://doi.org/10.5281/ZENODO.39562","url":null,"abstract":"This paper describes an investigation into the repair of continuous tracheoesophageal (TE) speech. Our repair system resynthesises TE speech using a synthetic glottal waveform, reduces its jitter and shimmer and applies a novel spectral smoothing and tilt correction algorithm, derived from a comparative study of normal and TE spectral envelopes. The perceptual enhancement achieved by each correction and the performance of the whole system are evaluated on a corpus of thirteen TE speakers using listening tests. Results show that our repair algorithms reduce the perceived breathiness and harshness and out-perform previous enhancement attempts overall.","PeriodicalId":380459,"journal":{"name":"2006 14th European Signal Processing Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125337767","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
扫码关注我们
求助内容：
应助结果提醒方式：