scholarly journals Modified Poisson compositing technique on skewed grid

2021 ◽  
Vol 7 (2) ◽  
pp. 2176-2194
Author(s):  
Nordin Saad ◽  
◽  
A'qilah Ahmad Dahalan ◽  
Azali Saudi ◽  
Keyword(s):  
Linear Equations ◽  
Numerical Differentiation ◽  
Laplacian Operator ◽  
Source Image ◽  
Image Composition ◽  
Measurement Results ◽  
Image Compositing ◽  
Speed Up ◽  
Relaxation Factors ◽  
Two Parameter

<abstract><p>Image compositing is the process of seamlessly inserting a portion of a source image into a target image to create a new desirable image. This work describes an image composition approach based on numerical differentiation utilizing the Laplacian operator. The suggested procedure uses the red-black strategy to speed up computations by using two separate relaxation factors for red and black nodes, as well as two accelerated parameters on a skewed grid. The Skewed Modified Two-Parameter Overrelaxation (SkMTOR) approach is a modification of the existing MTOR method. The SkMTOR has been used to solve numerous linear equations in the past, but its applicability in image processing has never been investigated. Several examples were used to test the suggested method in solving the Poisson equation for image composition. The results demonstrated that the image composition was successfully constructed using all six methods considered in this study. The six methods evaluated yielded identical images based on the similarity measurement results. In terms of computing speed, the skewed variants perform much quicker than their corresponding regular grid variants, with the SkMTOR showing the best performance.</p></abstract>

scholarly journals Modified iterative method with red-black ordering for image composition using poisson equation

2021 ◽  
Vol 10 (4) ◽  
pp. 2016-2027
Author(s):  
Zakariah Aris ◽  
Nordin Saad ◽  
A’qilah Ahmad Dahalan ◽  
Andang Sunarto ◽  
Azali Saudi
Keyword(s):  
Poisson Equation ◽  
Linear Equations ◽  
Numerical Differentiation ◽  
Laplacian Operator ◽  
Source Image ◽  
Relaxation Methods ◽  
Image Composition ◽  
The Poisson Equation ◽  
Speed Up ◽  
Two Parameter

Image composition involves the process of embedding a selected region of the source image to the target image to produce a new desirable image seamlessly. This paper presents an image composition procedure based on numerical differentiation using the laplacian operator to obtain the solution of the poisson equation. The proposed method employs the red-black strategy to speed up the computation by using two acceleration parameters. The method is known as modified two-parameter over-relaxation (MTOR) and is an extension of the existing relaxation methods. The MTOR was extensively studied in solving various linear equations, but its usefulness in image processing was never explored. Several examples were tested to examine the effectiveness of the proposed method in solving the poisson equation for image composition. The results showed that the proposed MTOR performed faster than the existing methods.

Recursive Linearization of Multibody Dynamics and Application to Control Design

1990 ◽  
Author(s):  
Tsung-Chieh Lin ◽  
K. Harold Yae
Keyword(s):  
Multibody Dynamics ◽  
Equations Of Motion ◽  
Linear Equations ◽  
Control Design ◽  
Numerical Differentiation ◽  
Difficult Problem ◽  
Computational Method ◽  
Computational Error ◽  
Dynamics Modeling ◽  
Analytical Approximations

Abstract The non-linear equations of motion in multi-body dynamics pose a difficult problem in linear control design. It is therefore desirable to have linearization capability in conjunction with a general-purpose multibody dynamics modeling technique. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient. It has also turned out to be more accurate because the analytical perturbation requires matrix and vector operations by circumventing numerical differentiation and other associated numerical operations that may accumulate computational error.

scholarly journals Two-parameter TSCSP method for solving complex symmetric system of linear equations

CALCOLO ◽  
2018 ◽  
Vol 55 (1) ◽  
Author(s):  
Davod Khojasteh Salkuyeh ◽  
Tahereh Salimi Siahkolaei
Keyword(s):  
Linear Equations ◽  
Symmetric System ◽  
System Of Linear Equations ◽  
Complex Symmetric ◽  
Two Parameter

Comparison of Reduced and Conventional Two-Phase Flash Calculations

SPE Journal ◽  
2014 ◽  
Vol 20 (02) ◽  
pp. 294-305 ◽  
Author(s):  
S.E.. E. Gorucu ◽  
R.T.. T. Johns
Keyword(s):  
Variable Number ◽  
Binary Interaction ◽  
Binary Interaction Parameter ◽  
Computational Time ◽  
Compositional Simulation ◽  
Two Phase ◽  
Number Of Components ◽  
Speed Up ◽  
Conventional Methods ◽  
Two Parameter

Summary Phase-equilibrium calculations become computationally intensive in compositional simulation as the number of components and phases increases. Reduced methods were developed to address this problem, where the binary-interaction-parameter (BIP) matrix is approximated either by spectral decomposition (SD), as performed by Hendriks and van Bergen (1992), or with the two-parameter BIP formula of Li and Johns (2006). Several authors have recently stated that the SD method—and by reference all reduced methods—is not as fast as previously reported in the literature. In this paper we present the first study that compares all eight reduced and conventional methods published to date by use of optimized code and compilers. The results show that the SD method and its variants are not as fast as other reduced methods, and can be slower than the conventional approach when fewer than 10 components are used. These conclusions confirm the findings of recently published papers. The reason for the slow speed is the requirement that the code must allow for a variable number of eigenvalues. We show that the reduced method of Li and Johns (2006) and its variants, however, are faster because the number of reduced parameters is fixed to six, which is independent of the number of components. Speed up in flash calculations for their formula is achieved for all fluids studied when more than six components are used. For example, for 10-component fluids, a speed up of 2–3 in the computational time for Newton-Raphson (NR) iterations is obtained compared with the conventional method modeled after minimization of Gibbs energy. The reduced method modeled after the linearized approach of Nichita and Graciaa (2011), which uses the two-parameter BIP formula of Li and Johns (2006), is also demonstrated to have a significantly larger radius of convergence than other reduced and conventional methods for five fluids studied.

scholarly journals Implementation of TAGE Method Using Seikkala Derivatives Applied to Two-Point Fuzzy Boundary Value Problems

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
A. A. Dahalan ◽  
J. Sulaiman
Keyword(s):  
Boundary Value Problems ◽  
Numerical Experiments ◽  
Boundary Value ◽  
Linear Equations ◽  
Alternating Group ◽  
System Of Linear Equations ◽  
Fuzzy Boundary Value Problems ◽  
Fuzzy Boundary ◽  
Two Parameter ◽  
Number Of Iterations

Iterative methods particularly the Two-Parameter Alternating Group Explicit (TAGE) methods are used to solve system of linear equations generated from the discretization of two-point fuzzy boundary value problems (FBVPs). The formulation and implementation of the TAGE method are also presented. Then numerical experiments are carried out onto two example problems to verify the effectiveness of the method. The results show that TAGE method is superior compared to GS method in the aspect of number of iterations, execution time, and Hausdorff distance.

scholarly journals Accelerated Red-Black Strategy for Image Composition Using Laplacian Operator

2021 ◽  
Vol 10 (1) ◽  
pp. 1085-1095
Author(s):  
Nordin Saad ◽  
Andang Sunarto ◽  
Azali Saudi
Keyword(s):  
Laplacian Operator ◽  
Image Composition

scholarly journals Numerical Simulation of Multiphase Multicomponent Flow in Porous Media: Efficiency Analysis of Newton-Based Method

Fluids ◽  
2021 ◽  
Vol 6 (10) ◽  
pp. 355
Author(s):  
Timur Imankulov ◽  
Danil Lebedev ◽  
Bazargul Matkerim ◽  
Beimbet Daribayev ◽  
Nurislam Kassymbek
Keyword(s):  
Porous Media ◽  
Linear Equations ◽  
Computation Time ◽  
Flow In Porous Media ◽  
Multicomponent Flow ◽  
Original Matrix ◽  
Sparsity Pattern ◽  
Speed Up ◽  
Systems Of Linear Equations ◽  
The One

Newton’s method has been widely used in simulation multiphase, multicomponent flow in porous media. In addition, to solve systems of linear equations in such problems, the generalized minimal residual method (GMRES) is often used. This paper analyzed the one-dimensional problem of multicomponent fluid flow in a porous medium and solved the system of the algebraic equation with the Newton-GMRES method. We calculated the linear equations with the GMRES, the GMRES with restarts after every m steps—GMRES (m) and preconditioned with Incomplete Lower-Upper factorization, where the factors L and U have the same sparsity pattern as the original matrix—the ILU(0)-GMRES algorithms, respectively, and compared the computation time and convergence. In the course of the research, the influence of the preconditioner and restarts of the GMRES (m) algorithm on the computation time was revealed; in particular, they were able to speed up the program.

scholarly journals Efficient Neural Network Modeling for Flight and Space Dynamics Simulation

2011 ◽  
Vol 2011 ◽  
pp. 1-7 ◽  
Author(s):  
Ayman Hamdy Kassem
Keyword(s):  
Neural Network ◽  
Dynamic Systems ◽  
Dynamic Models ◽  
Network Modeling ◽  
Linear Equations ◽  
Dynamics Simulation ◽  
Neural Network Modeling ◽  
The Neural Network ◽  
Speed Up ◽  
Space Dynamics

This paper represents an efficient technique for neural network modeling of flight and space dynamics simulation. The technique will free the neural network designer from guessing the size and structure for the required neural network model and will help to minimize the number of neurons. For linear flight/space dynamics systems, the technique can find the network weights and biases directly by solving a system of linear equations without the need for training. Nonlinear flight dynamic systems can be easily modeled by training its linearized models keeping the same network structure. The training is fast, as it uses the linear system knowledge to speed up the training process. The technique is tested on different flight/space dynamic models and showed promising results.

SEBSM-Based Iterative Method for Solving Large Systems of Linear Equations and Its Applications in Engineering Computation

2016 ◽  
Vol 13 (05) ◽  
pp. 1650024 ◽  
Author(s):  
Jin-Xiu Hu ◽  
Xiao-Wei Gao ◽  
Zhi-Chao Yuan ◽  
Jian Liu ◽  
Shi-Zhang Huang
Keyword(s):  
Iterative Method ◽  
Direct Method ◽  
Linear Equations ◽  
Coefficient Matrix ◽  
Relaxation Factor ◽  
Banded Matrix ◽  
Speed Up ◽  
Systems Of Linear Equations ◽  
Matrix Formula ◽  
Large Systems

In this paper, a new iterative method, for solving sparse nonsymmetrical systems of linear equations is proposed based on the Simultaneous Elimination and Back-Substitution Method (SEBSM), and the method is applied to solve systems resulted in engineering problems solved using Finite Element Method (FEM). First, SEBSM is introduced for solving general linear systems using the direct method. And, then an iterative method based on SEBSM is presented. In the method, the coefficient matrix [Formula: see text] is split into lower, diagonally banded and upper matrices. The iterative convergence can be controlled by selecting a suitable bandwidth of the diagonally banded matrix. And the size of the working array needing to be stored in iteration is as small as the bandwidth of the diagonally banded matrix. Finally, an accelerating strategy for this iterative method is proposed by introducing a relaxation factor, which can speed up the convergence effectively if an optimal relaxation factor is chosen. Two numerical examples are given to demonstrate the behavior of the proposed method.

scholarly journals Development of a Sensor to Measure Physician Consultation Times

Sensors ◽  
2019 ◽  
Vol 19 (24) ◽  
pp. 5359 ◽  
Author(s):  
Roman Gabl ◽  
Florian Stummer
Keyword(s):  
Walking Speed ◽  
Sensor System ◽  
Quality Analysis ◽  
Treatment Processes ◽  
Time Period ◽  
Single Side ◽  
Physician Contact ◽  
Measurement Results ◽  
Speed Up ◽  
Consultation Time

The duration of patient–physician contact is an important factor for the optimisation of treatment processes in healthcare systems. Available methods can be labour-intensive and the quality is, in many cases, poor. A part of this research project is to develop a sensor system, which allows the detection of people passing through a door, including the direction. For this purpose, two time of flight sensors are combined with a door sensor and a motion detection sensor (for redundancy) on one single side of the door frame. The period between two single measurements could be reduced to 50 ms, which allows the measurement of walking speed up to 2 ms − 1 . The accuracy of the time stamp for each event is less than one second and ensures a precise documentation of the consultation time. This paper presents the development of the sensor system, the miniaturisation of the installation and first measurement results, as well as the measurement’s concept of quality analysis, including multiple door applications. In future steps, the sensor system will be deployed at different medical practices to determine the exact duration of the patient–physician interaction over a longer time period.

Sign in / Sign up

Export Citation Format

Share Document