• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.132-139
• /
• 2012

Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1612-1616
• /
• 2006

For map services in the mobile environment, it should be considered that resource restriction or the mobile device. on, if a map database dedicated to mobile services may not be developed, the spatial data extracted from general map databases should be simplified before transmitting. % is paper suggests the filtering methods to manipulate the spatial data, which are changed to be able to displayed on the mobile devices. The suggested methods are evaluated by experiments. This method is based on the map generalization operator 'selection' and is refined to adapt on mobile phone environments.

• Journal of Broadcast Engineering
• /
• v.12 no.2
• /
• pp.112-119
• /
• 2007

Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data as well should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data hiding scheme. The difference expansion method achieves high embedding capacity and keeps the distortion low. This paper shows that the difference expansion method with simplified location map, and new expandability and changeability can achieve more embedding capacity while keeping the distortion almost the same as the original expansion method.

• Journal of Advanced Navigation Technology
• /
• v.13 no.1
• /
• pp.142-150
• /
• 2009

It is very important to generate a simplified model from a complex 3D character in computer game. We propose a new method of extracting feature lines from a 3D game character. Given an unstructured 3D character model containing texture information, we use model feature map (MFM), which is a 2D map that abstracts the variation of texture and curvature in the 3D character model. The MFM is created from both a texture map and a curvature map, which are produced separately by edge-detection to locate line features. The MFM can be edited interactively using standard image-processing tools. We demonstrate the technique on several data sets, including, but not limited to facial character.

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

The paper persents an efficient method of extracting line segment in a grid map. The grid map is composed of 2-D grids that have both the occupancy and orientation probabilities based on the simplified Bayesian updating model. The probabilities and orientations of cells in the grid map are continuously updated while the robot explorers to their values. The line segments are, then, extracted from the clusters using Hough transform methods. The eng points of a line segment are evaluated from the cells in each cluster, which is simple and efficient comparing to existing methods. The proposed methods are illustrated by sets of experiments in an indoor environment.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.22 no.4
• /
• pp.375-381
• /
• 2004

This study is to improve an automatic rate of mapping system through analysis of topographic map specification. The digital map ver 2.0(1/5,000) has used for this studv and the mapping information is to obtain digital and topographic map. This topographic map specification is compared with information that represented of today. The regulation of a map specification for automatic mapping system planed out $\circled1$ similar specification of topographic map $\circled2$ simplified specification $\circled3$ clearness specification. After this study, the automatic rate of a mapping is up to 7% and the map specification has been easily generated.

• Proceedings of the KSRS Conference
• /
• 2007.03a
• /
• pp.251-256
• /
• 2007

FY-2C 위성은 2004년 10월 발사되어 동경 105도 에 서 운영 중인 중국의 정지 궤도 기상위성 이며 관측 영상은 한반도 지역을 포함하고 있다. 현재 FY-2C S-VISSR2.0[l]에 대한 Navigation 알고리즘이 공개되어 있지 않으며，Navigation을 위하여 S-VISSR2.0에 포함되어 있는 Simplified Mapping Block 정보를 사용하여야 한다. Simplified Mapping Block은 5도 간격의 정보만을 제 공하므로 관측 지 역 의 모든 좌표에 대한 Navigation 정보를 얻기 위해서는 보간볍을 사용하여야 한다. 그러나 보간법은 기준 점에서 멀어질수록 오차가 크게 나타날 수 있다. 따라서 본 논문에서는 모든 좌표에 대한 Navigation 정보를 얻을 수 있는 MTSAT Image Navigation 알고리즘을 FY-2C S-VISSR2.0에 적용하여 Simplified Mapping Block과의 차이를 분석하였다. 분석 방법은 Simplified Mapping Block과 MTSAT Image Navigation[2] 알고리즘을 5도 간격의 격자 점(위경도)에서 Column 및 Line 값 비교， Geo-location된 영상의 품질 비교，WDB2 Map Data의 Coast Line과의 비교를 수행하였다. 분석 결과 격자 점에서의 Column, Line 값은 0.5 이내의 차이 값을 나타내었다. 그리고 Geo-location된 영상 비교에서는 격자 점 주변에서 영상의 차이가 없으나 격자 점에서 멸어질수록 영상의 품질은 MTSAT Image Navigation 알고리즘으로 생성한 영상이 더 우수하였다. WDB2 Map Data의 Coast Line과의 비교에서 오차는 동일하게 발생하였으며，영상의 Column 축에 대한 오차는 평균 1.847 Pixel, 최대 6 Pixel, 최소 oPixel 이며， Line 축에 대한 오차는 평균 0.135 Pixel, 최대 4 Pixel, 최소 0 Pixel을 나타내었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.481-484
• /
• 2003

For map services in the mobile environment, it should be considered that resource restriction of the mobile device. Thus, if a map database dedicated to mobile services may not be developed, the spatial data extracted from general map databases should be simplified before transmitting. This paper suggests the mechanism to simplify and modify the spatial data, which are changed to be able to displayed on the mobile devices. This mechanism is based on the map generalization operations and is refined to adapt on mobile phone environment.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.86-91
• /
• 2008

To present the design procedure of discretized 8-bit tent map executing the transformation of tent function which is one of the chaotic functions, first, the truth table of discretized tent map was written, and then according to the simplified Boolean algebra equations obtained from the truth table, the discretized map is implemented with the exclusive logic gate as a real hardware. The discretized tent map circuit which provides the feedback circuit for generating the period-8 states relevant to the 8-bit finite precision is also designed and presented in this paper. Furthermore, it might be used stream cipher system with a new key-stream circuit for generate of chaotic binary sequence.