• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1998년도 학술발표대회 논문집 제17권 1호
• /
• pp.197-200
• /
• 1998

본 논문에서는 유전자 알고리즘(genetic Algorithm)을 사용하여 벡터 양자화(vector quantization : VQ)를 수행하는 방법을 제안하고자 한다. 벡터 양자화를 수행하여 코드북(codebook)을 생성할 때 생성된 코드북과 학습벡터(training vector)사이에는 반드시 양자화 오차(quantization error)가 발생하는데 기존의 K-means 알고리듬을 사용하여 코드북을 생성했을 경우 양자화 오차를 줄이는데 한계가 있었다. 본 논문에서 제안하는 유전자 알고리즘을 이용한 벡터 양자화는 이 양자화 오차를 감소시키기 위해서 연구되었다. 제안한 방법의 성능을 평가하기 위해 음성데이터를 기존의 K-means 알고리즘에서 클러스터의 중심을 선택하는 방법중의 하나인 Minimax방법으로 코드북을 생성하여 제안한 방법과 양자화 오차를 비교한 결과 양자화 오차가 감소됨을 알 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제4권4호
• /
• pp.499-505
• /
• 1998

In developing an automated surface inspect algorithm, we have designed a hierarchical classifier using neural network. The defects which exist on the surface of cold mill strip have a scattering or singular distribution. We have considered three major problems, that is preprocessing, feature extraction and defect classification. In preprocessing, Top-hit transform, adaptive thresholding, thinning and noise rejection are used Especially, Top-hit transform using local minimax operation diminishes the effect of bad lighting. In feature extraction, geometric, moment, co-occurrence matrix, and histogram ratio features are calculated. The histogram ratio feature is taken from the gray-level image. For defect classification, we suggest a hierarchical structure of which nodes are multilayer neural network classifiers. The proposed algorithm reduced error rate by comparing to one-stage structure.

• 대한전자공학회논문지SP
• /
• 제44권5호
• /
• pp.94-102
• /
• 2007

잠음감소에 있어서 웨이브렛 임계처리 알고리즘은 미니맥스 관점에서 거의 최적의 성능을 보이는 것으로 알려져 있다. 그러나 웨이브렛 임계처리 알고리즘은 웨이브렛 함수의 복잡성으로 인해 FPGA와 같은 하드웨어 상에 구현이 어렵다. 본 논문에서는 이진트리 구조 필터뱅크에서 전체 신호전력에 대한 각 부밴드 신호 전력비에 기반한 새로운 잡음감소 기법을 제안한다. 그리고 이 기법을 FPGA 상에 구현한다. 간단한 구현을 위해 필터뱅크는 하다마드 변환 계수로 설계된다. 시뮬레이션과 하드웨어 실험결과 제안방법이 간단하지만 웨이브렛에 기반한 소프트 임계처리 잡음감소 알고리즘과 성능이 유사함을 보인다.

• 해양환경안전학회지
• /
• 제17권2호
• /
• pp.131-136
• /
• 2011

컴퓨터 비젼을 이용한 항행선박의 항적을 계산하고 교통량을 측정하는 방법은 해양사고의 예방관점에서 사고발생 가능성 여부를 예측해 볼 수 있는 유용한 방법이다. 본 연구에서는 컴퓨터 비젼을 이용하여 영상축소, 미분연산자, 최대 최소값 등을 이용하여 선박을 인식한 후 실세계 상에서의 좌표 값을 계산하여 실시간 항적을 전자 해도에 표시함으로서 해상 구조물과의 충돌여부를 직접 육안으로 확인 할 수 있는 알고리즘을 개발하였다. 본 연구에서 개발된 알고리즘은 영역 정보를 기반으로 개발되었기 때문에 점 정보에 의존하고 있는 기존 레이더 시스템의 단점을 보완하는 장점을 지니고 있다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• pp.118-118
• /
• 1993

We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 가을 학술발표논문집 Vol.34 No.2 (C)
• /
• pp.428-432
• /
• 2007

We present a novel method for determining k nearest neighbors, which accurately recognizes the underlying clusters in a data set. To this end, we introduce the "tiling neighborhood" which is constructed by tiling a number of small local circles rather than a single circle, as existing neighborhood schemes do. Then we formulate the problem of determining the tiling neighborhood as a minimax optimization, leading to an efficient message passing algorithm. For several real data sets, our method outperformed the k-nearest neighbor method. The results suggest that our method can be an alternative to existing for general classification tasks, especially for data sets which have many missing values.

• Journal of the Korean Data and Information Science Society
• /
• 제10권2호
• /
• pp.289-298
• /
• 1999

We consider a minimax approach to make a design robust to many types or uncertainty arising in reality when dealing with non-normal linear models. We try to build a design to protect against the worst case, i.e. to improve the "efficiency" of the worst situation that can happen. In this paper, we especially deal with the generalized linear model. It is a known fact that the generalized linear model is a universal approach, an extension of the normal linear regression model to cover other distributions. Therefore, the optimal design for the generalized linear model has very similar properties as the normal linear model except that it has some special characteristics. Uncertainties regarding the unknown parameters, link function, and the model structure are discussed. We show that the suggested approach is proven to be highly efficient and useful in practice. In the meantime, a computer algorithm is discussed and a conclusion follows.

• Communications for Statistical Applications and Methods
• /
• 제27권4호
• /
• pp.445-458
• /
• 2020

The least absolute shrinkage and selection operator (LASSO) is a popular method for a high-dimensional regression model. LASSO has high prediction accuracy; however, it also selects many irrelevant variables. In this paper, we consider the moderately clipped LASSO (MCL) for the high-dimensional generalized linear model which is a hybrid method of the LASSO and minimax concave penalty (MCP). The MCL preserves advantages of the LASSO and MCP since it shows high prediction accuracy and successfully selects relevant variables. We prove that the MCL achieves the oracle property under some regularity conditions, even when the number of parameters is larger than the sample size. An efficient algorithm is also provided. Various numerical studies confirm that the MCL can be a better alternative to other competitors.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제27권5호
• /
• pp.543-550
• /
• 2000

블럭 정합 알고리즘의 VLSI 구현시 복잡도를 줄이고, 수행 속도를 높이기 위하여 새로운 정합 기준인 적응적 비트 축소 MAD(adaptive bit-reduced mean absolute difference:ABRMAD)를 제안한다. ABRMAD는 기존의 MAD에서 화소의 모든 비트를 비교하는 대신, 화소를 구성하는 중요한 비트만을 고려하여 축소된 화소 값을 비교하여 움직임 벡터를 찾는다. 실험을 통하여, 제안한 정합 기준은 기존의 MAD 정합 기준에 비하여 낮은 하드웨어 복잡도를 가지면서 MSE(mean square error) 측면에서 유사한 성능을 가짐을 보인다. 또한 기존의 비트 수 축소형 정합 기준인 DPC(difference pixel counting), BBME(binary-matching with edge-map), 그리고 BPM(bit-plane matching)과 비교하여 같은 수의 비트를 사용하였을 경우 좋은 MSE 성능을 가짐을 보인다.

• 한국위성정보통신학회논문지
• /
• 제3권2호
• /
• pp.48-53
• /
• 2008

In the future, satellite communication systems, such as ISDB in Japan and DVB in Europe, are required to support higher transmission date rate for providing multimedia services including HDTV, high rate data communication etc. Considering the effectiveness of OFDM technique in efficient usage of frequency bandwidth and its robustness to the multi-path fading, several OFDM based standards have been proposed for satellite communication. However, the problem of high Peak to Average Power Ratio is one of the main obstacles for the implementation of OFDM based system. Many PAPR reduction schemes have been proposed for OFDM systems. Among these, the partial transmit sequences (PTS) is attractive as they obtain better PAPR property by modifying OFDM signals without distortion. In this paper, considering the complexity issue, we present a simplified minimum maximum (minimax) criterion and Sub-Optimal PTS algorithm to optimize the phase factor. This algorithm can be dynamically made tradeoff`f between performance and complexity on demand. In addition, we integrate guided scrambling (GS) with this method. Simulation in multiple antenna based OFDM system proves that the proposed Hybrid schemes can get much more PAPR reduction and do not require transmission of side information (SI). Thus it is helpful when implementing OFDM technique in satellite communication system.