• ETRI Journal
• /
• 제38권6호
• /
• pp.1153-1162
• /
• 2016

This paper addresses the resource allocation (RA) problem in multi-cell cognitive radio networks. Besides the interference power threshold to limit the interference on primary users PUs caused by cognitive users CUs, a proportional fairness constraint is used to guarantee fairness among multiple cognitive cells and the impact of imperfect spectrum sensing is taken into account. Additional constraints in typical real communication scenarios are also considered-such as a transmission power constraint of the cognitive base stations, unique subcarrier allocation to at most one CU, and others. The resulting RA problem belongs to the class of NP-hard problems. A computationally efficient optimal algorithm cannot therefore be found. Consequently, we propose a suboptimal RA algorithm composed of two modules: a subcarrier allocation module implemented by the immune algorithm, and a power control module using an improved sub-gradient method. To further enhance algorithm performance, these two modules are executed successively, and the sequence is repeated twice. We conduct extensive simulation experiments, which demonstrate that our proposed algorithm outperforms existing algorithms.

• Journal of information and communication convergence engineering
• /
• 제13권2호
• /
• pp.123-131
• /
• 2015

Training neural networks is a complex task with great importance in the field of supervised learning. In the training process, a set of input-output patterns is repeated to an artificial neural network (ANN). From those patterns weights of all the interconnections between neurons are adjusted until the specified input yields the desired output. In this paper, a new hybrid algorithm is proposed for global optimization of connection weights in an ANN. Dynamic swarms are shown to converge rapidly during the initial stages of a global search, but around the global optimum, the search process becomes very slow. In contrast, the gradient descent method can achieve faster convergence speed around the global optimum, and at the same time, the convergence accuracy can be relatively high. Therefore, the proposed hybrid algorithm combines the dynamic particle swarm optimization (DPSO) algorithm with the backpropagation (BP) algorithm, also referred to as the DPSO-BP algorithm, to train the weights of an ANN. In this paper, we intend to show the superiority (time performance and quality of solution) of the proposed hybrid algorithm (DPSO-BP) over other more standard algorithms in neural network training. The algorithms are compared using two different datasets, and the results are simulated.

• 한국산업정보학회논문지
• /
• 제13권1호
• /
• pp.57-67
• /
• 2008

본 논문에서는 광류를 이용한 적응 블록 정합 움직임 추정 방법을 제안하였다. 제안 방법에서는 먼저 각 화소의 시간 경사값과 공간 경사값을 미분필터를 통하여 계산한 후, 이 경사값들로부터 최소 자승 추정법을 이용하여 광류를 추정하여 탐색영역의 위치와 크기를 결정하였다. 특히 움직임 특성에 따라 탐색영역을 결전함으로써 움직임 추정 오차가 큰 영역인 크고 복잡한 움직임을 갖는 영상에 대해서 뛰어난 성능을 갖는다. 다양한 움직임 특성을 가지는 실험 영상들에 대한 기존의 방법과 제안한 방법의 움직임 추정 성능 평가를 위한 컴퓨터 모의실험을 통하여, 제안한 방법이 움직임이 크고 복잡한 영상에 대해서 기존의 방법에 비해 우수한 PSNR을 나타냄을 확인하였다.

• 대한건축학회논문집:구조계
• /
• 제33권12호
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.283-286
• /
• 2001

Based on a fuzzy system representation of gray scale images, we derive an edge detection algorithm whose convolution kernel is different from the known kernels such as those of Roberts', Prewitt's or Sobel's gradient. Our fuzzy system representation is an exact representation of the bicubic spline function which represents the gray scale image approximately. Hence the fuzzy system is a continuous function and it provides a natural way to define the gradient and the Laplacian operator. We show that the gradient at grid points can be evaluated by taking the convolution of the image with a 3 3 kernel. We also show that our gradient coupled with the approximate value of the continuous function generates an edge detection method which creates edge images clearer than those by other methods. A few examples of applying our methods are included.

• 응용통계연구
• /
• 제22권4호
• /
• pp.709-721
• /
• 2009

본 논문은 형태학적 워터쉐드 알고리즘을 이용하여 잡음에 강한 효율적인 영상분할에 대해서 논의하고자 한다. 기존의 형태학적 워터쉐드 알고리즘에 의한 영상분할은 크게 형태학적 연산자에 의한 영상의 단순화, 경사 영상 생성, 워터쉐드 알고리즘 수행 그리고 영역 병합 등의 여러 단계에 걸쳐 이루어진다. 그러나 기존의 형태학적 워터쉐드 알고리즘에 의한 영상분할은 과분할이 많이 일어나는 단점을 갖고 있다. 본 논문에서는 과분할을 줄이기 위해 잡음에 강한 형태학적 연산자에 의한 경사영상을 생성하고 워터쉐드 알고리즘을 적용 후 통계적인 콜모고로프-스미르노프 검정을 사용하여 인접한 영역 간의 픽셀 값 분포를 비교함으로써 부적절한 영역 병합을 최소화하였다. 본 논문에서 제안한 영상분할의 성능을 평가하기 위해 기존의 방법과 정성적이고 정량적인 비교뿐 만아니라 영상분할에 소요되는 계산시간까지 비교하였다.

• 한국컴퓨터정보학회논문지
• /
• 제16권8호
• /
• pp.57-66
• /
• 2011

본 논문에서는 단일 입력 영상에서 특징을 추출하여 실시간으로 에지 대칭과 기울기의 방향성 특징을 이용하여 효과적으로 사람을 검출하는 알고리즘을 제안한다. 제안된 알고리즘은 전처리, 사람 후보 영역 분할, 후보 영역 검증인 3단계로 구성되었다. 여기서 전처리 단계는 주변 조도 환경과 밝기에 강인하고, 사람의 특징인 모양 특징 크기, 사람의 조건을 고려한 사람의 특성을 가진 윤곽선을 검출한다. 그리고 사람 후보 영역 분할 단계는 검출된 윤곽선에서 사람의 에지 대칭성과 크기를 가지고 영역을 분리하고, 에이타부스트 알고리즘을 적용하여 1차 후보 영역을 분할한다. 마지막으로 후보 영역 검증 단계는 분할된 국소 영역에 대한 기울기의 특징 벡터 및 분류기를 이용하여 후보 영역을 검증하여 오검출의 성능을 우수하게 한다. 제안된 알고리즘을 적용하여 모의실험을 한 결과, 제안된 알고리즘은 단일 알고리즘을 적용한 기존 알고리즘 보다 처리 속도가 약 1.7배 정도 개선되었으며, FNR(False Negative Rate)은 3% 정도 우수함을 확인하였다.

• ETRI Journal
• /
• 제32권3호
• /
• pp.486-489
• /
• 2010

This letter presents a modified Pegasos algorithm for graph-based dependency parsing. We show that the modified Pegasos algorithm outperforms the margin infused relaxed and passive aggressive algorithms in three languages.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1239-1248
• /
• 2010

In this paper, an implementable BFGS bundle algorithm for solving a nonsmooth convex optimization problem is presented. The typical method minimizes an approximate Moreau-Yosida regularization using a BFGS algorithm with inexact function and the approximate gradient values which are generated by a finite inner bundle algorithm. The approximate subgradient of the objective function is used in the algorithm, which can make the algorithm easier to implement. The convergence property of the algorithm is proved under some additional assumptions.

• Journal of Mechanical Science and Technology
• /
• 제15권5호
• /
• pp.580-591
• /
• 2001

This paper proposes a fuzzy-sliding mode control which is designed by a self tuning fuzzy inference method based on a genetic algorithm. Using the method, the number of inference rules and the shape of the membership functions of the proposed fuzzy-sliding mode control are optimized without the aid of an expert in robotics. The fuzzy outputs of the consequent part are updated by the gradient descent method. It is further guaranteed that the selected solution becomes the global optimal solution by optimizing Akaikes information criterion expressing the quality of the inference rules. In order to evaluate the learning performance of the proposed fuzzy-sliding mode control based on a genetic algorithm, a trajectory tracking simulation of the polishing robot is carried out. Simulation results show that the optimal fuzzy inference rules are automatically selected by the genetic algorithm and the trajectory control result is similar to the result of the fuzzy-sliding mode control which is selected through trial error by an expert. Therefore, a designer who does not have expert knowledge of robot systems can design the fuzzy-sliding mode controller using the proposed self tuning fuzzy inference method based on the genetic algorithm.