• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.212-215
• /
• 2001

본 논문에서는 평면 형상에 대한 새로운 계층적 표현 방법을 소개하였다. 제안한 방법에서는 근사화 과정의 근사화 오차(approximation error)를 근사화 순서와 정도를 결정하는 중요한 척도로 활용하였으며, 제안한 오차 조절 알고리즘을 통해 보다 자연스러운 근사화 표현이 가능하도록 하였다. 그리고 최소 경계 사각형(MBR: Minimum Bounding Rectangle)을 단순 확장한 최소 경계 팔각형(MBO: Minimum Bounding Octangle)을 지역화에 응용하였으며, 이는 다른 지역화 방법들과 비교하였을 때 상대적으로 더 효율적인 방법임을 확인할 수 있었다.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.135-148
• /
• 2012

This paper proposes a model for recognizing sentential paraphrases through Predicate-Argument Tuple (PAT)-based approximate alignment between two texts. We cast the paraphrase recognition problem as a binary classification by defining and applying various alignment features which could effectively express the semantic relatedness between two sentences. Experiment confirmed the potential of our approach and error analysis revealed various paraphrase patterns not being solved by our system, which can help us devise methods for further performance improvement.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.18-27
• /
• 2002

A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

• Journal of the Society of Naval Architects of Korea
• /
• v.35 no.4
• /
• pp.118-125
• /
• 1998

This paper presents the hybrid curve approximation with geometric boundary conditions as position vector and tangent vector of start and end point using a B-spline approximation and a genetic algorithm First, H-spline approximation generates control points to fit B-spline curries through specified data points. Second, these control points are modified by genetic algorithm(with floating point representation) under geometric boundary conditions. This method would be able to execute the efficient design work without fairing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.534-537
• /
• 2010

반투명 재질의 효과적인 표현을 위해서 일반적으로 사용되는 빛의 확산 모델은 일반적 확산 모델(Standard Diffusion model: SDA)이다. 그러나 일반적 확산 모델은 흡수 변수 (absorption coefficient) ${\sigma}_a$가 감소한 산란 변수(reduced scattering coefficient) ${\sigma}_s$ 보다 상대적으로 큰 재질에 대해서는 부정확한 한계를 가지고 있다. 이러한 한계를 극복하기 위하여 다양한 모델이 제시되었다. $P_N$ 근사화 이론은 이러한 일반적 확산 모델이 가지고 있는 한계를 잘 극복한다. 우리는 일반적 확산 모델을 기반으로 하고 $P_3$ 근사화 이론의 변수들을 이용하는 hybrid-P3 근사화 방법을 이용하여 흡수 변수가 감소한 산란 변수보다 상대적으로 큰 재질을 그래픽 공간 상에서 효과적으로 표현하는 방법을 제시한다. 또한 그 재질의 광학적 특성을 추정하기 위하여 우리가 제안하는 모델에 적합한 측정장비를 개발하다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.425-428
• /
• 2001

본 논문에서 구현한 메쉬 편집기는 편집할 메쉬의 몇몇 점을 편집할 경우, 편집 정보가 그 점에 이웃한 점들에게도 영향을 미치게 되어, 편집 결과가 근사된 부드러운 곡면으로 표현하도록 하는 데 있다. 그러기 위해서는 3차원의 메쉬를 2차원 평면으로 매핑할 때, 매핑되는 원래의 메쉬의 모양이 크게 변형되지 않도록 하여야 하는데, 여기에 모양 유지 매개 변수화 방법을 사용하고 있다. 편집에 사용된 점의 편집 정보는 2차원 평면 다각형 안에 있는 서로 대응되는 점으로 매핑 되고, B-스플라인 보간으로 편집 정보는 2차 평면 안에 있는 다른 점들에게도 영향을 주게 된다. 이런 결과는 3차원 메쉬로 환원되어 부드럽게 근사된 곡면으로 표현된다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3689-3696
• /
• 2011

In decision support system, knowledge workers require aggregation operations of the large data and are more interested in the trend analysis rather than in the punctual analysis. Therefore, it is necessary to provide fast approximate answers rather than exact answers, and to research approximate query answering techniques. In this paper, we propose a new approximation query answering method which is based on Fuzzy C-means clustering (FCM) method and Adaptive Neuro-Fuzzy Inference System (ANFIS). The proposed method using FCM-ANFIS can compute aggregate queries without accessing massive multidimensional data cube by producing the KR model of multidimensional data cube. In our experiments, we show that our method using the KR model outperforms the NMF method.

• 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%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.453-456
• /
• 2003

Spatial database systems achieve filtering steps with MBR(Minimum founding Rectangle) for efficient query processing, and then carry out refinement steps for candidate objects. While most operations require fast execution of filtering, it is necessary to increase the filtering rates and reduce the number of refinement steps in the low computing powered devices. The compact representation method is also needed in the mobile devices with low storage capacity. The paper proposes various approximation methods for efficient spatial operations in the multiplatform environments. This paper also designs a compression technique for MBR, which occupies almost 80% of index data in the two dimensional case. We also analyze the advantages and drawbacks of each method in terms of space utilization, filtering efficiency and speed.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.