• ETRI Journal
• /
• v.39 no.1
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1748-1759
• /
• 2010

We extend the octree subdivision process from Cartesian coordinates to spherical coordinates to develop more efficient space-partitioning structure for surface models. As an application of the proposed structure, we apply the octree subdivision in spherical coordinates ("S-Octree") to geometry compression in progressive mesh coding. Most previous researches on geometry-driven progressive mesh compression are devoted to improve predictability of geometry information. Unlike this, we focus on the efficient information storage for the space-partitioning structure. By eliminating void space at initial stage and aligning the R axis for the important components in geometry information, the S-Octree improves the efficiency in geometry information coding. Several meshes are tested in the progressive mesh coding based on the S-Octree and the results for performance parameters are presented.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.103-112
• /
• 2007

This paper presents a practical approach for surface reconstruction from unoriented point clouds. Instead of estimating local surface orientation, we first generate a set of depth images from the input point clouds, and a coarse mesh is then generated based on them by space carving techniques. The resultant mesh is progressively refined by local mesh refinement and optimization according to surface distance measure. A manifold mesh approximating the input points within an given tolerance is finally obtained. Our approach is easy to implement, but has the ability to outputs high quality meshes in different resolutions. We show that the proposed approach is not sensitive to several types of data disfigurement and is able to reconstruct models robustly from variance input data.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.87-92
• /
• 2003

Progressive mesh representation and generation have become one of the most important issues in network-based computer graphics. However, current researches are mostly focused on triangular mesh models. On the other hand, solid models are widely used in industry and are applied to advanced applications such as product design and virtual assembly. Moreover, as the demand to share and transmit these solid models over the network is emerging, the generation and the transmission of progressive solid models depending on specific engineering needs and purpose are essential. In this paper, we present a Cellular Topology-based approach to generating and transmitting progressive solid models from a feature-based solid model for internet-based design and collaboration. The proposed approach introduces a new scheme for storing and transmitting solid models over the network. The Cellular Topology (CT) approach makes it possible to effectively generate progressive solid models and to efficiently transmit the models over the network with compact model size.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.2
• /
• pp.122-132
• /
• 2004

Progressive mesh representation and generation have become one of the most important issues in network-based computer graphics. However, current researches are mostly focused on triangular mesh models. On the other hand, solid models are widely used in industry and are applied to advanced applications such as product design and virtual assembly. Moreover, as the demand to share and transmit these solid models over the network is emerging, the generation and the transmission of progressive solid models depending on specific engineering needs and purpose are essential. In this paper, we present a Cellular Topology-based approach to generating and transmitting progressive solid models from a feature-based solid model for internet-based design and collaboration. The proposed approach introduces a new scheme for storing and transmitting solid models over the network. The Cellular Topology (CT) approach makes it possible to effectively generate progressive solid models and to efficiently transmit the models over the network with compact model size. Thus, an arbitrary solid model SM designed by a set of design features is stored as a much coarser solid model SM/sup 0/ together with a sequence of n detail records that indicate how to incrementally refine SM/sup 0/ exactly back into the original solid model SM = SM/sup 0/.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.132-140
• /
• 2003

In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.81-88
• /
• 2002

Transmission of 3D shape model through Internet has become one of the hottest issues in these days. Presented in this paper is a new approach for the rapid transmission of the geometry data of the shape model. By analyzing the important three factors, the shape fidelity, the file size, and the decompression time, for the compression, we point out the potential problems of previous approaches of using the deltas between consecutive vertices and propose an alternative of directly using the position values of vertices of the model. It turns out that the proposed approach has smaller file size, has lesser distortion in the model, and the decompression is faster.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.41-44
• /
• 2001

삼각형 메쉬(triangular mesh)로 이루어진 삼차원 영상의 큰 데이터량을 줄이기 위한 메쉬 부호화의 연구가 활발히 진행되고 있다. 그리고, 최근에는 삼차원 부호화 데이터의 네트워크 전송 문제가 대두되어, 점진적 부호화(proressive mesh compression)에 대한 알고리듬들도 제안되고 있다. 본 논문은 꼭지점의 위치 정보 및 간략화 과정의 꼭지점 패턴(vertex pattern) 규칙을 이용하여, 기존의 점진적 부호화 알고리듬의 부호화 성능을 개선한 알고리듬을 제안한다. 꼭지점의 위치 정보를 이용하여 기존의 알고리듬에 비해 낮은 엔트로피(entropy)를 얻었으며, 꼭지점 패턴 정보를 이용하여 복원시 분할 꼭지점(split vertex)의 탐색 범위를 한정하였다. 전산 모의 실험을 통해, 제안하는 알고리듬이 기존의 점진적 메쉬 부호화 연구에 비해, 연결 정보 부호화에서 대략 30%정도 향상된 부호화 성능을 가짐을 확인할 수 있었다.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.4
• /
• pp.25-30
• /
• 2003

본 논문에서는 서로 다른 개수의 정점을 가지는 두 다면체 사이의 점진적 다면체 모델 표현(Progressive Mesh Representation)을 계산하는 휴리스틱 방법을 제시한다. 정점의 개수가 각각 n, k개 인 두 다면체 모델 $M^n$, $M^k$ (n > k)에 대하여 $M^n$에서 서로 다른 k개의 정점을 선택한다. 선택된 k개의 정점을 기준으로 $M^n$의 모든 정점에 대한 클러스터링을 수행하여 k개의 정점군(Vertex Set)을 생성한다. $M^n$을 간략화하여 k개의 정점만을 가지는 모델 $M^{k'}$의 위상정보(Topology)를 $M^k$와 동일하게 유지하기 위하여 $M^n$ 정점군들의 위상정보를 수정한다. 수정 생성된 정점군 내에서 선분병합(Edge Collapse)을 수행하면, 위상정보를 유지하면서 $M^n$에서 $M^k$로 변화하는 점진적 다면체 모델 표현을 얻을 수 있다. $M^{k'}$과 $M^k$의 정점간의 기하학적 위치차이를 선형보간하여 선분병합이 일어날때 마다 반영하면 $M^n$에서 $M^k$로 기하정보를 부드럽게 유지하면서 변화하는 점진적 다면체 모델 표현을 얻을 수 있다. 본 논문의 연구결과는 기존의 DLoD(Discrete Level of Detail)를 지원하는 게임을 CLoD(Continuous Level of Detail)를 지원하는 게임으로 확장하는 등의 다양한 컴퓨터 그래픽스 응용문제에 사용할 수 있다.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.9-16
• /
• 2002

Recently, high dynamic range (HDR) compression has attracted much attention due to the wide availability of HDR images. In this paper, we present an HDR compression method using a progressive image, which is a multi-level image representation based on a progressive mesh. An HDR image can be decomposed into a base image and a sequence of details by conversion into a progressive image. This decomposition provides a good structure to highly compress the dynamic range while preserving image details. The base image and larger details are considerably scaled down but smaller details are slightly scaled down. Experimental results show that our method successfully generates HDR compressed images without halo artifacts by controlling two intuitive parameters.