A Method for Separating Multisource Partial Discharges in a Substation Based on Selected Bispectra of UHF Signals

A method for separating multisource partial discharges (PDs) in a substation is proposed based on selected bispectra of ultrahigh frequency (UHF) electromagnetic waves. Bispectra are sensitive to Gaussian noises and processes of symmetrical distribution. The phase information contained in bispectra can be useful and important for further signal processing. Bifrequencies where Fisher-like class separability measures between signals’ bispectra achieve their maximums are selected as characteristic parameters of the signals. Then, the selected bispectra are utilized for training the radial basis neural network to separate PD UHF signals in a substation. The method is used to analyze simulated UHF signals mixed with Gaussian white noise and frequency-fixed interference, and to separate PD UHF signals that are collected in a 500 kV substation. In order to prove the validity of the proposed separation method, the localization results are compared with the results calculated by time delay sequence, and the proposed separating algorithm is verified in the interference circumstances of a substation. However, the exact location of PD sources cannot be calculated according to the time delay sequence when the PD sources in a substation are close to each other or there are fewer than four antennas for receiving signals.

A High-Resolution Demodulation Algorithm for FBG-FP Static-Strain Sensors Based on the Hilbert Transform and Cross Third-Order Cumulant

Static strain can be detected by measuring a cross-correlation of reflection spectra from two fiber Bragg gratings (FBGs). However, the static-strain measurement resolution is limited by the dominant Gaussian noise source when using this traditional method. This paper presents a novel static-strain demodulation algorithm for FBG-based Fabry-Perot interferometers (FBG-FPs). The Hilbert transform is proposed for changing the Gaussian distribution of the two FBG-FPs’ reflection spectra, and a cross third-order cumulant is used to use the results of the Hilbert transform and get a group of noise-vanished signals which can be used to accurately calculate the wavelength difference of the two FBG-FPs. The benefit by these processes is that Gaussian noise in the spectra can be suppressed completely in theory and a higher resolution can be reached. In order to verify the precision and flexibility of this algorithm, a detailed theory model and a simulation analysis are given, and an experiment is implemented. As a result, a static-strain resolution of 0.9 nε under laboratory environment condition is achieved, showing a higher resolution than the traditional cross-correlation method.

The enhanced locating performance of an integrated cross-correlation and genetic algorithm for radio monitoring systems

The rapid development of wireless broadband communication technology has affected the location accuracy of worldwide radio monitoring stations that employ time-difference-of-arrival (TDOA) location technology. In this study, TDOA-based location technology was implemented in Taiwan for the first time according to International Telecommunications Union Radiocommunication (ITU-R) recommendations regarding monitoring and location applications. To improve location accuracy, various scenarios, such as a three-dimensional environment (considering an unequal locating antenna configuration), were investigated. Subsequently, the proposed integrated cross-correlation and genetic algorithm was evaluated in the metropolitan area of Tainan. The results indicated that the location accuracy at a circular error probability of 50% was less than 60 m when a multipath effect was present in the area. Moreover, compared with hyperbolic algorithms that have been applied in conventional TDOA-based location systems, the proposed algorithm yielded 17-fold and 19-fold improvements in the mean difference when the location position of the interference station was favorable and unfavorable, respectively. Hence, the various forms of radio interference, such as low transmission power, burst and weak signals, and metropolitan interference, was proved to be easily identified, located, and removed.

Sound Source Localization for HRI Using FOC-Based Time Difference Feature and Spatial Grid Matching

In human-robot interaction (HRI), speech sound source localization (SSL) is a convenient and efficient way to obtain the relative position between a speaker and a robot. However, implementing a SSL system based on TDOA method encounters many problems, such as noise of real environments, the solution of nonlinear equations, switch between far field and near field. In this paper, fourth-order cumulant spectrum is derived, based on which a time delay estimation (TDE) algorithm that is available for speech signal and immune to spatially correlated Gaussian noise is proposed. Furthermore, time difference feature of sound source and its spatial distribution are analyzed, and a spatial grid matching (SGM) algorithm is proposed for localization step, which handles some problems that geometric positioning method faces effectively. Valid feature detection algorithm and a decision tree method are also suggested to improve localization performance and reduce computational complexity. Experiments are carried out in real environments on a mobile robot platform, in which thousands of sets of speech data with noise collected by four microphones are tested in 3D space. The effectiveness of our TDE method and SGM algorithm is verified.

Noise-insensitive image optimal flow estimation using higher-order statistics

A new algorithm is presented that estimates the displacement vector field from two successive image frames. In the case where the sequence is severely corrupted by additive (Gaussian or not, colored) noise of unknown covariance, then second-order statistics methods do not work well. However, we have studied this topic from a viewpoint different from the above to explore the fundamental limits in image optimal flow estimation. Our scheme is based on subpixel optimal flow estimation using the bispectrum in the parametric domain. The displacement vector of a moving object is estimated by solving linear equations involving third-order holograms and the matrix containing the Dirac delta function. To prove the feasibility of the proposed method, we compared it with a phase correlation technique and the nonparametric bispectrum method described in Res. Lett. Signal Process., ID 417915 (2008). Our results show that our method is considerably more immune to the presence of noise.

Methodology for developing a high-precision ultrasound flow meter and fluid velocity profile reconstruction

This article reports the methodology used to develop a high-precision ultrasound transit time flow meter dedicated to liquid hydrocarbons. This kind of flow meter is designed for custody transfer applications requiring accuracy better than 0.15% of reading. We focus here on certain specific points to achieve this accuracy. The transit time method needs to estimate accurately the time delay between signals received by a pair of transducers. In this study, we review different ways of estimating this time delay. We also propose a specific configuration of the flow meter paths. In particular, this configuration compensates for the swirl phenomenon, which has a significant impact on the accuracy of the flow meter. We also propose a theoretical parametric profile to reconstruct the fluid velocity profile in order to perform in situ diagnosis of the flow. The parameters of the model are estimated from the measurements of the flow meter. Simulations and experimental results showed that this method provides characterization of the flow in disturbed and undisturbed flow conditions.

Robust time delay estimation of bioelectric signals using least absolute deviation neural network

The time delay estimation (TDE) is an important issue in modern signal processing and it has found extensive applications in the spatial propagation feature extraction of biomedical signals as well. Due to the extreme complexity and variability of the underlying systems, biomedical signals are usually nonstationary, unstable and even chaotic. Furthermore, due to the limitations of the measurement environments, biomedical signals are often noise-contaminated. Therefore, the TDE of biomedical signals is a challenging issue. A new TDE algorithm based on the least absolute deviation neural network (LADNN) and its application experiments are presented in this paper. The LADNN is the neural implementation of the least absolute deviation (LAD) optimization model, also called unconstrained minimum L1-norm model, with a theoretically proven global convergence. In the proposed LADNN-based TDE algorithm, a given signal is modeled using the moving average (MA) model. The MA parameters are estimated by using the LADNN and the time delay corresponds to the time index at which the MA coefficients have a peak. Due to the excellent features of L1-norm model superior to Lp-norm (p > 1) models in non-Gaussian noise environments or even in chaos, especially for signals that contain sharp transitions (such as biomedical signals with spiky series or motion artifacts) or chaotic dynamic processes, the LADNN-based TDE is more robust than the existing TDE algorithms based on wavelet-domain correlation and those based on higher-order spectra (HOS). Unlike these conventional methods, especially the current state-of-the-art HOS-based TDE, the LADNN-based method is free of the assumption that the signal is non-Gaussian and the noises are Gaussian and, thus, it is more applicable in real situations. Simulation experiments under three different noise environments, Gaussian, non-Gaussian and chaotic, are conducted to compare the proposed TDE method with the existing HOS-based method. Real application experiment is conducted to extract time delay information between every two adjacent channels of gastric myoelectrical activity (GMA) to assess the spatial propagation characteristics of GMA during different phases of the migrating myoelectrical complex (MMC).

Non-linear algorithms for processing biological signals

This paper illustrates different approaches to the analysis of biological signals based on non-linear methods. The performance of such approaches, despite the greater methodological and computational complexity is, in many instances, more successful compared to linear approaches, in enhancing important parameters for both physiological studies and clinical protocols. The methods introduced employ median filters for pattern recognition, adaptive segmentation, data compression, prediction and data modelling as well as multivariate estimators in data clustering through median learning vector quantizers. Another approach described uses Wiener-Volterra kernel technique to obtain a satisfactory estimation and causality test among EEG recordings. Finally, methods for the assessment of non-linear dynamic behaviour are discussed and applied to the analysis of heart rate variability signal. In this way invariant parameters are studied which describe non-linear phenomena in the modelling of the physiological systems under investigation.

Image motion estimation algorithms using cumulants

A class of algorithms is presented that estimates the displacement vector from two successive image frames consisting of signal plus noise. In the model, the signals are assumed to be either non-Gaussian or (quasistationary) deterministic; and, via a consistency result for cumulant estimators, the authors unify the stochastic and deterministic signal viewpoints. The noise sources are assumed to be Gaussian (perhaps spatially and temporally correlated) and of unknown covariance. Viewing image motion estimation as a 2D time delay estimation problem, the displacement vector of a moving object is estimated by solving linear equations involving third-order auto-cumulants and cross-cumulants. Additionally, a block-matching algorithm is developed that follows from a cumulant-error optimality criterion. Finally, the displacement vector for each pel is estimated using a recursive algorithm that minimizes a mean 2D fourth-order cumulant criterion. Simulation results are presented and discussed.