• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.4
• /
• pp.47-52
• /
• 2014

Species distribution models have been widely applied in order to assess biodiversity, design reserve, manage habitat and predict climate change. However, SDMs has been used restrictively to the public and policy sectors owing to model uncertainty. Recent studies on ensemble and consensus models have been increased to reduce model uncertainty. This paper was carried out single model and multi model for Corylopsis coreana and compares two models. First, model evaluation was used AUC, kappa and TSS. TSS was the most effective method because it was easy to compare several models and convert binary maps. Second, both single and ensemble model show good performance and RF, Maxent and GBM was evaluated higher, GAM and SRE was evaluated lower relatively. Third, ensemble model tended to overestimate over single model. This problem can be solved by the suitable model selection and weighting through collaboration between field experts and modeler. Finally, we should identify causes and magnitude of model uncertainty and improve data quality and model methods in order to apply special decision-making support system and conservation planning, and when we make policy decisions using SDMs, we should recognize uncertainty and risk.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.31-43
• /
• 2000

This paper presents a novel algorithm lot extraction of the eye and mouth fields (facial features) from 2D gray level face images. First of all, it has been found that Eigenfeatures, derived from the eigenvalues and the eigenvectors of the binary edge data set constructed from the eye and mouth fields are very good features to locate these fields. The Eigenfeatures, extracted from the positive and negative training samples for the facial features, ate used to train a MultiLayer Perceptron(MLP) whose output indicates the degree to which a particular image window contains the eye or the mouth within itself. Second, to ensure robustness, the ensemble network consisting of multiple MLPs is used instead of a single MLP. The output of the ensemble network becomes the average of the multiple locations of the field each found by the constituent MLPs. Finally, in order to reduce the computation time, we extracted the coarse search region lot eyes and mouth by using prior information on face images. The advantages of the proposed approach includes that only a small number of frontal faces are sufficient to train the nets and furthermore, lends themselves to good generalization to non-frontal poses and even to other people's faces. It was also experimentally verified that the proposed algorithm is robust against slight variations of facial size and pose due to the generalization characteristics of neural networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.329-336
• /
• 2016

In the outdoor advertising and industrial sites, are trying to implement the LED electric bulletin board system that is based on image processing in order to express a variety of intention in real time. Recently, in various field, rather than simple text representation, the importance of intuitive communication using images is increasing. Thus, instead of outputting the simple input information for communication, a system that can output a real-time information being sought. Therefore, the system is directed to overcoming by converting the problem of mapping an image on a variety of conventional LED display that can not be output images, the possible image output formats. Using an LED of low power, it has developed to output the efficient messages and images within a limited resources. This paper provides a system capable of managing the LED display on the wireless network. Atmega2560, Wi-Fi module, using the server and Android applications client, rather than printing a text only, it is a system to reduce the load generated image output character output in to the conversion process as can be managed by the server.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.25 no.4
• /
• pp.482-492
• /
• 2015

Objectives: Exposure Assessment for workplace hazards where the exposure level is below occupational exposure limits(OELs) has been performed without considering either the degrees of risk or exposure levels and has failed to lead to intervention in many cases. The objective of this study was to suggest and test an application framework for risk assessment methodology under the current exposure assessment system in Korea. Materials: First, we investigated the exposure assessment systems in Korea and other countries. To adopt some risk assessment techniques, we also analyzed risk assessment systems and compared them to exposure assessment systems. A few suggestions were made. We held a public hearing during an industrial hygiene conference and took surveys using a questionnaire. Results: The first suggestion was to implement the risk assessment and exposure assessment through a "one-stop" system. In that case, one expected question would be who has been doing the jobs so far. In most cases, industrial hygiene consulting services or laboratories have been performing exposure assessment for business owners. Business owners are required to perform risk assessment. As two different groups of people will be required to implement two things in a one-stop system, they need to share information. As an information vehicle to share information, commonly filed survey checklists were suggested. The second suggestion was to categorize exposure level into four groups instead of the current binary divisions based on OELs. In the risk assessment system, exposure level is divided into four groups utilizing the cut-points of 10%, 50%, and 100% of OELs. The same schema can be adopted in the exposure assessment system and different levels of requirements can be assigned for each group. The third suggestion was regarding the regulation system. To provide the suggestions some thrust toward being implemented in the field, changes should be made in the legal system. Two different types of new exposure assessment result reporting forms were suggested. Some investigations such as an ergonomic survey are officially accepted as risk assessment under the current legal system. A few items were suggested to be included in the exposure assessment result reporting to be accepted as risk assessment. A pilot study in two small factories was performed and pointed out the strengths and weakness of our suggestions. Conclusions: Discussions and studies on the improvement of the exposure assessment system have been held for decades and no tangible changes have yet been made. We hope this result can help realize healthy lives for workers in Korea.

• Progress in Medical Physics
• /
• v.23 no.3
• /
• pp.199-208
• /
• 2012

The computational human phantom including major radiation sensitive organs at risk (OARs) can be used in the field of radiotherapy, such as the variation of secondary cancer risks caused by the radiation therapy and the effective dose evaluation in diagnostic radiology. The present study developed a Korean adult female voxel phantom, VKH-Woman, based on serially sectioned color slice images of Korean female cadaver. The height and weight of the developed female voxel phantom are 160 cm and 52.72 kg, respectively that are virtually close to those of reference Korean female (161 cm and 54 kg). The female phantom consists of a total of 39 organs, including 27 organs recommended in the ICRP 103 publication for the effective dose calculations. The female phantom composes of $261{\times}109{\times}825$ voxels (=23,470,425 voxels) and the voxel resolution is $1.976{\times}1.976{\times}2.0619mm^3$ in the x, y, and z directions. The VHK-Woman is provided as both ASCII and Binary data formats to be conveniently implemented in Monte Carlo codes.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.396-404
• /
• 2014

The field of searching clothing, which is very difficult due to the nature of the informal sector, has been in an effort to reduce the recognition error and computational complexity. However, there is no concrete examples of the whole progress of learning and recognizing for cloth, and the related technologies are still showing many limitations. In this paper, the whole process including identifying both the person and cloth in an image and analyzing both its color and texture pattern is specifically shown for classification. Especially, deformable search descriptor, LBPROT_35 is proposed for identifying the pattern of clothing. The proposed method is scale and rotation invariant, so we can obtain even higher detection rate even though the scale and angle of the image changes. In addition, the color classifier with the color space quantization is proposed not to loose color similarity. In simulation, we build database by training a total of 810 images from the clothing images on the internet, and test some of them. As a result, the proposed method shows a good performance as it has 94.4% matching rate while the former Dense-SIFT method has 63.9%.

• Journal of Korean Society of Forest Science
• /
• v.96 no.1
• /
• pp.7-13
• /
• 2007

This study was done to develop PDA based application system for forest geographic information with GPS. The major results obtained in this study were as follows. A PDA based application program was developed to work on $Microsoft^{TM}$ PocketPC 2002 and 2003 operating system. The screen of PDA displays a 1:25,000 digital topographical map adopted DXF format converted from PC, and the map data with 1:2,500 to 1:30,000 on PDA can be zoomed in or out to five levels. Current position and navigating path received from GPS can be displayed on the screen and be saved in PDA. Information selected among layers of digital topographic map in DXF format can be converted into binary files which can be used on forest geographic information software. This can compress DXF files to 90% in size, and the processing speed of PDA was improved. The forest geographic information management system can be used to manage sample plots on which forest inventory is done, with the help of the sub-menus and grid index values with position information received from GPS. Forest workers can in quire forest geographic information such as forest type, location, forest roads, soil erosion control dams using forest geographic information management system in the field. The forest geographic information management system can provide current position and mobile path information to people who enjoy forest related activities like mountain-climbing, sightseeing, and visiting to historic spots.

• Journal of Korea Water Resources Association
• /
• v.48 no.11
• /
• pp.937-944
• /
• 2015

This study proposed a novel technique, namely the Radar Polygon Method (RPM), for areal rainfall estimation based on radar precipitation data. The RPM algorithm has the following steps: 1. Determine a map of the similar rainfall occurrence of which each grid cell contains the binary information on whether the grid cell rainfall is similar to that of the observation gage; 2. Determine the similar rainfall probability map for each gage of which each grid cell contains the probability of having the rainfall similar to that of the observation gage; 3. Determine the governing territory of each gage by comparing the probability maps of the gages. RPM method was applied to the Anseong stream basin. Radar Polygons and Thiessen Polygons of the study area were similar to each other with the difference between the two being greater for the rain gage highly influenced by the orography. However, the weight factor between the two were similar with each other. The significance of this study is to pioneer a new application field of radar rainfall data that has been limited due to short observation period and low accuracy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.93-100
• /
• 2007

Since Koblitz and Miller suggested the use of elliptic curves in cryptography, there has been an extensive literature on elliptic curve cryptosystem (ECC). The use of ECC is based on the observation that the points on an elliptic curve form an additive group under point addition operation. To realize secure cryptosystems using these groups, it is very important to find an elliptic curve whose group order is divisible by a large prime, and also to find a base point whose order equals this prime. While there have been many dramatic improvements on finding an elliptic curve and computing its group order efficiently, there are not many results on finding an adequate base point for a given curve. In this paper, we propose an efficient method to find a random base point on an elliptic curve defined over $GF(p^m)$. We first show that the critical operation in finding a base point is exponentiation. Then we present efficient algorithms to accelerate exponentiation in $GF(p^m)$. Finally, we implement our algorithms and give experimental results on various practical elliptic curves, which show that the new algorithms make the process of searching for a base point 1.62-6.55 times faster, compared to the searching algorithm based on the binary exponentiation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.3-10
• /
• 2008

The choice of basis for representation of element in $GF(2^m)$ affects the efficiency of a multiplier. Among them, a multiplier using redundant representation efficiently supports trade-off between the area complexity and the time complexity since it can quickly carry out modular reduction. So time of a previous multiplier using redundant representation is faster than time of multiplier using others basis. But, the weakness of one has a upper space complexity compared to multiplier using others basis. In this paper, we propose a new efficient multiplier with consideration that polynomial exponentiation operations are frequently used in cryptographic hardwares. The proposed multiplier is suitable fer left-to-right exponentiation environment and provides efficiency between time and area complexity. And so, it has both time delay of $T_A+({\lceil}{\log}_2m{\rceil})T_x$ and area complexity of (2m-1)(m+s). As a result, the proposed multiplier reduces $2(ms+s^2)$ compared to the previous multiplier using equally-spaced polynomials in area complexity. In addition, it reduces $T_A+({\lceil}{\log}_2m+s{\rceil})T_x$ to $T_A+({\lceil}{\log}_2m{\rceil})T_x$ in the time complexity.($T_A$:Time delay of one AND gate, $T_x$:Time delay of one XOR gate, m:Degree of equally spaced irreducible polynomial, s:spacing factor)