• Journal of Korea Game Society
• /
• v.14 no.4
• /
• pp.45-52
• /
• 2014

We cannot load the entire data for high-resolution terrain model to the GPU memory since its size is too big. Out-of-core approaches are commonly used to solve the problem. However, due to limited bandwidth of the secondary storage, it is difficult to render the terrain in real-time. A method that compresses the DEM data with wavelet transform on GPU, and renders the decoded data is suggested. However, it is inefficient since it has to sample the values from textures, convert them to vertices, and generate a mesh periodically. We propose a method to store the approximation coefficients of wavelet compression as vertex attributes and render the terrain by decoding the data on geometric shader. It can reduce the amount of transferring terrain texture since approximation coefficients are given as an attribute of the vertex. Also, it generate meshes without additional upload of terrain texture.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.528-531
• /
• 2003

본 논문에서는 BIFS노드를 추가한 MPEG-4 기반의 3차원 플레이어를 구현했다 BIFS는 바이너리 포맷으로서 VRML에 비하여 압축률이 높고 객체의 시공간적인 관계를 나타내주기 때문에 여러 개의 3차원 객체를 효과적으로 동시에 렌더링할 수 있는 방법을 제공한다. 이러한 BIFS의 특징은 3차원 객체에 대한 압축만을 제공하는 3D 메쉬코딩의 단점을 효율적으로 해결한다. 구현된 플레이어는 BIFS 노드가 추가된 3차원 컨텐츠를 렌더링함은 물론 3차원 객체들에 대한 이벤트를 지원하여 유저와의 상호작용을 가능하게 하였다

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.307-317
• /
• 2002

In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reconstruction algorithm but a mesh conversion (remeshing) algorithm. The main idea of our approach is that we sample surface detail from unorganized points without any topological information. For this, we predict a virtual triangular face from unorganized points for each sampling ray from a parameteric domain surface. Direct displaced subdivision surface reconstruction from unorganized points has much importance since the output of this algorithm has several important properties: It has compact mesh representation since most vertices can be represented by only a scalar value. Underlying structure of it is piecewise regular so it ran be easily transformed into a multiresolution mesh. Smoothness after mesh deformation is automatically preserved. We avoid time-consuming global energy optimization by employing the input data dependant mesh smoothing, so we can get a good quality displaced subdivision surface quickly.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.160-174
• /
• 2008

In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.149-159
• /
• 2001

The conventional block-based motion prediction suffers, especially in low bit-rate video application, from shortcomings such as blocking artifacts of motion field and unstable motion estimation. To overcome the deficiency, this paper proposes one method of adopting a new motion compensation scheme based on the irregular triangular mesh structure while keeping the current block-based DCT coding structure of H.263 as much as possible. To represent the reconstructed previous frame using minimal number of control points, the proposed method designs content-adaptive irregular triangular meshes, and then, estimate the motion vector of each control point using the affine transformation-based matching. The predicted current frame is obtained by applying the affine transformation to each triangular mesh. Experiment with the several real video sequences shows improvement both in objective and subjective picture quality over the conventional block-based H.263 method.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.601-603
• /
• 1999

대부분의 다면체 모델 데이터의 표면과 지리 정보 시스템을 위한 지형 데이터는 삼각 분할을 통하여 만들어진 불규칙 삼각형 네트웍(Triangulated Irregular Network:TIN) 구조를 가지고 있다. 대용량 TIN 데이터를 그래픽스 시스템에서 빠르게 시각화 하는데는 많은 어려움이 있으므로, 일반적으로 TIN 데이터의 특징을 이용하여 압축된 데이터를 이용한다. 그러나 압축한 TIN 데이터는 부분적인 수정과 같은 연산을 수행하기 위하여 전체 데이터를 디코딩하고 다시 인코딩하는 과정을 반복하여 수행하므로 이같은 연산이 자주 발생하는 응용분야에는 부적합하다. 본 논문은 이러한 문제의 해결방안으로 삼각형 메쉬를 삼각형 스트립으로 재구성 한 후에 이 삼각형 스트립을 정점 체인과 각 정점의 차수 정보를 이용하는 저장하는 압축 알고리즘과 함께 이 알고리즘이 부분적인 불규칙 삼각망 수정에 유용하게 적용될 수 있음을 제시한다. 제안된 알고리즘은 각각의 정점 체인이 독립적으로 인코딩 가능하므로 불규칙 삼각망 정보를 수정할 경우 최소한의 인코딩과 디코딩으로 불규칙 삼각망을 수정할 수 있다.

• Journal of Broadcast Engineering
• /
• v.28 no.3
• /
• pp.314-328
• /
• 2023

In this paper, we propose a texture map compression method based on the hierarchical coding method of SHVC to support the scalability function of dynamic mesh compression. The proposed method effectively eliminates the redundancy of multiple-resolution texture maps by downsampling a high-resolution texture map to generate multiple-resolution texture maps and encoding them with SHVC. The dynamic mesh decoder supports the scalability of mesh data by decoding a texture map having an appropriate resolution according to receiver performance and network environment. To evaluate the performance of the proposed method, the proposed method is applied to V-DMC (Video-based Dynamic Mesh Coding) reference software, TMMv1.0, and the performance of the scalable encoder/decoder proposed in this paper and TMMv1.0-based simulcast method is compared. As a result of experiments, the proposed method effectively improves in performance the average of -7.7% and -5.7% in terms of point cloud-based BD-rate (Luma PSNR) in AI and LD conditions compared to the simulcast method, confirming that it is possible to effectively support the texture map scalability of dynamic mesh data through the proposed method.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.21 no.2
• /
• pp.162-168
• /
• 2011

Launch vehicles and satellites experience severe vibration and pyroshock during the flight phase. These severe dynamic loading could result in the malfunction of electric devices which equipped in the launch vehicle and satellite. In this paper, mesh washer isolators are applied to attenuate these severe shock and vibration and isolation performances are enhanced by applying pseudoelasitic SMA wire material. Through random vibration and ground pyroshock tests, outstanding isolation performances are studied. Especially, comparison of isolation performances due to the change of pre-compressive displacement of mesh washer itself are suggested and applicablity to the adaptive vibration control are confirmed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.230-233
• /
• 2009

본 논문은 볼륨 데이터를 입력받아 계층성을 지원하는 등밀도 표면을 재구성하는 방법을 제안한다. 제안된 방법은 먼저 입력 볼륨 데이터에서 볼륨 피라미드를 구성하고 해상도가 최저인 피라미드의 최상단 볼륨에서부터 셀경계표현 방법을 이용하여 조악한 초기 메쉬를 생성하며, 이 메쉬를 표면축소기법을 사용하여 반복적으로 변형하여 O(3)-인접성 조건하에서 추출한 등밀도점을 잘 근사할 수 있도록 한다. 제안된 방법은 생성되는 표면이 압축이나 점진적인 전송 등과 같은 다중 해상도 알고리즘에 활용될 수 있다는 장점이 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.511-520
• /
• 2009

In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.