• 제목/요약/키워드: Algorithm Evaluate

검색결과 2,722건 처리시간 0.026초

유전자 알고리즘을 이용한 Piled Raft 기초의 최적설계 (Optimum Design of Piled Raft Foundations using Genetic Algorithm)

  • 김홍택;강인규;황정순;전응진;고용일
    • 한국지반공학회:학술대회논문집
    • /
    • 한국지반공학회 1999년도 가을 학술발표회 논문집
    • /
    • pp.415-422
    • /
    • 1999
  • This paper describes a new optimum design approach for piled raft foundations using the genetic algorithm. The objective function considered is the cost-based total weight of raft and piles. The genetic algorithm is a search or optimization technique based on nature selection. Successive generation evolves more fit individuals on the basis of the Darwinism survival of the fittest. In formulating the genetic algorithm-based optimum design procedure, the analysis of piled raft foundations is peformed based on the 'hybrid'approach developed by Clancy(1993), and also the simple genetic algorithm proposed by the Goldberg(1989) is used. To evaluate a validity of the optimum design procedure proposed based on the genetic algorithm, comparisons regarding optimal pile placement for minimizing differential settlements by Kim et at.(1999) are made. In addition using proposed design procedure, design examples are presented.

  • PDF

Recognition of Car License Plates Using Fuzzy Clustering Algorithm

  • Cho, Jae-Hyun;Lee, Jong-Hee
    • Journal of information and communication convergence engineering
    • /
    • 제6권4호
    • /
    • pp.444-447
    • /
    • 2008
  • In this paper, we proposed the recognition system of car license plates to mitigate traffic problems. The processing sequence of the proposed algorithm is as follows. At first, a license plate segment is extracted from an acquired car image using morphological features and color information, and noises are eliminated from the extracted license plate segment using line scan algorithm and Grassfire algorithm, and then individual codes are extracted from the license plate segment using edge tracking algorithm. Finally the extracted individual codes are recognized by an FCM algorithm. In order to evaluate performance of segment extraction and code recognition of the proposed method, we used 100 car images for experiment. In the results, we could verify the proposed method is more effective and recognition performance is improved in comparison with conventional car license plate recognition methods.

검사공정의 작업배분을 위한 휴리스틱 알고리즘 개발 (Heuristic algorithm to assign job in inspection process)

  • 이석환;박승헌
    • 대한안전경영과학회지
    • /
    • 제10권3호
    • /
    • pp.253-265
    • /
    • 2008
  • In this paper, we developed a heuristic algorithm to assign job to workers in parallel line inspection process without sequence. Objective of assigning job in inspection process is only to assign job to workers evenly. But this objective needs much time and effort since there are many cases in assigning job and cases increase geometrically if the number of job and worker increases. In order to solve this problem, we proposed heuristic algorithm to assign job to workers evenly. Experiments of assigning job are performed to evaluate performance of this heuristic algorithm. The result shows that heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are more than two optimal solutions, this heuristic algorithm can find the optimal solution with 98% accuracy.

칼라 이미지 디더링 알고리즘에 관한 연구 (Algorithm for Dithering Color Images)

  • 이태경;최두일;조우연
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
    • /
    • pp.581-584
    • /
    • 2002
  • In this study, an algorithm for dithering true color image to 8-bit indexded color image using Artificial Neural Network was proposed. An adaptive vector quantization algorithm based on Artificial neural network was proposed for dithering color images. To evaluate the proposed algorithm, Mean Square Error(MSE) and quality between original image and dithered image was compared to those of other algorithm. As a results, MSE of proposed algorithm was lower than that of other algorithm used in commercial application and quality of dithered image was also highly improved.

  • PDF

군집의 효율향상을 위한 휴리스틱 알고리즘 (Heuristic algorithm to raise efficiency in clustering)

  • 이석환;박승헌
    • 대한안전경영과학회지
    • /
    • 제11권3호
    • /
    • pp.157-166
    • /
    • 2009
  • In this study, we developed a heuristic algorithm to get better efficiency of clustering than conventional algorithms. Conventional clustering algorithm had lower efficiency of clustering as there were no solid method for selecting initial center of cluster and as they had difficulty in search solution for clustering. EMC(Expanded Moving Center) heuristic algorithm was suggested to clear the problem of low efficiency in clustering. We developed algorithm to select initial center of cluster and search solution systematically in clustering. Experiments of clustering are performed to evaluate performance of EMC heuristic algorithm. Squared-error of EMC heuristic algorithm showed better performance for real case study and improved greatly with increase of cluster number than the other ones.

무인차량 적용을 위한 차선강조기법 기반의 차선 인식 (Lane Recognition Using Lane Prominence Algorithm for Unmanned Vehicles)

  • 백준영;이민철
    • 제어로봇시스템학회논문지
    • /
    • 제16권7호
    • /
    • pp.625-631
    • /
    • 2010
  • This paper proposes lane recognition algorithm using lane prominence technique to extract lane candidate. The lane prominence technique is combined with embossing effect, lane thickness check, and lane extraction using mask. The proposed lane recognition algorithm consists of preprocessing, lane candidate extraction and lane recognition. First, preprocessing is executed, which includes gray image acquisition, inverse perspective transform and gaussian blur. Second, lane candidate is extracted by using lane prominence technique. Finally, lane is recognized by using hough transform and least square method. To evaluate the proposed lane recognition algorithm, this algorithm was applied to the detection of lanes in the rainy and night day. The experiment results showed that the proposed algorithm can recognize lane in various environment. It means that the algorithm can be applied to lane recognition to drive unmanned vehicles.

Target-to-Clutter Ratio Enhancement of Images in Through-the-Wall Radar Using a Radiation Pattern-Based Delayed-Sum Algorithm

  • Lim, Youngjoon;Nam, Sangwook
    • Journal of electromagnetic engineering and science
    • /
    • 제14권4호
    • /
    • pp.405-410
    • /
    • 2014
  • In this paper, we compare the quality of images reconstructed by a conventional delayed-sum (DS) algorithm and radiation pattern-based DS algorithm. In order to evaluate the quality of images, we apply the target-to-clutter ratio (TCR), which is commonly used in synthetic aperture radar (SAR) image assessment. The radiation pattern-based DS algorithm enhances the TCR of the image by focusing the target signals and preventing contamination of the radar scene. We first consider synthetic data obtained through GprMax2D/3D, a finite-difference time-domain (FDTD) forward solver. Experimental data of a 2-GHz bandwidth stepped-frequency signal are collected using a vector network analyzer (VNA) in an anechoic chamber setup. The radiation pattern-based DS algorithm shows a 6.7-dB higher TCR compared to the conventional DS algorithm.

선호색 보정을 이용한 화질 향상 알고리즘 (An Adaptive Color Enhancement Algorithm using the Preferred Color Reconstruction)

  • 양경옥;황보현;이승준;윤종호;최명렬
    • 전기학회논문지P
    • /
    • 제57권1호
    • /
    • pp.22-29
    • /
    • 2008
  • In this paper, we propose an adaptive color enhancement algorithm. It is used for the flat panel displays (FPDs) such as LCD, PDP, and so on. The proposed algorithm consists of an adaptive linear approximation CDF(Cumulative Density Function) algorithm and an adaptive saturation enhancement algorithm. The one is for contrast enhancement which prevents an image from the distortion by luminance transient of an input image. The other is the algorithm which improves the saturation without the contour artifact and over-saturation, whose problems are generated during the enhancing saturation. In addition, it allows to achieve the high quality image using the saturation enhancement method for a preferred color of original image. Visual test and standard deviation of their histograms have been applied to evaluate the resultant output images of the proposed algorithm.

로빈스-몬로 확률 근사 알고리즘을 이용한 데이터 분류 (Data Classification Using the Robbins-Monro Stochastic Approximation Algorithm)

  • 이재국;고춘택;최원호
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2005년도 전력전자학술대회 논문집
    • /
    • pp.624-627
    • /
    • 2005
  • This paper presents a new data classification method using the Robbins Monro stochastic approximation algorithm k-nearest neighbor and distribution analysis. To cluster the data set, we decide the centroid of the test data set using k-nearest neighbor algorithm and the local area of data set. To decide each class of the data, the Robbins Monro stochastic approximation algorithm is applied to the decided local area of the data set. To evaluate the performance, the proposed classification method is compared to the conventional fuzzy c-mean method and k-nn algorithm. The simulation results show that the proposed method is more accurate than fuzzy c-mean method, k-nn algorithm and discriminant analysis algorithm.

  • PDF

최적 알고리즘과 합성 성능지수에 의한 퍼지-뉴럴네트워크구조의 설계 (Design of Fuzzy-Neural Networks Structure using Optimization Algorithm and an Aggregate Weighted Performance Index)

  • 윤기찬;오성권;박종진
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 G
    • /
    • pp.2911-2913
    • /
    • 1999
  • This paper suggest an optimal identification method to complex and nonlinear system modeling that is based on Fuzzy-Neural Network(FNN). The FNN modeling implements parameter identification using HCM algorithm and optimal identification algorithm structure combined with two types of optimization theories for nonlinear systems, we use a HCM Clustering Algorithm to find initial parameters of membership function. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using optimal identification algorithm. The proposed optimal identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregate objective function(performance index) with weighted value is proposed to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

  • PDF