• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제7권6호
• /
• pp.205-220
• /
• 2018

소프트웨어 결함 예측은 결함이 자주 발생하는 모듈에 집중함으로써 소프트웨어 품질 보증 활동에 귀중한 프로젝트 리소스를 효과적으로 할당하는 데 도움이 될 수 있다. 회사 내에서 수집 된 충분한 기록 데이터를 사용하여 정확한 결함 발생 가능성이 높은 모듈 예측에 대해 WPDP (프로젝트 내 결함 예측)를 사용할 수 있다. 회사가 과거 데이터를 유지하지 못한 경우 CPDP (Cross-Project Defect Prediction) 메커니즘을 기반으로 오류를 예측하는 분류기를 만드는 것이 도움이 될 수 있다. CPDP는 다른 조직에서 수집 한 다른 프로젝트 데이터를 사용하여 분류기를 작성하기 때문에 정확한 분류기를 만드는데 가장 큰 장애물은 소스와 대상 프로젝트 간의 서로 다른 분포이다. 이 문제의 해결을 위해 효과적인 유사도 측정 기술을 식별하는 것이 중요하므로, 본 논문에서는 다양한 유사도 측정 기술을 CPDP 모델에 적용하여 성능을 비교한다. 유사도 가중치의 유효성을 평가하고, 통계적 유의성 검정 및 효과 크기 검정을 통해 결과를 검증한다. 실험 결과, k-Nearest Neighbor (k-NN), LOcal Correlation Integral (LOCI) 및 Range 방법이 유사도 측정 기술 중 상위 3 개에 속했고, 이들을 사용하는 CPDP 예측 성능이 WPDP의 성능과 유사하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권4호
• /
• pp.238-246
• /
• 2011

This paper proposes a new semantic representation and its associated similarity measure. The representation expresses textual context observed in a context of a certain term as a network where nodes are terms and edges are the number of cooccurrences between connected terms. To compare terms represented in networks, a graph kernel is adopted as a similarity measure. The proposed representation has two notable merits compared with previous semantic representations. First, it can process polysemous words in a better way than a vector representation. A network of a polysemous term is regarded as a combination of sub-networks that represent senses and the appropriate sub-network is identified by context before compared by the kernel. Second, the representation permits not only words but also senses or contexts to be represented directly from corresponding set of terms. The validity of the representation and its similarity measure is evaluated with two tasks: synonym test and unsupervised word sense disambiguation. The method performed well and could compete with the state-of-the-art unsupervised methods.

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

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

• ETRI Journal
• /
• 제24권1호
• /
• pp.23-30
• /
• 2002

MPEG-7 Visual Standard specifies a set of descriptors that can be used to measure similarity in images or video. Among them, the Edge Histogram Descriptor describes edge distribution with a histogram based on local edge distribution in an image. Since the Edge Histogram Descriptor recommended for the MPEG-7 standard represents only local edge distribution in the image, the matching performance for image retrieval may not be satisfactory. This paper proposes the use of global and semi-local edge histograms generated directly from the local histogram bins to increase the matching performance. Then, the global, semi-global, and local histograms of images are combined to measure the image similarity and are compared with the MPEG-7 descriptor of the local-only histogram. Since we exploit the absolute location of the edge in the image as well as its global composition, the proposed matching method can retrieve semantically similar images. Experiments on MPEG-7 test images show that the proposed method yields better retrieval performance by an amount of 0.04 in ANMRR, which shows a significant difference in visual inspection.

• 한국문헌정보학회지
• /
• 제47권1호
• /
• pp.39-55
• /
• 2013

It is a difficult problem to use keyword retrieval for low-quality Korean document images because these include adjacent characters that are connected. In addition, images that are created from various fonts are likely to be distorted during acquisition. In this paper, we propose and test a keyword retrieval system, using a support vector machine (SVM) for the retrieval of low-quality Korean document images. We propose a keyword retrieval method using an SVM to discriminate the similarity between two word images. We demonstrated that the proposed keyword retrieval method is more effective than the accumulated Optical Character Recognition (OCR)-based searching method. Moreover, using the SVM is better than Bayesian decision or artificial neural network for determining the similarity of two images.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 추계학술대회 논문집 전력기술부문
• /
• pp.207-210
• /
• 2005

The Similarity Index[1] is a good Performance measure for the network reduction. It can be applied to the network reduction In the zone categorized by the nodal prices. This paper deals with a zonal reduction method based on the similarity indices. The proposed method was verified by IEEE 39 bus test system.

• 산업공학
• /
• 제10권3호
• /
• pp.189-196
• /
• 1997

This paper presents a cell formation approach for a cellular manufacturing system to minimize the inter-cell moves considering operation sequences. Two new factors are introduced: (1)flow-similarity(FS) for integrating direct/indirect inter-machine flow and similarity (2)machine cell-part moves (CPM) for exactly computing inter-cell moves. FS is used for combining machines and CPM is used for assigning the parts to the preliminary machine cells. In addition, we develop an aggregated heuristic algorithm to form manufacturing machine cells and assign the parts to those cells based on these concepts. We use performance criterion called total inter-cell moves(TICM), which is the total material flow between internal cells and external cells. Results of computational tests on a number of randomly generated test problems show that the suggested heuristic is superior to existing methods.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2022년도 하계학술대회
• /
• pp.250-252
• /
• 2022

As immersive video contents have started to emerge in the commercial market, research on it is required. For this, efficient coding methods for immersive video are being studied in the MPEG-I Visual workgroup, and they released Test Model for Immersive Video (TMIV). In current TMIV, the patches are packed into atlas in order of patch size. However, this simple patch packing method can reduce the coding efficiency in terms of 2D encoder. In this paper, we propose patch packing method which pack the patches into atlases by using the similarity of each patch for improving coding efficiency of 3DoF+ video. Experimental result shows that there is a 0.3% BD-rate savings on average over the anchor of TMIV.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2017년도 제48회 춘계학술대회논문집
• /
• pp.374-377
• /
• 2017

TDACS의 작동 성능 검증 시험을 수행하기 위해서 유동시험 장치를 설계하였다. 이를 위해서 고체 추진기관 연소관 및 유동시험에서의 압력 거동을 모델링하였고 각 모델의 동적 특성을 나타내는 응답 시간을 구하였다. 본 논문에서는 유동시험 장치의 시스템 응답 시간을 고체추진기관 연소관의 특성과 같아지는 조건을 구하고 이를 설계에 반영함으로써 연소 환경에서 동적 응답특성을 검증하는 것과 유사한 결과를 갖도록 하였다.

• ETRI Journal
• /
• 제25권5호
• /
• pp.401-406
• /
• 2003

A biometric system determines the identity of a person by measuring physical features that can distinguish that person from others. Since biometric features have many variations and can be easily corrupted by noises and deformations, it is necessary to apply machine learning techniques to treat the data. When applying the conventional machine learning methods in designing a specific biometric system, however, one first runs into the difficulty of collecting sufficient data for each person to be registered to the system. In addition, there can be an almost infinite number of variations of non-registered data. Therefore, it is difficult to analyze and predict the distributional properties of real data that are essential for the system to deal with in practical applications. These difficulties require a new framework of identification and verification that is appropriate and efficient for the specific situations of biometric systems. As a preliminary solution, this paper proposes a simple but theoretically well-defined method based on a statistical test theory. Our computational experiments on real-world data show that the proposed method has potential for coping with the actual difficulties in biometrics.