• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.28 no.5
• /
• pp.277-283
• /
• 2016

Tetrapod is one of the most widely used concrete armor units for rubble mound breakwaters. The calculation of the stability number of Tetrapods is necessary to determine the optimal weight of Tetrapods. Many empirical formulas have been developed to calculate the stability number of Tetrapods, from the Hudson formula in 1950s to the recent one developed by Suh and Kang. They were developed by using the regression analysis to determine the coefficients of an assumed formula using the experimental data. Recently, software engineering (or machine learning) methods are introduced as a large amount of experimental data becomes available, e.g. artificial neural network (ANN) models for rock armors. However, these methods are seldom used probably because they did not significantly improve the accuracy compared with the empirical formula and/or the engineers are not familiar with them. In this study, we propose an explicit method to calculate the stability number of Tetrapods using the weights and biases of an ANN model. This method can be used by an engineer who has basic knowledge of matrix operation without requiring knowledge of ANN, and it is more accurate than previous empirical formulas.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.520-529
• /
• 2005

A feature-based 3D modeling algorithm is presented in this paper. Since conventional methods use depth-based techniques, they need much time for the image matching to extract depth information. Even feature-based methods have less computation load than that of depth-based ones, the calculation of modeling error about whole pixels within a triangle is needed in feature-based algorithms. It also increase the computation time. Therefore, the proposed algorithm consists of three phases, which are an initial 3D model generation, model evaluation, and model refinement phases, in order to acquire an efficient 3D model. Intensity gradients and incremental Delaunay triangulation are used in the Initial model generation. In this phase, a morphological edge operator is adopted for a fast edge filtering, and the incremental Delaunay triangulation is modified to decrease the computation time by avoiding the calculation errors of whole pixels and selecting a vertex at the near of the centroid within the previous triangle. After the model generation, sparse vertices are matched, then the faces are evaluated with the size, approximation error, and disparity fluctuation of the face in evaluation stage. Thereafter, the faces which have a large error are selectively refined into smaller faces. Experimental results showed that the proposed algorithm could acquire an adaptive model with less modeling errors for both smooth and abrupt areas and could remarkably reduce the model acquisition time.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.474-486
• /
• 2010

In this paper, we propose a new method for detection moving object contour using spatial and temporal edge. In general, contour pixels of the moving object are likely present around pixels with high gradient value along the time axis and the spatial axis. Therefore, we can detect the contour of the moving objects by finding pixels which have high gradient value in the time axis and spatial axis. In this paper, we introduce a new computation method, termed as temporal edge, to compute an gradient value along the time axis for any pixel on an image. The temporal edge can be computed using two input gray images at time t and t-2 using the Sobel operator. Temporal edge is utilized to detect a candidate region of the moving object contour and then the detected candidate region is used to extract spatial edge information. The final contour of the moving object is detected using the combination of these two edge information, which are temporal edge and spatial edge, and then the post processing such as a morphological operation and a background edge removing procedure are applied to remove noise regions. The complexity of the proposed method is very low because it dose not use any background scene and high complex operation, therefore it can be applied to real-time applications. Experimental results show that the proposed method outperforms the conventional contour extraction methods in term of processing effort and a ghost effect which is occurred in the case of entropy method.

• School Mathematics
• /
• v.18 no.1
• /
• pp.143-157
• /
• 2016

North Korea had been reorganized its educational curriculum and new contexts were authored in 2013. In this study, mathematics contexts of North Korean secondary school's first grade in 2009 and 2013 were investigated. And the changes of content structure, content development, and content composition were analyzed. Results were as follows: First, with respect to the content structure, 1 chapter decreased, while lesson number was intact and 4 subunits increased. Second, with respect to the content development, considerable changes were presented. The tendencies that encouraged student and pursued a student friendly form were investigated. Third, with respect to the content composition, obvious changes were presented. It was investigated that the ratio of numbers and number operations, letters and expressions decreased nearly half. And new contents were supplemented in the areas of patterns, geometry, functions, probability and statics, equation of figures, set and statement. This changes suggests that differences between contexts of South and North Korea is narrowing compared to the past. In conclusion, the direction of North Korean mathematical education is changing for the general direction of South Korean mathematical education.

• Smart Media Journal
• /
• v.7 no.1
• /
• pp.37-44
• /
• 2018

Utilizing sequence control and numerical computing, embedded devices are used in a variety of automated systems, including those at industrial sites, in accordance with their control program. Since embedded devices are used as a control system in corporate industrial complexes, nuclear power plants and public transport infrastructure nowadays, deliberate attacks on them can cause significant economic and social damages. Most attacks aimed at embedded devices are data-coded, code-modulated, and control-programmed. The control programs for industry-automated embedded devices are designed to represent circuit structures, unlike common programming languages, and most industrial automation control programs are designed with a graphical language, LAD, which is difficult to process static analysis. Because of these characteristics, the vulnerability analysis and security related studies for industry automation control programs have only progressed up to the formal verification, real-time monitoring levels. Furthermore, the static analysis of industrial automation control programs, which can detect vulnerabilities in advance and prepare for attacks, stays poorly researched. Therefore, this study suggests a method to present a discussion on an industry automation control program designed to represent the circuit structure to increase the efficiency of static analysis of embedded industrial automation programs. It also proposes a medium term translation technology exploiting LLVM IR to comprehensively analyze the industrial automation control programs of various manufacturers. By using LLVM IR, it is possible to perform integrated analysis on dynamic analysis. In this study, a prototype program that converts to a logical expression type of medium language was developed with regards to the S company's control program in order to verify our method.

• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.663-673
• /
• 2014

The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.141-148
• /
• 2011

Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.

• The KIPS Transactions:PartB
• /
• v.16B no.2
• /
• pp.131-140
• /
• 2009

This paper presents a new algorithm to the segmentation of the FISH images. First, for segmentation of the cell nuclei from background, a threshold is estimated by using the gaussian mixture model and maximizing the likelihood function of gray value of cell images. After nuclei segmentation, overlapped nuclei and isolated nuclei need to be classified for exact nuclei analysis. For nuclei classification, this paper extracted the morphological features of the nuclei such as compactness, smoothness and moments from training data. Three probability density functions are generated from these features and they are applied to the proposed Bayesian networks as evidences. After nuclei classification, segmenting of overlapped nuclei into isolated nuclei is necessary. This paper first performs intensity gradient transform and watershed algorithm to segment overlapped nuclei. Then proposed stepwise merging strategy is applied to merge several fragments in major nucleus. The experimental results using FISH images show that our system can indeed improve segmentation performance compared to previous researches, since we performed nuclei classification before separating overlapped nuclei.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.585-592
• /
• 2005

One of the most important things in the researches on diseases is to attach more importance to prevention of a disease and preservation of health than to treatment of a disease, also to foods rather than to medicines. In this context, the most significant concern in examining a patient is to find the presence of disease, and, if any, to diaguose the type of disease, after which a pharmacotherapy is followed. In this paper, various diagnosis methods of Oriental medicines are discussed. And ocular inspection, the most important method among the 4 disease diagnoses of Oriental medicines, is studied. Observing a person's shape and color has been the major method for ocular inspection, which usually has been dependent upon doctor's intuition as of these days. We are developing an automatic system which provides objective basic data for ocular inspection. As the first stage, we applied the signal processing techniques to automatic feature extraction of faces for ocular inspection. Firstly, facial regions are extracted from the point of frontal view, which was followed by extraction of their features. The experiment applied to 20 persons showed that frontal face regions are perfectly extracted, as well as their features, such as eyes, eyebrows, noses and mouths. Future work will seek to address the issues of morphological operation for a few unfinished extraction results, such as combined hair and eyebrows.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.117-126
• /
• 2013

Path planning is an essential problem to make virtual characters navigate in many applications including computer games. In many cases, multiple characters move in a group and qualitative aspects of planned paths are emphasized rather than optimality unlike Robotics. In this paper, we propose a two-level path planning algorithm in which the global path is planned for a single character specified as a leader and then the local path is planned to avoid dynamic obstacles while the group following this path. The space for group movement is achieved in the form of square grid array called a grid window. Member characters are located relatively to the leader within a space and moved. The static environment is reduced to the configuration space of this grid window to generate a roadmap on which a grid window can move. In local path planning, only the leader avoids dynamic obstacles by using an artificial potential field and the rest of members are located relatively to the leader in the grid window, which reduces computational load. Efficient algorithms to implement the proposed planning methods are introduced. The simulation results show that a group can handle with dynamic obstacles effectively while moving along the planned path for a static environment.