• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.293-299
• /
• 1994

A new approach to deal with the model matching problem for square plants is suggested. Admissibility conditions of the model matching error are derived in terms of state-space parameters and the derived formulas are exploited to obtain the solution to the model matching problem in H$_{2}$ norm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

• 전기학회논문지
• /
• 제57권1호
• /
• pp.109-116
• /
• 2008

Model matching problem of asynchronous sequential machines is addressed in this paper. The main topic is to design a corrective controller such that the closed-loop behavior of the asynchronous sequential machine can follow a given model, i.e., their models can be "matched" in stable states. In particular, we assume that the considered asynchronous machine suffers from the presence of an input disturbance that can cause undesirable state transitions. The proposed controller can realize both model matching and elimination of the adverse effect of the input disturbance. Necessary and sufficient condition for the existence of a corrective controller that solves model matching problem is presented. Whenever controller exists, algorithms for their design are outlined and demonstrated in a case study.

• 한국정밀공학회지
• /
• 제14권8호
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

• 제어로봇시스템학회논문지
• /
• 제15권10호
• /
• pp.967-973
• /
• 2009

The model matching problem of asynchronous sequential machines is to design a corrective controller such that the stable-state behavior of the closed-loop system matches that of a prescribed model. In this paper, we address model matching when the external input set consists of controllable inputs and uncontrollable ones. Like in the frame of supervisory control of Discrete-Event Systems (DES), uncontrollable inputs cannot be disabled and must be transmitted to the plant without any change. We postulate necessary and sufficient conditions for the existence of a corrective controller that solves model matching despite the influence of uncontrollable events. Whenever a controller exists, the algorithm for its design is outlined. To illustrate the physical meaning of the proposed problem, the closed-loop system of an asynchronous machine with the proposed control scheme is implemented in VHDL code.

• 대한전기학회논문지
• /
• 제45권2호
• /
• pp.256-264
• /
• 1996

In this paper, the decentralized suboptimal H$_{2}$ filtering problem is considered. An additional term is added to the centralized optimal H$_{2}$ filter so that the whole filter is decentralized. We derive a necessary and sufficient condition for existence of proposed decentralized filters By employing the solution procedure for the exact model matching problem, we obtain a set of decentralized H$_{2}$ filters, and choose a suboptimal filter from this set of decentralized H$_{2}$ filters.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2005년도 추계학술대회논문집
• /
• pp.830-833
• /
• 2005

SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

• 한국정보과학회논문지:시스템및이론
• /
• 제34권10호
• /
• pp.502-510
• /
• 2007

Private Matching은 각기 다른 두 참여자가 가진 데이타의 교집합을 구하는 문제이다. Private matching은 보험사기 방지시스템, 항공기 탑승 금지자 목록 검색, 의료 정보 검색 등에 이용될 수 있으며 다자간의 계산으로 확장하면 전자투표, 온라인 게임 등에도 이용될 수 있다. 2004년 Freedman 등 [1]은 이 문제를 확률적으로 해결하는 프로토콜을 제안하고 악의적인 공격자 모델과 다자간 계산으로 확장하였다. 이 논문에서는 기존의 프로토콜을 결정적(deterministic) 방법으로 개선하여 Semi-Honest 모델에서 결과의 정확성을 보장하는 한편, 이를 악의적인 공격자 모델에 확장하여 신뢰도와 연산속도를 향상 시키는 새로운 프로토콜을 제안한다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제36권12호
• /
• pp.996-1008
• /
• 2009

본 논문은 뼈대-구조(skeleton) 형태의 Active Shape Models을 이용한 사람의 자세 정합에 대한 새로운 접근 방법을 제안한다. 제안된 방법은 모델 생성과 정합 과정에서의 빠른 수행 시간을 위해 기존 윤곽 형태(silhouette)의 모델이 아닌 뼈대-구조 형태의 모델을 적용하였다. 기존 Active Shape Models을 뼈대-구조 형태로 사람 자세 정합에 적용했을 경우 자세를 결정짓는 팔과 다리의 부정확한 정합은 사람 몸의 다양한 색상 정보와 전후(fore-rear direction)만을 고려한 특징점(landmark)의 방향정보로 인해 발생되며, 이러한 문제점은 입력 영상의 차영상 정보와 사람의 자세를 결정짓는 팔과 다리의 중요 특징점에 방향정보를 추가하여 해결하였다. 사람의 뼈대-구조 모델을 생성하기 위해 600개의 이미지를 사용 하였으며, 생성된 형태 모델은 사람의 자세에 정합될 수 있는 17개의 특징점을 포함한다. 정합 과정에서 최대 30번 이하의 반복 과정을 수행 하며, 최대 수행 시간은 0.03초로 빠른 수행 시간의 결과를 얻었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3721-3737
• /
• 2015

3D reconstruction based on binocular data is significant to machine vision. In our method, we propose a new and high efficiency 3D reconstruction approach by using a consumer camera aiming to: 1) address the configuration problem of dual camera in the binocular reconstruction system; 2) address stereo matching can hardly be done well problem in both time computing and precision. The kernel feature is firstly proposed in calibration stage to rectify the epipolar. Then, we segment the objects in the camera into background and foreground, for which system obtains the disparity by different method: local window matching and kernel feature-based matching. Extensive experiments demonstrate our proposed algorithm represents accurate 3D model.