• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• 지구물리와물리탐사
• /
• 제17권3호
• /
• pp.137-146
• /
• 2014

원주 KSRS 지진관측망을 이용하여 한반도 및 주변지역의 인공지진원을 식별하기 위한 연구를 수행하였다. 신호대 잡음비가 높은 자연지진 150개와 인공지진 56개를 선별하여 표본 집단을 형성하였다. 2차원 Pg/Lg 스펙트럼 진폭 비의 격자를 구성하여 지진원 식별이 용이한 최적의 주파수 영역으로 Pg(4-6 Hz)/Lg(5-7 Hz)을 도출하였다. 스펙트럼으로 부터 진폭에 대한 지진 규모와 진원 거리의 영향을 보정함으로써 식별 능력을 향상시키고자 하였다. 지진모멘트에 대한 모서리주파수의 역비례 관계로 인한 규모 의존 효과를 보정하기 위하여, Brune의 진원 모델을 가정한 이론 스펙트럼을 관측 스펙트럼에서 제거하였다. 진원 거리에 따른 감쇠효과를 제거하기 위하여, 최적의 감쇠상수를 계산하여 스펙트럼을 보정하였다. 지진파 전파 경로에 대한 보정으로 지역에 따라 스펙트럼 진폭 비가 달라지는 효과를 제거하였다. 자연지진과 인공지진 표본 집단 사이의 식별 정도를 각 보정 단계에서 Mahalanobis 거리 계산을 통하여 비교하였다. 규모와 거리 및 경로 보정 전후 두 표본 집단 사이의 Mahalanobis 거리가 1.98에서 3.01로 증가하여 식별 결과에 뚜렷한 향상이 있었다.

• 한국측량학회지
• /
• 제31권6_1호
• /
• pp.483-491
• /
• 2013

차량용 내비게이션의 빠른 확산과 스마트폰 등 개인 단말기의 측위 기술 발달로 사용자 중심위치기반서비스, 특히 보행자 내비게이션 서비스에 대한 관심이 증대되고 있다. 보행자 내비게이션 서비스를 위한 핵심정보인 수치지도는 대용량이고 짧은 갱신주기를 요구하는 경우가 많아 수치지도의 효율적인 갱신이 중요한 이슈가 된다. 본 연구에서는 구축시기가 상이한 이종의 도로망 데이터 셋에 형상유사도 기반 면 객체 매칭을 적용하여 변화 탐지하는 기법을 제안하였다. 변화탐지에 앞서 이종의 도로망 데이터 셋의 면 객체 매칭에서 탐지될 수 있는 갱신 유형을 정의하였다. 면 객체 매칭 기반 변화 탐지를 위하여 이종의 두 도로망 데이터 셋의 선형인 도로객체를 이들로 둘러싸인 면인 블록으로 변환하였다. 변환된 블록을 중첩하여 중첩된 블록 간의 형상유사도를 계산하고, 이 값이 0.6 이상인 것을 후보 블록 쌍으로 추출하였다. 객체 유형별로 이분 그래프 군집화와 오목다각형 특성을 적용하여 정의된 갱신유형별 블록 쌍을 탐지하고, 해당 블록 쌍을 구성하거나 내부에 있는 도로 세그먼트 간의 프레셰 거리를 계산하였다. 이때, 프레셰 거리가 50 이상인 도로명주소기본도 도로구간의 도로객체가 갱신 도로객체로 추출된다. 그 결과 0.965의 높은 탐색율을 보여 제안된 기법이 이종의 도로망 데이터 셋의 선형 객체의 변화탐지에 적용될 수 있음을 확인할 수 있었다.

• 대한수학회보
• /
• 제47권5호
• /
• pp.889-905
• /
• 2010

In this paper, a distribution free approach to the parameter estimation of a simple bilinear model with periodic coefficients is presented. The proposed method relies on minimum distance estimator based on the autocovariances of the squared process. Consistency and asymptotic normality of the estimator, as well as hypotheses testing, are derived. Numerical experiments on simulated data sets are presented to highlight the theoretical results.

• ETRI Journal
• /
• 제32권4호
• /
• pp.630-633
• /
• 2010

In this letter, we propose a novel polygonal approximation of digital curves that preserve original shapes. The proposed method first detects break points, which have two different consecutive vectors, and sets an initial dominant point set. The approximation is then performed iteratively by deleting a dominant point using a novel distance, which can measure both the distance and the angle acuteness. The experimental results show that the proposed method can preserve original shapes and is appropriate for various shapes, including slab-sided shapes.

• Korean Journal of Mathematics
• /
• 제29권1호
• /
• pp.81-89
• /
• 2021

In this paper, we introduce the notions of a distance function, Alexandrov topology and ⊖-upper (⊕-lower) approximation operator based on complete co-residuated lattices. Under various relations, we define (⊕, ⊖)-fuzzy rough set on complete co-residuated lattices. Moreover, we study their properties and give their examples.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2005년도 학술발표회 논문집
• /
• pp.943-947
• /
• 2005

This study was intended to interpose an objection about the analysis of rainfall spatial distribution without a proper standard, and offer the improved approach using 1,he geostatistical analysis method to analyze it. For this, spatially distributed daily rainfall data sets were collected for 41 weather stations in study area, and variogram and correlation analysis were conducted. In the results of correlation analysis, it was found that the longer distance between the stations reduces the correlation of the rainfall data, and maltes the characteristics of the rainfall spatial distribution. The variogram analysis shows that correlation range was less than 50 km for the 17 daily rainfall data sets of total 91 sets. It says that it involves some rike, to determine the application method for rainfall spatial distribution without some qualifications, hence the Application standards of the Rainfall Spatial Distribution Analysis Technique, were essential and that was contingent on characteristics of rainfall and landscape.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권3호
• /
• pp.181-187
• /
• 2014

Dealing with uncertainty is always a challenging problem. Intuitionistic fuzzy sets was presented to manage situations in which experts have some membership and non-membership value to assess an alternative. Hesitant fuzzy sets was used to handle such situations in which experts hesitate between several possible membership values to assess an alternative. In this paper, the concept of intuitionistic hesitant fuzzy set is introduced to provide computational basis to manage the situations in which experts assess an alternative in possible membership values and non-membership values. Distance measure is defined between any two intuitionistic hesitant fuzzy elements. Fuzzy technique for order preference by similarity to ideal solution is developed for intuitionistic hesitant fuzzy set to solve multi-criteria decision making problem in group decision environment. An example is given to illustrate this technique.

• Journal of Computational Design and Engineering
• /
• 제2권3호
• /
• pp.183-194
• /
• 2015

This paper proposes a novel method for visualizing the thickness and clearance of 3D objects in a polyhedral representation. The proposed method uses the distance field of the objects in the visualization. A parallel algorithm is developed for constructing the distance field of polyhedral objects using the GPU. The distance between a voxel and the surface polygons of the model is computed many times in the distance field construction. Similar sets of polygons are usually selected as close polygons for close voxels. By using this spatial coherence, a parallel algorithm is designed to compute the distances between a cluster of close voxels and the polygons selected by the culling operation so that the fast shared memory mechanism of the GPU can be fully utilized. The thickness/clearance of the objects is visualized by distributing points on the visible surfaces of the objects and painting them with a unique color corresponding to the thickness/clearance values at those points. A modified ray casting method is developed for computing the thickness/clearance using the distance field of the objects. A system based on these algorithms can compute the distance field of complex objects within a few minutes for most cases. After the distance field construction, thickness/clearance visualization at a near interactive rate is achieved.

• International Journal of Contents
• /
• 제12권1호
• /
• pp.1-5
• /
• 2016

To manipulate large video contents, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-wise user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm that extracts key frames using color histograms and matches the video sequences using edge features. To effectively match video sequences with a low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with real sequence show that the proposed video sequence matching algorithm using edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.