• 전자공학회논문지B
• /
• 제31B권12호
• /
• pp.27-34
• /
• 1994

Block matching motion estimation is the most widely used method for motion compensated coding of image sequences. Based on a two dimensional systolic array, VLSI architecture and implementation of the full search block matching algorithm are described in this paper. The proposed architecture improves conventional array architecture by designing efficient processing elements that can control the data prodeuced by efficient search window division method. The advantages are that 1) it allows serial input to reduce pin counts for efficient composition of local memories but performs parallel processing. 2) It is flexible and can adjust to dimensional changes of search windows with simple control logic. 3) It has no idel time during the operation. 4) It can operate in real/time for low and main level in MPEG-2 standard. 5) It has modular and regular structure and thus is sutiable for VLSI implementation.

• 한국CDE학회논문집
• /
• 제4권3호
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• 대한전자공학회논문지
• /
• 제23권4호
• /
• pp.578-585
• /
• 1986

This paper describes a new two-dimensional adaptive lattice algorithm which determines reflection coefficients recursively by applying the gradient search technique to a two-dimensional lattice filter proposed by Parker and Kayran. The convergence characteristics of the proposed algorithm are also described. A new tow-dimensional adaptive lattice \ulcorneralgorithm has been obtained through the application of the \ulcorneralgorithm to the two-dimention adaptive lattice algorithm. Computer simulation proves that the convergence speed of the two-dimension adaptive lattice \ulcorneralgorithm is reladtively higher than that of the conventional adaptive lattice algorithm when \ulcornerhas a small value.

• 한국음향학회지
• /
• 제37권6호
• /
• pp.518-524
• /
• 2018

라이브 음악 또는 리메이크를 통해서 재발매된 음악을 원곡의 커버곡이라 부른다. 본 논문은 고속 커버곡 검색을 위한 특징 축약을 위해 2차원 퓨리에 변환을 이용하는 방법을 연구하였다. 이차원 퓨리에 변환은 조변화에 대해서 불변성을 가지고 있으므로, 커버곡 검색을 위한 특징 축약 방법으로 적합하다. 기존 퓨리에 변환 방법에서는 크기값 만을 활용하였으나, 본 논문에서는 인접한 크로마 블록은 같은 조변화를 가진다는 가정하에 위상 정보를 추가로 활용하는 방법을 제안하였다. 두 가지 커버곡 실험 데이터셋에서 성능 비교를 수행하였으며, 제안된 방법이 기존 방법에 비해서 우수한 커버곡 검색 정확도를 보임을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.791-796
• /
• 1987

In this paper, an efficient algorithm to estimate the volume and surface area from ultrasonic imaging and a reconstruction algorithm to generate three-dimensional graphics are presented. The computing efficiency is Improved by using the graph theory and the algorithm to determine proper contour points is performed by applying several tolerances. The search for contour points is limited by the change in curvature in order to provide an efficient search of the minimum cost path. These algorithms are applied to a selected mathematical model of ellipsoid. The results show that the measured value of the volume and surface area for the tolerances of 1.0005, 1.001 and 1.002 approximate to the measured values for the tolerance of 1.000 resulting in small errors. The reconstructed 3-dimensional Images are sparse and consist of larger triangular tiles between two cross sections as tolerance is increased.

• 정보과학회 논문지
• /
• 제42권2호
• /
• pp.242-254
• /
• 2015

본 논문에서는 다차원 인덱스 기반 다단계 k-NN 검색의 성능 향상 문제를 다룬다. 기존 다단계 k-NN 검색에서는 고차원 객체의 저차원 변환으로 인한 정보 손실로 k-NN 질의 결과 매우 큰 허용치(검색 범위)가 결정되어 범위 질의 결과로 많은 후보가 검색된다. 또한, 많은 후보는 후처리 과정에서 매우 많은 I/O 및 CPU 오버헤드를 발생시킨다. 본 논문에서는 이와 같은 고찰에 기반하여 범위 질의의 허용치를 줄여 후보 개수를 줄이고 이를 통해 성능을 향상시키는 방법을 제안한다. 먼저, k-NN 질의 결과로 결정된 허용치를 고차원 및 저차원 객체간 거리 비율로 강제 축소하여 범위 질의에 사용하는 허용치 축소 (근사적) 해결책을 제안한다. 다음으로, k-NN 질의 계수 k 대신 c k 를 사용하여 얻은 보다 타이트(tight)한 허용치로 범위 질의를 수행하는 계수 제어 (정확한) 해결책을 제안한다. 실제 객체 데이터를 사용하여 실험한 결과, 제안한 두 가지 해결책은 기존 다단계 k-NN 검색에 비해 후보 개수와 검색 시간 모두를 크게 향상시킨 것으로 나타났다.

• Architectural research
• /
• 제15권4호
• /
• pp.207-214
• /
• 2013

A form-finding technique is proposed for three-dimensional spatial structures. Two-step discrete finite element (FE) mesh generator based on computer aided geometric design (CAGD) is introduced and used to control the shape of three-dimensional spatial structures. Mathematical programming technique is adopted to search new forms (or shapes) of spatial structures. For this purpose, the strain energy is introduced as the objective function to be minimized and the initial volume (or the initial weight) is considered as constraint function. Numerical examples are carried out to test the capability of the proposed form-finding techniques and provided as benchmark tests.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.857-862
• /
• 2004

This paper analyzes properties of the recently developed nonlinear optimization method, Dynamic Encoding Algorithm for Searches (DEAS) [1]. DEAS locates local minima with binary strings (or binary matrices for multi-dimensional problems) by iterating the two operators; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., zero or one), while UDS performs increment or decrement to binary strings with no change of string length. Owing to these search routines, DEAS retains the optimization capability that combines the special features of several conventional optimization methods. In this paper, a special feature of BSS and UDS in DEAS is analyzed. In addition, a effective global search strategy is established by using information of DEAS. Effectiveness of the proposed global search strategy is validated through the well-known benchmark functions.

• Structural Engineering and Mechanics
• /
• 제45권2호
• /
• pp.183-199
• /
• 2013

Current methods of analysis of trusses depend on matrix formulations based on equilibrium equations which are in fact derived from energy principles, and compatibility conditions. Recently it has been shown that the minimum energy principle, by itself, in its pure and unmodified form, can well be exploited to analyze structures when coupled with an optimization algorithm, specifically with a meta-heuristic algorithm. The resulting technique that can be called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) has already been applied to analyses of linear and nonlinear plane trusses successfully as coupled with simulated annealing and local search algorithms. In this study the technique is applied to both 2-dimensional and 3-dimensional trusses emphasizing robustness, reliability and accuracy. The trials have shown that the technique is robust in two senses: all runs result in answers, and all answers are acceptable as to the reliability and accuracy within the prescribed limits. It has also been shown that Harmony Search presents itself as an appropriate algorithm for the purpose.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제12권1호
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.