• 한국전자파학회논문지
• /
• 제24권5호
• /
• pp.574-580
• /
• 2013

표적 추적을 위해 탐색 빔의 스캔간 획득 정보 상관 관계를 이용하는 TWS(Track While Scan) 방식과 달리, 위상 배열 레이더에서는 탐색 빔과 별도로 추적 빔을 할당하여 표적을 추적하는 adaptive tracking 방식을 사용할 수 있으며, 이로 인해 추적 형성 거리를 향상시킬 수 있다. 본 논문에서는 정기적인 탐색 빔 사이에 별도의 추적 빔들을 균등 시간 간격으로 할당한 adaptive tracking 방식을 제시하였다. 그리고 제안한 adaptive tracking 방식의 markov chain과 추적 형성 거리를 기존의 TWS 방식과 함께 나타내었다. 모의실험 결과, 동일한 추적 확인 조건하에서 제안한 adaptive tracking 방식이 TWS 방식에 비해 27.6 % 정도의 증가된 추적 형성 거리를 나타낼 수 있음을 보여주었다.

• Journal of Communications and Networks
• /
• 제16권5호
• /
• pp.512-522
• /
• 2014

This paper proposes fast millimeter-wave (mm-wave) beam training protocols with receive beamforming. Both IEEE standards and the academic literature have generally considered beam training protocols involving exhaustive search over all possible beam directions for both the beamforming initiator and responder. However, this operation requires a long time (and thus overhead) when the beamwidth is quite narrow such as for mm-wave beams ($1^{\circ}$ in the worst case). To alleviate this problem, we propose two types of adaptive beam training protocols for fixed and adaptive modulation, respectively, which take into account the unique propagation characteristics of millimeter waves. For fixed modulation, the proposed protocol allows for interactive beam training, stopping the search when a local maximum of the power angular spectrum is found that is sufficient to support the chosen modulation/coding scheme. We furthermore suggest approaches to prioritize certain directions determined from the propagation geometry, long-term statistics, etc. For adaptive modulation, the proposed protocol uses iterative multi-level beam training concepts for fast link configuration that provide an exhaustive search with significantly lower complexity. Our simulation results verify that the proposed protocol performs better than traditional exhaustive search in terms of the link configuration speed for mobile wireless service applications.

• 한국정보통신학회논문지
• /
• 제12권7호
• /
• pp.1187-1192
• /
• 2008

본 논문은 적응적 탐색 영역과 새로운 3단계 탐색을 이용하는 고속 움직임 추정을 제안한다. 제안한 방법은 이웃 블록의 모션벡터로부터 현재 블록의 움직임를 예측하고, 예측된 움직임 정보를 이용하여 탐색 영역을 적응적으로 설정함으로써 움직임 보상 영상의 화질이 $0.43dB{\sim}2.19dB$ 향상되었다. 또한 새로운 3단계 탐색 패턴을 적용하여 블록 당 계산량을 기존의 방법에 비해 $1.3%{\sim}1.9%$ 감소시킴으로써 고속 움직임 추정이 가능함을 알 수 있었다.

• 한국통신학회논문지
• /
• 제21권5호
• /
• pp.1109-1122
• /
• 1996

Generally, moving images contain the various components in motions, which reange from a static object and background to a fast moving object. To extract the accurate motion parameters, we must consider the various motions. That requires a wide search egion in motion estimation. The wide search, however, causes a high computational complexity. If we have a few knowledge about the motion direction and magnitude before motion estimation, we can determine the search location and search window size using the already-known information about the motion. In this paper, we present a local adaptive motion estimation approach that predicts a block motion based on spatio-temporal neighborhood blocks and adaptively defines the search location and search window size. This paper presents a technique for reducing computational complexity, while having high accuracy in motion estimation. The proposed algorithm is introduced the forward and backward projection techniques. The search windeo size for a block is adaptively determined by previous motion vectors and prediction errors. Simulations show significant improvements in the qualities of the motion compensated images and in the reduction of the computational complexity.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• 전기전자학회논문지
• /
• 제22권4호
• /
• pp.999-1005
• /
• 2018

본 논문에서는 전력계통에서 정밀하고 변화에 수렴성이 빠른 탐색을 기반으로 하는 주파수 추정 기법을 제안하였다. 제안된 주파수 추정 알고리즘은 고분해능 스펙트럼의 기울기를 추정하여 스펙트럼의 peak 점을 탐색하는 구조를 적용하였다. 과도적으로 주파수 변화가 큰 경우에 기존 방법들의 단점인 수렴속도가 늦는 점을 보완 또는 개선하기 위한 방법으로 Context analysis를 통하여 Full-search 기법과 주파수 추정변수들을 적응적으로 적용하여 주파수 추정의 정밀도와 수렴속도를 향상시키고 대표적인 주파수 추정기법인 DFT(discrete Fourier transform) 방법, ECKF(extended complex Kalman filter), MV(minimum variable)방법들과 비교하여 수렴성과 정밀도가 우수함을 보였다.

• Journal of Computational Design and Engineering
• /
• 제3권3호
• /
• pp.226-249
• /
• 2016

The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

• 전기학회논문지
• /
• 제56권9호
• /
• pp.1521-1526
• /
• 2007

This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.

• 조명전기설비학회논문지
• /
• 제23권12호
• /
• pp.48-57
• /
• 2009

본 논문에서는 FEM(Finite Element Method)을 이용한 직접구동형 영구자석 풍력발전기의 최적설계를 위해 최신의 최적화 기법인 MADS(Mesh Adaptive Direct Search)를 적용하였으며, 최적설계 목표는 연간 에너지 생산량(Annual Energy Production : AEP)을 최대화 하는 방향으로 선정하였다. 또한, 풍력발전기의 전 운전영역을 고려하기 위해 해당풍속에서의 통계적 확률밀도와 연간 운전시간을 적용하여 연간 최대에너지 생산량을 산정하였다. 아울러, MADS의 최적설계 결과와 병렬분산 컴퓨팅을 결합한 유전 알고리즘(Genetic Algorithm : GA)의 최적설계 결과를 비교하였으며, MADS는 병렬분산 유전알고리즘에 비해 상대적으로 빠른 수렴성을 나타내었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.43-46
• /
• 2000

In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.