• Spatial Information Research
• /
• 제16권4호
• /
• pp.489-497
• /
• 2008

주택시장에 대한 헤도닉분석을 위해 GIS가 활발하게 사용되고 있다. 그 것은 GIS를 이용할 경우 헤도닉 분석에서 필수적인 위치 변수를 손쉽게 측정할 수 있기 때문이다. 현재까지 국내의 주택시장을 대상으로 하는 헤도닉 분석은 전자지도상에서 포인트들로 표현된 공동주택 단지와 여러 중요 도시내 위치간의 직선최단거리를 측정하는 데 GIS를 이용하고 있다. 그런데 이상의 연구들에서 간과한 점은 실제의 직선최단거리는 포인트보다는 폴리곤으로 보다 정확하게 측정될 수 있다는 점이다. 물론 GIS에 기반한 헤도닉 분석에서 공동주택을 나타내는 데 포인트를 사용하느냐와 폴리곤을 사용하느냐는 연구의 목적에 따라 관심의 대상이 아닐 수 있다. 그러나 추정되는 모델의 질을 향상시키는 것이 목적이라면 선택에 신중을 기해야 할 문제이다. 이런 배경에서 본 연구에서는 서울 강북지역 공동주택의 위치를 포인트와 폴리곤으로 전자지도상에 각각 나타낸 후 각각의 경우 추정된 헤도닉 모델에 대해 Davidson and MacKinnon Test를 적용하여 어떤 경우 보다 우월한 모델이 추정되었는지 검증해 보았다. 검증결과 공동주택 단지를 폴리곤으로 나타낼 경우 이에 기반한 최단 직선거리 변수를 포함한 모델추정 결과가 우월한 것으로 나타났다. 이 결과가 의미하는 것은 GIS를 이용한 공동주택시장에 대한 헤도닉 모델추정에서 공동주택단지를 GIS 지도상에 폴리곤으로 나타내고 이를 기반으로 다양한 위치관련 변수를 추정하는 것이 보다 나은 모델 추정결과를 가져올 수 있다는 점이다.

• International Journal of Precision Engineering and Manufacturing
• /
• 제8권1호
• /
• pp.3-10
• /
• 2007

A new approach based on implicit surface interpolation combined with domain decomposition is proposed for filling complex-shaped holes in a large polygon model, A surface was constructed by creating a smooth implicit surface from an incomplete polygon model through which the actual surface would pass. The implicit surface was defined by a radial basis function, which is a continuous scalar-value function over the domain $R^{3}$. The generated surface consisted of the set of all points at which this scalar function is zero. It was created by placing zero-valued constraints at the vertices of the polygon model. The well-known domain decomposition method was used to treat the large polygon model. The global domain of interest was divided into smaller domains in which the problem could be solved locally. The LU decomposition method was used to solve the set of small local problems; the local solutions were then combined using weighting coefficients to obtain a global solution. The validity of this new approach was demonstrated by using it to fill various holes in large and complex polygon models with arbitrary topologies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.2926-2945
• /
• 2017

In geo-location database oriented spectrum sharing system, the entire geographic area is divided into meshes to classify, store and delivery the cognitive information. In this paper, we propose a flexible polygon mesh division scheme to reduce the number of meshes. Hence the cognitive information can be reduced correspondingly. Besides, polygon mesh can approximate the real environment and reduce the error of cognitive information because the edges of polygon are selected along the boundaries of the networks. We have designed the polygon approximation algorithm and have analyzed the relation between the error and the number of polygon's edges. Finally, the simulation results are provided to verify the algorithm and analysis. The polygon mesh division scheme in this paper provides an efficient approach for cognitive information organization in database oriented spectrum sharing system.

• 한국CDE학회논문집
• /
• 제3권3호
• /
• pp.145-153
• /
• 1998

An approach has been developed to generate parametric models with Boolean operations. The approach combines Boolean operations and graph manipulation on the constraints imposed on primitives. A Boolean operation is first performed on two primitives and new geometric elements such as vertices and edges are computed. Then to generate the constraint graph of the polygon the each constraints graph of two primitives are merged by adding the new geometric elements with its corresponding constraints. In the merging process, some of the geometric elements belonging to the primitives may be eliminated based on its contribution to the polygon. A computer implementation in a 2D space is described to illustrate the approach with examples.

• International Journal of Ocean System Engineering
• /
• 제3권1호
• /
• pp.22-32
• /
• 2013

A heuristic physical theory of diffraction (PTD) for an acoustic impedance wedge is proposed. This method is based on Ufimtsev's three-dimensional PTD, which is derived for an acoustic soft or hard wedge. We modify the original PTD according to the process of physical optics (or the Kirchhoff approximation) to obtain a 3D heuristic diffraction model for an impedance wedge. In principle, our result is equivalent to Luebbers' model presented in electromagnetism. Moreover, our approach provides a useful insight into the theoretical basis of the existing heuristic diffraction methods. The derived heuristic PTD is applied to an arbitrary impedance polygon, and a simple PTD formula is derived as a supplement to the physical optics formula.

• 한국정밀공학회지
• /
• 제24권11호
• /
• pp.134-143
• /
• 2007

A new approach based on mean value coordinate combined with Laplacian coordinate is proposed for shape deformation of a large polygon model composed of triangular net. In the method, the spherical mean value coordinates for closed control meshes is introduced to describe a vertex in the triangle meshes to be deformed. Furthermore, the well known quardratic least square method for the Laplacian coordinates is employed in order to deform the control meshes. Because the mean value coordinates are continuous and smooth on the interior of control meshes, deforming operation of control meshes change the shape of polygon model while preserving the intrinsic surface detail. The effectiveness and validity of this novel approach was demonstrated by using it to deform large and complex polygon models with arbitrary topologies.

• 한국정밀공학회지
• /
• 제23권1호
• /
• pp.174-184
• /
• 2006

In order to fill the holes with complex shapes in the large polygon model, a new approach which is based on the implicit surface interpolation method combined with domain decomposition method is presented. In the present study, a surface is constructed by creating smooth implicit surface from the incomplete polygon model through which the surface should pass. In the method an implicit surface is defined by a radial basis function, a continuous scalar-valued function over the domain $R^3$ The generated surface is the set of all points at which this scalar function takes on the value zero and is created by placing zero-valued constraints at the vertices of the polygon model. In this paper the well-known domain decomposition method is used in order to treat the large polygon model. The global domain of interest is divided into smaller domains where the problem can be solved locally. LU decomposition method is used to solve a set of small local problems and their local solutions are combined together using the weighting coefficients to obtain a global solution. In order to show the validity of the present study, various hole fillings are carried out fur the large and complex polygon model of arbitrary topology.

• 한국멀티미디어학회논문지
• /
• 제21권2호
• /
• pp.300-309
• /
• 2018

Detection of vanishing point is a challenging task in the situations where there are several structures with straight lines. Commonly used approaches for determining vanishing points involves finding the straight lines using edge detection and Hough transform methods. This approach often fails to perform effectively when there are a lot of straight lines found. The lines not meeting at a vanishing point are considered to be noises. In such situation, finding right candidate lines for detecting vanishing points is not a simple task. This paper proposes to use reference objects for vanishing point detection. By analyzing a reference object, it identifies the contour of the object, and derives a polygon from the contour information. Then the edges of the detected polygon are used to find the vanishing points. Our experimental results show that the proposed approach can detect vanishing points with comparable accuracy to the existing edge detection based method. Our approach can also be applied effectively even to complex situations, where too many lines generated by the existing methods make it difficult to select right lines for the vanishing points.

• 대한원격탐사학회지
• /
• 제37권1호
• /
• pp.111-122
• /
• 2021

Building footprint extraction is an active topic in the domain of remote sensing, since buildings are a fundamental unit of urban areas. Deep convolutional neural networks successfully perform footprint extraction from optical satellite images. However, semantic segmentation produces coarse results in the output, such as blurred and rounded boundaries, which are caused by the use of convolutional layers with large receptive fields and pooling layers. The objective of this study is to generate visually enhanced building objects by directly extracting the vertices of individual buildings by combining instance segmentation and keypoint detection. The target keypoints in building extraction are defined as points of interest based on the local image gradient direction, that is, the vertices of a building polygon. The proposed framework follows a two-stage, top-down approach that is divided into object detection and keypoint estimation. Keypoints between instances are distinguished by merging the rough segmentation masks and the local features of regions of interest. A building polygon is created by grouping the predicted keypoints through a simple geometric method. Our model achieved an F1-score of 0.650 with an mIoU of 62.6 for building footprint extraction using the OpenCitesAI dataset. The results demonstrated that the proposed framework using keypoint estimation exhibited better segmentation performance when compared with Mask R-CNN in terms of both qualitative and quantitative results.

• 한국정보과학회논문지:시스템및이론
• /
• 제33권10호
• /
• pp.777-788
• /
• 2006

물체의 표면에 돌출된 형상을 실시간으로 표현하는 변위매핑 방법에 대하여 설명한다. 기존의 이미지 기반 변위매핑 방법이 기준면에서 함몰된 형상만을 표현할 수 있는 것과 달리, 기준면에서 수직방향으로 돌출된 높이를 표현하여, 표면에서 돌출된 형상의 상세를 실시간으로 표현한다. 또한 폴리곤의 경계부분에서 시점에 따라 수직인 두 개의 면을 추가하여, 기준면의 경계 외부로 초과하는 픽셀의 변위를 표현하였다. 이로써 경계부분의 돌출 형상에 대한 정확한 외곽선을 표현할 수 있다. 제안된 방법은 부드러운 돌출 형상의 표현과 더불어 돌출 형상의 급격한 경사면에 텍스처 정보를 추가하여, 수직 돌출 형상을 포함한 급격한 경사면을 표현할 수 있다. 이 방법은 GPU에서 수행 가능한 픽셀 단위 계산으로 이루어져 실시간으로 가시화가 가능하며, 경계부위의 정확한 외곽선의 표현과 급격한 돌출 형상의 표현이 가능하여, 건물과 같이 기준면에서 돌출된 형상의 상세 표현에 사용된다.