• Korean Journal of Construction Engineering and Management
• /
• v.22 no.3
• /
• pp.40-51
• /
• 2021

MLS (Mobile Laser Scanning) which is a scanning method done by moving the LiDAR (Light Detection and Ranging) is widely employed to capture indoor PCD (Point Cloud Data) for floor plan generation in the AEC (Architecture, Engineering, and Construction) industry. The movement and rotation of LiDAR in the scanning phase cause deformation (i.e. skew) of PCD and impose a significant impact on quality of output. Thus, a de-skewing method is required to increase the accuracy of geometric representation. De-skewing methods which use position and pose information of LiDAR collected by IMU (Inertial Measurement Unit) have been mainly developed to refine the PCD. However, the existing methods have limitations on de-skewing PCD without IMU. In this study, a novel algorithm for de-skewing 2D PCD captured from MLS without IMU is presented. The algorithm de-skews PCD using scan matching between points captured from adjacent scan positions. Based on the comparison of the deskewed floor plan with the benchmark derived from TLS (Terrestrial Laser Scanning), the performance of proposed algorithm is verified by reducing the average mismatched area 49.82%. The result of this study shows that the accurate floor plan is generated by the de-skewing algorithm without IMU.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.672-678
• /
• 2021

New malware continues to increase and become advanced by every year. Although various studies are going on executable files to diagnose malicious codes, it is difficult to detect attacks that internalize malicious code threats in emails by exploiting non-executable document files, malicious URLs, and malicious macros and JS in documents. In this paper, we introduce a method of analyzing malicious code for email security through proactive detection and blocking of malicious email attacks, and propose a method for determining whether a non-executable document file is malicious based on AI. Among various algorithms, an efficient machine learning modeling is choosed, and an ML workflow system to diagnose malicious code using Kubeflow is proposed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.12
• /
• pp.1275-1283
• /
• 2014

Characteristics of PCM(Pulse Code Modulation) waveform are suitable for target tracking. Especially in terms of dwell time, it is desirable to detect and track a moving target with the single PCM waveform for a MFR(Multi-Function Radar) which carries out multiple tasks. General PCM waveform processing includes Doppler filter bank caused by the characteristics of ambiguity function, to detect target and estimate Doppler frequency, which induces hardware burden and computational complexity. We propose a ML(Maximum Likelihood) based Doppler estimator for a PCM waveform, which is the closed form suboptimal solution and computationally efficient to estimate Doppler frequency and detect a moving target.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.67-81
• /
• 2006

While the existing Web focuses on the interface with human users based on HTML, the next generation Web will focus on the interaction among software agents by using XML and XML-based standards and technologies. The inference engine, which will serve as brains of software agents in the next generation Web, should thoroughly understand the Semantic Web, the standard language of the next generation Web. As abasis for the service, the W3C (World Wide Web Consortium) has recommended SWRL (Semantic Web Rule Language) which had been made by compounding OWL (Web Ontology Language) and RuleML (Rule Markup Language). In this research, we develop a backward chaining inference engine SMART-B (SeMantic web Agent Reasoning Tools -Backward chaining inference engine), which uses SWRL and OWL to represent rules and facts respectively. We analyze the requirements for the SWRL-based backward chaining inference and design analgorithm for the backward chaining inference which reflects the traditional backward chaining inference algorithm and the requirements of the next generation Semantic Web. We also implement the backward chaining inference engine and the administrative tools for fact and rule bases into Java components to insure the independence and portability among different platforms under the environment of Ubiquitous Computing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.735-740
• /
• 2012

In this paper, we introduce design methodologies of polynomial radial basis function neural network classifier with the aid of Principal Component Analysis(PCA) and Linear Discriminant Analysis(LDA). By minimizing the information loss of given data, Feature data is obtained through preprocessing of PCA and LDA and then this data is used as input data of RBFNNs. The hidden layer of RBFNNs is built up by Fuzzy C-Mean(FCM) clustering algorithm instead of receptive fields and linear polynomial function is used as connection weights between hidden and output layer. In order to design optimized classifier, the structural and parametric values such as the number of eigenvectors of PCA and LDA, and fuzzification coefficient of FCM algorithm are optimized by Artificial Bee Colony(ABC) optimization algorithm. The proposed classifier is applied to some machine learning datasets and its result is compared with some other classifiers.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.27 no.2
• /
• pp.71-86
• /
• 2022

The water quality index (WQI) has been widely used to evaluate marine water quality. The WQI in Korea is categorized into five classes by marine environmental standards. But, the WQI calculation on huge datasets is a very complex and time-consuming process. In this regard, the current study proposed machine learning (ML) based models to predict WQI class by using water quality datasets. Sihwa Lake, one of specially-managed coastal zone, was selected as a modeling site. In this study, adaptive boosting (AdaBoost) and tree-based pipeline optimization (TPOT) algorithms were used to train models and each model performance was evaluated by metrics (accuracy, precision, F1, and Log loss) on classification. Before training, the feature importance and sensitivity analysis were conducted to find out the best input combination for each algorithm. The results proved that the bottom dissolved oxygen (DO_Bot) was the most important variable affecting model performance. Conversely, surface dissolved inorganic nitrogen (DIN_Sur) and dissolved inorganic phosphorus (DIP_Sur) had weaker effects on the prediction of WQI class. In addition, the performance varied over features including stations, seasons, and WQI classes by comparing spatio-temporal and class sensitivities of each best model. In conclusion, the modeling results showed that the TPOT algorithm has better performance rather than the AdaBoost algorithm without considering feature selection. Moreover, the WQI class for unknown water quality datasets could be surely predicted using the TPOT model trained with satisfactory training datasets.

• Journal of KIISE:Software and Applications
• /
• v.33 no.2
• /
• pp.143-153
• /
• 2006

Microarray which enables us to obtain hundreds and thousands of expression of gene or genotype at once is an epoch-making technology in comparative analysis of genes. First of all, we have to measure the intensity of each gene in an microarray image from the experiment to gain the expression level of each gene. But it is difficult to analyze the microarray image in manual because it has a lot of genes. Meta-gridding method and various auto-gridding methods have been proposed for this, but thew still have some problems. For example, meta-gridding requires manual-work due to some variations in spite of experiment in same microarray, and auto-gridding nay not carried out fully or correctly when an image has a lot of noises or is lowly expressed. In this article, we propose Hierarchical Grid Alignment algorithm for new methodology combining meta-gridding method with auto-gridding method. In our methodology, we necd a meta-grid as an input, and then align it with the microarray image automatically. Experimental results show that the proposed method serves more robust and reliable gridding result than the previous methods. It is also possible for user to do more reliable batch analysis by using our algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.3
• /
• pp.9-18
• /
• 2001

In this paper, we present the joint symbol detection and channel estimation for an orthogonal frequency division multiplexing (OFDM) system in fading channels. The proposed methods are based on decision-directed channel estimation (DDCE) method and their symbol detection is achieved by using Viterbi algorithm. This Viterbi decision-directed channel estimation (VDDCE) method tracks time-varying channels and detects a maximum likelihood symbol sequence. Recursive Viterbi decision-directed channel estimation (RVDDCE) method based on VDDCE method is proposed to shorten the detecting depth. In this method, channel estimate and Viterbi processing are recursively performed every interval of training symbol. Also, average chann'el estimation (ACE) technique to reduce the effect of additive white Gaussian noise (AWGN) is applied VDDCE method and RVDDCE method. These proposed methods arc demonstrated by computer simulation.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.50-60
• /
• 1998

This paper addresses a problem of extraction of parameteric motion estimation and structural motion segmentation for compact image sequence representation and object-based generic video coding. In order to extract meaningful motion structure from image sequences, a direct parameteric motion estimation based on a pre-segmentation is proposed. The pre-segmentation which considers the motion of the moving objects is canied out based on probabilistic clustering with mixture models using optical flow and image intensities. Parametric motion segmentation can be obtained by iterated estimation of motion model parameters and region reassignment according to a criterion using Gauss-Newton iterative optimization algorithm. The efficiency of the proposed methoo is verified with computer simulation using elF real image sequences.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3
• /
• pp.141-149
• /
• 2005

Tn general. Gaussian mixture model (GMM) is used to estimate the speaker model from the speech for speaker identification. The parameter estimates of the GMM are obtained by using the Expectation-Maximization (EM) algorithm for the maximum likelihood (ML) estimation. However the EM algorithm has such drawbacks that it depends heavily on the initialization and it needs the number of mixtures to be known. In this paper, to solve the above problems of the EM algorithm. we propose an EM algorithm with the initialization based on incremental ${\cal}k-means$ for GMM. The proposed method dynamically increases the number of mixtures one by one until finding the optimum number of mixtures. Whenever adding one mixture, we calculate the mutual relationship between it and one of other mixtures respectively. Finally. based on these mutual relationships. we can estimate the optimal number of mixtures which are statistically independent. The effectiveness of the proposed method is shown by the experiment for artificial data. Also. we performed the speaker identification by applying the proposed method comparing with other approaches.