• Journal of Digital Contents Society
• /
• v.18 no.6
• /
• pp.1151-1156
• /
• 2017

It is common to achieve lower performance in traversing tree data structures in GPU than one expects. In this paper, we analyze the reason of lower-than-expected performance in GPU tree traversal and present that the warp divergences is caused by the branch instructions ("if${\ldots}$ else") which appear commonly in tree traversal CUDA codes. Also, we compare the parallel shifted sort algorithm which can reduce the number of warp divergences with a kd-tree CUDA implementation to show that the shifted sort algorithm can work faster than the kd-tree CUDA implementation thanks to less warp divergences. As the analysis result, the shifted sort algorithm worked about 16-fold faster than the kd-tree CUDA implementation for $2^{23}$ query points and $2^{23}$ data points in $R^3$ space. The performance gaps tend to increase in proportion to the number of query points and data points.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.145-153
• /
• 2013

Multimedia contents' searching methods in existing mobile computer environment tend to be brought with many over heads when attempting to search data in large bulks. The MINT system has been studied to resolve such problem. However, MINT system delivers many over heads by searching multimedia contents through applying B-Tree. The suggested method is said to be CST-MCR searching system based on CST-Tree. The specific characteristic of this method is improved MINT system by applying CST-Tree's index. The result of capacity evaluation came out with improved capacity of 4.27% from MINT system and CST-MCR methods in average. Conclusively, it has been proven that the suggested method is superior.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.6
• /
• pp.605-614
• /
• 2015

Drone imaging, which is more cost-effective and controllable compared to airborne LiDAR, requires a low-cost camera and is used for capturing color images. From the overlapped color images, we produced two high-resolution digital surface models over different test areas. After segmentation, we performed tree identification according to the method proposed by , and computed the tree height and the canopy crown size. Compared with the field measurements, the computed results for the tree height in test area 1 (coniferous trees) were found to be accurate, while the results in test area 2 (deciduous coniferous trees) were found to be underestimated. The RMSE of the tree height was 0.84 m, and the width of the canopy crown was 1.51 m in test area 1. Further, the RMSE of the tree height was 2.45 m, and the width of the canopy crown was 1.53 m in test area 2. The experiment results validated the use of drone images for the extraction of a tree structure.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.347-355
• /
• 2014

The general octree structure is common for various applications including computer graphics, geometry information analysis and query. Unfortunately, the general octree approach causes duplicated sample data and discrepancy between sampling and representation positions when applied to sample continuous spatial information, for example, signed distance fields. To address these issues, some researchers introduced the dual octree. In this paper, the weakness of the dual octree approach will be illustrated by focusing on the fact that the dual octree cannot access some specific continuous zones asymptotically. This paper shows that the primal tree presented by Lefebvre and Hoppe can solve all the problems above. Also, this paper presents a three-dimensional primal tree traversal algorithm based the Morton codes which will help to parallelize the primal tree method.

• Journal of Forest and Environmental Science
• /
• v.33 no.3
• /
• pp.187-196
• /
• 2017

The use of unmanned aerial vehicles (UAV) for the estimation of tree height is gaining recognition. This study aims to assess the effectiveness of tree height estimation of Pinus densiflora Sieb. et Zucc. and Pinus koraiensis Sieb. et Zucc. using digital surface model (DSM) generated from UAV-acquired imageries. Images were taken with the $Trimble^{(R)}$ UX5 equipped with Sony ${\alpha}5100$. The generated DSM, together with the digital elevation model (DEM) generated from a digital map of the study areas, were used in the estimation of tree height. Field measurements were conducted in order to generate a regression model and carry out accuracy assessment. The obtained coefficients of determination (R2) and root mean square error (RMSE) for P. densiflora (R2=0.71; RMSE=1.00 m) and P. koraiensis (R2=0.64; RMSE=0.85 m) are comparable to the results of similar studies. The results of the paired two-tailed t-test show that the two tree height estimation methods are not significantly different (p-value=0.04 and 0.10, alpha level=0.01), which means that tree height estimation using UAV imagery could be used as an alternative to field measurement.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.19-25
• /
• 2010

In this paper, digital watermarking method using quad-tree algorithm is proposed. The proposed algorithm searches the significant coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation for performance analysis of the proposed algorithm is implemented about the effect of quad-tree algorithm in wavelet domain and that of embedding watermark in each subband coefficient (HH, LH, HL) and each DWT level, and that of embedding in the lowest frequency band (LL). As a simulation result, digital watermarking using quad-tree algorithm improves the watermarking performance in comparison with inserting watermark in the significant coefficients of fixed frequency band. The watermarking performance of simultaneously embedding in HH, LH, and HL band of DWT(6 level) is better than that of different cases. In addition, insertion the watermark to the LL band about 30~60% of all watermarks improves the correlation value while PSNR performance decreases 1~3dB.

• Journal of Platform Technology
• /
• v.10 no.4
• /
• pp.39-46
• /
• 2022

Recently, digital contents including video and sound are created in various fields, transmitted to the cloud through the Internet, and then stored and used. In order to utilize digital content, it is essential to verify data integrity, and it is necessary to ensure network bandwidth efficiency of verified data. This paper describes the design and implementation of a server that maintains, manages, and provides data for verifying the integrity of video data. The server receives and stores image data from Logger, a module that acquires image data, and performs a function of providing data necessary for verification to Verifier, a module that verifies image data. Then, a lightweight Merkle tree is constructed using the hash value. The light-weight Merkle tree can quickly detect integrity violations without comparing individual hash values of the corresponding video frame changes of the video frame indexes of the two versions. A lightweight Merkle tree is constructed by generating a hash value of digital content so as to have network bandwidth efficiency, and the result of performing proof of integrity verification is presented.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2004.05a
• /
• pp.344-345
• /
• 2004

• Nuclear Engineering and Technology
• /
• v.41 no.6
• /
• pp.849-858
• /
• 2009

Risk caused by safety-critical instrumentation and control (I&C) systems considerably affects overall plant risk. As digitalization of safety-critical systems in nuclear power plants progresses, a risk model of a digitalized safety system is required and must be included in a plant safety model in order to assess this risk effect on the plant. Unique features of a digital system cause some challenges in risk modeling. This article aims at providing an overview of the issues related to the development of a static fault-tree-based risk model. We categorize the complicated issues of digital system probabilistic risk assessment (PRA) into four groups based on their characteristics: hardware module issues, software issues, system issues, and safety function issues. Quantification of the effect of these issues dominates the quality of a developed risk model. Recent research activities for addressing various issues, such as the modeling framework of a software-based system, the software failure probability and the fault coverage of a self monitoring mechanism, are discussed. Although these issues are interrelated and affect each other, the categorized and systematic approach suggested here will provide a proper insight for analyzing risk from a digital system.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.81-83
• /
• 2005

The Reactor Protection System (RPS) is a very important system in a nuclear power plant because the system shuts down the reactor to maintain the reactor core integrity and the reactor coolant system pressure boundary if the plant conditions approach the specified safety limits. This paper describes the unavailability assessment of a digital reactor protection system using the fault tree analysis technique. The fault tree technique can be expressed in terms of combinations of the basic event failures. In this paper, a prediction method of the hardware failure rate is suggested for a digital reactor protection system. and applied to the reactor protection system being developed in Korea.