• 제목/요약/키워드: Adjustment Algorithms

검색결과 110건 처리시간 0.02초

반도체 칩의 높이 측정을 위한 스테레오 비전의 측정값 조정 알고리즘 (Adjustment Algorithms for the Measured Data of Stereo Vision Methods for Measuring the Height of Semiconductor Chips)

  • 김영두;조태훈
    • 반도체디스플레이기술학회지
    • /
    • 제10권2호
    • /
    • pp.97-102
    • /
    • 2011
  • Lots of 2D vision algorithms have been applied for inspection. However, these 2D vision algorithms have limitation in inspection applications which require 3D information data such as the height of semiconductor chips. Stereo vision is a well known method to measure the distance from the camera to the object to be measured. But it is difficult to apply for inspection directly because of its measurement error. In this paper, we propose two adjustment methods to reduce the error of the measured height data for stereo vision. The weight value based model is used to minimize the mean squared error. The average value based model is used with simple concept to reduce the measured error. The effect of these algorithms has been proved through the experiments which measure the height of semiconductor chips.

전자제품생산의 조정고정을 위한 지능형 제어알고리즘 (Intelligent Control Algorithm for the Adjustment Process During Electronics Production)

  • 장석호;구영모;고택범;우광방
    • 제어로봇시스템학회논문지
    • /
    • 제4권4호
    • /
    • pp.448-457
    • /
    • 1998
  • A neural network based control algorithm with fuzzy compensation is proposed for the automated adjustment in the production of electronic end-products. The process of adjustment is to tune the variable devices in order to examine the specified performances of the products ready prior to packing. Camcorder is considered as a target product. The required test and adjustment system is developed. The adjustment system consists of a NNC(neural network controller), a sub-NNC, and an auxiliary algorithm utilizing the fuzzy logic. The neural network is trained by means of errors between the outputs of the real system and the network, as well as on the errors between the changing rate of the outputs. Control algorithm is derived to speed up the learning dynamics and to avoid the local minima at higher energy level, and is able to converge to the global minimum at lower energy level. Many unexpected problems in the application of the real system are resolved by the auxiliary algorithms. As the adjustments of multiple items are related to each other, but the significant effect of performance by any specific item is not observed. The experimental result shows that the proposed method performs very effectively and are advantageous in simple architecture, extracting easily the training data without expertise, adapting to the unstable system that the input-output properties of each products are slightly different, with a wide application to other similar adjustment processes.

  • PDF

작업 일정계획문제 해결을 위한 유전알고리듬의 응용 (Application of Genetic Algorithms to a Job Scheduling Problem)

  • 김석준;이채영
    • 한국경영과학회지
    • /
    • 제17권3호
    • /
    • pp.1-12
    • /
    • 1992
  • Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

  • PDF

유전 알고리즘과퍼지 푸론 시스템의 합성 (Fusion of Genetic Algorithms and Fuzzy Inference System)

  • 황희수;오성권;우광방
    • 대한전기학회논문지
    • /
    • 제41권9호
    • /
    • pp.1095-1103
    • /
    • 1992
  • An approach to fuse the fuzzy inference system which is able to deal with imprecise and uncertain information and genetic algorithms which display the excellent robustness in complex optimization problems is presented in this paper. In order to combine genetic algorithms and fuzzy inference engine effectively the new reasoning method is suggested. The efficient identification method of fuzzy rules is proposed through the adjustment of search areas of genetic algorithms. The feasibilty of the proposed approach is evaluated through simulation.

  • PDF

A Design of Controller for 4-Wheel 2-D.O.F. Mobile Robot Using Fuzzy-Genetic algorithms

  • Kim, Sangwon;Kim, Sunghoe;Sunho Cho;chongkug
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
    • /
    • pp.607-612
    • /
    • 1998
  • In this paper, a controller using fuzzy-genetic algorithms is proposed for pat-tracking of WMR. A fuzzy controller is implemented so as to adjust appropriate crossover rate and mutation rate. A genetic algorithms is also implemented to have adaptive adjustment of control gain during optimizing process. To check effectiveness of this algorithms, computer simulation is applied.

  • PDF

오차분포 유클리드 거리 기반 학습법의 커널 사이즈 적응 (Adaptive Kernel Estimation for Learning Algorithms based on Euclidean Distance between Error Distributions)

  • 김남용
    • 한국산학기술학회논문지
    • /
    • 제22권5호
    • /
    • pp.561-566
    • /
    • 2021
  • 오차분포 추정을 위한 커널 사이즈는 오차확률밀도 사이의 유클리드 거리를 최소화 알고리즘의 가중치 갱신에 적합한 커널 사이즈가 될 수 없다. 이 논문에서는 MED 알고리즘의 수렴 성능 향상을 위해 적응적으로 커널 사이즈를 갱신하는 방법을 제안하였다. 제안한 방식은 MED 학습 알고리즘의 가중치 갱신을 위해 커널 사이즈에 대한 오차분산의 평균변화율을 도입하여 MED의 오차에 대한 평균전력이 감소하는 방향으로 커널 사이즈를 조절하도록 하였다. 제안된 적응 커널 추정법을 무선통신 채널의 왜곡 보상에 적용하여 학습 성능을 실험하고 그 효능을 밝혔다. 오차분산에 비례한 작은 값을 가지는 기존의 오차분포 추정 위한 최적 커널 사이즈와 달리, 제안한 방법에 의한 커널 사이즈는 MED 가중치 수렴을 위한 적절한 커널 사이즈로 수렴함을 보였다. 실험 결과로부터 제안한 방법이 MED 알고리즘의 커널 사이즈 설정에 따른 민감성을 크게 해결한 방법이라고 볼 수 있다.

WBI 시스템에서 학습능력을 고려한 출제 문제의 난이도 재조정 알고리즘 (Degree of Difficulty Adjustment Algorithms of Selection Question using Education Ability in WBI)

  • 김은정;류희열
    • 한국산업정보학회논문지
    • /
    • 제9권4호
    • /
    • pp.47-55
    • /
    • 2004
  • 웹 기반의 원격 교육에서 평가를 위해 출제되는 문제들은 주로 고정 출제나 무작위 출제 방식 또는 난이도에 따른 자동 출제 방식을 이용하고 있다. 이중에서 난이도에 따른 자동 출제 방식은 학습자들의 평가 결과에 따른 난이도 재조정으로 문제 은행의 문제들에 대한 객관성을 유지하는 것이 중요한 문제이다. 이에 본 논문에서는 난이도에 따른 자동 출제 방식에서 문제은행의 난이도를 재조정함에 있어서 학습자들의 평가 결과와 학습자득의 학습 능력을 함께 고려한 새로운 난이도 재조정 알고리즘을 제시판다 제시된 알고리즘을 구축된 웹기반 학습 시스템에서 기존 알고리즘과 비교 분석한 결과 보다 효율적으로 문제 난이도를 관리할 수 있음을 확인한 수 있었다.

  • PDF

전자제품 생산의 조정공정을 위한 신경회로망 응용 (An Application of Neural Ntwork For the Adjustment Process during Electronics Production)

  • 장석호;정영기;감도영;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.310-313
    • /
    • 1996
  • In this paper, a neural control algorithm is proposed on the automation of adjustment process. The adjustment processes in camcoder production line are modelled, and the processes are adjusted automatically by means of off-line supervisory trained multi-layer neural network. We have made many experiments on the several adjustment processes by using the control algorithm. There are many unexpected troubles to achieve the desirable adjust time in the practical application. To overcome those, some auxiliary algorithms are demanded. As a result, our proposed algorithm has some advantages - simple architecture, easy extraction of the training data without expertises, adaptability to the varying systems, and wide application for the other resemble processes.

  • PDF

이러닝 문제은행기반 출제 시스템을 위한 동적 난이도 조정 정책 (Dynamic Degree of Difficulty Adjustment Policy for E-learning Databank Based Selection System)

  • 김은정;이상관;김성곤
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2008년도 지능정보 및 응용 학술대회
    • /
    • pp.160-164
    • /
    • 2008
  • 이러닝 문제은행 기반의 출제 시스템에서 평가를 위해 출제되는 문제들은 주로 난이도에 따른 자동 출제 방식을 이용하고 있다. 이러한 방식은 출제 시점의 문제 난이도가 문제 출제에 핵심이기 때문에 무엇보다 객관적이고 효율적인 방법으로 문제의 난이도에 대한 지속적인 관리가 필요하다. 본 논문에서는 웹 기반의 학습 시스템에서 보다 효율적인 문제 출제를 위해, 평가 결과를 바탕으로 해당 문제들의 난이도를 동적으로 재조정하는 보다 향상된 알고리즘을 제시한다. 제시된 알고리즘을 구축된 웹기반 학습 시스템에서 기존 알고리즘과 비교 분석해 본 결과 보다 효율적임을 확인할 수 있었다.

  • PDF

Multipoint variable generalized displacement methods: Novel nonlinear solution schemes in structural mechanics

  • Maghami, Ali;Shahabian, Farzad;Hosseini, Seyed Mahmoud
    • Structural Engineering and Mechanics
    • /
    • 제83권2호
    • /
    • pp.135-151
    • /
    • 2022
  • The generalized displacement method is a nonlinear solution scheme that follows the equilibrium path of the structure based on the development of the generalized displacement. This method traces the path uniformly with a constant amount of generalized displacement. In this article, we first develop higher-order generalized displacement methods based on multi-point techniques. According to the concept of generalized stiffness, a relation is proposed to adjust the generalized displacement during the path-following. This formulation provides the possibility to change the amount of generalized displacement along the path due to changes in generalized stiffness. We, then, introduce higher-order algorithms of variable generalized displacement method using multi-point methods. Finally, we demonstrate with numerical examples that the presented algorithms, including multi-point generalized displacement methods and multi-point variable generalized displacement methods, are capable of following the equilibrium path. A comparison with the arc length method, generalized displacement method, and multi-point arc-length methods illustrates that the adjustment of generalized displacement significantly reduces the number of steps during the path-following. We also demonstrate that the application of multi-point methods reduces the number of iterations.