• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.73-78
• /
• 1999

This paper presents an effective construction method of adaptive multiple control systems utilizing some knowledge upon the plants. The adaptive multiple control system operates plants un-der widely changing environmental conditions. The adaptive multiple control system is composed of a family of candidate controllers together with a supervisor. The system does not require any identification schemes of environmental conditions. Monitoring outputs of the plant, the supervisor switches from one candidate controller to another, The basic ideas of adaptation are as follows: (1)each candidate controller is prepared for each environmental condition in advance; (2)the supervise. applies a sequence of speculative controls to the plant with candidate controllers just after the start of control or just after the detection of a change in the environmental condition. Each candidate controller can keep the system stable during one-step period of the speculative control and the most appropriate candidate controller for the environmental condition to which the system is exposed can be selected before the last trial of speculative control step comes to an end. We proposed a construction method of adaptive multiple control system without any knowledge of plant dynamics and applied the method to a cart-pole balancing problem and a vehicle anti skid braking system. In real applications, as we can often easily obtain a piece of knowledge upon plant dynamics beforehand, we intend to extend the method such that multiple control systems can be efficiently designed using the knowledge. We apply the new idea to the cart-pole balancing problem with variable length of the pole. The simulation experiments lead us to the conclusion that the new attempt can reduce the manpower to design the candidate controllers for adaptive multiple control systems.

• 한국통신학회논문지
• /
• 제34권1C호
• /
• pp.37-47
• /
• 2009

본 논문은 무선망과 같이 패킷 손실이 많은 환경에 H.264 부호화 영상이 전송될 때 복호기 단말기에서 손실된 움직임 벡터를 효율적으로 에러은닉 방법에 대하여 2가지를 제안한다. 첫째, 손실된 블록(매크로블록)에 대하여 후보벡터집합(candidate vector set)을 선정하는 방법으로는 손실된 블록에 인접한 주변 블록의 움직임벡터들의 높은 상관성을 착안하여 후보벡터를 선정한다. 이때 제안한 알고리즘은 주변 블록의 움직임벡터들 간에 거리를 이용하여 클러스터한다. 클리스터된 움직임 벡터 집합(클러스터 집합)에서 최적의 후보벡터 선택방법은 중앙값을 선택한다. 둘째, 손실된 블록의 최종의 후보벡터를 선정하는 방법으로는 후보벡터집합에서 주변에 인접한 픽셀간의 방향성을 고려하여 왜곡 값이 최소인 벡터를 후보벡터로 결정한다. 패킷이 손실되는 환경에서 실험한 결과, 제안한 에러 은닉 방법은 기존 방법에 비하여 후보벡터 개수가 평균적으로 $23%{\sim}61%$까지 감소하였고, 디코딩 시간이 평균적으로 $3{\sim}4$(sec) 감소하였다. 또한 화질에 대한 객관적 평가 기준인 PSNR은 평균적으로 기존 방법들과 거의 비슷하였다.

• 한국컴퓨터정보학회논문지
• /
• 제25권4호
• /
• pp.141-148
• /
• 2020

용어추출은 도메인 텍스트 모음으로부터 도메인 용어 목록을 인식하는 작업이다. 용어추출의 기존 효과적인 방법들은 비교사 방식으로 동작하며, 후보 용어 집합을 추출하는 작업과 후보 용어에 용어중요도를 할당하는 작업을 주요 단계로 포함한다. 후보 용어의 용어중요도 계산과 관련하여 본 논문에서는 후보 용어의 내부 및 외부용어집합을 활용한다. 내부용어집합은 후보 용어에 포함된 다른 짧은 용어들의 집합이며, 외부용어집합은 후보 용어가 포함된 다른 긴 용어들의 집합이다. 본 논문에서는 후보 용어의 내부 혹은 외부용어집합으로부터 후보 용어의 용어 강도를 계산하는 다양한 강도 함수들을 제시하고, 이들 용어 강도 값들과 C-value 점수를 결합하는 용어중요도 계산 방법을 소개한다. 생물학 및 전산언어학 분야 영어 데이터셋을 사용한 성능 평가에서는 제안된 방법의 용어추출 성능을 비교하고 분석한다. 제안된 방법은 생물학 및 전산언어학 분야 데이터셋에 대해 각각 최대 1%와 3% 차이의 성능 향상을 보였다.

• 방송공학회논문지
• /
• 제24권1호
• /
• pp.41-47
• /
• 2019

HEVC(High Efficiency Video Coding) 보다 뛰어난 압축 성능을 갖는 차세대 비디오 압축 표준으로 진행중인 VVC(Versatile Video Coding)에서는 보다 향상된 움직임 병합(Merge) 모드를 위한 기법들이 다루어지고 있다. 기존의 병합 모드에서는 다수의 주변 블록에서 움직임 정보가 존재하지 않으면 현재 블록의 움직임 정보로 사용할 병합 후보 리스트에 제로(zero) 움직임 벡터가 후보에 삽입될 수 있으며 이는 부호화 효율을 저하시킬 수 있다. 본 논문에서는 병합 후보 리스트에 제로 움직임 후보가 삽입되는 경우를 줄이기 위해 대체 움직임 정보를 생성하여 병합 후보 리스트에 삽입하는 효율적인 병합 모드 후보 리스트 구성 기법을 제시한다. 실험결과 제안 기법은 VTM1.0 대비 3% 복호화 복잡도 증가와 함께 0.2%의 부호화 성능 향상을 보였다.

• 한국통신학회논문지
• /
• 제32권9C호
• /
• pp.888-894
• /
• 2007

The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type I). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type II). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type I and Type II sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type I and Type II provide an additional 10-15% complexity reduction while maintaining detection performance.

• 대한방사선기술학회지:방사선기술과학
• /
• 제41권3호
• /
• pp.231-240
• /
• 2018

Automated breast ultrasound (ABUS) equipment is a new innovative technique for 3D automatic breast scanning, but limited for the examination in the concave axillary region. The purpose of this study was to determine feasible candidate materials for the ultrasonic wave propagation media in ABUS, enabling the evaluation of the axillary region. Ultrasonography was performed using an ABUS system ($Invenia^{TM}ABUS$, GE, USA) on the ultrasound-specific phantom (UC-551M-0.5, ATS Laboratories, USA) covered by different candidate materials. The validity of feasible candidate materials was evaluated by image quality. Three independent radiological technologists, with more than 10 years of experience, visually assessed on the images. The inter-observer agreements according to the candidate materials were tested using Cronbach's alpha. Unenveloped solidified carrageenan can be a feasible material for the use of ABUS with excellent test reliability. Therefore, the coverage of the axillary region with carrageenan may be effective for ABUS which was originally developed for the convex anatomic structure as female breast.

• 한국산학기술학회논문지
• /
• 제15권11호
• /
• pp.6838-6844
• /
• 2014

LTE-A 시스템은 고속 데이터 전송을 위해 다중안테나를 장착하고 있다. 일반적으로 공간다중화 다중안테나 시스템의 수신기 복잡도는 후보벡터의 개수에 따라 증가한다. 후보벡터의 개수가 증가함에 따라 연판정 값의 신뢰도가 향상된다. 많은 수의 후보벡터를 생성하는 최우도 신호검출방식을 사용하면 우수한 성능을 달성할 수 있다. 반면 적은 개수의 후보벡터를 생성하는 저복잡도 수신기는 신뢰도가 낮은 연판정 값을 생성한다. 본 논문에서는 적은 수의 후보벡터를 사용해서 얻게되는 연판정 값의 신뢰도를 향상시키는 새로운 기술을 제안하고 모의실험을 통해 개선된 성능을 확인한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1519-1522
• /
• 2002

In this paper, we propose a new adaptive dissolve detection method based on the analysis of a dissolve modeling error that is the difference between an ideally modeled dissolve curve without any correlation and an actual variance curve with a correlation. The dissolve modeling error is determined based on a correlation between two scenes and variances for each scene. First, Candidate regions are extracted by using the characteristics of a parabola that is downward convex, then the candidate region will be verified based on a dissolve modeling error. If a dissolve modeling error on a candidate region is less than a threshold that is defined by a dissolve modeling error with a target correlation, the candidate region should be a dissolve region with a correlation less than the target correlation. The threshold is adaptively determined based on the variances between the candidate regions and the target correlation. By considering the correlation between neighbor scenes, the proposed method is able to be a semantic scene-change detector. The proposed algorithm was tested on various types of data and its performance proved to be more accurate and reliable when compared with other commonly used methods

• 한국정보시스템학회지:정보시스템연구
• /
• 제25권1호
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

• Communications for Statistical Applications and Methods
• /
• 제28권2호
• /
• pp.189-204
• /
• 2021

In a regression analysis, a single best model is usually selected among several candidate models. However, it is often useful to combine several candidate models to achieve better performance, especially, in the prediction viewpoint. Model combining methods such as stacking and Bayesian model averaging (BMA) have been suggested from the perspective of averaging candidate models. When the candidate models include a true model, it is expected that BMA generally gives better performance than stacking. On the other hand, when candidate models do not include the true model, it is known that stacking outperforms BMA. Since stacking and BMA approaches have different properties, it is difficult to determine which method is more appropriate under other situations. In particular, it is not easy to find research papers that compare stacking and BMA when regression model assumptions are violated. Therefore, in the paper, we compare the performance among model averaging methods as well as a single best model in the linear regression analysis when standard linear regression assumptions are violated. Simulations were conducted to compare model averaging methods with the linear regression when data include outliers and data do not include them. We also compared them when data include errors from a non-normal distribution. The model averaging methods were applied to the water pollution data, which have a strong multicollinearity among variables. Simulation studies showed that the stacking method tends to give better performance than BMA or standard linear regression analysis (including the stepwise selection method) in the sense of risks (see (3.1)) or prediction error (see (3.2)) when typical linear regression assumptions are violated.