• 제목/요약/키워드: Information input algorithm

Search Result 2,444, Processing Time 0.031 seconds

Research of Runoff Management in Urban Area using Genetic Algorithm (유전자알고리즘을 이용한 도시화 유역에서의 유출 관리 방안 연구)

  • Lee, Beum-Hee
    • Journal of the Korean Geophysical Society
    • /
    • v.9 no.4
    • /
    • pp.321-331
    • /
    • 2006
  • Recently, runoff characteristics of urban area are changing because of the increase of impervious area by rapidly increasing of population and industrialization, urbanization. It needs to extract the accurate topologic and hydrologic parameters of watershed in order to manage water resource efficiently. Thus, this study developed more precise input data and more improved parameter estimating procedures using GIS(Geographic Information System) and GA(Genetic Algorithm). For these purposes, XP-SWMM (EXPert-Storm Water Management Model) was used to simulate the urban runoff. The model was applied to An-Yang stream basin that is a typical Korean urban stream basin with several tributaries. The rules for parameter estimation were composed and applied based on quantity parameters that are investigated through the sensitivity analysis. GA algorithm is composed of these rules and facts. The conditions of urban flows are simulated using the rainfall-runoff data of the study area. The data of area, slope, width of each subcatchment and length, slope of each stream reach were acquired from topographic maps, and imperviousness rate, land use types, infiltration capacities of each subcatchment from land use maps, soil maps using GIS. Also we gave the management scheme of urbanization runoff using XP-SWMM. The parameters are estimated by GA from sensitivity analysis which is performed to analyze the runoff parameters.

  • PDF

Development of CPLD technology mapping algorithm for Sequential Circuit under Time Constraint (시간제약 조건하에서 순차 회로를 위한 CPLD 기술 매핑 알고리즘 개발)

  • Youn, Chung-Mo;Kim, Hi-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.1
    • /
    • pp.224-234
    • /
    • 2000
  • In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that if fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs bu 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

  • PDF

Effect of input variable characteristics on the performance of an ensemble machine learning model for algal bloom prediction (앙상블 머신러닝 모형을 이용한 하천 녹조발생 예측모형의 입력변수 특성에 따른 성능 영향)

  • Kang, Byeong-Koo;Park, Jungsu
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.35 no.6
    • /
    • pp.417-424
    • /
    • 2021
  • Algal bloom is an ongoing issue in the management of freshwater systems for drinking water supply, and the chlorophyll-a concentration is commonly used to represent the status of algal bloom. Thus, the prediction of chlorophyll-a concentration is essential for the proper management of water quality. However, the chlorophyll-a concentration is affected by various water quality and environmental factors, so the prediction of its concentration is not an easy task. In recent years, many advanced machine learning algorithms have increasingly been used for the development of surrogate models to prediction the chlorophyll-a concentration in freshwater systems such as rivers or reservoirs. This study used a light gradient boosting machine(LightGBM), a gradient boosting decision tree algorithm, to develop an ensemble machine learning model to predict chlorophyll-a concentration. The field water quality data observed at Daecheong Lake, obtained from the real-time water information system in Korea, were used for the development of the model. The data include temperature, pH, electric conductivity, dissolved oxygen, total organic carbon, total nitrogen, total phosphorus, and chlorophyll-a. First, a LightGBM model was developed to predict the chlorophyll-a concentration by using the other seven items as independent input variables. Second, the time-lagged values of all the input variables were added as input variables to understand the effect of time lag of input variables on model performance. The time lag (i) ranges from 1 to 50 days. The model performance was evaluated using three indices, root mean squared error-observation standard deviation ration (RSR), Nash-Sutcliffe coefficient of efficiency (NSE) and mean absolute error (MAE). The model showed the best performance by adding a dataset with a one-day time lag (i=1) where RSR, NSE, and MAE were 0.359, 0.871 and 1.510, respectively. The improvement of model performance was observed when a dataset with a time lag up of about 15 days (i=15) was added.

Object Segmentation for Image Transmission Services and Facial Characteristic Detection based on Knowledge (화상전송 서비스를 위한 객체 분할 및 지식 기반 얼굴 특징 검출)

  • Lim, Chun-Hwan;Yang, Hong-Young
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.36T no.3
    • /
    • pp.26-31
    • /
    • 1999
  • In this paper, we propose a facial characteristic detection algorithm based on knowledge and object segmentation method for image communication. In this algorithm, under the condition of the same lumination and distance from the fixed video camera to human face, we capture input images of 256 $\times$ 256 of gray scale 256 level and then remove the noise using the Gaussian filter. Two images are captured with a video camera, One contains the human face; the other contains only background region without including a face. And then we get a differential image between two images. After removing noise of the differential image by eroding End dilating, divide background image into a facial image. We separate eyes, ears, a nose and a mouth after searching the edge component in the facial image. From simulation results, we have verified the efficiency of the Proposed algorithm.

  • PDF

Efficient Object Selection Algorithm by Detection of Human Activity (행동 탐지 기반의 효율적인 객체 선택 알고리듬)

  • Park, Wang-Bae;Seo, Yung-Ho;Doo, Kyoung-Soo;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.3
    • /
    • pp.61-69
    • /
    • 2010
  • This paper presents an efficient object selection algorithm by analyzing and detecting of human activity. Generally, when people point any something, they will put a face on the target direction. Therefore, the direction of the face and fingers and was ordered to be connected to a straight line. At first, in order to detect the moving objects from the input frames, we extract the interesting objects in real time using background subtraction. And the judgment of movement is determined by Principal Component Analysis and a designated time period. When user is motionless, we estimate the user's indication by estimation in relation to vector from the head to the hand. Through experiments using the multiple views, we confirm that the proposed algorithm can estimate the movement and indication of user more efficiently.

Inclined Face Detection using JointBoost algorithm (JointBoost 알고리즘을 이용한 기울어진 얼굴 검출)

  • Jung, Youn-Ho;Song, Young-Mo;Ko, Yun-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.5
    • /
    • pp.606-614
    • /
    • 2012
  • Face detection using AdaBoost algorithm is one of the fastest and the most robust face detection algorithm so many improvements or extensions of this method have been proposed. However, almost all previous approaches deal with only frontal face and suffer from limited discriminant capability for inclined face because these methods apply the same features for both frontal and inclined face. Also conventional approaches for detecting inclined face which apply frontal face detecting method to inclined input image or make different detectors for each angle require heavy computational complexity and show low detection rate. In order to overcome this problem, a method for detecting inclined face using JointBoost is proposed in this paper. The computational and sample complexity is reduced by finding common features that can be shared across the classes. Simulation results show that the detection rate of the proposed method is at least 2% higher than that of the conventional AdaBoost method under the learning condition with the same iteration number. Also the proposed method not only detects the existence of a face but also gives information about the inclined direction of the detected face.

A Study on Object Tracking using Variable Search Block Algorithm (가변 탐색블록을 이용한 객체 추적에 관한 연구)

  • Min Byoung-Muk;Oh Hae-Seok
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.463-470
    • /
    • 2006
  • It is difficult to track and extract the movement of an object through a camera exactly because of noises and changes of the light. The fast searching algorithm is necessary to extract the object and to track the movement for realtime image. In this paper, we propose the correct and fast algorithm using the variable searching area and the background image change method to robustic for the change of background image. In case the threshold value is smaller than reference value on an experimental basis, change the background image. When it is bigger, we decide it is the point of the time of the object input and then extract boundary point of it through the pixel check. The extracted boundary points detect precise movement of the object by creating area block of it and searching block that maintaining distance. The designed and embodied system shows more than 95% accuracy in the experimental results.

The Design and Implementation of Outer Encoder/Decoder for Terrestrial DMB (지상파 DMB용 Outer 인코더/리코더의 설계 및 구현)

  • Won, Ji-Yeon; Lee, Jae-Heung;Kim, Gun
    • The KIPS Transactions:PartA
    • /
    • v.11A no.1
    • /
    • pp.81-88
    • /
    • 2004
  • In this paper, we designed the outer encoder/decoder for the terrestrial DMB that is an advanced digital broadcasting standard, implemented, and verified by using ALTERA FPGA. In the encoder part, it was created the parity bytes (16 bytes) from the input packet (188by1e) of MPEG-2 TS and the encoded data was distributed output by the convolutional interleaver for Preventing burst errors. In the decoder part, It was proposed the algorithm that detects synchronous character suitable to DMB in transmitted data from the encoder. The circuit complexity in RS decoder was reduced by applying a modified Euclid's algorithm. This system has a capability to correct error of the maximum 8 bytes in a packet. After the outer encoder/decoder algorithm was verified by using C language, described in VHDL and implemented in the ALTERA FPGA chips.

Implementation of a bio-inspired two-mode structural health monitoring system

  • Lin, Tzu-Kang;Yu, Li-Chen;Ku, Chang-Hung;Chang, Kuo-Chun;Kiremidjian, Anne
    • Smart Structures and Systems
    • /
    • v.8 no.1
    • /
    • pp.119-137
    • /
    • 2011
  • A bio-inspired two-mode structural health monitoring (SHM) system based on the Na$\ddot{i}$ve Bayes (NB) classification method is discussed in this paper. To implement the molecular biology based Deoxyribonucleic acid (DNA) array concept in structural health monitoring, which has been demonstrated to be superior in disease detection, two types of array expression data have been proposed for the development of the SHM algorithm. For the micro-vibration mode, a two-tier auto-regression with exogenous (AR-ARX) process is used to extract the expression array from the recorded structural time history while an ARX process is applied for the analysis of the earthquake mode. The health condition of the structure is then determined using the NB classification method. In addition, the union concept in probability is used to improve the accuracy of the system. To verify the performance and reliability of the SHM algorithm, a downscaled eight-storey steel building located at the shaking table of the National Center for Research on Earthquake Engineering (NCREE) was used as the benchmark structure. The structural response from different damage levels and locations was collected and incorporated in the database to aid the structural health monitoring process. Preliminary verification has demonstrated that the structure health condition can be precisely detected by the proposed algorithm. To implement the developed SHM system in a practical application, a SHM prototype consisting of the input sensing module, the transmission module, and the SHM platform was developed. The vibration data were first measured by the deployed sensor, and subsequently the SHM mode corresponding to the desired excitation is chosen automatically to quickly evaluate the health condition of the structure. Test results from the ambient vibration and shaking table test showed that the condition and location of the benchmark structure damage can be successfully detected by the proposed SHM prototype system, and the information is instantaneously transmitted to a remote server to facilitate real-time monitoring. Implementing the bio-inspired two-mode SHM practically has been successfully demonstrated.

Low Power Parallel Acquisition Scheme for UWB Systems (저전력 병렬탐색기법을 이용한 UWB시스템의 동기 획득)

  • Kim, Sang-In;Cho, Kyoung-Rok
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.147-154
    • /
    • 2007
  • In this paper, we propose a new parallel search algorithm to acquire synchronization for UWB(Ultra Wideband) systems that reduces computation of the correlation. The conventional synchronization acquisition algorithms check all the possible signal phases simultaneously using multiple correlators. However it reduces the acquisition time, it makes high power consumption owing to increasing of correlation. The proposed algorithm divides the preamble signal to input the correlator into an m-bit bunch. We check the result of the correlation at first stage of an m-bit bunch data and predict whether it has some synchronization acquisition information or not. Thus, it eliminates the unnecessary operation and save the number of correlation. We evaluate the proposed algorithm under the AWGN and the multi-Path channel model with MATLAB. The proposed parallel search scheme reduces number of the correlation 65% on the AWGN and 20% on the multi-path fading channel.