• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.123-129
• /
• 2017

New mobile phones with high tech-camera and a large size memory have been recently launched and people upload pictures of beautiful scenes or unknown flowers in SNS. This paper develops a flower recognition system that can get information on flowers in the place where mobile communication is not even available. It consists of a registration part for reference flowers and a recognition part based on OpenCV for Android platform. A new color classification method using RGB color channel and K-means clustering is proposed to reduce the recognition processing time. And ORB for feature extraction and Brute-Force Hamming algorithm for matching are used. We use 12 kinds of flowers with four color groups, and 60 images are applied for reference DB design and 60 images for test. Simulation results show that the success rate is 83.3% and the average recognition time is 2.58 s on Huawei ALEUL00 and the proposed system is suitable for a mobile phone without a network.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.3 s.303
• /
• pp.33-40
• /
• 2005

In order to successfully exploit underwater resources, the first step would be a marine environmental research and exploration on the seafloor. Traditionally one sets up a long-term underwater experimental unit on the seafloor and retrieves the unit later after a certain period time. Essential to these applications is the reliable teleoperation and telemetering of the unit. This study presents ultrasonic-wave remote control system and an underwater sound recognition algorithm that can identify the sound signal without the influence of disturbances due to underwater environmental changes. The proposed method provides a means suitable for units which require low power dissipation and long-time underwater operation. We demonstrate its ability of securing stability and fast sound recognition through experimental methods.

• Smart Structures and Systems
• /
• v.14 no.1
• /
• pp.39-54
• /
• 2014

Node layout optimization of structural wireless systems is investigated as a means to prolong the network lifetime without, if possible, compromising information quality of the measurement data. The trade-off between these antagonistic objectives is studied within a multi-objective layout optimization framework. A Genetic Algorithm is adopted to obtain a set of Pareto-optimal solutions from which the end user can select the final layout. The information quality of the measurement data collected from a heterogeneous WSN is quantified from the placement quality indicators of strain and acceleration sensors. The network lifetime or equivalently the network energy consumption is estimated through WSN simulation that provides realistic results by capturing the dynamics of the wireless communication protocols. A layout optimization study of a monitoring system on the Great Belt Bridge is conducted to evaluate the proposed approach. The placement quality of strain gauges and accelerometers is obtained as a ratio of the Modal Clarity Index and Mode Shape Expansion values that are computed from a Finite Element model of the monitored bridge. To estimate the energy consumption of the WSN platform in a realistic scenario, we use a discrete-event simulator with stochastic communication models. Finally, we compare the optimization results with those obtained in a previous work where the network energy consumption is obtained via deterministic communication models.

• Journal of Power Electronics
• /
• v.13 no.4
• /
• pp.516-527
• /
• 2013

This paper presents a new overall system for state-of-available-power (SoAP) prediction for a lithium-ion battery pack. The essential part of this method is based on an adaptive network architecture which utilizes both fuzzy model (FIS) and artificial neural network (ANN) into the framework of adaptive neuro-fuzzy inference system (ANFIS). While battery aging proceeds, the system is capable of delivering accurate power prediction not only for room temperature, but also at lower temperatures at which power prediction is most challenging. Due to design property of ANN, the network parameters are adapted on-line to the current battery states (state-of-charge (SoC), state-of-health (SoH), temperature). SoC is required as an input parameter to SoAP module and high accuracy is crucial for a reliable on-line adaptation. Therefore, a reasonable way to determine the battery state variables is proposed applying a combination of several partly different algorithms. Among other SoC boundary estimation methods, robust extended Kalman filter (REKF) for recalibration of amp hour counters was implemented. ANFIS then achieves the SoAP estimation by means of time forward voltage prognosis (TFVP) before a power pulse occurs. The trade-off between computational cost of batch-learning and accuracy during on-line adaptation was optimized resulting in a real-time system with TFVP absolute error less than 1%. The verification was performed on a software-in-the-loop test bench setup using a 53 Ah lithium-ion cell.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2843-2845
• /
• 2000

A lane detection based on a road model or feature all need correct acquirement of information on the lane in a image, It is inefficient to implement a lane detection algorithm through the full range of a image when being applied to a real road in real time because of the calculating time. This paper defines two searching range of detecting lane in a road, First is searching mode that is searching the lane without any prior information of a road, Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It is allow to extract accurately and efficiently the edge candidates points of a lane as not conducting an unnecessary searching. By means of removing the perspective effect of the edge candidate points which are acquired by using the inverse perspective transformation, we transform the edge candidate information in the Image Coordinate System(ICS) into the plane-view image in the World Coordinate System(WCS). We define linear approximation filter and remove the fault edge candidate points by using it This paper aims to approximate more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.

• Structural Engineering and Mechanics
• /
• v.57 no.2
• /
• pp.327-355
• /
• 2016

A new analytical derivation of the elastodynamic point load solutions for an isotropic multi-layered half-space is presented by means of the precise integration method (PIM) and the approach of dual vector. The time-harmonic external load is prescribed either on the external boundary or in the interior of the solid medium. Starting with the axisymmetric governing motion equations in a cylindrical coordinate system, a second order ordinary differential matrix equation can be gained by making use of the Hankel integral transform. Employing the technique of dual vector, the second order ordinary differential matrix equation can be simplified into a first-order one. The approach of PIM is implemented to obtain the solutions of the ordinary differential matrix equation in the Hankel integral transform domain. The PIM is a highly accurate algorithm to solve sets of first-order ordinary differential equations and any desired accuracy of the dynamic point load solutions can be achieved. The numerical simulation is based on algebraic matrix operation. As a result, the computational effort is reduced to a great extent and the computation is unconditionally stable. Selected numerical trials are given to validate the accuracy and applicability of the proposed approach. More examples are discussed to portray the dependence of the load-displacement response on the isotropic parameters of the multi-layered media, the depth of external load and the frequency of excitation.

• YAKHAK HOEJI
• /
• v.56 no.1
• /
• pp.48-54
• /
• 2012

Enviromental differences in gentamicin pharmacokinetics by using population pharmacokinetic methods were compared with 20 Korean patients and 24 Korean-American appendicitis patients. Two to six blood specimens were collected from all patients at the following times : just before a regularly scheduled infusion and at 0.5 hour after the end of a 0.5 hour infusion. Nonparametric expected maximum (NPEM) algorithm for population modeling was used. The estimated parameters were the elimination rate constant (K), the slope (KS) of the relationship between K versus creatinine clearance ($C_{cr}$), the apparent volume of distribution (V), the slope (VS) of the relationship between V versus weight, gentamicin clearance (CL) and the slope (CS) of the relationship between CL versus $C_{cr}$ and the V. The output includes two marginal probability density function (PDF), means, medians, modes, variance and CV%. The mean K (KS) were $0.402{\pm}0.129\;h^{-1}(0.00486{\pm}0.00197\;[h{\cdot}ml/min/1.73\;m^2]^{-1})$ and $0.411{\pm}0.135\;h^{-1}(0.00475{\pm}0.00180\;[h{\cdot}ml/min/1.73\;m^2]^{-1})$ for Korean and Korean-American populations, respectively. The mean V (VS) were not different at $14.3{\pm}3.6l(0.241{\pm}0.0511l/kg)$ and $15.1{\pm}3.84l(0.239{\pm}0.0492l/kg)$ for Korean and Korean-American populations, respectively (p>0.2). The mean CL (CS) were $5.68{\pm}1.69l/h(0.0714{\pm}0.0222l/kg[h{\cdot}ml/min/1.73\;m^2])$ and $5.70{\pm}1.77l/h(0.0701{\pm}0.0215l/kg[h{\cdot}ml/min/1.73\;m^2])$ for Korean and Korean-American populations, respectively. There were no enviromental differences in gentamicin pharmacokinetics between Korean and Korean-American appendicitis patients.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.2
• /
• pp.311-318
• /
• 2014

As modern computer graphics technology has been developed, it is hard to discriminate computer graphics from photographic images with the naked eye. Advances in graphics technology has brought a lot of convenience to human, it has side effects such as image forgery, malicious edit and fraudulent means. In order to cope with such problems, studies of various algorithms using a feature that represents a characteristic of an image has been processed. In this paper, we verify directly the existing algorithm, and provide new features based a noise that represents the characteristics of the computer graphics well. And this paper introduces the method of using SVM(Support Vector Machine) with features proposed in previous research to improve the discrimination accuracy.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.4
• /
• pp.50-58
• /
• 2017

Recently, some methods of converging heterogeneous fire sensor data have been proposed for effective fire detection, but the rule-based methods have low adaptability and accuracy, and the fuzzy inference methods suffer from detection speed and accuracy by lack of consideration for images. In addition, a few image-based deep learning methods were researched, but it was too difficult to rapidly recognize the fire event in absence of cameras or out of scope of a camera in practical situations. In this paper, we propose a novel fire detection system combining a deep learning algorithm based on CNN and fuzzy inference engine based on heterogeneous fire sensor data including temperature, humidity, gas, and smoke density. we show it is possible for the proposed system to rapidly detect fire by utilizing images and to decide fire in a reliable way by utilizing multi-sensor data. Also, we apply distributed computing architecture to fire detection algorithm in order to avoid concentration of computing power on a server and to enhance scalability as a result. Finally, we prove the performance of the system through two experiments by means of NIST's fire dynamics simulator in both cases of an explosively spreading fire and a gradually growing fire.

• Journal of International Society for Simulation Surgery
• /
• v.2 no.1
• /
• pp.26-32
• /
• 2015

Purpose When a surgeon examines the morphology of skull of patient, locations of craniometric landmarks of 3D computed tomography(CT) volume are one of the most important information for surgical purpose. The locations of craniometric landmarks can be found manually by surgeon from the 3D rendered volume or 2D sagittal, axial, and coronal slices which are taken by CT. Since there are many landmarks on the skull, finding these manually is time-consuming, exhaustive, and occasionally inexact. These inefficiencies raise a demand for a automatic localization technique for craniometric landmark points. So in this paper, we propose a novel method through which we can automatically find these landmark points, which are useful for surgical purpose. Materials and Methods At first, we align the experimental data (CT volumes) using Frankfurt Horizontal Plane (FHP) and Mid Sagittal Plane(MSP) which are defined by 3 and 2 cranial landmark points each. The target landmark of our experiment is the anterior nasal spine. Prior to constructing a statistical cubic model which would be used for detecting the location of the landmark from a given CT volume, reference points for the anterior nasal spine were manually chosen by a surgeon from several CT volume sets. The statistical cubic model is constructed by calculating weighted intensity means of these CT sets around the reference points. By finding the location where similarity function (squared difference function) has the minimal value with this model, the location of the landmark can be found from any given CT volume. Results In this paper, we used 5 CT volumes to construct the statistical cubic model. The 20 CT volumes including the volumes, which were used to construct the model, were used for testing. The range of age of subjects is up to 2 years (24 months) old. The found points of each data are almost close to the reference point which were manually chosen by surgeon. Also it has been seen that the similarity function always has the global minimum at the detection point. Conclusion Through the experiment, we have seen the proposed method shows the outstanding performance in searching the landmark point. This algorithm would make surgeons efficiently work with morphological informations of skull. We also expect the potential of our algorithm for searching the anatomic landmarks not only cranial landmarks.