• Title/Summary/Keyword: Simplex Method

Search Result 251, Processing Time 0.029 seconds

Implementation of 3D Structure Reconstruction System Using Geometric Primitives (원시기하도형을 이용한 3차원구조 복원시스템의 구현)

  • 남현석;구본기;진성일
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.237-240
    • /
    • 2003
  • We implement a system for 3D structure reconstruction from multiple 2D images. It uses geometric primitives such as box, wedge, pyramid, etc, each having translation, rotation, and scale parameters. Primitives are marked on input images with GUI (Graphic User Interface). Lines made by projection of primitives onto an image correspond to marked line segments of the image. Error function is defined by disparity between them and is minimized by downhill simplex method. By assigning relationship between models, the number of parameters to solve can be decreased and the resultant models become more accurate To share variables among other models also reduces computational complexity. Experiments using real images have shown that the proposed method successfully reconstructs 3D structure.

  • PDF

3 Dimensional Position Estimation for Eye-in-Hand Robot Vision (Eye-in-Hand 로보트 비젼을 이용한 3차원 위치 정보의 추정)

  • Jang, Won;Kim, Kyung-Jin;Chung, Myung-Jin;Bien, Zeungnam
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.8
    • /
    • pp.1152-1160
    • /
    • 1989
  • This paper describes a 3 dimensional position estimation method for a eye-in-hand robot vision system. The camera is mounted on the tip of a robot manipulator, and moves without restriction. Sequences of images are considered simultaneously for nonlinear least-square formation, and the best estimation of the 3 dimensional position is searched by the Simplex search algorithm. The experiments show that the proposed method can provide fairly accurate position information, while the robot is executing a given task.

  • PDF

A Study on the Optimum Design of Multi-Object Dynamic System for the Rail Vehicle (철도차량 동적 진동특성을 고려한 다목적함수 최적설계)

  • Park, Chan-Kyoung;Lee, Kwang-Ki;Kim, Ki-Hwan;Hyun, Seung-Ho;Park, Choon-Soo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2000.06a
    • /
    • pp.894-899
    • /
    • 2000
  • Optimization of 26 design variables selected from suspension characteristics for Korean High Speed Train (KHST) is performed according to the minimization of 58 responses which represent running safety and ride comfort for KHST and analyzed by using the each response surface model from stochastic design experiments. Sensitivity of design variables is also analyzed through the response surface model which ineffective design prameters to the performance index are screened by using stepwise regression method. The response surface models are used for optimizing design variables through simplex algorism. Values of performance index simulated by optimized design parameters are totally lower than those by initial design parameters. It shows that this method is effective for optimizing multi-design variables to multi-object function.

  • PDF

Optimal Production Cost Evaluation Using Karmarkar Algorithm (Karmarkar 알고리듬을 이용한 최적 발전시뮬레이션)

  • Song, K.Y.;Kim, Y.H.;Oh, K.H.
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.113-116
    • /
    • 1995
  • In this study, we formulate production costing problem with environmental and operational constraints into an optimization problem of LP form. In the process of formulation, auxiliary constraints on which reflect unit loading order are constructed to reduce the size of optimization problem by economic operation rules. As a solution of the optimization problem in LP form, we use Karmarkar's method which performs much faster than simplex method in solving large scale LP problem. The proposed production costing algorithm is applied to IEEE Reliability Test System, and performs production simulation under environmental and operational constraints. Test and computer results are given to show the accuracy and usefulness of the proposed algorithm in the field of power system planning.

  • PDF

A Tour Bus Scheduling Method by Greedy Heuristic and Column Generation Techniques (Greedy Heuristic기법과 열 제조에 의한 관광버스 배차방법)

  • Park Sun-Dal;Jang Byeong-Man
    • Journal of the military operations research society of Korea
    • /
    • v.13 no.1
    • /
    • pp.101-115
    • /
    • 1987
  • This paper presents an optimization based heuristic algorithm for a tour bus scheduling problem where buses consist of various kinds of sightseeing and commutation services. First, this algorithm transforms the prolem into a vehicle routing problem on whose nodes denote trips and arcs denote connections between trips. Second, a greedy heuritic routing technique is applied to find a good feasible bus-route set. Then the greedy feasible solution is improved by the simplex method using column generation technique. The algorithm provides a better near-optimal solution which gives much reductions in the total tour distance and the number of tour buses.

  • PDF

A New Procedure for the Initial Solution of Goal Programming (목표계획법 초기해의 새로운 절차에 관한 연구)

  • ;;Choi, Jae Bong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.1
    • /
    • pp.113-122
    • /
    • 1994
  • This study proposes a new procedure to find an initial solution to reduce the number of iterations of goal programming. The process of computing an initial solution is divided into two steps in this study. Decision variables which satisfy feasibility using Gaussian eliminations construct an initial solution reducing the iterations in the first step. It uses LHS as a tool that decision variables construct an initial solution. The initial solution which is constructed by the first step computes the updated coefficient of the objective function in the second step. If the solution does not satisfy the optimality, the optimal solution using the Modified Simplex Method is sought. The developed method doesn't reduce the overall computing time of goal programming problems, because time is more required for the process of constructing an initial solution. But The result of this study shows that the proposed procedure can reduce the large number of iterations in the first step effectively.

  • PDF

Forecasting the Flood Inflow into Irrigation Reservoir (관개저수지의 홍수유입량 예측)

  • 문종필;엄민용;박철동;김태얼
    • Proceedings of the Korean Society of Agricultural Engineers Conference
    • /
    • 1999.10c
    • /
    • pp.512-518
    • /
    • 1999
  • Recently rainfall and water evel are monitored via on -line system in real-time bases. We applied the on-line system to get the rainfall and waterlevel data for the development of the real-time flood forecasting model based on SCS method in hourly bases. Main parameters for the model calibration are concentration time of flood and soil moisture condition in the watershed. Other parameters of the model are based on SCS TR-%% and DAWAST model. Simplex method is used for promoting the accuracy of parameter estimation. The basic concept of the model is minimizing the error range between forcasted flood inflow and actual flood inflow, and accurately forecasting the flood discharge some hours in advance depending on the concentration time. The flood forecasting model developed was applied to the Yedang and Topjung reservoir.

  • PDF

A New Hybrid Genetic Algorithm for Nonlinear Channel Blind Equalization

  • Han, Soowhan;Lee, Imgeun;Han, Changwook
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.259-265
    • /
    • 2004
  • In this study, a hybrid genetic algorithm merged with simulated annealing is presented to solve nonlinear channel blind equalization problems. The equalization of nonlinear channels is more complicated one, but it is of more practical use in real world environments. The proposed hybrid genetic algorithm with simulated annealing is used to estimate the output states of nonlinear channel, based on the Bayesian likelihood fitness function, instead of the channel parameters. By using the desired channel states derived from these estimated output states of the nonlinear channel, the Bayesian equalizer is implemented to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a conventional genetic algorithm(GA) and a simplex GA. In particular, we observe a relatively high accuracy and fast convergence of the method.

An Analysis of the Contact Problem between Mating Involute Gear Teeth Using Finite Element Method (有限要素法을 이용한 齒車의 接觸 應力 解析)

  • 이대희;최동훈;임장근;윤갑영
    • Tribology and Lubricants
    • /
    • v.4 no.2
    • /
    • pp.28-35
    • /
    • 1988
  • A general and efficient algorithm is proposed for the analysis of the frictionless elastic contact problems. It utilizes a simplex-type algorithm with a modified entry rule and incoporates finite element method to obtain flexibility matrices. The algorithmic solution is compared with the Hertzian solution for the contact problem between two cylinders to prove its accuracy and the contact problem between pin and piston rod is solved and compared with the numerical results of Frankavilla and Zienkiewicz to demonstrate the generality and effectiveness of the suggested algorithm. The contact problem between mating involute gear teeth at the worst load position is considered. The computed contact stress is smaller than the result of Hertz's theory applied to the contact between two kinematically equivalent discs and the contact area is larger than that of Hertz's theory.

Estimation Method of the Best-Approximated Form Factor Using the Profile Measurement of the Aspherical Ophthalmic Lens (단면 형상 측정을 이용한 비구면 안경 렌즈의 최적 근사화된 설계 계수의 추정 방법)

  • Lee Hocheol
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.5 s.170
    • /
    • pp.55-62
    • /
    • 2005
  • This paper presents mainly a procedure to get the mathematical form of the manufactured aspherical lens. Generally Schulz formula describes the aspherical lens profile. Therefore, the base curvature, conic constant. and high-order polynomial coefficient should be set to get the approximated design equation. To find the best-approximated aspherical form, lens profile is measured by a commercial stylus profiler, which has a sub-micrometer measurement resolution. The optimization tool is based on the minimization of the root mean square of error sum to get the estimated aspherical surface equation from the scanned aspherical profile. Error minimization step uses the Nelder-Mead simplex (direct search) method. The result of the lens refractive power measurement shows the experimental consistency with the curvature distribution of the best-approximated aspherical surface equation