• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.231-244
• /
• 2015

The accuracy of reference point of VLBI antenna is mandatory to perform collocation of different space geodetic techniques. In this study, we evaluated the optimal methods for the 3D circle fitting to enhance the accuracy of the reference point of VLBI antenna. Two kinds of methodologies for the orthonormal coordinate system with translation of planar observation point and the unitary coordinate transforamation were suggested and their fitting accuracies were evaluated where the orthogonal distance was calculated by residual between observation point and fitting model and the recursive calculation was performed to improve the accuracy of 3D circle fitting. Finally, we found that the methodology for the unitary coordinate transformation is highly appropriate to determine the optimal equation for azimuth-axis and elevation-axis of VLBI antenna. Therefore, the reference point of VLBI antenna with high accuracy can be determined by the intersection of the above two axises (azimuth-axis and elevation-axis). This result is expected to be utilized for a variety of researches for connection between VLBI observation results and the national control point.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.93-100
• /
• 2005

We propose an optimal thresholding method for the voxel coloring in the reconstruction of a 3D shape. Our purposed method is a new approach to resolve the trade-off error of the threshold value on determining the photo-consistency in the conventional method. Optimal thresholding value is decided to compare the photo-consistency of a surface with inside voxel on the optic ray of the center camera. As iterating the process of the vokels, the threshold is approached to the optimal value for the individual surface voxel. And also, graph cut method is reduced to the surface noise on eliminating neighboring voxel. To verify the proposed algorithm, we simulated in the virtual and real environment. It is advantaged to speed up and accuracy of a 3D face reconstruction by applying the methods of optimal threshold and graph as compare with conventional algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2800-2804
• /
• 2015

Recently, device-to-device (D2D) direct communication is attracting much interest and many researches have been conducted. In this paper, we investigated an algorithm to support the D2D direct communication in cellular mobile communication networks. We investigated the optimal D2D scheduling algorithm which can achieve the maximal sum-rate in cellular uplink frequency. We also proposed a simple scheduling algorithm which can considerably reduce the computational complexity, compared to the optimal scheme. Finally, we analyzed the performance of the proposed scheme based on computer simulations.

• Journal of the Korean Institute of Gas
• /
• v.4 no.2 s.10
• /
• pp.7-14
• /
• 2000

LNG (Liquified Natural Gas) carried by LNG ship is unloaded into the LNG storage tanks at the very low temperature (a little lower than the boiling point of LNG). Because LNG is unloaded through the pipeline, two phase flow appears in the pipeline. In this study, we have studied the pressure-drop mechanisms of the two-phase flow in the pipeline, and the calculation method of BOG (Boil-off Gas) amount based on the heat transfer mechanism through the insulation and the surface of the pipeline. We have developed a computer program for thermal-hydraulic analysis on the LNG pipeline system. We have also developed the optimal design program to find the optimal thickness of insulation and the pipeline size. The program searches the optimal design with the minimum capital cost of pipelines and insulation on the operating conditions of maximum allowance pressure-drop and BOG amount, etc.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.8
• /
• pp.637-644
• /
• 2003

In this study, with the FEM we analyzed the variation of the resonance frequency, bandwidth, and sound pressure of the Tonpilz transducer in relation to its design variables. Through statistical multiple regression analysis of the results, we derived functional forms of the resonance frequency, bandwidth, and sound pressure in terms of the design variables. By applying the constrained optimization technique, SQP-PD, to the derived function, we determined the optimal structure of the transducer that could provide the highest sound pressure level at the resonance frequency of 30,000 Hz and having the -3 dB bandwidth more than 10%, The validity of the optimized results was confirmed through comparison of the optimal performance with that of the FEA. The optimal design method proposed could reflect all the cross-coupled effects of multiple structural variables, and could determine the detailed geometry of the transducer with great efficiency and rapidity.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• The KIPS Transactions:PartD
• /
• v.18D no.5
• /
• pp.323-328
• /
• 2011

For content-based image retrieval, the earth mover's distance and the optimal color composition distance are proposed to measure the dissimilarity. Although providing good retrieval results, both methods are too time-consuming to be used in a large image database. To solve the problem, we propose a new distance function that calculates an approximate earth mover's distance in linear time. To calculate the dissimilarity in linear time, the proposed approach employs the space-filling curve. We have performed extensive experiments to show the effectiveness and efficiency of the proposed approach. The results reveal that our approach achieves almost the same results with the EMD in linear time.

• Smart Media Journal
• /
• v.11 no.9
• /
• pp.75-80
• /
• 2022

Recently, research and development on immersive virtual reality(VR) technology to provide a realistic experience is being widely conducted. To provide realistic experience in immersive virtual reality for VR participants, virtual environments should consist of high-realistic environments using 3D reconstruction. In this paper, to acquire 3D information in real space using multiple cameras in the reconstruction process, we propose a novel method of optimal camera placement for accurate reconstruction to minimize distortion of 3D information. Through our approach in this paper, real 3D information can obtain with minimized errors during environment reconstruction, and it is possible to provide a more immersive experience with the created virtual environment.

• Composites Research
• /
• v.35 no.5
• /
• pp.317-321
• /
• 2022

In this study, the PIC design method with machine learning that automatically assigning different stacking sequences according to loading types was applied bumper beam. The input value and labels of the training data for applying machine learning were defined as coordinates and loading types of reference elements that are part of the total elements, respectively. In order to compare the 2D and 3D implementation method, which are methods of representing coordinate value, training data were generated, and machine learning models were trained with each method. The 2D implementation method is divided FE model into each face and generating learning data and training machine learning models accordingly. The 3D implementation method is training one machine learning model by generating training data from the entire finite element model. The hyperparameter were tuned to optimal values through the Bayesian algorithm, and the k-NN classification method showed the highest prediction rate and AUC-ROC among the tuned models. The 3D implementation method revealed higher performance than the 2D implementation method. The loading type data predicted through the machine learning model were mapped to the finite element model and comparatively verified through FE analysis. It was found that 3D implementation PIC bumper beam was superior to 2D implementation and uni-stacking sequence composite bumper.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.377-382
• /
• 2006

Advantageous features of flash memory are stimulating its exploitation in mobile and ubiquitous related devices. The hardware characteristics of flash memory however place restrictions upon this current trend. In this paper, a cleaning policy for flash memory is proposed in order to decrease the necessary penally for recycling of memory minimizing the degradation of performance at the same time. The proposed cleaning algorithm is based on partitioning of candidate memory regions, to be reclaimed as free, into a number of groups. In addition, in order to improve the balanced utilization of the entire flash memory space in terms of 'wearing-out', a free segment selection algorithm is discussed. The impact of the proposed algorithms is evaluated through a number of experiments. Moreover, the composition of the optimal configuration featuring the proposed methods is tested through experiments.