Effects of inner iteration times on the performance of IDEAL algorithm

2011 ◽  
Vol 38 (9) ◽  
pp. 1195-1200 ◽  
Author(s):  
D.L. Sun ◽  
Q.P. Liu ◽  
J.L. Xu ◽  
W.Q. Tao
Keyword(s):  
Inner Iteration ◽  
Ideal Algorithm

scholarly journals Image smoothing based on global sparsity decomposition and a variable parameter

2021 ◽  
Author(s):  
Xiang Ma ◽  
Xuemei Li ◽  
Yuanfeng Zhou ◽  
Caiming Zhang
Keyword(s):  
Removal Rate ◽  
Variable Parameter ◽  
Smoothing Parameter ◽  
Smoothing Effect ◽  
Image Smoothing ◽  
Sparse Decomposition ◽  
Alternating Direction ◽  
Texture Removal ◽  
Ideal Algorithm ◽  
Better Than

AbstractSmoothing 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.

Parallel Improvement for a Classical Template Serial Thinning Algorithm

2011 ◽  
Vol 271-273 ◽  
pp. 1509-1513 ◽  
Author(s):  
Mei Xiu Lu ◽  
Fu Rong Wang ◽  
Feng Li
Keyword(s):  
Mathematical Morphology ◽  
Fingerprint Recognition ◽  
Thinning Algorithm ◽  
Recognition Algorithms ◽  
Characteristic Points ◽  
Image Thinning ◽  
Ideal Algorithm ◽  
Improved 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.

scholarly journals MN-PGSOR Method for Solving Nonlinear Systems with Block Two-by-Two Complex Symmetric Jacobian Matrices

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Yu-Ye Feng ◽  
Qing-Biao Wu
Keyword(s):  
Nonlinear Systems ◽  
Iteration Method ◽  
Computing Time ◽  
Coefficient Matrix ◽  
New Method ◽  
Jacobian Matrices ◽  
Modified Newton Method ◽  
Preconditioned Matrix ◽  
Outer Iteration ◽  
Inner Iteration

For solving the large sparse linear systems with 2 × 2 block structure, the generalized successive overrelaxation (GSOR) iteration method is an efficient iteration method. Based on the GSOR method, the PGSOR method introduces a preconditioned matrix with a new parameter for the coefficient matrix which can enhance the efficiency. To solve the nonlinear systems in which the Jacobian matrices are complex and symmetric with the block two-by-two form, we try to use the PGSOR method as an inner iteration, with the help of the modified Newton method as an efficient outer iteration method. This new method is called the modified Newton-PGSOR (MN-PGSOR) method. Local convergence properties of the MN-PGSOR are analyzed under the Hölder condition. Finally, we give the comparison of our new method with some previous methods in the numerical results. The MN-PGSOR method is superior in both iteration steps and computing time.

scholarly journals Modeling Design Iteration in Product Design and Development and Its Solution by a Novel Artificial Bee Colony Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Tinggui Chen ◽  
Renbin Xiao
Keyword(s):  
Product Design ◽  
Iteration Method ◽  
High Performance ◽  
Artificial Bee Colony ◽  
Market Competition ◽  
Processing System ◽  
Design And Development ◽  
Bee Colony ◽  
Design Iteration ◽  
Inner Iteration

Due to fierce market competition, how to improve product quality and reduce development cost determines the core competitiveness of enterprises. However, design iteration generally causes increases of product cost and delays of development time as well, so how to identify and model couplings among tasks in product design and development has become an important issue for enterprises to settle. In this paper, the shortcomings existing in WTM model are discussed and tearing approach as well as inner iteration method is used to complement the classic WTM model. In addition, the ABC algorithm is also introduced to find out the optimal decoupling schemes. In this paper, firstly, tearing approach and inner iteration method are analyzed for solving coupled sets. Secondly, a hybrid iteration model combining these two technologies is set up. Thirdly, a high-performance swarm intelligence algorithm, artificial bee colony, is adopted to realize problem-solving. Finally, an engineering design of a chemical processing system is given in order to verify its reasonability and effectiveness.

scholarly journals Performance Analyses of IDEAL Algorithm on Highly Skewed Grid System

2014 ◽  
Vol 6 ◽  
pp. 813510
Author(s):  
Dongliang Sun ◽  
Jinliang Xu ◽  
Peng Ding
Keyword(s):  
Convergence Rate ◽  
Curvilinear Coordinates ◽  
Grid System ◽  
Time Step ◽  
Fine Grid ◽  
Simpler Algorithm ◽  
Inclined Cavity ◽  
Transfer Problems ◽  
Ideal Algorithm ◽  
The Ideal

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.

Performance Analysis of IDEAL Algorithm Combined with Bi-CGSTAB Method

2010 ◽  
Vol 56 (6) ◽  
pp. 411-431 ◽  
Author(s):  
D. L. Sun ◽  
Y. P. Yang ◽  
J. L. Xu ◽  
W. Q. Tao
Keyword(s):  
Performance Analysis ◽  
Ideal Algorithm
Sign in / Sign up

Export Citation Format

Share Document