• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.267-270
• /
• 2002

In this paper, a new watermarking method using an iterative scheme is proposed. The proposed method consists of two parts: watermark generation and its insertion. In the watermark generation, random signals with normalized distribution N(0,1) are produced and modified using an iterative scheme. In the watermark insertion, the resulting watermark signals are inserted into selected transform coefficients with various scaling parameters in order to achieve the invisibility and robustness against illegal attacks. The simulation results show that the proposed method has good performance for various attacks including image compression, filtering, etc.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.13 no.1
• /
• pp.20-24
• /
• 2009

Objective: In this study, the differences between two reconstruction methods were analyzed by comparing image uniformity and contrast according to Iteration and Subset, which were altered through the Iterative method and True X method, used in Siemens' PET/CT studies. Methods: The Phantom images were obtained by exposure for two minutes per one bed. To determine the image uniformity, the Coefficient of variance was used. Also, in order to compare the contrast value, we measured and analyzed the ratio of the SUV mean of Phantom image's hot spheres and the background. Results: Under the same reconstruction conditions (Iteration and Subset) of CV, the Iterative method was higher than the True X method. In the comparison of the SUV mean ratio of the background and hot sphere, the True X method had a closer rate than the Iterative method. Conclusion: The newly developed True X reconstruction method is better than the previously used Iterative method in terms of uniformity and contrast. However, the date for this study was only obtained using the Phantom device. In order to obtain more accurate and useful information from the experiment, further research should be conducted. Also, it is necessary to find the appropriate standards for Iteration and Subset for further experimentation.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.5
• /
• pp.88-93
• /
• 2003

This paper presents a controller design method of bilinear systems via iterative method. The iterative procedure with auxiliary sequences is defined in the process of constructing coupled linear time varying systems from bilinear systems. To design the feedback controller for bilinear systems with quadratic cost function, an optimization procedure is given by the representation closely related to the Riccati approach. In the simulation results, it is shown that the suggested method accomplishes the improved performance and good convergence.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.9 no.4
• /
• pp.390-403
• /
• 2017

Smoothed Particle Hydrodynamics (SPH) method has a good adaptability for the simulation of free surface flow problems. There are two forms of SPH. One is weak compressible SPH and the other one is incompressible SPH (ISPH). Compared with the former one, ISPH method performs better in many cases. ISPH based on Rankine source solution can perform better than traditional ISPH, as it can use larger stepping length by avoiding the second order derivative in pressure Poisson equation. However, ISPH_R method needs to solve the sparse linear matrix for pressure Poisson equation, which is one of the most expensive parts during one time stepping calculation. Iterative methods are normally used for solving Poisson equation with large particle numbers. However, there are many iterative methods available and the question for using which one is still open. In this paper, three iterative methods, CGS, Bi-CGstab and GMRES are compared, which are suitable and typical for large unsymmetrical sparse matrix solutions. According to the numerical tests on different cases, still water test, dam breaking, violent tank sloshing, solitary wave slamming, the GMRES method is more efficient than CGS and Bi-CGstab for ISPH method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.91-99
• /
• 1994

We proposed the regularized iterative restoration method considering relaxation parameter and regularization paramenter in order to restore the noisy motion-blurred images. We used (i-H) as a regularization operator and these two kinds of constraints were applied while conventional regularization iterative restoration method proposed by Jan Biemond et al used the 2-D Laplacian filter and a predetermined regularization parameter value and relaxation parameter to 1. Through the experimental results, we showed better results compared with those by a conventional method and or regularized iterative restoration method just considering only a regularization parameter. These two kinds of constratints have good effects when applied into the regularized iterative restoration method for noisy motion-blurred images.

• Journal of computational fluids engineering
• /
• v.9 no.3
• /
• pp.57-65
• /
• 2004

The incompressible Navier-Stokes equations in two dimensions are stabilized by a modified residual method, and then discretized by hierarchical elements. The stabilization is necessary to escape from the Ladyzhenskaya-Babuska-Brezzi(LBB) constraint and hence to achieve an equal order formulation. To expedite a standard iterative method such as the conjugate gradient squared(CGS) method, a preconditioning technique called the Hierarchical Iterative Procedure(HIP) has been applied. In this paper, we increased the order of interpolation within an element up to cubic. The hierarchical elements have been used to achieve a higher order accuracy in fluid flow analyses, but a proper efficient iterative procedure for higher order finite element formulation has not been available so far The numerical results by the present HIP for the lid driven cavity flow and others showed the present procedure to be stable, very efficient and useful in flow analyses in conjunction with hierarchical elements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.798-809
• /
• 2013

In this paper, we propose robust relay and destination filter design methods for the multi-user peer-to-peer amplify-and-forward relaying systems while taking imperfect channel knowledge into consideration. Specifically, the relay and destination filter sets are developed to minimize the sum mean-squared-error (MSE). We first present a robust joint optimum relay and destination filter calculation method with an iterative algorithm. Motivated by the need to reduce computational complexity of the iterative scheme, we then formulate a simplified sum MSE minimization problem using the relay filter decomposability, which lead to two robust sub-optimum non-iterative design methods. Finally, we propose robust modified destination filter design methods which require only local channel state information between relay node and a specific destination node. The analysis and simulation results verify that, compared with the optimum iterative method, the proposed non-iterative schemes suffer a marginal loss in performance while enjoying significantly improved implementation efficiencies. Also it is confirmed that the proposed robust filter design methods provide desired robustness in the presence of channel uncertainty.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.91-94
• /
• 1996

This paper presents an approach to estimation of learning gain in iterative learning control for discrete-time affine nonlinear systems. In iterative learning control, to determine learning gain satisfying the convergence condition, we have to know the system model. In the proposed method, the input-output equation of a system is identified by neural network refered to as Piecewise Linearly Trained Network (PLTN). Then from the input-output equation, the learning gain in iterative learning law is estimated. The validity of our method is demonstrated by simulations.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1233-1245
• /
• 2008

In this paper, an iterative method is proposed to solve the least-squares problem of matrix equation AXB+CYD=E over unknown matrix pair [X, Y]. By this iterative method, for any initial matrix pair [$X_1,\;Y_1$], a solution pair or the least-norm least-squares solution pair of which can be obtained within finite iterative steps in the absence of roundoff errors. In addition, we also consider the optimal approximation problem for the given matrix pair [$X_0,\;Y_0$] in Frobenius norm. Given numerical examples show that the algorithm is efficient.

• Structural Engineering and Mechanics
• /
• v.83 no.3
• /
• pp.353-361
• /
• 2022

Linear Elastic Fracture Mechanics (LEFM) has been developed by applying stress analysis to determine the stress intensity factor (SIF, K). The finite element method (FEM) is widely used as a standard tool for evaluating the SIF for various crack configurations. The prediction accuracy can be achieved by applying an adaptive Delaunay triangulation combined with a FEM. The solution can be solved using either direct or iterative solvers. This work adopts the element-by-element preconditioned conjugate gradient (EBE-PCG) iterative solver into an adaptive FEM to solve the solution to heal problem size constraints that exist when direct solution techniques are applied. It can avoid the formation of a global stiffness matrix of a finite element model. Several numerical experiments reveal that the present method is simple, fast, and efficient compared to conventional sparse direct solvers. The optimum convergence criterion for two-dimensional LEFM analysis is studied. In this paper, four sample problems of a two-edge cracked plate, a center cracked plate, a single-edge cracked plate, and a compact tension specimen is used to evaluate the accuracy of the prediction of the SIF values. Finally, the efficiency of the present iterative solver is summarized by comparing the computational time for all cases.