• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.1312-1314
• /
• 2004

This paper proposes a new simplification algorithm that simplifies reconstructed polygonal mesh from 3D point set considering an original point set. Previous method computes error using mesh information, but it makes to increase error of difference between an original and a simplified model by reason of implementation of simplification. Proposed method simplifies a reconstructed model using an original point data, we acquire a simplified model similar an original. We show several simplified results to demonstrate the usability of our methods.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.365-372
• /
• 2004

Recently, the studies for mesh simplification have been increased according to the application area of the complicate 3D mesh models has been expanded. This paper introduces a novel method for mesh simplification which uses the properties of the mesh model in addition to the geometric locations of the model. The information of the 3D mesh model Includes surface properties such as color, texture, and curvature information as well as geometic information of the model. The most of current simplification methods adopt such geometric information and surface properties individually for mesh simplification. However, the proposed simplification method combines the geometric information and solace properties and applies them to the simplification process simultaneously. In this paper, we exploit the extended geometry based quadric error metric(QEM) which relatively allows fast and accurate geometric simplification of mesh. Thus, the proposed mesh simplification utilizes the quadric error metric based on geometric information and the surface properties such as color, normal, and texture. The proposed mesh simplification method can be expressed as a simple quadric equation which expands the quadric error metric based on geometric information by adding surface properties such as color, normal, and texture. From the experimental results, the simplification of the mesh model based on the proposed method shows the high fidelity to original model in some respects such as global appearance rather than using current geometry based simplification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4463-4482
• /
• 2020

Mesh model generated from 3D reconstruction usually comes with lots of noise, which challenges the performance and robustness of mesh simplification approaches. To overcome this problem, we present a novel method for mesh simplification which could preserve structure and improve the accuracy. Our algorithm considers both the planar structures and linear features. In the preprocessing step, it automatically detects a set of planar structures through an iterative diffusion approach based on Region Seed Growing algorithm; then robust linear features of the mesh model are extracted by exploiting image information and planar structures jointly; finally we simplify the mesh model with plane constraint QEM and linear feature preserving strategies. The proposed method can overcome the known problem that current simplification methods usually degrade the structural characteristics, especially when the decimation is extreme. Our experimental results demonstrate that the proposed method, compared to other simplification algorithms, can effectively improve the quality of mesh and yield an increased robustness on noisy input mesh.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.22 no.1
• /
• pp.63-71
• /
• 2004

This research is to reconstruction of railway alignment using GPS data, an investigation is made on the method of optimum simplification for reduction of unnecessary linear data, improve the accuracy by using four simplification algorithms among the methods. By applying two measured of displacement between observed data and it's simplification methods have been evaluated. The results showed that the complexities of lines is not practical to investigate simplification algorithms, the Douglas-Peucker method produced a little displacement between observed data and it's simplification. Its by using the Douglas-Peucker method to observed linear GPS data in railway track, design elements of horizontal alignment have been calculated. Then we could know that obtain the good results fur reconstruction of alignment elements through the methods and algorithns of this study.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.249-254
• /
• 2017

Digital vector maps must be compressed effectively for transmission or storage in Web GIS (geographic information system) and mobile GIS applications. This paper presents a polyline compression method that consists of polyline feature-based hybrid simplification and second derivative-based data compression. Experimental results verify that our method has higher simplification and compression efficiency than conventional methods and produces good quality compressed maps.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.151-153
• /
• 2001

Feature Simplification is an essential method for multiple representations of spatial features in GIS. However, spatial features re various, complex and a alrge size. Among spatial features which describe spatial information. linear feature is the msot common. Therefore, an efficient linear feature simplification method is most critical for spatial feature simplification in GIS. This paper propose an original method, by which the problem of linear feature simplification is mapped into the signal processing field. This method avoids conventional geometric computing in existing methods and exploits the advantageous properties of wavelet transform. Experimental results are presented to show that the proposed method outperforms the existing methods and achieves the time complexity of O(n), where n is the number of points of a linear feature. Furthermore, this method is not bound to two-dimension but can be extended to high-dimension space.

• International Commerce and Information Review
• /
• v.6 no.3
• /
• pp.203-224
• /
• 2004

The purpose of this study is to review and analyze the protection measures for the importer's interests through the utilization of electronic delivery order(e-D/O) with the implementation of trade facilitation measures such as the simplification of customs procedures by the Korea Customs Service. The Korea Customs Service has been introducing several custom facilitation measures through the use of EDI system in the export and import processes. Korea has also already achieved a comparable level of sophistication in trade automation and custom simplification field. However, the full benefits of the trade automation and custom simplification measures have not yet achieved through the frequent illegal delivery of the imported goods in the bonded areas. Therefore, it is argued in this study that the introduction and the full utilization of e-D/O would help to reap the trade automation and custom simplification measures in Korea. In conclusion, it is emphasized that it would be very crucial for the Korean government to introduce the trusted repository for distribution of the electronic trade-related documents and the construction of the one stop single window platform for the trade and customs facilitation.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.418-429
• /
• 2013

This paper presents a GIS vector map data compression scheme based on hybrid polyline simplification method and SEC(spatial energy compaction). The proposed method extracts all layers which contain polylines in the GIS vector map and compress all polylines in extracted layers by the hybrid polyline simplification and SEC based on MAE(minimum area error) for each segment in the line. The proposed simplification and SEC increase the compression ratio while preserving the shape quality. We analyze the visual aspects and compression efficiency between the original GIS vector map and the compressed map. From experimental results, we verify that our method has the higher compression efficiency and visual quality than conventional methods.

• Phonetics and Speech Sciences
• /
• v.1 no.1
• /
• pp.33-40
• /
• 2009

This study examines how young speakers of Seoul Korean produce tri-consonantal clusters /1kt/ and /1pt/ as in palk-ta ('to be bright') and palp-ta ('to step on'). Production data were collected from 20 speakers of Seoul Korean. The results of narrow transcription of the data showed that simplification is not obligatory as some speakers often preserve all three consonants. When simplified, there was a clear asymmetry between /1kt/ and /1pt/. Speakers showed no clear preference for either C1 preservation (C1=/1/) or C2 preservation (C2=/k/ in /1kt/ and /p/ in /1pt/) in production of /1kt/, but in production of /1pt/, strong preference was found for C1-preserved to C2-preserved variant. When compared with production data in Cho (1999), simplification patterns appear to have changed over the past 10 years, in a direction to preserve the first member of the cluster (/1/) more often, especially with /1kt/. There was no substantial between-item variation, indicating that simplification patterns are not lexically specified. Finally, the results suggest that the process of tri-consonantal simplification has not been fully phonologized in the grammar of the language as evident in substantial inter- and intra-speaker variation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.51-58
• /
• 2004

In this paper, a mesh simplification algorithm is proposed which considers the conservation of the volume of a 3D model. In General, most of mesh simplification algorithm use a distance metric. The distance metric is very efficient to measure geometric error, but it causes volume changes between the original model and the simplified model. In this paper a mesh simplification algorithm which conserves the volume of the original model is suggested. A new vertex resulting from an edge contraction, takes a position which conserves the volume of the 3D model using the proposed algorithm. Although the new algorithm needs more time than the QEM algorithm, it is shown that it conserves the original volumn of the 3D model during the simplification.