• 한국측량학회지
• /
• 제31권2호
• /
• pp.111-119
• /
• 2013

항공 라이다로부터 획득한 대용량의 3차원 점 데이터로부터 대상 물체의 윤곽정보를 추출하는 것은 데이터 처리 과정에서 필수적이며 기반적인 기술 중의 하나이다. 특히 인공 구조물인 건물은 복잡한 현대 도시를 구성하는 주요 구조물이며 그 형태가 명확하기에 윤곽 정보의 추출 과정이 더욱 중요하다 할 수 있다. 본 연구에서는 항공 라이다를 이용하여 얻어진 건물을 구성하는 3차원 점 데이터로부터 건물의 윤곽정보를 추출하기 위하여 점 데이터의 기하정보만을 이용한 확장 카이(${\chi}$-Chi) 알고리즘을 제안한다. 제안된 알고리즘은 임의의 점군을 델로니(Delaunay) 삼각망으로 구성하고 특정 조건을 만족하는 변(edge)를 제거하는 과정을 통하여 구현된다. 덧붙여, 전체적인 추출과정의 효율화를 위해서 델로니 삼각망의 구성을 스윕헐 알고리즘을 적용하여 수행하였다. 본 연구에서 제안하는 확장 카이 알고리즘의 성능을 확인하기 위하여 본 연구와 같은 목적으로 개발된 인케이싱 폴리곤 제작 알고리즘과 알파 쉐이프 알고리즘을 비교하였고 기 제작된 건물의 도화정보를 이용하여 윤곽정보 추출의 정확도를 비교하였다. 실험결과, 본 연구에서 제안한 알고리즘은 기존의 알고리즘들보다 윤곽정보 추출 속도 및 정확도가 향상됨을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2011년도 제42회 하계학술대회
• /
• pp.648-649
• /
• 2011

This Paper presents an efficient approach for solving the economic dispatch (ED) problems with valve-point effects using an combination of particle swarm optimization and harmony search. To reduce a premature convergence effect of PSO algorithm, We proposed PSO-HS algorithm considering evolutionary using harmony search algorithm. To prove the ability of the PSO-HS in solving nonlinear optimization problems, ED problems with non-convex solution spaces are solved with three different approach(PSO, HS, combination of PSO and HS)

• 한국측량학회지
• /
• 제19권4호
• /
• pp.365-372
• /
• 2001

나라사이의 경계를 결정하기 위한 일반적인 방법은 등거리원칙이다. 등거리원칙은 각각의 기준선 또는 기준점의 경계에서 일정한 거리까지를 경계로 정하는 방법이다. 본 연구에서는 등거리 원칙을 기본으로 하는 알고리즘으로 폭넓게 사용되고 있는 Two-Point 알고리즘과 Three-Point 알고리즘을 정립한 후, 알고리즘을 적용한 결과와 오차를 확인할 수 있는 경계 획선 프로그램을 개발하였다. 이 프로그램은 인공지물이나 지형지물이 없어 경계를 결정하기 어려운 해양경계 획선시 특히 유용하게 사용될 수 있다. 그 중간점 계산결과 타원체상에서 등거리원칙에 기초한 알고리즘을 적용하면, 지도 투영에 의한 어떤 왜곡도 없이 적용할 수 있고 평면이나 구에서 적용한 것 보다 오차가 적었다. 경계 획선 프로그램 개발을 통하여 도면을 이용한 수작업에 의한 여러 오차를 제거 할 수 있고, 해양경계협상시 신속히 대처할 수 있다. 또한, 기준선의 기준점 위치에러는 계산된 중간선의 중간점으로 전파되는 것을 확인할 수 있었고 그 오차를 확인하여 적합한 기준면을 설정 할 수 있었다.

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

In the closed range space, the parallel two CCD cameras are used to acquire a pair of stereo image. The acquired stereo image are computed with Wavelet Transform repeatedly and including the low frequency component, the image size of those are reduced. It is the pyramid structure. The optimum matching point is searched to the pixel. Then appling the optimum matching point to DLT, it extract the three - dimensional surface coordinate from a stereo image. The direct linear transformation(DLT) method is used to calibrate the stereo camera compute the coordinate on a three dimensional space. To find the parameters for the DLT method, 30 control points which marked on the cylinder type object are used. To improve the matching algorithm, the paper select the pyramid structure for Wavelet Transform. The acquired disparity information is used to represent the really three-dimensional surface coordinate.

• Journal of Power Electronics
• /
• 제18권5호
• /
• pp.1448-1457
• /
• 2018

Many researchers devote themselves to develop model-predictive direct power control (MPDPC) so as to accelerate the response speed of the grid-connected systems, but they are troubled its large computing amount. On the basis of MPDPC, dual MPDPC (DMPDPC) is presented in this paper. The proposed algorithm divides the conventional MPDPC into two steps. In the first step, the optimal sector is obtained, which contains the optimal switching state in three-level converters. In the second step, the optimal switching state in the selected sector is searched to trace reference active and reactive power and balance neutral point voltage. Simulation and experiment results show that the proposed algorithm not only decreases the computational amount remarkably but also improves the steady-state performance. The dynamic response of the DMPDPC is as fast as that of the MPDPC.

• Nuclear Engineering and Technology
• /
• 제39권4호
• /
• pp.313-326
• /
• 2007

In this paper, an algorithm to reconstruct two orthogonal images into a three-dimensional image is developed in order to measure the bubble size and volume in a two-phase boiling flow. The central-active contour model originally proposed by P. $Szczypi\'{n}ski$ and P. Strumillo is modified to reduce the dependence on the initial reference point and to increase the contour stability. The modified model is then applied to the algorithm to extract the object boundary. This improved central contour model could be applied to obscure objects using a variable threshold value. The extracted boundaries from each image are merged into a three-dimensional image through the developed algorithm. It is shown that the object reconstructed using the developed algorithm is very similar or identical to the real object. Various values such as volume and surface area are calculated for the reconstructed images and the developed algorithm is qualitatively verified using real images from rubber clay experiments and quantitatively verified by simulation using imaginary images. Finally, the developed algorithm is applied to measure the size and volume of vapor bubbles condensing in a subcooled boiling flow.

• 한국지하수토양환경학회:학술대회논문집
• /
• 한국지하수토양환경학회 2004년도 임시총회 및 추계학술발표회
• /
• pp.97-100
• /
• 2004

Multivariate Newton Raphson method is developed to perform the particle tracking in the three dimensional area using four objective functions. In this method, three variables are solved to compute target point and actual and real tracking time. The simulated pathlines in various types of three dimensional elements are well matched with exact pathline.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• pp.169-172
• /
• 2002

This paper is concerned with walking trajectory generation by applying the genetic algorithm. The walking trajectory is generated though three via-points and genetic algorithm is employed to find velocity and acceleration at each via-point. Also genetic algorithm is applied for balancing joint trajectory. Fitness function is used for minimizing the trajectory. As a result, new algorithm generated the smooth trajectory. The proposed algorithm is verified by the experiment of biped walking robot developed in our Control laboratory, and we compared the result with the previous walking algorithm. It showed that the new proposed algorithm generated the better walking trajectory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5344-5356
• /
• 2018

Nowadays with the help of Location-Based Social Networks (LBSNs), users of Point-of-Interest (POI) recommendation service in LBSNs are able to publish their geo-tagged information and physical locations in the form of sign-ups and share their experiences with friends on POI, which can help users to explore new areas and discover new points-of-interest, and promote advertisers to push mobile ads to target users. POI recommendation service in LBSNs is attracting more and more attention from all over the world. Due to the sparsity of users' activity history data set and the aggregation characteristics of sign-in area, conventional recommendation algorithms usually suffer from low accuracy. To address this problem, this paper proposes a new recommendation algorithm based on a novel Preference-Content-Region Model (PCRM). In this new algorithm, three kinds of information, that is, user's preferences, content of the Point-of-Interest and region of the user's activity are considered, helping users obtain ideal recommendation service everywhere. We demonstrate that our algorithm is more effective than existing algorithms through extensive experiments based on an open Eventbrite data set.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1031-1033
• /
• 2005

This paper presents a system of handwritten numerals recognition, which is based on Ant-miner algorithm (data mining based on Ant colony optimization). At the beginning, three distinct fractures (also called attributes) of each numeral are extracted. The attributes are Loop zones, End points, and Feature codes. After these data are extracted, the attributes are in the form of attribute = value (eg. End point10 = true). The extraction is started by dividing the numeral into 12 zones. The numbers 1-12 are referenced for each zone. The possible values of Loop zone attribute in each zone are "true" and "false". The meaning of "true" is that the zone contains the loop of the numeral. The Endpoint attribute being "true" means that this zone contains the end point of the numeral. There are 24 attributes now. The Feature code attribute tells us how many lines of a numeral are passed by the referenced line. There are 7 referenced lines used in this experiment. The total attributes are 31. All attributes are used for construction of the classification rules by the Ant-miner algorithm in order to classify 10 numerals. The Ant-miner algorithm is adapted with a little change in this experiment for a better recognition rate. The results showed the system can recognize all of the training set (a thousand items of data from 50 people). When the unseen data is tested from 10 people, the recognition rate is 98 %.