• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.2
• /
• pp.171-176
• /
• 2013

X-ray cross-sectional image-based inspection technique is one of the most useful methods to inspect the brazing joints of heat exchanger. Through X-ray cross-sectional image acquisition, image processing, and defect inspection, the defects of brazing joints can be detected. This paper presents a method to judge the type of detected defects automatically, and to display them three-dimensionally. The defect type is classified as unconnected defect, void, and so on, based on location, size, and shape information of defect. Three-dimensional display which is realized using OpenGL (Open Graphics Library) will be helpful to understand the overall situation including location, size, shape of the defects in a test object.

• Computers and Concrete
• /
• v.18 no.5
• /
• pp.1019-1039
• /
• 2016

In this paper, a parallel algorithm of nonlinear dynamic analysis of three-dimensional (3D) reinforced concrete (RC) frame structures based on the platform of graphics processing unit (GPU) is proposed. Time integration is performed using Newmark method for nonlinear implicit dynamic analysis and parallelization strategies are presented. Correspondingly, a parallel Preconditioned Conjugate Gradients (PCG) solver on GPU is introduced for repeating solution of the equilibrium equations for each time step. The RC frames were simulated using fiber beam model to capture nonlinear behaviors of concrete and reinforcing bars. The parallel finite element program is developed utilizing Compute Unified Device Architecture (CUDA). The accuracy of the GPU-based parallel program including single precision and double precision was verified in comparison with ABAQUS. The numerical results demonstrated that the proposed algorithm can take full advantage of the parallel architecture of the GPU, and achieve the goal of speeding up the computation compared with CPU.

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

Belief propagation (BP) is a commonly used global energy minimization algorithm for solving stereo matching problem in 3D reconstruction. However, it requires large memory bandwidth and data size. In this paper, we propose a novel memory-efficient algorithm of BP in stereo matching on the Graphics Processing Units (GPU). The data size and transfer bandwidth are significantly reduced by storing only a part of the whole message. In order to maintain the accuracy of the matching result, the local messages are reconstructed using shared memory available in GPU. Experimental result shows that there is almost an order of reduction in the global memory consumption, and 21 to 46% saving in memory bandwidth when compared to the conventional algorithm. The implementation result on a recent GPU shows that we can obtain 22.8 times speedup in execution time compared to the execution on CPU.

• Journal of Korea Game Society
• /
• v.5 no.3
• /
• pp.39-47
• /
• 2005

Current rendering processors are organized mainly to process a triangle as fast as possible and recently parallel 3D rendering processors, which can process multiple triangles in parallel with multiple rasterizers, begin to appear. For high performance in processing triangles, it is desirable for each rasterizer have its own local pixel cache. However, the consistency problem may occur in accessing the data at the same address simulaneously by more than one rasterizer. In this paper, we propose a parallel rendering processor architecture resolving such consistency problem effectively. Moreover, the proposed architecture reduces the latency due to a pixel cache miss significantly. The experimental results show that proposed architecture achieves almost linear speedup at best case even in sixteen rasterizer

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.5
• /
• pp.17-25
• /
• 2019

In this paper, we introduce the technology to convert a single human image into a fashion show animation video clip. The technology can help the customers confirm the dynamic fitting result when combined with the virtual try on technique as well as the interesting experience to a normal person of being a fashion model. We developed an extended technique of full human 2D to 3D inverse modeling based on SMPLify human body inverse modeling technique, and a rigged model animation method. The 3D shape deformation of the full human from the body model was performed by 2 part deformation in the image domain and reconstruction using the estimated depth information. The quality of resultant animation videos are made to be publically available for evaluation. We consider it is a promising approach for commercial application when supplemented with the post - processing technology such as image segmentation technique, mapping technique and restoration technique of obscured area.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1081-1089
• /
• 1999

Volume data modeling is concerned with finding a mathematical function which represents the relationship implied by the 3D data. Modeling a volume data geometrically can visualize a volume data using surface graphics without voxelization. It has many merits in that it is fast and requires little memory. We proposes, a method based on wavelet transformation and tetrahedrization. we implement a prototype system based on the proposed method. Last, we evaluated the proposed method comparing it with marching cube algorithm. the evaluation results show that though the proposed method uses only 13% of the volume data, the images generated is as good as the images generated by the marching cubes algorithm.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.9-16
• /
• 2002

Recently, high dynamic range (HDR) compression has attracted much attention due to the wide availability of HDR images. In this paper, we present an HDR compression method using a progressive image, which is a multi-level image representation based on a progressive mesh. An HDR image can be decomposed into a base image and a sequence of details by conversion into a progressive image. This decomposition provides a good structure to highly compress the dynamic range while preserving image details. The base image and larger details are considerably scaled down but smaller details are slightly scaled down. Experimental results show that our method successfully generates HDR compressed images without halo artifacts by controlling two intuitive parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.647-653
• /
• 2016

Recently, the data image processing has been applied to a variety of fields including broadcasting, communication, computer graphics, medicine, and so on. Generally, the image data may develop the noise during their transmission. Therefore, the studies have been actively conducted to remove the noise on the image. There are diverse types of noise on the image including salt and pepper noise, AWGN, and mixed noise. Hence, the filter algorithm for the image recovery was proposed that salt and pepper noise was processed by histogram and spatial weighted values after defining the noise to lessen the impact of mixed noise added in the image, and AWGN was processed by the pixel information of local mask establishing the weighted values in this study. Regarding the processed results by applying Lena images which were corrupted by salt and pepper noise(P=50%) and AWGN(${\sigma}=10$), suggested algorithm showed the improvement by 7.06[dB], 10.90[dB], 5.97[dB] respectively compared with the existing CWMF, A-TMF, AWMF.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.209-218
• /
• 2009

3D backprojection is a kind of reconstruction algorithm to generate volume data consisting of tomographic images, which provides spatial information of the original 3D data from hundreds of 2D projections. The computational time of backprojection increases in proportion to the size of volume data and the number of projection images since the value of every voxel in volume data is calculated by considering corresponding pixels from hundreds of projections. For the reduction of computational time, fast GPU based 3D backprojection methods have been studied recently and the performance of them has been improved significantly. This paper presents two multiple GPU based methods to maximize the parallelism of GPU and compares the efficiencies of two methods by considering both the number of projections and the size of volume data. The first method is to generate partial volume data independently for all projections after allocating a half size of volume data on each GPU. The second method is to acquire the entire volume data by merging the incomplete volume data of each GPU on CPU. The in-complete volume data is generated using the half size of projections after allocating the full size of volume data on each GPU. In experimental results, the first method performed better than the second method when the entire volume data can be allocated on GPU. Otherwise, the second method was efficient than the first one.

• Geophysics and Geophysical Exploration
• /
• v.20 no.2
• /
• pp.72-77
• /
• 2017

We calculated 3D frequency- and Laplace-domain wavefields using time-domain modeling and Fourier transform or Laplace transform. We adopted OpenACC and GPU for an efficient parallel calculation. The OpenACC makes it easy to use GPU accelerators by adding directives in conventional C, C++, and Fortran programming languages. Accordingly, one doesn't have to learn new GPGPU programming languages such as CUDA or OpenCL to use GPU. An OpenACC program allocates GPU memory, transfers data between the host CPU and GPU devices and performs GPU operations automatically or following user-defined directives. We compared performance of 3D wave propagation modeling programs using OpenACC and GPU to that using single-core CPU through numerical tests. Results using a homogeneous model and the SEG/EAGE salt model show that the OpenACC programs are approximately 53 and 30 times faster than those using single-core CPU.