IET Signal Processing
Print ISSN
1751-9675
Online ISSN 1751-9683
Online ISSN 1751-9683
IET Signal Processing publishes topics such as algorithm advances in single and multi-dimensional, linear and non-linear, recursive and non-recursive digital filters and multi-rate filter banks; the application of chaos theory and neural network based approaches to signal processing.
This publication was previously known as IEE Proceedings - Vision, Image and Signal Processing 1994-2006. ISSN 1350-245X. more..
Volumes & issues:
Latest content
-
Multiuser modulation classification based on cumulants in additive white Gaussian noise channel
- Author(s): M. Zaerin; B. Seyfe
- + Show Description
-
Hide details
-
p.
815
–823
(9)
In this study the negative impacts of interference transmitters on automatic modulation classification (AMC) have been discussed. The authors proposed two approaches for AMC in the presence of interference: single user modulation classification (SUMC) and multiuser modulation classification (MUMC). When the received power of one transmitter is larger than the other transmitters, SUMC approach recognises the modulation type of the dominant transmitter and other transmitters are treated as interferences. Alternatively when the received powers of all the transmitters are close to each other the authors propose MUMC method to recognise the modulation type of all of the transmitted signals. The features being used to recognise the modulation types of transmitted signals for the both approaches, SUMC and MUMC are higher order cumulants. The superposition property of cumulants for independent random variables is utilised for SUMC and MUMC. The authors investigated the robustness of their classifier with respect to different powers of the received signals via analytical and simulation results and the authors have shown the analytical results will be confirmed by simulations. Also the authors studied the effects of signal synchronisation error, phase jitter and frequency offset on their proposed methods via simulations in the both condition for MUMC and SUMC.
-
Combining log-spectral mean subtraction at different frequency resolutions for handset-channel compensation in single utterance speaker verification
- Author(s): O. Büyük; L.M. Arslan
- + Show Description
-
Hide details
-
p.
824
–828
(5)
Cepstral mean subtraction (CMS) is a well-known feature domain channel compensation technique employed to eliminate the effects of convolutive channel distortion. However, as the authors use in log-spectral mean subtraction (LSMS), the compensation might be applied in spectral domain before the filter-bank analysis with a higher-frequency resolution. LSMS can also be combined with CMS to further improve the recognition performance. In this study, the authors compare the performances of LSMS and CMS methods using a multi-channel, text-dependent single utterance speaker recognition database. In the experiments, the authors observe that LSMS outperforms CMS especially in the high false acceptance region. Moreover, the accuracy is further improved when the methods are combined together. With the combination, the authors achieve 15.5% relative reduction in equal error rate for no score normalisation and 9.4% for test normalisation cases when compared with the baseline CMS experiment.
-
Automatic feature extraction using generalised autoregressive conditional heteroscedasticity model: an application to electroencephalogram classification
- Author(s): S. Mihandoost; M. Amirani; M. Mazlaghani; A. Mihandoost
- + Show Description
-
Hide details
-
p.
829
–838
(10)
Nearly 1% of the world population in all ages suffer from epilepsy. An automatic seizure detection system is an important tool, which helps diagnose epilepsy. In this study, a new approach for epileptic detection based on generalised autoregressive conditional heteroscedasticity (GARCH) model is proposed. First, the electroencephalogram (EEG) signals are decomposed into the frequency sub-bands using wavelet transform. To choose an efficient statistical model for EEG signal wavelet coefficients, the statistical characteristics of these coefficients are studied. The authors show that these coefficients are heteroscedastic. To capture this important property, GARCH model, that is, heteroscedastic, is employed for these coefficients. Moreover, the authors show that GARCH model is compatible with other properties of wavelet coefficients such as heavy tail marginal distribution. GARCH parameters are calculated for each sub-band to represent the wavelet coefficients' distribution of EEG signals. These parameters are then utilised for EEG classification. Next, Markov random field is used to feature selection. The features found are then fed to multilayer perceptron classifier with three discrete outputs: healthy volunteers, epilepsy patients during seizure-free interval and epilepsy patients during seizure. The results clearly indicate that the performance of the new method in classification of EEG signals outperforms previous methods.
-
Optimal linear estimation for systems with multiplicative noise uncertainties and multiple packet dropouts
- Author(s): J. Ma; S. Sun
- + Show Description
-
Hide details
-
p.
839
–848
(10)
This study is concerned with the optimal linear estimation problem for linear discrete-time stochastic systems with multiplicative noise uncertainties in state and measurement matrices and with multiple packet dropouts from a sensor to an estimator. Based on the projection theory, the optimal linear estimators including filter, predictor and smoother are derived in the linear minimum variance sense. In the absence of stochastic uncertainties and/or packet dropouts, the corresponding results can be obtained as the special cases of the proposed estimators. Steady-state property is also analysed. A sufficient condition for the existence of the steady-state estimators is obtained. They can be computed offline. So they have the reduced online computational cost. Simulation examples are given to demonstrate the effectiveness of the proposed estimators.
-
Effects of trends and seasonalities on robustness of the Hurst parameter estimators
- Author(s): X. Ye; X. Xia; J. Zhang; Y. Chen
- + Show Description
-
Hide details
-
p.
849
–856
(8)
Long-range dependence (LRD) is discovered in time series arising from different fields, especially in network traffic and econometrics. Detecting the presence and the intensity of LRD plays a crucial role in time-series analysis and fractional system identification. The existence of LRD is usually indicated by the Hurst parameters. Up to now, many Hurst parameter estimators have been proposed in order to identify the LRD property involved in a time series. Since different estimators have different accuracy and robustness performances, in this study, 13 most popular Hurst parameter estimators are summarised and their estimation performances are investigated. LRD processes with known Hurst parameters are generated as the control data set for the robustness evaluation. In addition, three types of LRD processes are also obtained as the test signals by adding noises in terms of means, trends and seasonalities to the control data set. All 13 Hurst parameter estimators are applied to these LRD processes to estimate the existing Hurst parameters. The estimation results are documented and quantified by the standard errors. Conclusions of the accuracy and robustness performances of the estimators are drawn by comparing the estimation results.
-
Fast and efficient multidimensional scaling algorithm for mobile positioning
- Author(s): S. Qin; Q. Wan; L.-F. Duan
- + Show Description
-
Hide details
-
p.
857
–861
(5)
Mobile station (MS) localisation that plays an important role in the process of target continuous localisation has received considerable attention. In this study, a new framework based on subspace approach for positioning an MS at minimum localisation system with the use of time-of-arrival measurements is introduced. Unlike ordinary multidimensional scaling algorithm using eigendcomposition or inverse computation to estimate the MS position, a computationally simple weighting estimator is proposed by introducing Lagrange multiplier and mean-square error weighting matrix. Computer simulations are included to corroborate the theoretical development and to contrast the estimator performance with several conventional algorithms as well as the Cramér–Rao lower bound (CRLB). It is shown that the new method with low computational complexity attains the CRLB for zero-mean white Gaussian range error at moderate noise level.
-
Medical image denoising on field programmable gate array using finite Radon transform
- Author(s): A. Ahmad; A. Amira; H. Rabah; Y. Berviller
- + Show Description
-
Hide details
-
p.
862
–870
(9)
This study presents the design and implementation of efficient architectures for finite Radon transform (FRAT) on a field programmable gate array (FPGA). FPGA-based architectures with two design strategies have been proposed: direct implementation of pseudo-code with a sequential or pipelined description, and a block random access memory-based approach. Various medical images modalities have been deployed for both software evaluation and hardware implementation. Xilinx DSP tool has been used to improve the implementation time and reduce the design cycle and the Xilinx software has been used for generating a hardware description language from a high-level MATLAB description. Objective evaluation of image denoising using FRAT is carried out and demonstrates promising results. Moreover, the impact of different block sizes on image reconstruction has been analysed. Performance analysis in terms of area, maximum frequency and throughput is presented and reveals significant achievements.
-
New orthogonal polynomials for speech signal and image processing
- Author(s): W.A. Jassim; P. Raveendran; R. Mukundan
- + Show Description
-
Hide details
-
p.
713
–723
(11)
This study introduces a new set of orthogonal polynomials and moments and the set's application in signal and image processing. This polynomial is derived from two well-known orthogonal polynomials: the Tchebichef and Krawtchouk polynomials. This study attempts to present the following: (i) the mathematical and theoretical frameworks for the definition of this polynomial including the modelling of signals with the various analytical properties it contains, as well as, recurrence relations and transform equations that need to be addressed; and (ii) the results of empirical tests that compare the representational capabilities of this polynomial with those of the more traditional Tchebichef and Krawtchouk polynomials using speech and image signals from different databases. This study attempts to demonstrate that the proposed polynomials can be applied in the field of signal and image processing because of the promising properties of this polynomial especially in its localisation and energy compaction capabilities.
-
Improved architecture of complementary set of sequences correlation by means of an inverse generation approach
- Author(s): M.A. Funes; P.G. Donato; M.N. Hadad; D.O. Carrica; M. Benedetti
- + Show Description
-
Hide details
-
p.
724
–730
(7)
System coding is a growing trend in all fields of engineering. Many different algorithms have been developed and studied for applications in signal processing, radar and multi-emission systems, among others. One of the most interesting algorithms, among these, is the complementary sets of sequences (CSS) given their potential and simplicity. They are characterised by a distinctive correlation and orthogonality properties. Nowadays, sustained efforts are being devoted to reducing the calculations involved in the generation and/or correlation of these sequences by means of recursive algorithms. Some authors have brought forward efficient algorithms that are based on modular architectures made up of adders, multipliers and delays. This work introduces an inverse generation approach to perform the correlation of CSS. This approach allows one to substantially reduce calculations, and enables the simultaneous correlation of M sequences, adopting neither time-multiplexing schemes nor complex parallel implementations. This is theoretically demonstrated by means of generation and correlation algorithms. An analysis of the performance and efficiency is then conducted in a reconfigurable hardware platform. The proposal represents an advance in the practical application of these sequences in the above-mentioned fields.
-
Optimal prior knowledge-based direction of arrival estimation
- Author(s): P. Wirfält; G. Bouleux; M. Jansson; P. Stoica
- + Show Description
-
Hide details
-
p.
731
–742
(12)
In certain applications involving direction of arrival (DOA) estimation the operator may have a-priori information on some of the DOAs. This information could refer to a target known to be present at a certain position or to a reflection. In this study, the authors investigate a methodology for array processing that exploits the information on the known DOAs for estimating the unknown DOAs as accurately as possible. Algorithms are presented that can efficiently handle the case of both correlated and uncorrelated sources when the receiver is a uniform linear array. The authors find a major improvement in estimator accuracy in feasible scenarios, and they compare the estimator performance to the corresponding theoretical stochastic Cramér–Rao bounds as well as to the performance of other methods capable of exploiting such prior knowledge. In addition, real data from an ultra-sound array is applied to the investigated estimators.
