• Title/Summary/Keyword: 최소제약조건

Search Result 179, Processing Time 0.025 seconds

A Study on Constrained Linear Spectral Unmixing of Hyperspectral Imagery based on Unsupervised Endmember Selection (무감독 Endmember 추출을 통한 하이퍼스펙트럴 영상의 제약 선형분광혼합분석에 관한 연구)

  • Choi, Jae-Wan;Kim, Dae-Sung;Kim, Yong-Il
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2005.11a
    • /
    • pp.35-39
    • /
    • 2005
  • 선형혼합분광분석(LSU, Linear Spectral Unmixing) 모델은 위성 영상의 한 화소 값이 공간 내에 포함된 다양한 지표 대상물의 반사에너지가 혼합된 결과로 나타난다는 가정을 통해 화소이하(Sub-Pixel) 단위의 영상 분석을 수행하는 알고리즘의 한 형태이다. 분석의 결과는 한 화소에 존재하는 순수 대상물(Endmember)의 비율로 나타나며, 최소제곱법을 이용하여 결과를 도출하는 것이 일반적인 방법으로 알려져 있다. 하지만, 최소제곱법을 이용한 선형혼합분광분석모델은 기본적인 가정을 만족시키지 못하며, Endmember를 사용자가 임의로 지정해야 하기 때문에 영상 분석에 많은 어려움이 있다. 이런 단점을 극복하기 위해 무감독으로 추출된 Endmember를 이용한 제약선형분광혼합분석(Constrained Linear Spectral Unmixing) 모델을 본 연구를 통해 제안하고자 한다. 결과를 통해, 무감독 제약선형분광혼합분석 모델은 선형분광혼합분석 모델에 비해 각각의 Endmember에 대하여 제약조건을 만족하는 점유비율(Abundance) 정보를 제공하였으나, 비슷한 Endmember를 중복 추출할 수 있는 가능성도 지니고 있음을 확인할 수 있었다.

  • PDF

Finding Alternative Routes in Inter Modal Transit Networks Considering Constraints (제약조건을 고려한 통합대중교통망의 대안경로탐색)

  • Lee Mee-Young;Baek Nam-Chul
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.4 no.1 s.6
    • /
    • pp.1-13
    • /
    • 2005
  • For integrated transit networks operated with diverse transit modes, it is difficult to find related literatures on the provision of multiple travel time routes information. This study proposes a methodology on how to select K number of least time transit routes in the integrated transit network with two modes, bus and subway. In the Proposed method, three constraints usually (will be) encountered for decision by users-(1) service time constraints of travel modes, (2) maximum payment fare constraints under the integrated distance based fare system, and (3) maximum number of transfer constraints - are taken into consideration in the searched routes. The experimental studies shows that the proposed method properly provides K number of least time routes. In addition, it somehow proves that by combinatorially considering three constraints the proposed method can be evaluated as to enlarge the quality as well as the diversity of route information demanded by users.

  • PDF

철도 승무원 교번표 작성에 관한 연구

  • 김영훈;김지표
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.153-156
    • /
    • 2000
  • 철도 승무원 교번표는 승무사업이 작성된 이후 순서규칙(sequencing rule), 운영규칙 등과 같은 제약조건을 만족하는 사업(duty)의 진행 내용을 나타내고 있는 표이다. 일반적으로 철도 승무원 교번표 작성은 승무원 사업표가 작성된 후 각 사업소 별로 승무원간 사업시간의 차이가 최소가 되도록 즉, 승무원이 균등한 사업시간을 갖도록 작성이 된다. 교번표의 작성은 각 나라마다 독특한 노동협약이나 운용규정 등과 같은 복잡한 제약조건들을 충분히 고려하여 작성되어야 하므로 그 동안 연구에 어려움이 많았다. 본 연구에서는 우리나라 철도청에서 현재 수행하고 있는 교번표 작성현황을 살펴보고 문제점을 파악하였다. 또한 교번표 작성 절차를 분석하여 모형화 하였으며 추후 연구방향을 제시하였다.

  • PDF

The In-Core Fuel Management by Variational Method (변분법에 의한 노심 핵연료 관리)

  • Kyung-Eung Kim
    • Nuclear Engineering and Technology
    • /
    • v.16 no.4
    • /
    • pp.181-194
    • /
    • 1984
  • The in-core fuel management problem was studied by use of the calculus of variations. Two functions of interest to a public power utility, the profit function and the cost function, were subjected to the constraints of criticality, the reactor turnup equations and an inequality constraint on the maximum allowable power density. The variational solution of the initial profit rate demonstrated that there are two distinct regions of the reactor, a constant power region and a minimum inventory or flat thermal flux region. The transition point between these regions is dependent on the relative importance of the profit for generating power and the interest charges for the fuel. The fuel cycle cost function was then used to optimize a three equal volume region reactor with a constant fuel enrichment. The inequality constraint on the maximum allowable power density requires that the inequality become an equality constraint at some points in the reactor. and at all times throughout the core cycle. The finite difference equations for reactor criticality and fuel burnup in conjunction with the equality constraint on power density were solved, and the method of gradients was used to locate an optimum enrichment. The results of this calculation showed that standard non-linear optimization techniques can be used to optimize a reactor when the inequality constraints are properly applied.

  • PDF

Physically-Based Objects Interaction in Augmented Reality Environments (물리기반 모델링을 이용한 증강현실에서의 효과적 객체 상호작용)

  • Lee, Min-Kyoung;Kim, Young-J.;Redon,, Stephane
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.89-95
    • /
    • 2007
  • 본 논문에서는 연속적 충돌검사 방법과 제약 조건 기반의 강체 역학 모델링 기법을 이용하여 마커 기반의 트래킹 환경에서 현실의 객체와 가상의 객체가 물리적으로 현실적이고 안정적으로 상호작용하는 증강현실 방법을 제안한다. 본 논문에서 구현된 증강 현실 시스템은 증강 현실환경상의 현실 객체를 인식하고 트래킹 하는 부분과 증강현실에 등장하는 모든 종류의 객체들 간의 물리적인 상호작용을 시뮬레이션 하는 부분으로 크게 구성된다. 객체 트래킹에 사용되는 일반적인 카메라로는 적은 수의 불연속적인 프레임 밖에 얻을 수 없는 성능의 근본적인 한계에도 불구하고, 본 논문에서는 연속적 충돌검사 방법을 이용하여 객체간의 올바른 충돌 정보를 얻을 수 있었고, 이를 이용하여 제약 조건 기반의 강체 역학 시뮬레이션을 적용하여 안정적이고 현실적인 물리 반응을 생성할 수 있었다. 제안한 방법론은 이러한 트래킹 지연에도 불구하고 본 논문에서 사용된 다양한 벤치마킹 시나리오에서, 안정적으로 현실의 객체와 가상의 객체 사이에 물리적으로 실감나는 인터랙션 결과를 보여주었다.

  • PDF

A K Least Time Paths Searching Algorithm for Time Dependent Intermodal Transportation Networks with Departure Time Schedule Constraints (출발시간제약이 존재하는 동적 복합교통망의 K최소시간경로탐색)

  • Jo, Jong-Seok;Sin, Seong-Il;Mun, Byeong-Seop;Im, Gang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.3 s.89
    • /
    • pp.167-176
    • /
    • 2006
  • An minimum path algorithm for integrated networks with departure time constraints require considering arrival time of arriving mode, transfer time. waiting time, and departure time of next mode. Integrated network with diverse modes commonly include departure time constraints. Because public mode suck as train and airplane have fixed service schedule which provide passengers. This study developed the k-path algorithm in integrated network with time varying conditions and departure time constraints. We proposed the extended method based on entire path deletion method, and examined the application of the proposed algorithm through case study.

A pragmatic approximation algorithm for constrained minimum spanning tree problem (추가제약을 가진 MST문제를 위한 실용적 근사해법)

  • 홍성필;민대현
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.275-277
    • /
    • 1998
  • 최근 Ravi와 Goemanns는 즉 전체 길이의 합이 일정한 값을 넘지 않는 최소비용신장나무(minimum spanning tree problem)를 구하는 문제의 (1+$\varepsilon$,1)-근사해를 구할 수 있는 알고리듬을 제시하였다. 즉 비용은 최적을 보장하지만 전체길이 제약조건은 근사적으로 만족하는 해를 생성한다. 그러나 이러한 알고리듬은 문제의 비가능해를 생성 할 수 있으며 1/$\varepsilon$에 대하여 지수함수의 수행시간을 갖는다. 본 논문에서는 Ravi와 Geomanns의 알고리듬을 실용적으로 변형하여 전체 길이 제약조건을 정확히 만족하며, 그 비용은 최적비용과의 차이가 호의 비용 중 최대값을 넘지 않도록 보장하는 강성다항식 알고리듬을 제사한다.

  • PDF

Hybrid Constrained Extrapolation Experimental Design (하이브리드형 제약 외삽실험 계획법)

  • Kim, Young-Il;Jang, Dae-Heung
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.1
    • /
    • pp.65-75
    • /
    • 2012
  • In setting an experimental design for the prediction outside the experimental region (extrapolation design), it is natural for the experimenter to be very careful about the validity of the model for the design because the experimenter is not certain whether the model can be extended beyond the design region or not. In this paper, a hybrid constrained type approach was adopted in dealing model uncertainty as well as the prediction error using the three basic principles available in literature, maxi-min, constrained, and compound design. Furthermore, the effect of the distance of the extrapolation design point from the design region is investigated. A search algorithm was used because the classical exchange algorithm was found to be complex due to the characteristic of the problem.

Development of DCOC Algorithm Considering the Variation of Effective Depth in the Optimum Design of PRC Continuous Beam (PRC연속보 최적설계에서 단면의 유효깊이 변화를 고려한 DCOC알고리즘 개발)

  • 조홍동;한상훈
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.2
    • /
    • pp.281-291
    • /
    • 2002
  • This paper describes the minimum cost design of prestressed reinforced concrete (PRC) hem with rectangular section. The cost of construction as objective function which includes the costs of concrete, prestressing steel, non prestressing steel, and formwork is minimized. The design constraints include limits on the minimum deflection, flexural and shear strengths, in addition to ductility requirements, and upper-Lower bounds on design variables as stipulated by the specification. The optimization is carried out using the methods based on discretized continuum-type optimality criteria(DCOC). Based on Kuhn-Tucker necessary conditions, the optimality criteria are explicitly derived in terms of the design variables - effective depth, eccentricity of prestressing steel and non prestressing steel ratio. The prestressing profile is prescribed by parabolic functions. In this paper the effective depth is considered to be freely-varying and one uniform for the entire multispan beam respectively. Also the maximum eccentricity of prestressing force is considered in every span. In order to show the applicability and efficiency of the derived algorithm, several numerical examples of PRC continuous beams are solved.

Minimum Cost Design of Reinforced Concrete Beam Using DCOC (DCOC를 이용한 철근 콘크리트보의 최소경비설계)

  • 조홍동;한상훈
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.13 no.4
    • /
    • pp.417-425
    • /
    • 2000
  • This paper describes the application of discretized continuum-type optimality criteria(DCOC) and the development of optimum design program for the reinforced concrete continuous beams with rectangular cross-section. The cost of construction as objective function which includes the costs of concrete, reinforcing steel and formwork is minimized. The design constraints include limits on the maximum deflection, flexural and shear strengths, in addition to ductility requirements, and upper and lower bounds on design variables as stipulated by the design Code. Based on Kuhn-Tucker necessary conditions, the optimality criteria are explicitly derived in terms of the design variables-effective depth, and steel ratio. The self-weight of the beam is included in the equilibrium equation of the real system. An iterative procedure and computer program for updating the design variables are developed. Two numerical examples of reinforced concrete continuous beams are presented to show the applicability and efficiency of the DCOC-based technique.

  • PDF