• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.667-669
• /
• 2003

특징 형상의 조합으로 표현될 수 없는 자유 형상을 가진 제품이 늘어남에 따라 자유형상을 효율적으로 변형시키는 기법이 필요하다. 여러 가지 자유형상 변형기법(FFD) 가운데에서 자유 형상을 파라메트릭하게 컨트롤하기 위해서는 조정 다각형 기반의 형상 변형 기법이 적합하다. 이에 따라 본 연구에서는 FFD 기법을 적용하여 자유형상 모델을 파라메트릭하게 컨트롤하기 위해 입력 모델에 대한 조정 다각형을 자동으로 생성하는 알고리즘을 제안하였다. 제안된 알고리즘은 크게 기본 조정 다각형 생성과 조정 다각형 최적화 단계로 나누어진다. 기본 다각형 생성에서는 1)입력모델을 직교 3방향에 투영, 2)투영된 결과에 대해 2차원 조정 다각형을 생성, 3)2차원 조정 다각형을 조합하여 3차원 기본 조정 다각형 생성의 단계를 거친다. 조정 다각형 최적화 단계에서는 기본 조정 다각형에 에지 및 면 연산자를 적용하여 입력 모델에 더욱 근사하는 최종 조정 다각형을 생성한다. 예제에서는 제안된 알고리즘을 통해 자동으로 생성된 조정다각형을 자동차 모델에 적용하여 모델의 형상을 변화시킨 결과를 보였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.495-500
• /
• 2002

3D 컴퓨터 그래픽스 분야에서 사용되는 표면모델은 일반적으로 매우 복잡하고 방대한 양의 다각형 조각들로 구성된다. 이러한 표면 모델들은 사실감을 높일 수 있지만 지나치게 많은 데이터 양으로 인해 많은 문제들을 야기시킬 수 있다. 따라서 모델의 원래 모양을 가능하면 유지하면서 방대한 양의 데이터를 효과적으로 감소시킬 수 있는 방법이 필요하다. 본 논문에서는 지역표면의 기하학적 특성을 잘 보존할 수 있는 에지 비용함수를 제안한다. 또한 병합에 기반 한 반복적인 에지 축약을 기본 연산으로 하는 표면 간략화 알고리즘을 구현한다. 병합에 기반 한 축약방법은 메모리를 효율적으로 사용할 수 있게 하여 실시간 데이터 전송을 요하는 응용 시스템에 매우 효과적으로 적용될 수 있다. 제안하는 알고리즘을 표면모델에 적용시켜 간략화를 수행 한 결과 기존의 알고리즘에 비해 높은 품질의 근사모델을 얻을 수 있었으며 원래 모델의 세부적인 모양을 잘 보존할 수 있었다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.17 no.1
• /
• pp.31-38
• /
• 2004

Mechanical design process is generally accomplished by design, analysis, and test. Designers use programs fitting purpose, and obtain repeatedly a response of a simulation program, a sub-program for optimization. In this paper, shape optimization using approximate optimization technique is carried out with sequential design domain(SDD). In addition, algorithm executing Pro/Engineer and ANSYS automatically are adopted in the approximate optimization program by SDD. It is difficult for design problem to be approximated accurately for the whole range of design space. However, more or less accurate approximation is constructed if SDD is applied to that case. SDD starts with a certain range which is off-seted from midpoint of an initial design domain and then SDD of the next step is determined by a move limited. Convergence criterion is defined such that optimal point must be located within SDD during the two steps. Also, the PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information and the active set strategy, in order to seek the direction of design variables.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.157-164
• /
• 2001

This paper studies on the processing of spatial joins. The spatial join operation is divided into filters and refinement steps in general. The processing of spatial joins can be greatly improved by the use of filters that reduce the polygons in order to find the intersecting ones. As a result, three possible sets of answers are identified: the positive one, the negative one and the inconclusive one. To identify all the interesting pairs of polygons with inconclusive answers, it is necessary to have access to the representation of polygons so that an exact geometry test can take place. We introduce a bit-map approximation technique to drastically reduce the computation required by the refinement step during refinement processing. Bit-map representation are used for the description of the internal, the external and the boundary regions of the polygon objects. The proposed scheme increases the chance of trivial acceptance and rejection of data objects, and reduces unnecessary disk accesses in query processing. It has been shown that the reference to the object data file can be cut down by as much as 60%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.503-510
• /
• 2003

In CDMA cellular system, because all users share the frequency resource the signals of other user becomes interference which influences the communication quality. The system capacity defined the number of connected users within a cell is determined by the amount of interference, therefore the exact estimation of interference is important to system performance evaluation. In this paper, we propose an approximated function which calculates other cell interference in terms of Riemann-Zeta function in CDMA cellular systems, and compare with simulation results in other to verify its usefulness. The upper and lower bounds of system capacity calculated with the proposed approximated function gives almost alike result with the simulation. The proposed interference bounds are useful to calculate system capacity and to evaluate some algorithm in a hierarchical cellular systems where various propagation environments are mixed.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.1
• /
• pp.42-48
• /
• 2006

In this study, a repetitive response surface enhancement technique (RRSET) is proposed as a new system approximation method for the efficient multidisciplinary design and optimization (MDO). In order to represent the highly nonlinear behavior of the response with second order polynomials, RRSET introduces a design space transformation using stretching functions and repetitive response surface improvement. The tentative optimal point is repetitively included to the set of experimental points to better approximate the response surface of the system especially near the optimal point, hence a response surface with significantly improved accuracy can be generated with very small experimental points and system iterations. As a system optimizer, the simulated annealing, which generates a global design solution is utilized. The proposed technique is applied to several numerical examples, and demonstrates the validity and efficiency of the method. With its improved approximation accuracy, the RRSET can contribute to resolve large and complex system design problems under MDO environment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.210-218
• /
• 2002

This paper proposes an efficient separation method of the composite images by using independent component analysis(ICA) based on neural networks of the approximate learning algorithm. The Proposed learning algorithm is the fixed point(FP) algorithm based on Secant method which can be approximately computed by only the values of function for estimating the root of objective function for optimizing entropy. The secant method is an alternative of the Newton method which is essential to differentiate the function for estimating the root. It can achieve a superior property of the FP algorithm for ICA due to simplify the composite computation of differential process. The proposed algorithm has been applied to the composite signals and image generated by random mixing matrix in the 4 signal of 500-sample and the 10 images of $512{\times}512-pixel$, respectively The simulation results show that the proposed algorithm has better performance of the learning speed and the separation than those using the conventional algorithm based method. It also solved the training performances depending on initial points setting and the nonrealistic learning time for separating the large size image by using the conventional algorithm.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1123-1130
• /
• 2009

The advances in networking technology and importance of multimedia communication require real time transaction. In many applications, high reliable real-time communications are required more frequently. In this paper, we propose a reliable communication in cube-based multi -computer using the safety vector. Each node in a cube-based n dimensional multi-computer is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. We propose an algorithm that can establish detour paths using the safety vector. The established detour paths are disjoint with the primary real-time channel. Therefore, our algorithm is more efficient than earlier proposed algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.3
• /
• pp.10-17
• /
• 2003

In this paper, genetic algorithm (GA)-based Thin Film Bulk Acoustic Resonator (FBAR) RF filter design technique is proposed. Since the BVD(Butterworth-Van Dyke) lumped element model is valid only around the resonance, FBAR filter design technique based on BVD circuit has an approximate error. Instead of using BVD model, optimizing filter design method utilizes an analytical electrical impedance equation of FBAR. The geometry of FBAR such as thickness of the piezoelectric layer and area which significantly affect the filter response is optimized by GA. US-PCS Rx Bandpass filter obtained by the proposed technique shows a better response comparing with the typical and BVD-based filter.