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.

Efficient Ideal Algorithm for Task Scheduling in Cloud Computing

Present days cloud computing is one of the best raising technologies in distributed computing sectors which permits pays in line with model as per customer demand and requirements.Cloud includes a set of virtual machines which incorporates each persistent andcomputational facility. Providing efficient access of any data to the remote area through network is the primary motto of the cloud computing. Day by day cloud is facing many demanding situations. In which it is facing scheduling is the key one. The process through which the task can be done in certain order via pc device is called scheduling. The word scheduling defines different package of rules for controlling the task order for running the known job through network via computer machines. An awesome scheduler adapts the strategy of scheduling consistent with converting execution of job to sort of different tasks. In research paper we presented, data control of different virtual machines in cloud computing is the new target to the researchers. Algorithms of different tasks scheduling plays an essential and important role for solving some problems. The intention of the scheduling is running of different tasks successfully with in less time and accuracy.And we discussing about various components that cloud computing depends like CPU usage, Load balancing, and Time.

Performance Analyses of IDEAL Algorithm on Highly Skewed Grid System

IDEAL is an efficient segregated algorithm for the fluid flow and heat transfer problems. This algorithm has now been extended to the 3D nonorthogonal curvilinear coordinates. Highly skewed grids in the nonorthogonal curvilinear coordinates can decrease the convergence rate and deteriorate the calculating stability. In this study, the feasibility of the IDEAL algorithm on highly skewed grid system is analyzed by investigating the lid-driven flow in the inclined cavity. It can be concluded that the IDEAL algorithm is more robust and more efficient than the traditional SIMPLER algorithm, especially for the highly skewed and fine grid system. For example, at θ = 5° and grid number = 70 × 70 × 70, the convergence rate of the IDEAL algorithm is 6.3 times faster than that of the SIMPLER algorithm, and the IDEAL algorithm can converge almost at any time step multiple.

Parallel Improvement for a Classical Template Serial Thinning Algorithm

Image thinning is one of important steps of fingerprint preprocessing. Most of fingerprint recognition algorithms checked the characteristic points on thinning image. In this paper, we discover some shortages in OPTA and mathematical morphology thinning algorithm and find out the reasons for some shortages such as many glitches and snags, defective thinning, and so on. A new improved algorithm is proposed in the paper, which is an ideal algorithm because it is faster, produces less glitch, and thins completely.