A New Blocking Effect Reduction Method

Block effect reduction by the 1-D gray polynomial interpolation

Abstract. In recent years, the use of Polarimetric Synthetic Aperture Radar (PolSAR) data in different applications dramatically has been increased. In SAR imagery an interference phenomenon with random behavior exists which is called speckle noise. The interpretation of data encounters some troubles due to the presence of speckle which can be considered as a multiplicative noise affecting all coherent imaging systems. Indeed, speckle degrade radiometric resolution of PolSAR images, therefore it is needful to perform speckle filtering on the SAR data type. Markov Random Field (MRF) has proven to be a powerful method for drawing out eliciting contextual information from remotely sensed images. In the present paper, a probability density function (PDF), which is fitted well with the PolSAR data based on the goodness-of-fit test, is first obtained for the pixel-wise analysis. Then the contextual smoothing is achieved with the MRF method. This novel speckle reduction method combines an advanced statistical distribution with spatial contextual information for PolSAR data. These two parts of information are combined based on weighted summation of pixel-wise and contextual models. This approach not only preserves edge information in the images, but also improves signal-to-noise ratio of the results. The method maintains the mean value of original signal in the homogenous areas and preserves the edges of features in the heterogeneous regions. Experiments on real medium resolution ALOS data from Tehran, and also high resolution full polarimetric SAR data over the Oberpfaffenhofen test-site in Germany, demonstrate the effectiveness of the algorithm compared with well-known despeckling methods.

It is well known that at low bit rates, a block-based discrete cosine transform compressed image or video can exhibit visually annoying blocking and ringing artifacts. Low-pass filters are very effective in reducing the blocking artifacts in smooth areas. However, it is difficult to achieve a satisfactory result for ringing artifact removal using only an adaptive filtering scheme. This paper presents a neural network-based deblocking method that is effective on various types of images. The first step of this scheme is block classification that identifies each 8 × 8 block as one of the three types: PLAIN, EDGE or TEXTURE, based on its statistical characteristics. The next step is the reduction in the blocking and ringing artifacts by applying three trained layered neural networks to three different types of image areas. Comparing this method with other algorithms, the simulation results clearly show that the proposed algorithm is very powerful in effectively reducing both blocking and ringing artifacts while preserving the true edge and textural information and thus significantly improving the visual quality of the blocking images or videos.

In this study, a Markov Random Field (MRF) approach is used to locate source boundary positions which are difficult to identify from Bouguer gravity and magnetic maps. As a generalized form of Markov Chains, the MRF approach is an unsupervised statistical model based algorithm and is applied to the analysis of images, particularly in the detection of visual patterns or textures. Here, we present a dynamic programming based on the MRF approach for boundary detection of noisy and super-positioned potential anomalies, which are produced by various geological structures. In the MRF method, gravity and magnetic maps are considered as two-dimensional (2-D) images with a matrix composed of N1 × N2 pixels. Each pixel value of the matrix is optimized in real time with no a priori processing by using two parameter sets; average steering vector (θ) and quantization level (M). They carry information about the correlation of neighboring pixels and the locality of their connections. We have chosen MRF as a processing approach for geophysical data since it is an unsupervised, efficient model for image enhancement, border detection and separation of 2-D potential anomalies. The main benefit of MRF is that an average steering vector and a quantization level are enough in evaluation of the potential anomaly maps. We have compared the MRF method to noise implemented synthetic potential field anomalies. After satisfactory results were found, the method has been applied to gravity and magnetic anomaly maps of Gelibolu Peninsula in Western Turkey. Here, we have observed Anafartalar thrust fault and another parallel fault northwest of Anafartalar thrust fault. We have modeled a geological structure including a lateral fault, which results in a higher susceptibility and anomaly amplitude increment. We have shown that the MRF method is effective to detect the broad-scale geological structures in the Gelibolu Peninsula, and thus to delineate the complex tectonic structure of Gelibolu Peninsula.

Summary form only given. Block-based Discrete Cosine Transform (BDCT) has been widely used in image and video compression due to its energy compacting property and relative ease of implementation. However, BDCT has a major drawback, which is usually referred to as blocking artifacts. Blocking artifacts appear as grid noise along the block boundaries because each block is transformed and quantized independently. Image deblocking techniques can reduce these distortions and alleviate the conflict between bit rate reduction and visual quality preservation. Many state-of-the-art image deblocking algorithms treated the blocking artifacts reduction of the compressed image as an inverse restoration problem. Natural image prior models are well utilized into the blocking artifacts reduction processing, such as the local sparsity prior model and non-local similarity property of natural images. These two local and non-local models characterize the image prior information in two complementary perspectives. Therefore, it is necessary to combine these two models in a unified framework. In this paper, we propose a novel method to reduce the blocking artifacts of blockcoded images via patch clustering and low-rank minimization, which simultaneously exploits the local and non-local sparse representations in a unified framework. First, the whole compressed image are divided into small patches. For each patch, we perform patch clustering to collect similar patches into a group. Then the whole group are simultaneously reconstructed by a low-rank minimization approach. Singular value thresholding (SVT) algorithm is employed to solve the low-rank minimization problem. To further improve the performance of the proposed algorithm, we adopt an iterative procedure to utilize the newly output data in each iteration and update the noise and signal variance adaptively. Experimental results show that the proposed method achieves higher PSNR and SSIM than the state-of-the-art methods. Comparing to the state-of-theart algorithms and, the proposed algorithm achieves about 0.37dB and 0.11dB improvement on average. For visual quality assessment, the deblocking images produced by the proposed algorithm reveal much more sharp edge structures and richer textures.

Coding of images or processing of images has played a momentous role in the success of digital communications and multimedia. Coding plays a major role is 3D mobile generation. The image processing methods have been exploited through the years to improve the quality of digital images. In the image processing system De-noising based coding is used extensively. As we know that, in low bit rate applications, the blocking artifacts problem arises, which severely reduce the visual quality of the image. Reducing blocking artifacts is essential to render the compressed visual data acceptable to the viewer. So, to detect and reduce noise from the image is a major task. So removing the noise from original signal is still a challenging problem for researchers. There have been several published algorithms and each approach has its assumptions, advantages, and limitations. For real-time applications like television, photo-phone, etc. it is essential to reduce the noise power as much as possible and to retain the fine details and the edges in the image as well. Moreover, it is very important to have very low computational complexity so that the filtering operation is performed in a short time for online and real-time applications. The main focus of this paper is first to define an algorithm and based on that a non linear threshold filter is described which not only preserve the actual image structures in the presence of different types of noises (Salt & peepers, Speckle and Gaussian Noise) as well as it provide better PSNR, MSE, MAE, & Time Complexity than others Classical algorithms.

Improving the runtime of MRF based method for MRI brain segmentation

An effective post-processing technique is proposed to reduce the blocking artifacts in the block discrete cosine transform (BDCT)-coded images. Simulation results indicate that the proposed scheme outperforms conventional post-processing techniques in both PSNR and visual quality.

Uncertainty quantification of metallic microstructures using principal image moments

Image segmentation method combined with Markov random field (MRF) model and regional growth image in this paper is proposed to achieve the accuracy of sonar image segmentation. First of all, the characteristics of field and the label field of sonar image is established through the MRF model; secondly, the further image segmentation is processed by region growing based on the initial image segmentation by ICM algorithm, and this reduced segmentation plaques caused by the MRF method on image segmentation. Finally, experimental results show that the method in this paper can obtain the image segmentation effectively.

Weighted roll-off scheme to remove block artifacts for low power local dimming liquid crystal displays

In this paper, we propose and compare two spectral angle based approaches for spatial-spectral classification. Our methods use the spectral angle to generate unary energies in a grid-structured Markov random field defined over the pixel labels of a hyperspectral image. The first approach is to use the exponential spectral angle mapper (ESAM) kernel/covariance function, a spectral angle based function, with the support vector machine and the Gaussian process classifier. The second approach is to directly use the minimum spectral angle between the test pixel and the training pixels as the unary energy. We compare the proposed methods with the state-of-the-art Markov random field methods that use support vector machines and Gaussian processes with squared exponential kernel/covariance function. In our experiments with two datasets, it is seen that using minimum spectral angle as unary energy produces better or comparable results to the existing methods at a smaller running time.

Chaotic moving video quality enhancement based on deep in-loop filtering

GPU-accelerated MRF segmentation algorithm for SAR images

A new method for the automated extraction of pipelines and other linear objects from Synthetic Aperture Radar (SAR) scenes is presented. It combines intensity data with coherence data from an interferometric evaluation of a SAR scene pair. The fusion is based on Bayesian statistics and is part of a Markov random field (MRF) model for line extraction. Both intensity and coherence data are evaluated using rotating templates. The different statistical properties of intensity and coherence are taken into account by a multiplicative noise model and an additive noise model respectively. The MRF model introduces prior knowledge about the continuity and the narrowness of lines. Posterior odds resulting from the MRF method are input to a method based on ziplock snakes for linear object extraction. This processing step is controlled interactively which is necessary as fully automatic processing of the given noisy data does not provide sufficiently predictable results. The method is applied to data of the ERS tandem mission.