• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.103-107
• /
• 2009

This paper presents how to minimize the second-order cone programming problem occurring in the 3D reconstruction of multiple views. The $L_{\infty}$-norm minimization is done by a series of the minimization of the maximum infeasibility. Since the problem has many inequality constraints, we have to adopt methods of the interior point algorithm, in which the inequalities are sequentially approximated by log-barrier functions. An initial feasible solution is found easily by the construction of the problem. Actual computing is done by an iterative Newton-style update. When we apply the interior point method to the problem of reconstructing the structure and motion, every Newton update requires to solve a very large system of linear equations. We show that the sparse bundle-adjustment technique can be utilized in the same way during the Newton update, and therefore we obtain a very efficient computation.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.05a
• /
• pp.156-161
• /
• 1998

This describes a numerical method for predicting the incompressible unsteady laminar three-dimensional flows of fluid behaviour with free-surface. The elliptic differential equations governing the flows have been linearized by means of finite-difference approximations, and the resulting equations have been solved via a fully-implicit iterative method. The free-surface is defined by the motion of a set of marker particles and interface behaviour was investigated by way of a 'Lagrangian' technique. Using the GALA concept of Spalding, the conventional mass continuity equation is modified to form a volumetric or bulk-continuity equation. The use of this bulk-continuity relation allows the hydrodynamic variables to be computed over the entire flow domain including both liquid and gas regions. Thus, the free-surface boundary conditions are imposed implicitly and the problem formulation is greatly simplified. The numerical procedure is validated by comparing the predicted results of a periodic standing waves problems with analytic solutions or experimental results from the literature. The results show that this numerical method produces accurate and physically realistic predictions of three-dimensional free-surface flows.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.12
• /
• pp.1528-1534
• /
• 2004

The combination of ultrasound echo images with digital particle image velocimetry (DPIV) methods has resulted in a two-dimensional, two-component velocity field measurement technique appropriate for opaque flow conditions including blood flow in clinical applications. Advanced PIV processing algorithms including an iterative scheme and window offsetting were used to increase spatial resolution. The optimum concentration of the ultrasound contrast agent used for seeding was explored. Velocity validation tests in fully developed laminar pipe flow result of echo PIV showed good agreement with both optical PIV measurements and the known analytic solution based on a volume flow measurement.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.499-506
• /
• 2003

The design cycle associated with large engineering systems requires an initial decomposition of the complex system into design processes which are coupled through the transference of output data. Some of these design processes may be grouped into iterative subcycles. In analyzing or optimizing such a coupled system, it is essential to determine the best order of the processes within these subcycles to reduce design cycle time and cost. This is accomplished by decomposing large multidisciplinary problems into several sub design structure matrices (DSMs) and processing them in parallel This paper proposes a new method for parallel decomposition of multidisciplinary problems to improve design efficiency by using the multi-objective genetic algorithm and two sample test cases are presented to show the effect of the suggested decomposition method.

• Journal of KSNVE
• /
• v.10 no.5
• /
• pp.886-891
• /
• 2000

In this paper, an iterative array shape estimation technique is presented, which is based on the use of the least squares polynomial fitting to the data from heading sensors. The estimated polynomial shape model is then used for calculating the hydrophone positions on the assumption that the arc distances between sensors are constant. In order to verify the applicability of the proposed algorithm, numerical simulations are performed using two types of non-linear array shapes. In addition the noise effects of heading sensors on the array shape estimation results and the performance of beamformer are also investigated.

• Journal for History of Mathematics
• /
• v.11 no.2
• /
• pp.63-76
• /
• 1998

When teaching the linear regression analysis in the class, the power transformation must be introduced to fit the linear regression model for nonlinear data. Box and Cox (1964) proposed the attractive power transformation technique which is so called Box-Cox transformation. In this paper, an effective algorithm selecting an appropriate value for Box-Cox transformation is developed which is considered to find a value minimizing error sum of squares. When the proposed algorithm is used to find a value for transformation, the number of iterations needs to be considered. Thus, the number of iterations is examined through simulation study. Since SAS is one of most widely used packages and does not provide the procedure that performs iterative Box-Cox transformation, a SAS program automatically choosing the value for transformation is developed. Hence, the students could learn how the Box-Cox transformation works, moreover, researchers can use this for analysis of data.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 1993.11a
• /
• pp.99-102
• /
• 1993

A consistent general order nodal method for solving the three-dimensional neutron diffusion equation in (x-y-z) geometry has been derived by using a weighted integral technique and expanding the spatial variable by the Legendre orthogonal series function. The equation set derived can be converted into any order nodal schemes. It forms a compact system for general order of nodal moments. The method utilizes fewer unknown variables in the schemes for iterative-convergence solution than other nodal methods listed in the literatures, and because the method utilizes the analytic solutions of the transverse-integrated one dimensional equations and a consistent approximation for a given spatial variable through all the solution procedures, which renders the use of an approximation for the transverse leakages no longer necessary, we can expect extremely accurate solutions and the solution would converge exactly when the mesh width is decreased or the approximation order is increased.

• Journal of Sensor Science and Technology
• /
• v.24 no.3
• /
• pp.188-193
• /
• 2015

This paper presents a new byte-wise BCH (4122, 4096, 2) decoder, which treats byte-wise parallel operations so as to enhance its throughput. In particular, we evaluate the parallel processing technique for the most time-consuming components such as syndrome generator and Chien search owing to the iterative operations. Even though a syndrome generator is based on the conventional LFSR architecture, it allows eight consecutive bit inputs in parallel and it treats them in a cycle. Thus, it can reduce the number of cycles that are needed. In addition, a Chien search eliminates the redundant operations to reduce the hardware complexity. The proposed BCH decoder is implemented with VHDL and it is verified using a Xilinx FPGA. From the simulation results, the proposed BCH decoder can enhance the throughput as 43% and it can reduce the hardware complexity as 67% compared to its counterpart employing parallel processing architecture.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2018.05a
• /
• pp.185-186
• /
• 2018

The slabfrom, which is commonly used in construction sites, has drawbacks in that the workability of the workers is reduced due to their heavy weight. This study investigates the possibility of design optimization of euro form between structural stability and weight using harmonic search algorithm. The harmonic search algorithm is a metaheuristic optimization technique that obtains multiple optimal solution candidates through iterative. As a result of multiple attempts of optimization through the algorithm, it was possible to design the formwork which is structurally stable and light in weight than the existing formwork.

• Journal of Korean Association for Spatial Structures
• /
• v.1 no.1 s.1
• /
• pp.157-166
• /
• 2001

In general, the cutting pattern of the membrane structures is determined by dividing the complicated curved 3-D surface into several 2-D plane strip by using flattening technique. In this procedure, however, some discrepancies ore occurred between actual stresses of equilibrated state and designed uniform stresses because the material properties are not considered. These deviations can cause the critical structural problems, wrinkling or overstress, and thus a optimization process should be considered. In this paper, a new analytical method for determining an optimum cutting pattern considering material properties is presented. Here, iterative procedure is introduced to decrease the errors caused in numerical process. The optimization method proposed can diminish the deviations occurred by material properties and numerical errors, simultaneously. As a results, it is shown that the final stress distributions for the HP shell model are sufficiently near to design stress distributions, and it can be concluded that this method can be used to obtain the optimized cutting pattern of membrane structures.