A novel shrinkage technique based on the normal inverse Gaussian density model

This paper proposes a novel image denoising technique based on the normal inverse Gaussian (NIG) density model using an extended non-negative sparse coding (NNSC) algorithm proposed by us. This algorithm can converge to feature basis vectors, which behave in the locality and orientation in spatial and frequency domain. Here, we demonstrate that the NIG density provides a very good fitness to the non-negative sparse data. In the denoising process, by exploiting a NIG-based maximum a posteriori estimator (MAP) of an image corrupted by additive Gaussian noise, the noise can be reduced successfully. This shrinkage technique, also referred to as the NNSC shrinkage technique, is self-adaptive to the statistical properties of image data. This denoising method is evaluated by values of the normalized signal to noise rate (SNR). Experimental results show that the NNSC shrinkage approach is indeed efficient and effective in denoising. Otherwise, we also compare the effectiveness of the NNSC shrinkage method with methods of standard sparse coding shrinkage, wavelet-based shrinkage and the Wiener filter. The simulation results show that our method outperforms the three kinds of denoising approaches mentioned above.

Dynamics of Gompertzian tumour growth under environmental fluctuations

We investigate the effect of correlated additive and multiplicative Gaussian white noise oil the Gompertzian growth of tumours. Our results are obtained by Solving numerically the time-dependent Fokker-Planck equation (FPE) associated with the stochastic dynamics. In Our numerical approach we have adopted B-spline functions as a truncated basis to expand the approximated eigenfunctions. The eigenfunctions and eigenvalues obtained using this method are used to derive approximate solutions of the dynamics under Study. We perform simulations to analyze various aspects, of the probability distribution. of the tumour cell populations in the transient- and steady-state regimes. More precisely, we are concerned mainly with the behaviour of the relaxation time (tau) to the steady-state distribution as a function of (i) of the correlation strength (lambda) between the additive noise and the multiplicative noise and (ii) as a function of the multiplicative noise intensity (D) and additive noise intensity (alpha). It is observed that both the correlation strength and the intensities of additive and multiplicative noise, affect the relaxation time.

A Bayesian method for detecting stellar flares

We present a Bayesian-odds-ratio-based algorithm for detecting stellar flares in light-curve data. We assume flares are described by a model in which there is a rapid rise with a half-Gaussian profile, followed by an exponential decay. Our signal model also contains a polynomial background model required to fit underlying light-curve variations in the data, which could otherwise partially mimic a flare. We characterize the false alarm probability and efficiency of this method under the assumption that any unmodelled noise in the data is Gaussian, and compare it with a simpler thresholding method based on that used in Walkowicz et al. We find our method has a significant increase in detection efficiency for low signal-to-noise ratio (S/N) flares. For a conservative false alarm probability our method can detect 95 per cent of flares with S/N less than 20, as compared to S/N of 25 for the simpler method. We also test how well the assumption of Gaussian noise holds by applying the method to a selection of 'quiet' Kepler stars. As an example we have applied our method to a selection of stars in Kepler Quarter 1 data. The method finds 687 flaring stars with a total of 1873 flares after vetos have been applied. For these flares we have made preliminary characterizations of their durations and and S/N.

Convergence and tracking analysis of a variable normalised LMF (XE-NLMF) algorithm

The least-mean-fourth (LMF) algorithm is known for its fast convergence and lower steady state error, especially in sub-Gaussian noise environments. Recent work on normalised versions of the LMF algorithm has further enhanced its stability and performance in both Gaussian and sub-Gaussian noise environments. For example, the recently developed normalised LMF (XE-NLMF) algorithm is normalised by the mixed signal and error powers, and weighted by a fixed mixed-power parameter. Unfortunately, this algorithm depends on the selection of this mixing parameter. In this work, a time-varying mixed-power parameter technique is introduced to overcome this dependency. A convergence analysis, transient analysis, and steady-state behaviour of the proposed algorithm are derived and verified through simulations. An enhancement in performance is obtained through the use of this technique in two different scenarios. Moreover, the tracking analysis of the proposed algorithm is carried out in the presence of two sources of nonstationarities: (1) carrier frequency offset between transmitter and receiver and (2) random variations in the environment. Close agreement between analysis and simulation results is obtained. The results show that, unlike in the stationary case, the steady-state excess mean-square error is not a monotonically increasing function of the step size. (c) 2007 Elsevier B.V. All rights reserved.

An iterative longest matching segment approach to speech enhancement with additive noise and channel distortion

This paper presents a new approach to speech enhancement from single-channel measurements involving both noise and channel distortion (i.e., convolutional noise), and demonstrates its applications for robust speech recognition and for improving noisy speech quality. The approach is based on finding longest matching segments (LMS) from a corpus of clean, wideband speech. The approach adds three novel developments to our previous LMS research. First, we address the problem of channel distortion as well as additive noise. Second, we present an improved method for modeling noise for speech estimation. Third, we present an iterative algorithm which updates the noise and channel estimates of the corpus data model. In experiments using speech recognition as a test with the Aurora 4 database, the use of our enhancement approach as a preprocessor for feature extraction significantly improved the performance of a baseline recognition system. In another comparison against conventional enhancement algorithms, both the PESQ and the segmental SNR ratings of the LMS algorithm were superior to the other methods for noisy speech enhancement.

Speech Enhancement from Additive Noise and Channel Distortion - a Corpus-Based Approach

This paper presents a new approach to single-channel speech enhancement involving both noise and channel distortion (i.e., convolutional noise). The approach is based on finding longest matching segments (LMS) from a corpus of clean, wideband speech. The approach adds three novel developments to our previous LMS research. First, we address the problem of channel distortion as well as additive noise. Second, we present an improved method for modeling noise. Third, we present an iterative algorithm for improved speech estimates. In experiments using speech recognition as a test with the Aurora 4 database, the use of our enhancement approach as a preprocessor for feature extraction significantly improved the performance of a baseline recognition system. In another comparison against conventional enhancement algorithms, both the PESQ and the segmental SNR ratings of the LMS algorithm were superior to the other methods for noisy speech enhancement. Index Terms: corpus-based speech model, longest matching segment, speech enhancement, speech recognition

A new look at the pulsating DB white dwarf GD 358: Line-of-sight velocity measurements and constraints on model atmospheres

We report on our findings of the bright, pulsating, helium atmosphere white dwarf GD 358, based on time-resolved optical spectrophotometry. We identify 5 real pulsation modes and at least 6 combination modes at frequencies consistent with those found in previous observations. The measured Doppler shifts from our spectra show variations with amplitudes of up to 5.5 km s-1 at the frequencies inferred from the flux variations. We conclude that these are variations in the line-of-sight velocities associated with the pulsational motion. We use the observed flux and velocity amplitudes and phases to test theoretical predictions within the convective driving framework, and compare these with similar observations of the hydrogen atmosphere white dwarf pulsators (DAVs). The wavelength dependence of the fractional pulsation amplitudes (chromatic amplitudes) allows us to conclude that all five real modes share the same spherical degree, most likely, l=1. This is consistent with previous identifications based solely on photometry. We find that a high signal-to-noise mean spectrum on its own is not enough to determine the atmospheric parameters and that there are small but significant discrepancies between the observations and model atmospheres. The source of these remains to be identified. While we infer Teff =24 kK and log g ~ 8.0 from the mean spectrum, the chromatic amplitudes, which are a measure of the derivative of the flux with respect to the temperature, unambiguously favour a higher effective temperature, 27 kK, which is more in line with independent determinations from ultra-violet spectra.

Spatially Correlated Multiple-Ananna Channel Capacity Distributions

In this paper, we investigate the capacity of multiple-input multiple-output (MIMO) wireless communication systems over spatially correlated Rayleigh distributed flat fading channels with complex Gaussian additive noise. Specifically, we derive the probability density function of the mutual information between transmitted and received complex signals of MIMO systems. Using this density we derive the closed-form ergodic capacity (mean), delay-limited capacity, capacity variance and outage capacity formulas for spatially correlated channels and then evaluate these formulas numerically. Numerical results show how the channel correlation degrades the capacity of MIMO communication systems. We also show that the density of mutual information of correlated/uncorrelated MIMO systems can be approximated by a Gaussian density with derived mean and variance, even for a finite number of inputs and outputs.

Nonlinear time series prediction based on a power-law noise model

In this paper we investigate the influence of a power-law noise model, also called noise, on the performance of a feed-forward neural network used to predict time series. We introduce an optimization procedure that optimizes the parameters the neural networks by maximizing the likelihood function based on the power-law model. We show that our optimization procedure minimizes the mean squared leading to an optimal prediction. Further, we present numerical results applying method to time series from the logistic map and the annual number of sunspots demonstrate that a power-law noise model gives better results than a Gaussian model.

Time-Independent Discrete Gaussian Sampling for Post-Quantum Cryptography

As the development of a viable quantum computer nears, existing widely used public-key cryptosystems, such as RSA, will no longer be secure. Thus, significant effort is being invested into post-quantum cryptography (PQC). Lattice-based cryptography (LBC) is one such promising area of PQC, which offers versatile, efficient, and high performance security services. However, the vulnerabilities of these implementations against side-channel attacks (SCA) remain significantly understudied. Most, if not all, lattice-based cryptosystems require noise samples generated from a discrete Gaussian distribution, and a successful timing analysis attack can render the whole cryptosystem broken, making the discrete Gaussian sampler the most vulnerable module to SCA. This research proposes countermeasures against timing information leakage with FPGA-based designs of the CDT-based discrete Gaussian samplers with constant response time, targeting encryption and signature scheme parameters. The proposed designs are compared against the state-of-the-art and are shown to significantly outperform existing implementations. For encryption, the proposed sampler is 9x faster in comparison to the only other existing time-independent CDT sampler design. For signatures, the first time-independent CDT sampler in hardware is proposed.