• Journal of the Korea Computer Graphics Society
• /
• v.21 no.1
• /
• pp.13-21
• /
• 2015

We present a robust GPU algorithm constructing a sweep volume boundary for a triangular mesh model. Sweeping geometric entities of a triangular mesh object is first approximated to a set of triangles, the envelope of which becomes the outer boundary of the sweep volume. We find the envelope by computing the arrangement of the triangle set and extracting its outmost boundary. To ensure robustness of the algorithm, we adopt random perturbation of sweep vertices and the interval arithmetic using multi-level precisions. The algorithm is implemented to perform most computation on GPU, and as a result it runs two orders of magnitude faster than other algorithms.

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

Finding line segments in an intensity image has been one of the most fundamental issues in computer vision. In complex scenes, it is hard to detect the locations of point features. Line features are more robust in providing greater positional accuracy. In this paper we present a robust "line features extraction" algorithm which extracts line feature in a single pass without using any assumptions and constraints. Our algorithm consists of five steps: (1) edge scanning, (2) edge normalization, (3) line-blob extraction, (4) line-feature computation, and (5) line linking. By using edge scanning, the computational complexity due to too many edge pixels is drastically reduced. Edge normalization improves the local quantization error induced from the gradient space partitioning and minimizes perturbations on edge orientation. We also analyze the effects of edge processing, and the least squares-based method and the principal axis-based method on the computation of line orientation. We show its efficiency with some real images.al images.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.3
• /
• pp.147-156
• /
• 2008

A new approach based on cone prism intersection method combined with sorting algorithm is proposed for the fast and robust signed distance field computation. In the method, the space bounding the geometric model composed of triangular net is divided into multiple smaller cells. For the efficient calculation of distance fields, valid points among the triangular net which will generate minimum distances with current cell are selected by checking the intersection between current cell and cone prism generated at each point. The method is simple to implement and able to achieve an order of magnitude improvement in the computation time as compared to earlier approaches. Further the method is robust in handling the traditional sign problems. The validity of the suggested method was demonstrated by providing numerous examples including Boolean operation, shape deformation and morphing of complex geometric models.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1111-1113
• /
• 1998

A robust economic dispatch algorithm involving transmission losses is proposed and investigated for a possibility of on-line applications. In this paper, the penalty factors are calculated directly from transposed Jacobian of load flow analysis with advantages of superiority to B-coefficients method based on its computation time and suitability for real time application since the approach is based on a current system condition. The proposed algorithm is systematically handling the generation capacity constraints with transmission losses. Implementation of the algorithm for IEEE systems and EPRI Scenario systems shows that computation time is enough to apply on-line economic dispatch to large power system and production cost is saved compared with the crude classical economic dispatch algorithm without considering transmission losses.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2262-2267
• /
• 2018

In electric machine design, there is a large computation cost for finite element analyses (FEA) when analyzing nonlinear characteristics in the machine Therefore, for the optimal design of an electric machine, designers commonly use an optimization algorithm capable of excellent convergence performance. However, robustness consideration, as this factor can guarantee machine performances capabilities within design uncertainties such as the manufacturing tolerance or external perturbations, is essential during the machine design process. Moreover, additional FEA is required to search robust optimum. To address this issue, this paper proposes a computationally efficient robust optimization algorithm. To reduce the computational burden of the FEA, the proposed algorithm employs a useful technique which termed static analysis assisted technique (SAAT). The proposed method is verified via the effective robust optimal design of electric machine to reduce cogging torque at a reasonable computational cost.

• Nuclear Engineering and Technology
• /
• v.53 no.7
• /
• pp.2162-2173
• /
• 2021

In this paper, the coupling of fine-mesh computational fluid dynamics (CFD) thermal-hydraulics (TH) code and neutronics code is achieved using the Ansys Fluent User Defined Function (UDF) for code development, including parallel meshing mapping, data computation, and data transfer. Also, some CFD schemes are designed for mesh mapping and data transfer to guarantee physical conservation in the coupling computation. Because there is no rigorous research that gives robust guidance on the various CFD schemes that must be obtained before the fine-mesh coupling computation, this work presents a quantitative analysis of the CFD meshing and mapping schemes to improve the accuracy of the value and location of key physical prediction. Furthermore, the effect of the sub-pin scale coupling computation is also studied. It is observed that even the pin-resolved coupling computation can also create a large deviation in the maximum value and spatial locations, which also proves the significance of the research on mesh mapping and data transfer for CFD code in a coupling computation.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.05
• /
• pp.5-7
• /
• 1991

We have developed an efficient and robust image reconstruction algorithm for static impedance imaging. This improved Newton-Raphson method produced more accurate images by reducing the undesirable effects of the ill-conditioned Hessian matrix. We found that our electrical impedance tomography (EIT) system could produce two-dimensional static images from a physical phantom with 7% spatial resolution at the center and 5% at the periphery. Static EIT image reconstruction requires a large amount of computation. In order to overcome the limitations on reducing the computation time by algorithmic approaches, we implemented the improved Newton-Raphson algorithm on a parallel computer system and showed that the parallel computation could reduce the computation time from hours to minutes.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.322-324
• /
• 2013

Haze is an extreme reason of the reduction of contrast when capturing image in the outdoor. Recently, there are several single image dehazing techniques, but they are not robust in dynamic variations of natural environment caused by the thickness, coverage of haze and appearance of sunlight. In this paper, we propose an effective and robust method to enhance luminance for image dehazing depending on histogram analysis. Compare with conventional methods, our proposal have better performance in term of contrast, and computation time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.491-497
• /
• 1993

In MIMO design, input and output units are different from each other. By this reason, the effect of larger units to smaller one is not trivial and there is no method of proper scaling, optimal scaling. In this paper, robust stability of MIMO LQG/LTR design are analised when the plnat inputs and outputs are scalled. The upper bound of model error to guarantee the robust stability is obtained, and gain margin and phase margins are computed with respect to scalling matrices.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.5-8
• /
• 2012

Haze is an extreme reason of the reduction of contrast when capturing image in the outdoor. Recently, there are several single image dehazing techniques, but they are not robust in dynamic variations of natural environment caused by the thickness, coverage of haze and appearance of sunlight. In this paper, we propose an effective and robust method to restore degradation of hazy image. Compare with conventional methods, our proposal have better performance and computation time.