Exploiting Image Local And Nonlocal Consistency For Mixed Gaussian-Impulse Noise Removal

Most existing image denoising algorithms can only deal with a single type of noise, which violates the fact that the noisy observed images in practice are often suffered from more than one type of noise during the process of acquisition and transmission. In this paper, we propose a new variational algorithm for mixed Gaussian-impulse noise removal by exploiting image local consistency and nonlocal consistency simultaneously. Specifically, the local consistency is measured by a hyper-Laplace prior, enforcing the local smoothness of images, while the nonlocal consistency is measured by three-dimensional sparsity of similar blocks, enforcing the nonlocal self-similarity of natural images. Moreover, a Split-Bregman based technique is developed to solve the above optimization problem efficiently. Extensive experiments for mixed Gaussian plus impulse noise show that significant performance improvements over the current state-of-the-art schemes have been achieved, which substantiates the effectiveness of the proposed algorithm.Comment: 6 pages, 4 figures, 3 tables, to be published at IEEE Int. Conf. on Multimedia & Expo (ICME) 201

REMOVAL OF GAUSSIAN AND IMPULSE NOISE IN THE COLOUR IMAGE PROGRESSION WITH FUZZY FILTERS

This paper is concerned with algebraic features based filtering technique, named as the adaptive statistical quality based filtering technique (ASQFT), is presented for removal of Impulse and Gaussian noise in corrupted colour images. A combination of these two filters also helps in eliminating a mixture of these two noises. One strong filtering step that should remove all noise at once would inevitably also remove a considerable amount of detail. Therefore, the noise is filtered step by step. In each step, noisy pixels are detected by the help of fuzzy rules, which are very useful for the processing of human knowledge where linguistic variables are used. The proposed filter is able to efficiently suppress both Gaussian noise and impulse noise, as well as mixed Gaussian impulse noise. The experiments shows that proposed method outperforms novel modern filters both visually and in terms of objective quality measures such as the mean absolute error (MAE), the peaksignal- to-noise ratio (PSNR) and the normalized color difference (NCD). The expectations filter achieves a promising performance

Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive Feedforward Neural Network

The problem of noise interference with the image always occurs irrespective of whatever precaution is taken. Challenging issues with noise reduction are diversity of characteristics involved with source of noise and in result; it is difficult to develop a universal solution. This paper has proposed neural network based generalize solution of noise reduction by mapping the problem as pattern approximation. Considering the statistical relationship among local region pixels in the noise free image as normal patterns, feedforward neural network is applied to acquire the knowledge available within such patterns. Adaptiveness is applied in the slope of transfer function to improve the learning process. Acquired normal patterns knowledge is utilized to reduce the level of different type of noise available within an image by recorrection of noisy patterns through pattern approximation. The proposed restoration method does not need any estimation of noise model characteristics available in the image not only that it can reduce the mixer of different types of noise efficiently. The proposed method has high processing speed along with simplicity in design. Restoration of gray scale image as well as color image has done, which has suffered from different types of noise like, Gaussian noise, salt &peper, speckle noise and mixer of it

Improved Iterative Truncated Arithmetic Mean Filter

This thesis discusses image processing and filtering techniques with emphasis on Mean filter, Median filter, and different versions of the Iterative Truncated Arithmetic Mean (ITM) filter. Specifically, we review in detail the ITM algorithms (ITM1 and ITM2) proposed by Xudong Jiang. Although filtering is capable of reducing noise in an image, it usually also results in smoothening or some other form of distortion of image edges and file details. Therefore, maintaining a proper trade off between noise reduction and edge/detail distortion is key. In this thesis, an improvement over Xudong Jiang’s ITM filters, namely ITM3, has been proposed and tested for different types of noise and for different images. Each of the two original ITM filters performs better than the other under different conditions. Experimental results demonstrate that the proposed filter, ITM3, provides a better trade off than ITM1 and ITM2 in terms of attenuating different types of noise and preserving fine image details and edges

Fuzzy metrics and fuzzy logic for colour image filtering

El filtrado de imagen es una tarea fundamental para la mayoría de los sistemas de visión por computador cuando las imágenes se usan para análisis automático o, incluso, para inspección humana. De hecho, la presencia de ruido en una imagen puede ser un grave impedimento para las sucesivas tareas de procesamiento de imagen como, por ejemplo, la detección de bordes o el reconocimiento de patrones u objetos y, por lo tanto, el ruido debe ser reducido. En los últimos años el interés por utilizar imágenes en color se ha visto incrementado de forma significativa en una gran variedad de aplicaciones. Es por esto que el filtrado de imagen en color se ha convertido en un área de investigación interesante. Se ha observado ampliamente que las imágenes en color deben ser procesadas teniendo en cuenta la correlación existente entre los distintos canales de color de la imagen. En este sentido, la solución probablemente más conocida y estudiada es el enfoque vectorial. Las primeras soluciones de filtrado vectorial, como por ejemplo el filtro de mediana vectorial (VMF) o el filtro direccional vectorial (VDF), se basan en la teoría de la estadística robusta y, en consecuencia, son capaces de realizar un filtrado robusto. Desafortunadamente, estas técnicas no se adaptan a las características locales de la imagen, lo que implica que usualmente los bordes y detalles de las imágenes se emborronan y pierden calidad. A fin de solventar este problema, varios filtros vectoriales adaptativos se han propuesto recientemente. En la presente Tesis doctoral se han llevado a cabo dos tareas principales: (i) el estudio de la aplicabilidad de métricas difusas en tareas de procesamiento de imagen y (ii) el diseño de nuevos filtros para imagen en color que sacan provecho de las propiedades de las métricas difusas y la lógica difusa. Los resultados experimentales presentados en esta Tesis muestran que las métricas difusas y la lógica difusa son herramientas útiles para diseñar técnicas de filtrado,Morillas Gómez, S. (2007). Fuzzy metrics and fuzzy logic for colour image filtering [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/1879Palanci

Echo Cancellation - A Likelihood Ratio Test for Double-talk Versus Channel Change

Echo cancellers are in wide use in both electrical (four wire to two wire mismatch) and acoustic (speaker-microphone coupling) applications. One of the main design problems is the control logic for adaptation. Basically, the algorithm weights should be frozen in the presence of double-talk and adapt quickly in the absence of double-talk. The control logic can be quite complicated since it is often not easy to discriminate between the echo signal and the near-end speaker. This paper derives a log likelihood ratio test (LRT) for deciding between double-talk (freeze weights) and a channel change (adapt quickly) using a stationary Gaussian stochastic input signal model. The probability density function of a sufficient statistic under each hypothesis is obtained and the performance of the test is evaluated as a function of the system parameters. The receiver operating characteristics (ROCs) indicate that it is difficult to correctly decide between double-talk and a channel change based upon a single look. However, post-detection integration of approximately one hundred sufficient statistic samples yields a detection probability close to unity (0.99) with a small false alarm probability (0.01)

Denoising using Self Adaptive Radial Basis Function

This paper presents an adaptive form of the Radial basis function neural network to correct the noisy image in a unified way without estimating the existing noise model in the image. Proposed method needs a single noisy image to train the adaptive radial basis function network to learn the correction of the noisy image. The gaussian kernel function is applied to reconstruct the local disturbance appeared because of the noise. The proposed adaptiveness in the radial basis function network is compared with the fixed form of spreadness and the center value of kernel function. The proposed solution can correct the image suffered from different varieties of noises like speckle noise, Gaussian noise, salt & pepper noise separately or combination of noises. Various standard test images are considered for test purpose with different levels of noise density and performance of proposed algorithm is compared with adaptive wiener filter

Development of Some Novel Nonlinear and Adaptive Digital Image Filters for Efficient Noise Suppression

Some nonlinear and adaptive digital image filtering algorithms have been developed in this thesis to suppress additive white Gaussian noise (AWGN), bipolar fixed-valued impulse, also called salt and pepper noise (SPN), random-valued impulse noise (RVIN) and their combinations quite effectively. The present state-of-art technology offers high quality sensors, cameras, electronic circuitry: application specific integrated circuits (ASIC), system on chip (SOC), etc., and high quality communication channels. Therefore, the noise level in images has been reduced drastically. In literature, many efficient nonlinear image filters are found that perform well under high noise conditions. But their performance is not so good under low noise conditions as compared to the extremely high computational complexity involved therein. Thus, it is felt that there is sufficient scope to investigate and develop quite efficient but simple algorithms to suppress low-power noise in an image. When..

Adaptive filters for sparse system identification

Sparse system identification has attracted much attention in the field of adaptive algorithms, and the adaptive filters for sparse system identification are studied. Firstly, a new family of proportionate normalized least mean square (PNLMS) adaptive algorithms that improve the performance of identifying block-sparse systems is proposed. The main proposed algorithm, called block-sparse PNLMS (BS-PNLMS), is based on the optimization of a mixed ℓ2,1 norm of the adaptive filter\u27s coefficients. A block-sparse improved PNLMS (BS-IPNLMS) is also derived for both sparse and dispersive impulse responses. Meanwhile, the proposed block-sparse proportionate idea has been extended to both the proportionate affine projection algorithm (PAPA) and the proportionate affine projection sign algorithm (PAPSA). Secondly, a generalized scheme for a family of proportionate algorithms is also presented based on convex optimization. Then a novel low-complexity reweighted PAPA is derived from this generalized scheme which could achieve both better performance and lower complexity than previous ones. The sparseness of the channel is taken into account to improve the performance for dispersive system identification. Meanwhile, the memory of the filter\u27s coefficients is combined with row action projections (RAP) to significantly reduce the computational complexity. Finally, two variable step-size zero-point attracting projection (VSS-ZAP) algorithms for sparse system identification are proposed. The proposed VSS-ZAPs are based on the approximations of the difference between the sparseness measure of current filter coefficients and the real channel, which could gain lower steady-state misalignment and also track the change in the sparse system --Abstract, page iv