• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.373-377
• /
• 2018

In this paper, we propose an implementation of a neural network accelerator for reducing the rendering noise using OpenCL. Among the rendering algorithms, we selects a ray tracing to assure a high quality graphics. Ray tracing rendering uses ray to render, less use of the ray will result in noise. Ray used more will produce a higher quality image but will take operation time longer. To reduce operation time whiles using fewer rays, Learning Base Filtering algorithm using neural network was applied. it's not always produce optimize result. In this paper, a new approach to Matrix Multiplication that is based on General Matrix Multiplication for improved performance. The development environment, we used specialized in high speed parallel processing of OpenCL. The proposed architecture was verified using Kintex UltraScale XKU6909T-2FDFG1157C FPGA board. The time it takes to calculate the parameters is about 1.12 times fast than that of Verilog-HDL structure.

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.193-206
• /
• 2017

In this paper, we propose a rate control method based on the $R-{\lambda}$ model that supports a parallel encoding structure in GOP levels or IDR period levels for 4K UHD input video in real-time. For this, a slice-level bit allocation method is proposed for parallel encoding instead of sequential encoding. When a rate control algorithm is applied in the GOP level or IDR period level parallelism, the information of how many bits are consumed cannot be shared among the frames belonging to a same frame level except the lowest frame level of the hierarchical B structure. Therefore, it is impossible to manage the bit budget with the existing bit allocation method. In order to solve this problem, we improve the bit allocation procedure of the conventional ones that allocate target bits sequentially according to the encoding order. That is, the proposed bit allocation strategy is to assign the target bits in GOPs first, then to distribute the assigned target bits from the lowest depth level to the highest depth level of the HEVC hierarchical B structure within each GOP. In addition, we proposed a processing method that is used to improve subjective image qualities by allocating the bits according to the coding complexities of the frames. Experimental results show that the proposed bit allocation method works well for frame-level parallel HEVC software encoders and it is confirmed that the performance of our rate controller can be improved with a more elaborate bit allocation strategy by using the preprocessing results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.619-628
• /
• 2000

Abstract Perspective views provide a powerful depth cue and thus aid the interpretation of complicated images. The main drawback of current perspective volume rendering is the long execution time. In this paper, we present an efficient perspective volume rendering algorithm based on coherency between rays. Two sets of templates are built for the rays cast from horizontal and vertical scanlines in the intermediate image which is parallel to one of volume faces. Each sample along a ray is calculated by interpolating neighboring voxels with the pre-computed weights in the templates. We also solve the problem of uneven sampling rate due to perspective ray divergence by building more templates for the regions far away from a viewpoint. Since our algorithm operates in object-order, it can avoid redundant access to each voxel and exploit spatial data coherency by using run-length encoded volume. Experimental results show that the use of templates and the object-order processing with run-length encoded volume provide speedups, compared to the other approaches. Additionally, the image quality of our algorithm improves by solving uneven sampling rate due to perspective ray di vergence.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.164-173
• /
• 2014

In underwater robotics, vision would be a key element for recognition in underwater environments. However, due to turbidity an underwater optical camera is rarely available. An underwater imaging sonar, as an alternative, delivers low quality sonar images which are not stable and accurate enough to find out natural objects by image processing. For this, artificial landmarks based on the characteristics of ultrasonic waves and their recognition method by a shape matrix transformation were proposed and were proven in Part 1. But, this is not working properly in undulating and dynamically noisy sea-bottom. To solve this, we propose a framework providing a selection phase of likelihood candidates, a selection phase for final candidates, recognition phase and tracking phase in sequence images, where a particle filter based selection mechanism to eliminate fake candidates and a mean shift based tracking algorithm are also proposed. All 4 steps are running in parallel and real-time processing. The proposed framework is flexible to add and to modify internal algorithms. A pool test and sea trial are carried out to prove the performance, and detail analysis of experimental results are done. Information is obtained from tracking phase such as relative distance, bearing will be expected to be used for control and navigation of underwater robots.

• Geophysics and Geophysical Exploration
• /
• v.18 no.2
• /
• pp.74-84
• /
• 2015

To yield physically meaningful images through elastic reverse-time migration, the wavefield separation which extracts P- and S-waves from reconstructed vector wavefields by using elastic wave equation is prerequisite. For expanding the application of the elastic reverse-time migration to anisotropic media, not only the anisotropic modelling algorithm but also the anisotropic wavefield separation is essential. The anisotropic wavefield separation which uses pseudo-derivative filters determined according to vertical velocities and anisotropic parameters of elastic media differs from the Helmholtz decomposition which is conventionally used for the isotropic wavefield separation. Since applying these pseudo-derivative filter consumes high computational costs, we have developed the efficient anisotropic wavefield separation algorithm which has capability of parallel computing by using GPUs (Graphic Processing Units). In addition, the highly efficient anisotropic elastic reverse-time migration algorithm using MPI (Message-Passing Interface) and incorporating the developed anisotropic wavefield separation algorithm with GPUs has been developed. To verify the efficiency and the validity of the developed anisotropic elastic reverse-time migration algorithm, a VTI elastic model based on Marmousi-II was built. A synthetic multicomponent seismic data set was created using this VTI elastic model. The computational speed of migration was dramatically enhanced by using GPUs and MPI and the accuracy of image was also improved because of the adoption of the anisotropic wavefield separation.

• Progress in Medical Physics
• /
• v.19 no.2
• /
• pp.102-112
• /
• 2008

We developed a high-resolution micro-CT system based on rotational gantry and flat-panel detector for live mouse imaging. This system is composed primarily of an x-ray source with micro-focal spot size, a CMOS (complementary metal oxide semiconductor) flat panel detector coupled with Csl (TI) (thallium-doped cesium iodide) scintillator, a linearly moving couch, a rotational gantry coupled with positioning encoder, and a parallel processing system for image data. This system was designed to be of the gantry-rotation type which has several advantages in obtaining CT images of live mice, namely, the relative ease of minimizing the motion artifact of the mice and the capability of administering respiratory anesthesia during scanning. We evaluated the spatial resolution, image contrast, and uniformity of the CT system using CT phantoms. As the results, the spatial resolution of the system was approximately the 11.3 cycles/mm at 10% of the MTF curve, and the radiation dose to the mice was 81.5 mGy. The minimal resolving contrast was found to be less than 46 CT numbers on low-contrast phantom imaging test. We found that the image non-uniformity was approximately 70 CT numbers at a voxel size of ${\sim}55{\times}55{\times}X100\;{\mu}^3$. We present the image test results of the skull and lung, and body of the live mice.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.1-12
• /
• 2008

In this paper, we present a real-time algorithm for recognizing the vehicle color from the indoor and outdoor vehicle images based on GPU (Graphics Processing Unit) acceleration. In the preprocessing step, we construct feature victors from the sample vehicle images with different colors. Then, we combine the feature vectors for each color and store them as a reference texture that would be used in the GPU. Given an input vehicle image, the CPU constructs its feature Hector, and then the GPU compares it with the sample feature vectors in the reference texture. The similarities between the input feature vector and the sample feature vectors for each color are measured, and then the result is transferred to the CPU to recognize the vehicle color. The output colors are categorized into seven colors that include three achromatic colors: black, silver, and white and four chromatic colors: red, yellow, blue, and green. We construct feature vectors by using the histograms which consist of hue-saturation pairs and hue-intensity pairs. The weight factor is given to the saturation values. Our algorithm shows 94.67% of successful color recognition rate, by using a large number of sample images captured in various environments, by generating feature vectors that distinguish different colors, and by utilizing an appropriate likelihood function. We also accelerate the speed of color recognition by utilizing the parallel computation functionality in the GPU. In the experiments, we constructed a reference texture from 7,168 sample images, where 1,024 images were used for each color. The average time for generating a feature vector is 0.509ms for the $150{\times}113$ resolution image. After the feature vector is constructed, the execution time for GPU-based color recognition is 2.316ms in average, and this is 5.47 times faster than the case when the algorithm is executed in the CPU. Our experiments were limited to the vehicle images only, but our algorithm can be extended to the input images of the general objects.

• Explosives and Blasting
• /
• v.28 no.2
• /
• pp.1-16
• /
• 2010

This study focuses on the phenomenon that the blast damaged zone developed on rock slope surfaces can be affected by joint characteristics rather than by explosive power when the pre-splitting is applied to excavate a jointed rock slope. The characteristics of rock joints on a slope were investigated and categorized them into 4 cases. Also an image processing system has been used for comparing the distribution pattern of rock blocks. From this investigation, it was found that the rock blocks bigger than 2,000 mm occupied 42% in the case of single joint set and it showed the well efficiency of pre-splitting blast. In cases of 2~3 parallel joint sets and 2~3 intersecting joint sets are developed on rock surfaces, the rock blocks in the range of 1,000~2,000 mm occupied 43.6% and 35.8%, respectively, and it showed that the efficiency of pre-splitting was decreased. When more than 3 joint sets are randomly developed, however, the rock blocks in the range of 250~500 mm occupied 35% and there was no block bigger than 1,000 mm. This denotes that the blasting with pre-splitting was not effective. The numerical analysis using PFC2D showed that the blast damaged zone in a rock mass could be directly influenced by the pre-splitting. It is, therefore, required to investigate the discontinuity pattern on rock surfaces in advance, when the pre-splitting method is applied to excavate jointed rock slopes and to apply a flexible blating design with a consideration of the joint characteristics.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.20 no.3
• /
• pp.213-220
• /
• 2000

The method of photoelasticity allows one to obtain principal stress differences and principal stress directions in a photoelastic model. In the classical approach, the photoelastic parameters are measured manually point by point. The previous methods require much time and skill in the identification and measurement of photoelastic data. Fringe phase shifting method has been recently developed and widely used to measure and analyze fringe data in photo-mechanics. This paper presents the test results of photoelastic fringe phase shifting technique for the stress analysis of a circular disk under compression and an edge-cracked plate subjected to tensile load. The technique used here requires four phase stepped photoelastic images obtained from a circular polariscope by rotating the analyzer at $0^{\circ}$, $45^{\circ}$, $90^{\circ}$ and $135^{\circ}$. Experimental results are compared with those or FEM. Good agreement between the results can be observed. However, some error may be included if the technique is used to general direction which is not parallel to isoclinic fringe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.777-784
• /
• 2010

Recently, the necessity of underwater communication and demand for transmitting and receiving various data such as voice or high resolution image data are increasing as well. The performance of underwater acoustic communication system is influenced by characteristics of the underwater communication channels. Especially, ISI(inter symbol interference) occurs because of delay spread according to multi-path and communication performance is degraded. In this paper, we study the OFDM technique to overcome the delay spread in underwater channel and by using CP, we compensate for delay spread. But PAPR which OFDM system has problem is very high. Therefore, we use DFT-spread OFDM method to avoid nonlinear distortion by high PAPR and to improve efficiency of amplifier. DFT-spread OFDM technique obtains high PAPR reduction effect because of each parallel data loads to all subcarrier by DFT spread processing before IFFT. In this paper, we show performance about delay spread through OFDM system and verify method that DFT spread OFDM is more suitable than OFDM for underwater communication. And we analyze performance according to two subcarrier mapping methods(Interleaved, Localized). Through the simulation results, performance of DFT spread OFDM is better about 5~6dB at $10^{-4}$ than OFDM. When compared to BER according to subcarrier mapping, Interleaved method is better about 3.5dB at $10^{-4}$ than Localized method.