• 한국컴퓨터정보학회논문지
• /
• 제12권6호
• /
• pp.147-152
• /
• 2007

디지털 영상에서의 얼굴탐색은 얼굴인식을 위한 기본 단계이면서 인식 성능에 큰 영향을 미치는 중요한 처리 단계이다. 템플릿 정합 방식의 객체 검출방식에서 사용되어 얼굴 인식 등에서 좋은 성능을 보이는 Hausdorff 거리는 주어진 점의 집합들 사이에서 기하학적 유사도만을 고려한 측도이므로 원래의 영상이 포함하고 있는 다른 정보들을 추가적으로 이용함으로 효율을 높일 수 있다. 이러한 점에 착안하여 본 논문에서는 점들 사이에 서로 다른 정도를 측정하기 위해서 거리뿐만 아니라 점들 주위의 국지적 계조패턴 정보까지 포함하는 측도를 정의함으로써 보다 정밀한 템플릿 정합결과를 얻는 방법을 제안한다.

• 정보처리학회논문지B
• /
• 제8B권5호
• /
• pp.493-500
• /
• 2001

동영상 데이터의 장면 분할은 내용기반 분석을 위해 필요한 기초작업이다. 본 논문에서는 동영상의 매 프레임을 워터쉐드 알고리즘을 통해 객체 중심의 작은 영역들로 나누어 각 영역이 연속적인 프레임 상에서 계속 존재하는가를 파악하는 방법을 통해 장면을 구분하는 새로운 영역기반 장면 분할 기법을 제안한다. 이를 위해 각 영역들에 대한 형태와 공간상의 유사도를 측정해 영역들의 움직임 정도에 따라 동영상 데이터를 동적 구간과 정적 구간으로 나누고 인접한 구간간의 유사도에 따라 그룹화 하는 방법을 통해 장면 분할을 시도한다. 제안하는 기법은 객체들을 표현하는 각 영역을 비교 대상으로 삼기 때문에 명암 변화나 변화에도 오검출 하지 않으면서 효과적으로 장면을 구분해낼수 있는 장점을 갖는다.

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

One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.

• 대한원격탐사학회지
• /
• 제31권1호
• /
• pp.1-9
• /
• 2015

Mobility and cloud platform have become the dominant paradigm to develop web services dealing with huge and diverse digital contents for scientific solution or engineering application. These two trends are technically combined into mobile cloud computing environment taking beneficial points from each. The intention of this study is to design and implement a mobile cloud application for remotely sensed image fusion for the further practical geo-based mobile services. In this implementation, the system architecture consists of two parts: mobile web client and cloud application server. Mobile web client is for user interface regarding image fusion application processing and image visualization and for mobile web service of data listing and browsing. Cloud application server works on OpenStack, open source cloud platform. In this part, three server instances are generated as web server instance, tiling server instance, and fusion server instance. With metadata browsing of the processing data, image fusion by Bayesian approach is performed using functions within Orfeo Toolbox (OTB), open source remote sensing library. In addition, similarity of fused images with respect to input image set is estimated by histogram distance metrics. This result can be used as the reference criterion for user parameter choice on Bayesian image fusion. It is thought that the implementation strategy for mobile cloud application based on full open sources provides good points for a mobile service supporting specific remote sensing functions, besides image fusion schemes, by user demands to expand remote sensing application fields.

• 정보처리학회논문지D
• /
• 제13D권6호
• /
• pp.823-832
• /
• 2006

소프트웨어(SW) 복제도 감정의 목적은 두 프로그램 사이의 동일 또는 유사성 정도를 판단하는 것으로, 컴퓨터프로그림 저작권 관련 분쟁해결의 주요한 기술적 판단근거를 제시하는 제도라 할 수 있다. SW감정을 진행함에 있어서 중요한 점은 감정인의 주관적 판단에 편중되지 않도록 하고, 신속 객관적인 감정의 수행으로 정확한 감정결과를 도출해내는 것이다. 그러나 현재까지 체계적인 감정기법의 표준화 연구 및 개발은 미비한 상태이며, SW감정 분야별(유형별) 감정기법 조차 전문 감정인들에 따라 그 접근방법이 천차만별이어서 뚜렷한 표준안이 제시되지 못하고 있다. 또한, 기 수행되었던 감정사례에 대한 실증적 분석 결과, 기존 감정 절차 및 기법의 오류 또는 감정인의 전문지식 결여 등의 문제가 잠재하여 일부 감정결과에 대한 객관성 및 정확성에 손상이 있음을 알 수 있다. 본 논문에서는 감정인에 따라 동일한 평가 항목에 대하여 서로 다른 결과가 도출될 수 있는 오차의 허용치를 감소시키기 위한 객관적인 평가 방법과 정형화된 SW복제도 감정기법의 표준화 모델을 제시한다. 특히, 기존 감정기법의 문제점 해결 및 보완 연구를 기반으로 감정범위의 설정, 감정기준 및 방법, 단위작업 프로세스 기준의 감정영역 및 감정항목 설정, 가중치 부여, 논리적 복제도와 물리적 복제도 산출 등에 초점을 맞추어 감정기법을 분석 평가한다. 따라서 SW복제도 감정 기법의 표준화 모델은 감정인의 주관적 판단에 의한 오류의 가능성을 최소화하고, 감정결과의 객관성 및 신뢰성을 한층 제고하기 위한 도구를 제공할 것이다.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.803-816
• /
• 1997

In this paper we propose a new approach far part families considering multiple attributes of parts in the design and operating stage of flexible manufacturing systems. We first represent the relationship of parts and the relative attributes using fuzzy membership function, AHP method and normalization. As a result, more realistic nonbinary data of the relationship is obtained. Then we group parts into part families based on the nonbinary data using fuzzy $\alpha$-cut and new similarity coefficient method. The performance of our method is compared numerically with others.

• 경영과학
• /
• 제4권
• /
• pp.76-83
• /
• 1987

The machine-part group formation(MPGF) problem arises frequently in FMS planning. By viewing the problem as one of finding good assignments, a powerful solution algorithm is presented. The new algorithm solves the threshold dilemma found in previous solution procedures employing similarity coefficients. It also compared favorably with other existing MPGF algorithms by finding minimum exceptional elements for the tested problems. Furthermore the new algorithm can solve dynamic and more realistic MPGF problems by considering production volumes or costs. Such diverse machine-part relationship values were not considered in previous MPGF studies, which included only 0,1 incidence values. An example problem is solved where production volumes are the elements of MPGF incidence matrix.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.137-137
• /
• 1991

This paper compares and evaluates the performances of the two types of mathematical programming models for solving the machine-part cell formation problem in group technology manufacturing : indirect formulation relying on surrogate measure such as similarity coefficient and direct formulation seeking to minimize the number of exceptional elements. New indirect formulation, called the generalized p-median model. is proposed. Unlike existing p-median formulations, proposed formulation includes the classical cell formation problem in which only one process plan exsits for each part as a special case. The proposed new formulation can also deal with the cell formation problem in which alternative process plans exist for a part. The indirect formulation is compared with a new direct formulation which needs much fewer extra variables and constraints than existing direct formulations. Some significant findings from comparative experiment are discussed.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.123-132
• /
• 1998

The group formation problem of the machine and part is a very important issue in the planning stage of cellular manufacturing systems. This paper investigates Self-Organizing Map(SOM) neural networks approach to machine-part grouping problem. We present a two-phase algorithm based on SOM for grouping parts and machines. SOM can learn from complex, multi-dimensional data and transform them into visually decipherable clusters. Output layer in SOM network is one-dimensional structure and the number of output node has been increased sufficiently to spread out the input vectors in the order of similarity. The proposed algorithm performs remarkably well in comparison with many other algorithms for the well-known problems shown in previous papers.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• pp.37-40
• /
• 2001

This paper describes the selection and evaluation of RP processes. Major rapid prototyping processes such as SLS, SLA, FDM and LOM, which are wide spread in use are selected. A test part, which includes various primitives, is designed in order to evaluate these RP processes. Measurement of the test part is automated by using a CMN program. To visualize and analyze measured data, Microsoft Access and Visual C++ are used. Also, from measured data obtained, TOPSIS, one of the decision making methods, and Shannon Entropy is used to select an appropriate RP process for specific application.