Fuzzy based directional weighted median filter for impulse noise detection and reduction

The known median-based denoising methods tends to work well for restoring the images corrupted by random-valued impulse noise with low noise level, but it fails in denoising highly corrupted images. In this paper, a new noise reduction method based on directional weighted median based fuzzy impulse noise detection and reduction method (DWMFIDRM) has been proposed, which has been specially developed for denoising all categories of impulse noise. The contribution of this paper is threefold. The main contribution of the novel impulse noise reduction technique lies in the unification of three different methods; the impulse noise detection phase utilizing the concept of fuzzy gradient values, edge-preserving noise reduction phase based on the directional weighted median of the neighboring pixels and a final filtering step in order to deal with noisy pixels of non-zero degree. Such a unique combination has improved the efficiency of this method for high density noise removal. The experimental results of our proposed method have a significant improvement when compared to other existing filters for high density noise removal. This paper utilizes the concept of fuzzy gradient values. The noise reduction phase that preserves edge sharpness is based on the directional weighted median of neighboring pixels. Final filtering phase is performed only when there is non-zero degree of noise pixels. This phase makes our method more efficient in high noise density. Experimental results show that DWMFIDRM provides a significant improvement on other existing filters.     

小波分析在信号去噪声中的应用

小波分析是近年来发展起来的一种数学方法,在信号与图象处理中有重要的应用.中值滤波是信号处理中常用的一种非线性滤波器,它能够有效地消除瞬时脉冲干扰,并且能够很好地保持信号的边缘信息,在信号和图象处理中得到广泛应用.对中值滤波器与小波变换的结合进行了比较系统的研究.通过实例说明中值滤波器与小波变换相结合具有比单一滤波器更好的效果.     

Refinable Functions with Exponential Decay: An?Approach via Cascade Algorithms

Refinable functions with exponential decay arise from applications such as the Butterworth filters in signal processing. Refinable functions with exponential decay also play an important role in the study of Riesz bases of wavelets generated from multiresolution analysis. A fundamental problem is whether the standard solution of a refinement equation with an exponentially decaying mask has exponential decay. We investigate this fundamental problem by considering cascade algorithms in weighted L _p spaces (1≤p≤∞). We give some sufficient conditions for the cascade algorithm associated with an exponentially decaying mask to converge in weighted L _p spaces. Consequently, we prove that the refinable functions associated with the Butterworth filters are continuous functions with exponential decay. By analyzing spectral properties of the transition operator associated with an exponentially decaying mask, we find a characterization for the corresponding refinable function to lie in weighted L ₂ spaces. The general theory is applied to an interesting example of bivariate refinable functions with exponential decay, which can be viewed as an extension of the Butterworth filters.     

Rank-deficient prewhitening with quotientSVD andULV decompositions

This paper deals with certain theoretical and numerical aspects of prewhitening, which is a technique frequently used in signal processing when dealing with signals degraded by colored noise. In particular, we demonstrate how to prewhiten a signal contaminated by an interfering noisy signal whose covariance matrix is rank deficient. The formulation of our technique is based on the quotient (or generalized) singular value decomposition, and we also show that a quotient-version of theULV decomposition can be used to provide an efficient updatable implementation.     

Ergodicity and Accuracy of Optimal Particle Filters for Bayesian Data Assimilation

Data assimilation refers to the methodology of combining dynamical models and observed data with the objective of improving state estimation. Most data assimilation algorithms are viewed as approximations of the Bayesian posterior (filtering distribution) on the signal given the observations. Some of these approximations are controlled, such as particle filters which may be refined to produce the true filtering distribution in the large particle number limit, and some are uncontrolled, such as ensemble Kalman filter methods which do not recover the true filtering distribution in the large ensemble limit. Other data assimilation algorithms, such as cycled 3DVAR methods, may be thought of as controlled estimators of the state, in the small observational noise scenario, but are also uncontrolled in general in relation to the true filtering distribution. For particle filters and ensemble Kalman filters it is of practical importance to understand how and why data assimilation methods can be effective when used with a fixed small number of particles, since for many large-scale applications it is not practical to deploy algorithms close to the large particle limit asymptotic. In this paper, the authors address this question for particle filters and, in particular, study their accuracy (in the small noise limit) and ergodicity (for noisy signal and observation) without appealing to the large particle number limit. The authors first overview the accuracy and minorization properties for the true filtering distribution, working in the setting of conditional Gaussianity for the dynamics-observation model. They then show that these properties are inherited by optimal particle filters for any fixed number of particles, and use the minorization to establish ergodicity of the filters. For completeness we also prove large particle number consistency results for the optimal particle filters, by writing the update equations for the underlying distributions as recursions. In addition to looking at the optimal particle filter with standard resampling, they derive all the above results for (what they term) the Gaussianized optimal particle filter and show that the theoretical properties are favorable for this method, when compared to the standard optimal particle filter.     

A combined direction stochastic approximation algorithm

The stochastic approximation problem is to find some root or minimum of a nonlinear function in the presence of noisy measurements. The classical algorithm for stochastic approximation problem is the Robbins-Monro (RM) algorithm, which uses the noisy negative gradient direction as the iterative direction. In order to accelerate the classical RM algorithm, this paper gives a new combined direction stochastic approximation algorithm which employs a weighted combination of the current noisy negative gradient and some former noisy negative gradient as iterative direction. Both the almost sure convergence and the asymptotic rate of convergence of the new algorithm are established. Numerical experiments show that the new algorithm outperforms the classical RM algorithm.     

New advances in digital image processing

Enhancement of noisy image data is a very challenging issue in many research and application areas. In the last few years, non-linear filters, feature extraction, high dynamic range imaging methods based on soft computing models have been shown to be very effective in removing noise without destroying the useful information contained in the image data. In this paper new image processing techniques are introduced in the above mentioned fields, thus contributing to the variety of advantageous possibilities to be applied. The main intentions of the presented algorithms are (1) to improve the quality of the image from the point of view of the aim of the processing, (2) to support the performance, and parallel with it (3) to decrease the complexity of further processing using the results of the image processing phase.     

Edge detection based on fractional order differentiation and its application to railway track images

Edge detection is one of the most fundamental necessities in image processing. Usally, edge detection algorithms are based on integer order differentiation operators. In many applications it is essential to perform a robust edge detection also to noisy input image data with low SNR as well. Thereby, integer based differentiation operators are often not leading to sufficient detection results. For this purpose an edge detector based on fractional order differentiation is introduced, which can significantly improve the detection performance to noisy images. Furthermore, a real application scenario of fractional order based edge detection is given within a modular railway track measurement system. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Electrocardiogram Signal Compression Using Beta Wavelets

In this paper, a wavelet based methodology is presented for compression of electrocardiogram (ECG) signal. The methodology employs new wavelet filters whose coefficients are derived with beta function and its derivatives. A comparative study of performance of different existing wavelet filters and the Beta wavelet filters is made in terms of compression ratio (CR), percent root mean square difference (PRD), mean square error (MSE) and signal-to-noise ratio (SNR). When compared, the Beta wavelet filters give better compression ratio and also yields good fidelity parameters as compared to other wavelet filters. The simulation result included in this paper shows the clearly increased efficacy and performance in the field of biomedical signal processing.     

Multivariate numerical differentiation

We present an innovative method for multivariate numerical differentiation i.e. the estimation of partial derivatives of multidimensional noisy signals. Starting from a local model of the signal consisting of a truncated Taylor expansion, we express, through adequate differential algebraic manipulations, the desired partial derivative as a function of iterated integrals of the noisy signal. Iterated integrals provide noise filtering. The presented method leads to a family of estimators for each partial derivative of any order. We present a detailed study of some structural properties given in terms of recurrence relations between elements of a same family. These properties are next used to study the performance of the estimators. We show that some differential algebraic manipulations corresponding to a particular family of estimators lead implicitly to an orthogonal projection of the desired derivative in a Jacobi polynomial basis functions, yielding an interpretation in terms of the popular least squares. This interpretation allows one to (1) explain the presence of a spatial delay inherent to the estimators and (2) derive an explicit formula for the delay. We also show how one can devise, by a proper combination of different elementary estimators of a given order derivative, an estimator giving a delay of any prescribed value. The simulation results show that delay-free estimators are sensitive to noise. Robustness with respect to noise can be highly increased by utilizing voluntary-delayed estimators. A numerical implementation scheme is given in the form of finite impulse response digital filters. The effectiveness of our derivative estimators is attested by several numerical simulations.     

Adaptive cluster synchronization in networks with time-varying and distributed coupling delays

This paper studies the adaptive cluster synchronization of a generalized linearly coupled network with time-varying delay and distributed delays. This network includes nonidentical nodes displaying different local dynamical behaviors, while for each cluster of that network the internal dynamics is uniform (such as chaotic, periodic, or stable behavior). In particular, the generalized coupling matrix of this network can be asymmetric and weighted. Two different adaptive laws of time-varying coupling strength and a linear feedback control are designed to achieve the cluster synchronization of this network. Some sufficient conditions to ensure the cluster synchronization are obtained by using the invariant principle of functional differential equations and linear matrix inequality (LMI). Numerical simulations verify the efficiency of our proposed adaptive control method.     

Multivariate numerical differentiation

We present an innovative method for multivariate numerical differentiation i.e. the estimation of partial derivatives of multidimensional noisy signals. Starting from a local model of the signal consisting of a truncated Taylor expansion, we express, through adequate differential algebraic manipulations, the desired partial derivative as a function of iterated integrals of the noisy signal. Iterated integrals provide noise filtering. The presented method leads to a family of estimators for each partial derivative of any order. We present a detailed study of some structural properties given in terms of recurrence relations between elements of a same family. These properties are next used to study the performance of the estimators. We show that some differential algebraic manipulations corresponding to a particular family of estimators lead implicitly to an orthogonal projection of the desired derivative in a Jacobi polynomial basis functions, yielding an interpretation in terms of the popular least squares. This interpretation allows one to (1) explain the presence of a spatial delay inherent to the estimators and (2) derive an explicit formula for the delay. We also show how one can devise, by a proper combination of different elementary estimators of a given order derivative, an estimator giving a delay of any prescribed value. The simulation results show that delay-free estimators are sensitive to noise. Robustness with respect to noise can be highly increased by utilizing voluntary-delayed estimators. A numerical implementation scheme is given in the form of finite impulse response digital filters. The effectiveness of our derivative estimators is attested by several numerical simulations.     

基于模糊中值滤波的椒盐噪声去除方法

研究基于模糊中值滤波的椒盐噪声去除方法。通过比较图像各像素点的灰度值,定义基于图像梯度信息的各点被判别为噪声点的模糊隶属函数。利用此模糊隶属函数对中值滤波方法进行加权,得到了一种加权中值滤波器,可实现边缘处椒盐噪声的有效滤除。讨论这种模糊加权方法与其它先进滤波方法的结合途径,指出了其推广应用价值。最后利用数值实验验证本文方法的有效性,结果表明,相比于自适应中值滤波方法,本文方法得到的滤波图像在峰值信噪比及结构相似度方面均有明显提高。     

关于H?lder正则性的一个注记

Holder正则性在图像消噪、信号重构等方面都具有重要意义．本文对Holder空间的两种定义进行研究分析，利用归纳法和Littlewood—Paley分解方法证明了两种Ho1der定义在一定条件下还是等价的，为Holder正则性的应用提供了理论依据．     

Panel‐based stratified cluster sampling and analysis for photovoltaic outdoor measurements

We study a stratified multisite cluster‐sampling panel time series approach in order to analyse and evaluate the quality and reliability of produced items, motivated by the problem to sample and analyse multisite outdoor measurements from photovoltaic systems. The specific stratified sampling in spatial clusters reduces sampling costs and allows for heterogeneity as well as for the analysis of spatial correlations due to defects and damages that tend to occur in clusters. The analysis is based on weighted least squares using data‐dependent weights. We show that this does not affect consistency and asymptotic normality of the least squares estimator under the proposed sampling design under general conditions. The estimation of the relevant variance–covariance matrices is discussed in detail for various models including nested designs and random effects. The strata corresponding to damages or manufacturers are modelled via a quality feature by means of a threshold approach. The analysis of outdoor electroluminescence images shows that spatial correlations and local clusters may arise in such photovoltaic data. Further, relevant statistics such as the mean pixel intensity cannot be assumed to follow a Gaussian law. We investigate the proposed inferential tools in detail by simulations in order to assess the influence of spatial cluster correlations and serial correlations on the test's size and power. ©2016 The Authors. Applied Stochastic Models in Business and Industry published by John Wiley & Sons, Ltd.     

Weighted pseudo‐almost periodic functions on time scales with applications to cellular neural networks with discrete delays

In this paper, we first propose a concept of weighted pseudo‐almost periodic functions on time scales and study some basic properties of weighted pseudo‐almost periodic functions on time scales. Then, we establish some results about the existence of weighted pseudo‐almost periodic solutions to linear dynamic equations on time scales. Finally, as an application of our results, we study the existence and global exponential stability of weighted pseudo‐almost periodic solutions for a class of cellular neural networks with discrete delays on time scales. The results of this paper are completely new. Copyright © 2016 John Wiley & Sons, Ltd.     

A secure communication scheme based on chaotic Duffing oscillators and frequency estimation for the transmission of binary-coded messages

This work presents a new technique to securely transmit and retrieve a message signal via chaotic systems. The main contribution of this paper is two-fold: the way that the message signal is encrypted in the frequency of a sinusoidal term and a novel frequency estimator for retrieving the message. In our system, a two-valued message signal modulates the frequency of the Duffing oscillator sinusoidal term. Then, two chaotic signals generated by the oscillator are encrypted with a Delta modulator and sent through a noisy channel. A Lyapunov-based observer is used in the receiver side to retrieve the sinusoidal term that contains the message and a novel frequency estimator is then used to retrieve the confidential message signal. The system was implemented in Matlab/Simulink in order to analyze its performance.     

Particle filters with random resampling times

Particle filters are numerical methods for approximating the solution of the filtering problem which use systems of weighted particles that (typically) evolve according to the law of the signal process. These methods involve a corrective/resampling procedure which eliminates the particles that become redundant and multiplies the ones that contribute most to the resulting approximation. The correction is applied at instances in time called resampling/correction times. Practitioners normally use certain overall characteristics of the approximating system of particles (such as the effective sample size of the system) to determine when to correct the system. As a result, the resampling times are random. However, in the continuous time framework, all existing convergence results apply only to particle filters with deterministic correction times. In this paper, we analyse (continuous time) particle filters where resampling takes place at times that form a sequence of (predictable) stopping times. We prove that, under very general conditions imposed on the sequence of resampling times, the corresponding particle filters converge. The conditions are verified when the resampling times are chosen in accordance to the effective sample size of the system of particles, the coefficient of variation of the particles’ weights and, respectively, the (soft) maximum of the particles’ weights. We also deduce central-limit theorem type results for the approximating particle system with random resampling times.     

Asymptotic behavior of the loss function in the multiplicative scaling of the wavelet coefficients of a signal function

The construction of an estimator for a signal function from noisy data is considered. The technique depends on minimizing the probability of exceeding the maximum error in calculating the wavelet coefficients for a given critical value. In a model with additive Gaussian noise, the order of the loss function is estimated in a class of Lipschitz regular functions.     

A discrete problem on d-dimensional symmetric weighted median filters

Using a tool-energy of d-dimensional signal sequences taking values 1 or -1, we have completely solved an interesting discrete mathematical problem on d-dimensional symmetric weighted median filters, i.e., when a d-dimensional symmetric weighted median filter is applied iteratively to a real signal sequence, then the limit of the iterates with even index as well as the limit of the iterates with odd index both converge.