• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1137-1140
• /
• 1998

In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamic programming method. The dynamic programming method is used in finding the corresponding pixels between the left image and the right image. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities from the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the number of the range constraint, which reduced the number of the necessary PEs dramatically compared to the traditional method which uses the PEs with the number of pixels on the epipolar line. For the normal method by 25 times. The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

• 대한기계학회논문집A
• /
• 제22권4호
• /
• pp.811-825
• /
• 1998

An approximate line search is presented for dynamic response optimization with Augmented Lagrange Multiplier(ALM) method. This study empolys the approximate a augmented Lagrangian, which can improve the efficiency of the ALM method, while maintaining the global convergence of the ALM method. Although the approximate augmented Lagragian is composed of only the linearized cost and constraint functions, the quality of this approximation should be good since an approximate penalty term is found to have almost second-order accuracy near the optimum. Typical unconstrained optimization algorithms such as quasi-Newton and conjugate gradient methods are directly used to find exact search directions and a golden section method followed by a cubic polynomial approximation is empolyed for approximate line search since the approximate augmented Lagrangian is a nonlinear function of design variable vector. The numberical performance of the proposed approach is investigated by solving three typical dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested approach is robust and efficient.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.121-124
• /
• 2004

This paper proposed the method of creating image mosaic in automated fashion. It is well known that geometric and radiometric balance in adjacent images should be maintained in mosaicking process. The seam line to minimize geometric discontinuity was extracted using Minimum Absolute­Gray-Difference Sum considering constraint condition in search width. To maintain the radiometric balance of images acquired at different time, we utilized Match Cumulative Frequency, Match Mean and Standard Deviation and Hue Adjustment algorithm. The mosaicked image prepared by the proposed method was compared with those of commercial software. Experiments show that seam lines were extracted significantly well from roads, rivers. ridgelines etc. and Match Cumulative Frequency algorithm was performed pretty good in histogram matching

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.541-553
• /
• 1995

An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.977-979
• /
• 1996

This paper presents an algorithm to control the undesirable sway of a suspended load in the crane system that has a trade-off between positioning the load and suppressing the sway of the load. The aim is to transport the load to a specified place with small sway angle as quickly as possible. Dynamic model is based on a simple pendulum driven by a velocity drive that is mostly used for actuating a trolley in industry. Proposed algorithm is composed of two parts : one is a off-line optimal trajectory generator, the other on-line tracking control. The former produces optimal trajectories minimizing energy under the speed constraint of velocity drive. The latter controls outputs to track the generated trajectories. Digital simulations and experiments are performed on a pilot crane to demonstrate the performance of the proposed control algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.882-885
• /
• 1987

The path of an industrial manipulator in a crowded workspace generally consists of 8 set of Cartesian straight line path connecting a set of two adjacent points. To achieve the Cartesian straight line path is, however, a nontrivial task and an alternative approach is to place enough intermediate points along a desired path and linearly interpolate between these points in the joint space. A method is developed that determines the subtravelling- and the transition-time such that the total travelling time for this path is minimized subject to the maximum joint velocities and accelerations constraint. The method is based on the application of nonlinear programming technique, i.e., FTM (Flexible Tolerance Method). These results are simulated on a digital computer using a six-joint revolute manipulator to show their applications.

• 한국항공우주학회지
• /
• 제36권9호
• /
• pp.884-890
• /
• 2008

본 논문에서는 원형 목표구역에 무인 비행체가 도달할 때 비행체의 지향각, 즉 속도 벡터의 방향과 비행체와 목표점과의 시선이 이루는 사이 각을 제어할 수 있는 일반화된 중기 유도법칙을 제안한다. 유도법칙의 도출을 위해 비행체의 운동을 비선형 미분 방정식으로 모델링하고 거리함수 가중치를 갖는 제어 에너지 최소화 문제로 접근하여 최적제어이론을 적용하였다. 결과적으로 원형 목표구역 도달 시 지향각 구속조건을 만족시킬 수 있는 최적 해를 도출한다. 해의 수렴성을 비롯하여 제안한 유도법칙의 특성에 대해 고찰한다. 수치적인 시뮬 레이션을 통해 전형적인 시나리오에 대해 제안한 유도법칙의 성능을 시범적으로 보인다.

• 한국의류학회지
• /
• 제32권7호
• /
• pp.1046-1055
• /
• 2008

The purpose of this study is to investigate the effects of product variables(i.e., fashionability, brand fame) and situational variables(i.e., time constraint, usage occasion) on the internet browsing behavior (i.e., prepurchase search; ongoing search for products, stores, fashion trends, promotions, and post-purchasing information) for fashion products. This study developed hypothetical scenarios based on the factorial design of the two independent variables for the survey with a questionnaire. All items in the questionnaire were measured on a six-point scale. By convenience sampling and on-line survey, a total of 209 usable responses were used for further analyses. The results show as follows; firstly, respondents more intensively browse for information search on products, stores and fashion trends when the style of browsing products is trendy. Secondly, whether the fashion products have a famous brand name or not has a significant influence on browsing behavior for stores and fashion trends information search. Thirdly, time constraint is found to influence significantly on respondents' browsing for promotions information search. Lastly, occasion for product worn shows a significant influence on browsing behavior for stores and fashion trends information search. The managerial implications are provided based on findings.

• 산업공학
• /
• 제16권3호
• /
• pp.352-361
• /
• 2003

Vehicle manufacturing plant is a typical mixed-model production system. Generally it consists of three main shops including body shop, painting shop and assembly shop in addition to engine shop. Each shop contains diverse manufacturing processes, all of which are integrated in a form of flow line. Due to the high pressure from the market requesting small-volume large variety production, production planning becomes very critical for the competitiveness of automotive industry. In order to save costs and production time, production planning system is requested to meet some designated requirements for each shop: to balance the work load in body and assembly shops, and to minimize the number of color changes in painting shop. In this context, we developed a sequencing module for a vehicle production planning system using the ILOG Solver Library. It is designed to take into account all the manufacturing constraints at a time with meeting hard constraints in body shop, minimizing the number of soft constraints violated in assembly shop, and minimizing the number of color changes in painting shop.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.407-410
• /
• 1998

Configuration is a set of building block processes, a series of selection and combining parts or components which composes a whole thing. A whole thing could be such a configurable object as manufacturing product, network system, financial portfolio, system development plan, project team, etc. Configuration problem could happen during any phase of product life cycle: design, production, sales, installation, and maintenance. Configuration has long been one of cost and time consuming work, because only high salaried technical experts on product and components can do configuration. Rework for error adjustments of configurations at later process causes far much cost and time, so accurate configuration is required. Under the on-line electronic commerce environment, configuration problem solving becomes more important, because component-based sales should be done automatically on the merchant web site. Automated product search, order placement, order fulfillment and payment make that manual configuration is no longer feasible. Automated configuration means that all the constraints among components should be checked and confirmed by configuration engine automatically. In addition, technical constraints and customer preferences like price range and a specific function required should be considered. This paper gives an brief overview of configuration problems: characteristics, representation paradigms, and solving algorithms and introduce CRSP(Constraint and Rule Satisfaction Problem) method. CRSP method adopts both constraint and rule for configuration domain knowledge representation. A survey and analysis on web sites adopting configuration functions are provided. Future directions of configuration for EC is discussed in the three aspects: methodology itself, companies adopting configuration function, and electronic commerce industry.