• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.381-386
• /
• 2003

In this paper, we consider the problem of embedding complete binary trees into 3-dimensional meshes. The method of embedding a complete binary tree into 3-dimensional mesh with the link congestion two is considered in [1], and the embedding in [2] shows that a complete binary tree can be embedded into a ,3-dimensional mesh of expansion 1.27. The proposed embedding in this paper shows that a complete binary tree can be embedded into a 3-dimensional mesh of expansion approximately 1.125 with the link congestion one, using the dimensional ordered routing. Such method yields some improved features in terms of minimizing the link congestion or the expansion of embedding comparing to the previous results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.239-246
• /
• 2004

Image snapping for an image moves the cursor location to nearby features in the image, such as edges. In this paper, we propose geometric snapping for 3D triangular meshes, which is extended from image snapping. Similar to image snapping, geometric snapping also moves the cursor location naturally to a location which represents main geometric features in the 3D triangular meshes. Movement of cursor is based on the approximate curvatures which appear geometric features on the 3D triangular meshes. The proposed geometric snapping can be applied to extract main geometric features on 3D triangular meshes. Moreover, it can be applied to extract the geometric features of a tooth which are necessary for generating the occlusal surfaces in dental prostheses.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.656-658
• /
• 2000

상호연결망으로 메쉬 구조를 채택한 대규모 병렬처리 시스템에 대해서 제안된 기존의 프로세서 할당기법들은 직사각형 모양의 서브메쉬 할당 기법으로 제한되어왔다. 그 결과 기존의 기법들은 심각한 시스템의 단편화를 초래하는 문제를 갖고 있다. 본 논문에서는 외부 프래그멘테이션과 작업 응답 시간을 동시에 줄이기 위해서, 단편화된 메쉬 시스템에도 적용될 수 있도록 직사각형뿐만 아니라 변형된 L자 모양의 서브메쉬를 할당하는 확장된 LSSA(L-Shaped Submesh Allocation) 기법을 제안한다. LSSA 기법에서 수행되는 모든 서브메쉬 모양의 변형들은 응용 프로그래머에서 투명성을 보장한다. 시뮬레이션 결과를 통해서 LSSA 기법이 작업 응답 시간과 시스템의 활용도 면에서 다른 기법들보다 우수함을 보인다.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 1998.11a
• /
• pp.45-49
• /
• 1998

3차원 스캐너 또는 스테레오 비전 등으로부터 입력된 거리 정보(Range Data)를 실제 응용프로 프로그램에 사용하기 위한 가상객체(Virtual Character)로 만들기 해서 는 우선 메쉬(mesh) 형태로 변환하는 작업 이 필수적이며, 기법들은 수십년 동안 활발히 연구되어 왔다. 많이 이용되는 방법은 초기 입력된 거리영상들의 각각의 점들이 연결관계 및 구조에 대한 정보를 입력 시점에서 알 수 있으므로, 각 면에 대해서는 쉽게 메쉬를 생성하여, 2차원 측정 단면 중심의 부조 형태로 메쉬를 활용하고 있지만. 3차원 가상객체가 요구되는 경우에는 측정단면별로 형성된 결과들을 하나의 메쉬로 생성하기 위해서는 짜깁기(Zippering)와 같은 어려운 작업이 추가로 필요하다. 본 논문에서는 개선된 3차원 행진입방체 방법과 간략화 기법을 적용하여 짜깁기(Zippering)을 사용하지 않고 가상객체를 생성하는 방법을 소개하려 한다.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.3
• /
• pp.61-71
• /
• 2018

When triangular meshes are generated from the point clouds in global space reconstructed through camera pose estimation against captured RGB-D streams, the quality of the resulting meshes improves as more triangles are hired. However, for 3D reconstructed models beyond some size threshold, they become to suffer from the ugly-looking artefacts due to the insufficient precision of RGB-D sensors as well as significant burdens in memory requirement and rendering cost. In this paper, for the generation of 3D models appropriate for real-time applications, we propose an effective technique that extracts high-quality textures for moderate-sized meshes from the captured colors associated with the reconstructed point sets. In particular, we show that via a simple method based on the mapping between the 3D global space resulting from the camera pose estimation and the 2D texture space, textures can be generated effectively for the 3D models reconstructed from captured RGB-D image streams.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.55-62
• /
• 2007

This paper proposes method to get exquisite third dimension data removing included noise by error that occur in third dimension reconstruction through camera auto-calibration. Though reconstructing third dimension data by previous noise removing method, mesh that area is wide is happened problem by noise. Because mesh's area is important, the proposed algorithm need preprocessing that remove unnecessary triangle meshes of acquired third dimension data. The research analyzes the characteristics of noise using the area information of 3-dimensional meshes, separates a peek noise and a Gauss noise by its characteristics and removes the noise effectively. We give a quantitative evaluation of the proposed preprocessing filter and compare with the mesh smoothing procedures. We demonstrate that our effective preprocessing filter outperform the mesh smoothing procedures in terms of accuracy and resistance to over-smoothing.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.898-900
• /
• 2004

3차원 모델은 흔히 비정규(irregular connectivity) 삼각형 메쉬로 구성된다. 비정규 메쉬를 정규(completely-regular connectivity) 메쉬로 재생성라면 기하 정보를 정규적인 연결성에 상응하는 2차원 형태의 이미지로 나타낼 수 있다. 본 논문은 매개변수(parameter) 영역에서 비정규 메쉬의 특징점들로 연결된 날카로운 모서리(sharp edge)로의 특징 snapping 을 통하여 기존의 방법으로 생성된 기하 이미지보다 특징이 잘 보호된 기하 이미지 생성에 대한 방법을 제시한다. 우선 비정규 메쉬를 구성하는 정점들의 곡률을 계산한 후 매개변수 영역에서 곡률이 증가하는 방향으로 snapping을 적용하였다. 실험 결과, 본 논문에서 제시한 방법이 기존의 방법에 비해 비정규 메쉬의 특징을 보다 잘 보호할 수 있음을 확인하였다.

• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.64-73
• /
• 2004

A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.769-780
• /
• 2005

This paper addresses a novel application of meshes to analyzing the deformation patterns of 2D signals. The proposed mesh is distinguished form the previous models in that it includes simulated charges in each node that interact with external charges comprising an input pattern. Therelaxation of the mesh given an input is carried out by any of the well-known numerical integration techniques. The result of the relaxation is a deformed mesh. This Paper provides four criterion functions for measuring the pattern deformation. A set of trained meshes was created from the simple average of target patterns. Experimental results show that these measures, although highly intuitive, are not good enough to capture the amount and characteristics of pattern deformation. If more sophisticated measures are found and incorporated into the relaxation process, we expect that a better and high-performance mesh framework is realized.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.599-602
• /
• 2002

본 논문에서는 피라미드 구조를 정방형 2-차원 메쉬로 임베딩하는 문제를 다룬다. $(4^N-1)$/3개의 정점들로 구성된 높이 N인 피라미드 $P_N$을 대상으로$(N\geq5)$인 경우에 $2^N\times2^N$의 2-차원 메쉬로 신장율 $(5/8){\cdot}2^{N-1}$로 임베딩이 가능한 새로운 임베딩 함수를 제안한다. 이러한 결과는 통일한 조건 하에서 기존의 연구결과보다 신장율 면에서 3/8에 해당하는 개선을 의미한다.