• The korean journal of orthodontics
• /
• v.52 no.4
• /
• pp.287-297
• /
• 2022

Objective: To investigate the pattern of accuracy change in artificial intelligence-assisted landmark identification (LI) using a convolutional neural network (CNN) algorithm in serial lateral cephalograms (Lat-cephs) of Class III (C-III) patients who underwent two-jaw orthognathic surgery. Methods: A total of 3,188 Lat-cephs of C-III patients were allocated into the training and validation sets (3,004 Lat-cephs of 751 patients) and test set (184 Lat-cephs of 46 patients; subdivided into the genioplasty and non-genioplasty groups, n = 23 per group) for LI. Each C-III patient in the test set had four Lat-cephs: initial (T0), pre-surgery (T1, presence of orthodontic brackets [OBs]), post-surgery (T2, presence of OBs and surgical plates and screws [S-PS]), and debonding (T3, presence of S-PS and fixed retainers [FR]). After mean errors of 20 landmarks between human gold standard and the CNN model were calculated, statistical analysis was performed. Results: The total mean error was 1.17 mm without significant difference among the four time-points (T0, 1.20 mm; T1, 1.14 mm; T2, 1.18 mm; T3, 1.15 mm). In comparison of two time-points ([T0, T1] vs. [T2, T3]), ANS, A point, and B point showed an increase in error (p < 0.01, 0.05, 0.01, respectively), while Mx6D and Md6D showeda decrease in error (all p < 0.01). No difference in errors existed at B point, Pogonion, Menton, Md1C, and Md1R between the genioplasty and non-genioplasty groups. Conclusions: The CNN model can be used for LI in serial Lat-cephs despite the presence of OB, S-PS, FR, genioplasty, and bone remodeling.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.1
• /
• pp.43-58
• /
• 2002

A methodology to nondestructively locate and estimate size of damage in beam-type structures using a few natural frequencies or a few mode shapes is presented. A damage-localization algorithm to locate damage from changes in natural frequencies and a damage-sizing algorithm to estimate crack-size from natural frequency perturbation are outlined. A damage index algorithm to localize and estimate severity of damage from monitoring changes in mode shapes is outlined. The frequency-based method and the mode-shape-based method are evaluated for several damage scenarios by locating and sizing damage in PS concrete beams lot which a few natural frequencies and mode shapes are generated from finite element models. The result of the analyses indicates that the two methods correctly localize and closely estimate the size of the crack simulated in the test beam.

• Geomechanics and Engineering
• /
• v.13 no.6
• /
• pp.893-906
• /
• 2017

Automatic large scale soil model generation is very critical stage for earthquake hazard simulation of urban areas. Manual model development may cause some data losses and may not be effective when there are too many data from different soil observations in a wide area. Geographic information systems (GIS) for storing and analyzing spatial data help scientists to generate better models automatically. Although the original soil observations were limited to soil profile data, the recent developments in mapping technology, interpolation methods, and remote sensing have provided advanced soil model developments. Together with advanced computational technology, it is possible to handle much larger volumes of data. The scientists may solve difficult problems of describing the spatial variation of soil. In this study, an algorithm is proposed for automatic three dimensional soil and velocity model development of southern part of the European side of Istanbul next to Sea of Marmara based on GIS data. In the proposed algorithm, firstly bedrock surface is generated from integration of geological and geophysical measurements. Then, layer surface contacts are integrated with data gathered in vertical borings, and interpolations are interpreted on sections between the borings automatically. Three dimensional underground geology model is prepared using boring data, geologic cross sections and formation base contours drawn in the light of these data. During the preparation of the model, classification studies are made based on formation models. Then, 3D velocity models are developed by using geophysical measurements such as refraction-microtremor, array microtremor and PS logging. The soil and velocity models are integrated and final soil model is obtained. All stages of this algorithm are carried out automatically in the selected urban area. The system directly reads the GIS soil data in the selected part of urban area and 3D soil model is automatically developed for large scale earthquake hazard simulation studies.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.2
• /
• pp.123-131
• /
• 2005

According to ow previous study, we confirmed That the Petrov-Galerkin natural element method(PG-NEM) completely resolves the numerical integration inaccuracy in the conventional Bubnov-Galerkin natural element method(BG-NEM). This paper is an extension of PG-NEM to two-dimensional geometrically nonlinear problem. For the analysis, a linearized total Lagrangian formulation is approximated with the PS-NEM. At every load step, the grid points ate updated and the shape functions are reproduced from the relocated nodal distribution. This process enables the PG-NEM to provide more accurate and robust approximations. The representative numerical experiments performed by the test Fortran program, and the numerical results confirmed that the PG-NEM effectively and accurately approximates The large deformation problem.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.157-163
• /
• 2000

Introduction of motion video including live video into network virtual reality systems makes virtual spaces more attractive. To handle live video in networked virtual reality s)'stems based on VRML, the scalability of networked virtual reality systems becomes very important on the internet where the performance of the network and the end systems varies dynamically. In this paper, a new quality control algorithm suitable for scalable networked virtual reality systems with live video capability is proposed. Our approach is to introduce the notion of the importance of presence (IoP) which represents the importance of objects in virtual spaces. According to IoPs, the degree of the deterioration of each object presentation will be determined in case of the starvation of system resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9A
• /
• pp.656-663
• /
• 2009

In 3GPP LTE system downlink, PSS (primary synchronization signal) and SSS (secondary synchronization signal) sequences are used for initial cell search and synchronization. UE (user equipment) detects slot timing, frequency offset, and cell ID by using PSS. After that it should detect frame timing, cell group ID, and CP length by using SSS. But in 3GPP LTE, there are two kinds of CP length, so we should operate FFT twice. In this paper, to minimize SSS detection complexity in cell searcher, we propose a CP length pre-decision algorithm that reduces the arithmetical complexity by half at most, with negligible performance degradation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.137-145
• /
• 2003

Nowadays, people can communicate with each other on any time at my place by development of wireless communications. But, the openness of mobile communications Poses serious security threats and the security is necessary on mobile communications to support the secure communication channel. The most commonly method is stream cipher for mobile communications. Generally, this stream cipher is implemented by LFSR(Linear Feedback Shift Register). On this paper proposes the modified mechanism of the S box is usually used in block cipher to advance security og the stream cipher and this mechanism is the modified three one in consideration og the randomness. Generally, S box that is function with nonlinear property makes data more strong by attack. The randomness test of the proposed algorithm is used Ent Pseudorandom Number Sequence Test Program and by the test result it proves that it has better randomness and serial correlation value than the based stream cipher on respective test.

• Korean Journal of Remote Sensing
• /
• v.27 no.5
• /
• pp.521-534
• /
• 2011

The high-resolution X-band SAR systems such as COSMO-SkyMED and TerraSAR-X have been launched recently. In addition KOMPSAT-5 will be launched in the early of 2012. In this study we developed the new method for persistent scatterer candidate (PSC) selection and network construction, which is more suitable for PSInSAR analysis using multi-temporal X-band SAR data. PSC selection consists in two main steps: first, selection of initial PSCs based on amplitude dispersion index, mean amplitude, mean coherence. second, selection of final PSCs based on temporal coherence directly estimated from network analysis of initial PSCs. To increase the stability of network the Multi- TIN and complex network for non-urban area were addressed as well. The proposed algorithm was applied to twenty-one TerraSAR-X SAR of New Orleans. As a result many PSs were successfully extracted even in non-urban area. This research can be used as the practical application of KOMPSAT-5 for surface displacement monitoring using X-band PSInSAR.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.53-60
• /
• 2006

Handover of WiBro is based on 802.16e hard handover scheme. When PSS is handover, it is handover that confirm neighbor's cell condition and RAS ID in neighbor advertisement message. Serving RAS transmits HO-notification message to neighbor RAS. Transmiting HO-notification message to neighbor RAS, it occurs many signaling traffics. Also, When WiBro is handover, It occurs many packet loss. Therefore, user suffer service degradation. LPM handover is supporting seamless handover because it buffers data packets during handover. So It is proposed scheme that predicts is LPM handover and reserves target RAS with pre-authentication. These schemes occur many signaling traffics. In this paper, we propose PSS Movement Prediction to solve signaling traffic. Target RAS is decided by old data in history cache. When serving RAS receives HO-notification-RSP message to target RAS, target RAS inform to crossover node. And crossover node bicast data packet. If handover is over, target RAS forward data packet. Therefore, It reduces signaling traffics but increase handover success rate. When history cache success, It decrease about 48% total traffic. But When history cache fails, It increase about 6% total traffic