Narrow Results

Orthogonal frequency division multiplexing (OFDM) is adopted in most wireless communication systems, and the performance of OFDM is affected by impulse noise (IN). Better channel estimation (CE) performance is required to detect the channel information on the receiving side. The OFDM system is considered with the number of subcarriers carrying the data and pilot symbols. In the OFDM modulator, the symbols of the frequency domain are transformed into the signals of the time domain using inverse discrete Fourier transformation (IDFT). Effective impulsive noise mitigation is crucial for improving the effectiveness of OFDM communication systems, and it improves the signal-to-noise ratio (SNR) at the receiver. A cyclic prefix is then appended before transmission through the channel. In the receiver noise, the effect of IN is mitigated jointly with CE using the Bayesian matching pursuit (BMP) and Moth-flame algorithm (MFA). In this approach, the IN and channel information is considered as a sparse vector. Here, the data symbols used are considered an unknown parameter. The approach incorporating all subcarriers has a lower mean square error (MSE) of IN estimate for impulsive noise reduction. The MFA algorithm is used to optimize the sensor matrix in BMP. The sparsity of the channel and the impulse response are observed in the time domain to represent the channel and IN together. It exactly recovers the sparse signal for finding the convex objectives of the sparse minimizer, and the sparse solution is obtained with fixed point updates. The proposed BMP algorithm improves the CE by explicitly considering the existence of IN. The BMP is a greedy algorithm that selects the most correlated residuals at each column. Under mutual incoherence, it recovers the signal with a higher probability. The simulated outcomes proved that the proposed CE and noise mitigation model achieved better performance based on the bit error rate (BER), throughput and MSE.

When the input signals for acoustic echo cancellation (AEC) are related signals, the convergence speed of the traditional normalized least mean square (NLMS) algorithms is significantly reduced. In this paper, a joint optimization robust AEC algorithm is proposed to solve this problem. Based on the analysis of the convergence of the normalized subband adaptive filtering (NSAF) algorithm, the algorithm is optimized by minimizing the mean square error (MSE) of the NSAF algorithm, combining sub-band time-varying step factor and time-varying regularization parameter to update the filter weight vectors. And when the impulse noise occurs, the sub-band cut-off parameter is updated in a recursive manner, which makes the algorithm achieve fast convergence speed and low steady-state error, and has strong robustness to impulse noise. In a series of experiments on AEC, simulation results show that the performance of the algorithm is better than the existing algorithms.

In the process of image acquisition and transmission, data can be corrupted by impulse noise. This paper presented the removal of impulse noise in medical image by using Very Large Scale Integrated circuit (VLSI) implementation. The Low Cost Reduced Simple Edge Preserved De-noising (LCRSEPD) technique is introduced using Low Area Carry Select Adder (CSLA) to remove the salt and pepper noise instead of normal adder. Thus, LCRSEPD technique preserves visual performance and edge features in terms of quality and quantitative evaluation. By optimizing the architecture, low cost RSEPD can achieve low computational complexity that will reflect in area, power and delay. Compared to the previous VLSI implementations, the LCRSEPD implementation with CSLA adder has achieved good medical image quality and less hardware cost due to the reduction of area, power and delay.

Impulse noise is an image noise that degrades the quality of the image drastically. In this paper, k-means clustering has been incorporated with fuzzy-support vector machine (FSVM) classifier for classification of noisy and non-noisy pixels in removal of impulse noise from gray images. Here, local binary pattern (LBP) has been incorporated with previously used feature vector prediction error of the processing pixel, absolute difference between median value and processing pixel, median pixel, pixel under operation and mean value around the processing kernel. In this work, $k$-means clustering has been used for reducing the feature vector set, where features have been extracted from the images corrupted with 10%, 50%, and 90% impulse noise. If the pixel is depicted as noisy in testing phase, histogram adaptive fuzzy filter is processed over the noisy pixel under operation. It is seen that the proposed filter offers improved performance over some of the state-of-the-art filter in terms of different image quality measures likely PSNR, SSIM, MSE, FSIM, etc. It is observed that performance is increased by $\sim$2–5dB than baseline filters likely SVM fuzzy filter, and artificial neural network based adaptive sized mean filter (ANNASMF) especially at high density noise.

Salt-and-pepper noise suppression for vector-valued images usually employs vector median filtering, total variation L1 model, diffusion methods and variants. These approaches, however, often introduce excessive smoothing and can result in extensive visual feature blurring and are suitable only for images with low intensity noise. In this paper, a new method, as an important preprocessing step in cyber-physical systems, is presented to suppress salt-and-pepper noise that can overcomes this limitation. This method first detects the corrupted pixels and then restores them using channel-wise anisotropic diffusion. The means is twofold. On the one hand, the marginal approach is used to perform noise suppression separately in each channel because the contaminative pixel components are of independent distribution. On the other hand, a decision-based anisotropic diffusion method is applied to each channel to restores them. The anisotropic diffusion is an energy-dissipating process with time, and dependent on geometric analysis of shape of the energy surface. Simulation results indicate that the proposed method for impulsive noise removal achieves the state-of-the-arts results.

The essence of Huber fractal image coding (HFIC) is to predict the fractal code of a noiseless image as accurately as possible from its corrupted observation with outliers by adopting Huber M-estimation technique. However, the traditional HFIC is not quite satisfactory mainly due to the absence of contractivity restriction for the estimate of the fractal parameters (actually, it is a fundamental requirement in the theory of fractal image coding). In this paper, we introduce a primal-dual algorithm for robust fractal image coding (PD-RFIC), which formulates the problem of robust prediction of the fractal parameters with contractivity condition as a constrained optimization model and then adopts a primal-dual algorithm to solve it. Furthermore, in order to relieve using the corrupted domain block as the independent variable in the proposed method, instead of using the mean operation on a $2\times 2$ subblock in the traditional HFIC, we apply a median operation on a larger subblock to obtain the contracted domain blocks for achieving the robustness against outliers. The effectiveness of the proposed method is experimentally illustrated on problems of image denoising with impulse noise (specifically, salt & pepper noise and random-valued noise). Remarkable improvements of the proposed method over conventional HFIC are demonstrated in terms of both numerical evaluations and visual quality. In addition, a median-based version of Fisher classification method is also developed to accelerate the encoding speed of the proposed method.

We propose and analyze a new single-pass filter designed to restore images highly corrupted by the impulse noise. The filter involves three stages designed to detect particular patterns of noise. The filter recognizes the "short line like" or the "short curve like" patterns of noise which enables us to preserve fine details. Our simulations show that the proposed new filter overperforms the conventional multilevel median filter, the two-state and the multi-state-median filter.

The article proposes an adaptive, noise-exclusive and assessment-based fuzzy switching median filter for high intensity impulse noise. The filter adaptively changes the size of sliding window in accordance with noise intensity and noise-exclusive operation is performed only on noise-free pixels. These steps thus preserve the image details effectively. Judicious assessment of the previously restored pixels is made in order to use them in replacing the noisy pixels and further improve the efficiency of filter. With these possibilities, fuzzy switching median filter-based approach is also incorporated for improving the performance. Experimental results justified the efficacy of the proposed fuzzy-based filtering method qualitatively and quantitatively for twelve different highly corrupted noisy images, and showed significant improvement to existing algorithms.

Fiber directional tracking through diffusion tensor magnetic resonance imaging (DT-MRI) is a promising research field in visualization and computer graphics and is widely applied in the reconstruction of fiber orientation and the structure of biological tissues. The filter technique used to blur noise in data is of critical importance for fiber directional tracking, particularly because existing tracking methods are very sensitive to impulsive noise. In this paper, a mixed filter of the 3D Gauss and directional distance filter (GDDF) is proposed to suppress noises in corrupted vector fields. Simulation results and objective evaluation of vector datasets demonstrate that GDDF not only possesses the capability of noise attenuation but also preserves vector directions. By validating the simulated vector data against experimental heart data, it is also shown that the GDDF is an effective and stable preprocessing method that accurately reconstructs fiber orientation.

The interest of this paper is in reduction of impulse noise in digital color images. The two main methods used for noise reduction in images are the mean and median filters. These techniques operate by replacing the test pixel in a chosen window by a new filtered pixel value. The window is made to iteratively slide across the entire image to reconstruct a new noise reduced image. The mean filters suffer from the effect of smoothing out color contrast and edges due to leveraging the unrepresentative pixels in the filtering process. The vector median filter and its variants overcome this problem by considering only the most representative pixel in the chosen window. The most representative pixel, i.e. the pixel that is of highest conformity to take the place of the test pixel, is determined by minimizing the aggregate distance from one pixel to every other pixel in the window. The problem in these median filtering approaches is that only one pixel is treated as representative of all the pixels in the chosen window. This conjecture could lead to information loss due to marginalizing other pixels that also are representative of the center pixel. In this paper, we propose a selective mean filtering process to overcome the said problem. The key idea here is to determine the most representative pixels in the window using the method of aggregate distances and then compute the mean of these pixels. This approach will perform better than the vector median filters as now a set of representative pixels are leveraged into the filtering process. Simulation results show that the proposed method performs better than the conventional vector median filtering methods in terms of noise reduction and structural similarity and thus validates the proposed approach. Moreover, the method is tested on real MRI scan images in successfully reducing impulse noise for improved medical diagnosis.

The focus of this paper is impulse noise reduction in digital color images. The most popular noise reduction schemes are the vector median filter and its many variants that operate by minimizing the aggregate distance from one pixel to every other pixel in a chosen window. This minimizing operation determines the most confirmative pixel based on its similarity to the chosen window and replaces the central pixel of the window with the determined one. The peer group filters, unlike the vector median filters, determine a set of pixels that are most confirmative to the window and then perform filtering over the determined set. Using a set of pixels in the filtering process rather than one pixel is more helpful as it takes into account the full information of all the pixels that seemingly contribute to the signal. Hence, the peer group filters are found to be more robust to noise. However, the peer group for each pixel is computed deterministically using thresholding schemes. A wrong choice of the threshold will easily impair the filtering performance. In this paper, we propose a peer group filtering approach using principles of Bayesian probability theory and clustering. Here, we present a method to compute the probability that a pixel value is clean (not corrupted by impulse noise) and then apply clustering on the probability measure to determine the peer group. The key benefit of this proposal is that the need for thresholding in peer group filtering is completely avoided. Simulation results show that the proposed method performs better than the conventional vector median and peer group filtering methods in terms of noise reduction and structural similarity, thus validating the proposed approach.

Median type filters coupled with the Laplacian distribution assumption have shown a high efficiency in suppressing impulse noise. We however demonstrate in this paper that the Gaussian distribution assumption is more preferable than Laplacian distribution assumption in suppressing impulse noise, especially for high noise densities. This conclusion is supported by numerical experiments with different noise densities and filter models.

This paper proposes a new approach for filtering out impulse noise in digital color images. This work is of critical interest in biomedical imaging, visual tracking, etc. The conventional filtering methods operate by applying a noise reduction scheme, generally the vector median filtering approach and its variants, for the center pixel of a suitably chosen window that iteratively slides along the entire image. These methods consider the window in its entirety in the filtering process. This consideration, however, comprehends the noise within the noisy pixels in the filtering process and could prove detrimental to the overall output. The method proposed in this paper operates by clustering the pixels in the chosen window into two groups, one that corresponds to the pixel intensities that lie in the signal space and the other to those that lie in the noise space. The motivating rationale for this clustering scheme is to marginalize those pixels that lie in the noise space that seemingly do not contribute to the information in the image. The median filter is then applied to the pixels that contribute to the signal, in isolation from the color components, to filter out the impulse noise. Simulation results show that the proposed method outperforms conventional filtering methods in terms of noise reduction and structural similarity and thus validates the proposed approach. The proposed method is applied to analyze CT scans for improved diagnosis of SARS-COV-2 COVID-19 disease. The method is also applied to a visual tracking example as a preprocessor.

Particle Swarm Optimization technique, a new evolutionary soft computational technique, has been used to eliminate the random noise present in the bio-medical images. The reconstructed images have been compared to the presently available technique such as Median Filter, etc. The results indicate that the proposed technique is a simple and accurate model to eliminate noise from highly corrupt images. This proposed method has been tested with other images including medical images like mammograms.

In this paper, we propose an impulse noise removal algorithm, which can realize the elimination of the impulse noise in an image effectively even though these noises are on image edges or details. The algorithm introduces a statistic, visual perception outlier measurement (VPOM for short), to identify the impulse noise in an image. Once the noises are identified, noise candidates are restored by a nonlocal edge-preserving regularized filter. Extensive experimental results indicate that our algorithm provides a significant improvement over many other existing techniques.