Performance Analysis of Image Smoothing Techniques on a New Fractional Convolution Mask for Image Edge Detection

We present the analysis of three independent and most widely used image smoothing techniques on a new fractional based convolution edge detector originally constructed by same authors for image edge analysis. The implementation was done using only Gaussian function as its smoothing function based on predefined assumptions and therefore did not scale well for some types of edges and noise. The experiments conducted on this mask using known images with realistic geometry suggested the need for image smoothing adaptation to obtain a more optimal performance. In this paper, we use the structural similarity index measure and show that the adaptation technique for choosing smoothing function has significant advantages over a single function implementation. The new adaptive fractional based convolution mask can smoothly find edges of various types in detail quite significantly. The method can now trap both local discontinuities in intensity and its derivatives as well as locating Dirac edges.

A Parameter Adaptive Method for Image Smoothing

Edge is the key information in the process of image smoothing. Some edges, especially the weak edges, are difficult to maintain, which result in the local area being over-smoothed. For the protection of weak edges, we propose an image smoothing algorithm based on global sparse structure and parameter adaptation. The algorithm decomposes the image into high frequency and low frequency part based on global sparse structure. The low frequency part contains less texture information which is relatively easy to smoothen. The high frequency part is more sensitive to edge information so it is more suitable for the selection of smoothing parameters. To reduce the computational complexity and improve the effect, we propose a bicubic polynomial fitting method to fit all the sample values into a surface. Finally, we use Alternating Direction Method of Multipliers (ADMM) to unify the whole algorithm and obtain the smoothed results by iterative optimization. Compared with traditional methods and deep learning methods, as well as the application tasks of edge extraction, image abstraction, pseudo-boundary removal, and image enhancement, it shows that our algorithm can preserve the local weak edge of the image more effectively, and the visual effect of smoothed results is better.

Image Smoothing Based on Image Decomposition and Sparse High Frequency Gradient

Image smoothing is a crucial image processing topic and has wide applications. For images with rich texture, most of the existing image smoothing methods are difficult to obtain significant texture removal performance because texture containing obvious edges and large gradient changes is easy to be preserved as the main edges. In this paper, we propose a novel framework （DSHFG） for image smoothing combined with the constraint of sparse high frequency gradient for texture images. First, we decompose the image into two components： a smooth component （constant component） and a non-smooth （high frequency） component. Second, we remove the non-smooth component containing high frequency gradient and smooth the other component combining with the constraint of sparse high frequency gradient. Experimental results demonstrate the proposed method is more competitive on efficiently texture removing than the state-of-the-art methods. What is more, our approach has a variety of applications including edge detection, detail magnification, image abstraction, and image composition.

A nonlocal gradient concentration method for image smoothing

It is challenging to consistently smooth natural images, yet smoothing results determine the quality of a broad range of applications in computer vision. To achieve consistent smoothing, we propose a novel optimization model making use of the redundancy of natural images, by defining a nonlocal concentration regularization term on the gradient. This nonlocal constraint is carefully combined with a gradientsparsity constraint, allowing details throughout the whole image to be removed automatically in a datadriven manner. As variations in gradient between similar patches can be suppressed effectively, the new model has excellent edge preserving, detail removal,and visual consistency properties. Comparisons with state-of-the-art smoothing methods demonstrate the effectiveness of the new method. Several applications,including edge manipulation, image abstraction,detail magnification, and image resizing, show the applicability of the new method.

Image smoothing based on global sparsity decomposition and a variable parameter

Smoothing images,especially with rich texture,is an important problem in computer vision.Obtaining an ideal result is difficult due to complexity,irregularity,and anisotropicity of the texture.Besides,some properties are shared by the texture and the structure in an image.It is a hard compromise to retain structure and simultaneously remove texture.To create an ideal algorithm for image smoothing,we face three problems.For images with rich textures,the smoothing effect should be enhanced.We should overcome inconsistency of smoothing results in different parts of the image.It is necessary to create a method to evaluate the smoothing effect.We apply texture pre-removal based on global sparse decomposition with a variable smoothing parameter to solve the first two problems.A parametric surface constructed by an improved Bessel method is used to determine the smoothing parameter.Three evaluation measures:edge integrity rate,texture removal rate,and gradient value distribution are proposed to cope with the third problem.We use the alternating direction method of multipliers to complete the whole algorithm and obtain the results.Experiments show that our algorithm is better than existing algorithms both visually and quantitatively.We also demonstrate our method’s ability in other applications such as clip-art compression artifact removal and content-aware image manipulation.

Image smoothing of multispectral imagery based on the HNN and geo-statistics

A new method for image down-scaling using geostatistical interpolation or smoothing based on the Hopfield Neural Network(HNN) and zero semivariance value is introduced.The method utilises the smoothing effect of the semivariogram matching process to produce the smoothened sub-pixel multispectral(MS) image with smaller RMSEs in comparison with the bilinear interpolation.In fact,the zero semivariograms increase the spatial correlation between the adjacent sub-pixels of the superresolution image.Containing higher spatial correlation,the resulting super-resolution MS image has smaller RMSEs compared with the original coarse image.

More efficient ground truth ROI image coding technique: implementation and wavelet based application analysis

In this paper, more efficient, low-complexity and reliable region of interest （ROI） image codec for compressing smooth low texture remote sensing images is proposed. We explore the efficiency of the modified RO! codec with respect to the selected set of convenient wavelet filters, which is a novel method. Such ROI coding experiment analysis representing low bit rate lossy to high quality lossless reconstruction with timing analysis is useful for improving remote sensing ground truth surveillance efficiency in terms of time and quality. The subjective [i.e. fair, five observer （HVS） evaluations using enhanced 3D picture view Hyper memory display technology] and the objective results revealed that for faster ground truth ROI coding applications, the Symlet-4 adaptation performs better than Biorthogonal 4.4 and Biorthogonal 6.8. However, the discrete Meyer wavelet adaptation is the best solution for delayed ROI image reconstructions.

Least-squares images for edge-preserving smoothing

In this paper, we propose least-squares images(LS-images) as a basis for a novel edgepreserving image smoothing method. The LS-image requires the value of each pixel to be a convex linear combination of its neighbors, i.e., to have zero Laplacian, and to approximate the original image in a least-squares sense. The edge-preserving property inherits from the edge-aware weights for constructing the linear combination. Experimental results demonstrate that the proposed method achieves high quality results compared to previous state-of-theart works. We also show diverse applications of LSimages, such as detail manipulation, edge enhancement,and clip-art JPEG artifact removal.

Satellite Image Adaptive Restoration Using Periodic Plus Smooth Image Decomposition and Complex Wavelet Packet Transforms

A satellite image adaptive restoration method was developed that avoids ringing artifacts at the image boundary and retains oriented features. The method combines periodic plus smooth image decom- position with complex wavelet packet transforms. The framework first decomposes a degraded satellite im- age into the sum of a ＂periodic component＂ and a ＂smooth component＂. The Bayesian method is then used to estimate the modulation transfer function degradation parameters and the noise. The periodic component is deconvoluted using complex wavelet packet transforms with the deconvolution result of the periodic component then combined with the smooth component to get the final recovered result. Tests show that this strategy effectively avoids ringing artifacts while preserving local image details （especially directional tex- tures） without amplifying the noise. Quantitative comparisons illustrate that the results are comparable with previous methods. Another benefit is that this approach can process large satellite images with parallel processing, which is important for practical use.

Improved image filter based on SPCNN

By extraction of the thoughts of non-linear model and adaptive model match, an improved Nagao filter is brought. Meanwhile a technique based on simplified pulse coupled neural network and used for noise positioning, is put forward. Combining the two methods above, we acquire a new method that can restore images corrupted by salt and pepper noise. Experiments show that this method is more preferable than other popular ones, and still works well while noise density fluctuates severely.